IMPLEMENTATION OF CONVOLUTION AND FOURIER-TRANSFORMS USING 1-BIT SYSTOLIC ARRAYS

被引:5
作者
WARD, JS
STANIER, BJ
机构
关键词
D O I
10.1049/el:19820541
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
引用
收藏
页码:799 / 801
页数:3
相关论文
共 8 条
[1]  
AGARWAL RC, 1977, IEEE T ASSP, V25, P106
[2]   COMPLETELY ITERATIVE, PIPELINED MULTIPLIER ARRAY SUITABLE FOR VLSI [J].
MCCANNY, JV ;
MCWHIRTER, JG .
IEE PROCEEDINGS-G CIRCUITS DEVICES AND SYSTEMS, 1982, 129 (02) :40-46
[3]   IMPLEMENTATION OF SIGNAL-PROCESSING FUNCTIONS USING 1-BIT SYSTOLIC ARRAYS [J].
MCCANNY, JV ;
MCWHIRTER, JG .
ELECTRONICS LETTERS, 1982, 18 (06) :241-243
[4]   DIGITAL FILTERING USING POLYNOMIAL TRANSFORMS [J].
NUSSBAUMER, HJ .
ELECTRONICS LETTERS, 1977, 13 (13) :386-387
[5]   COMPUTATION OF CONVOLUTIONS AND DISCRETE FOURIER-TRANSFORMS BY POLYNOMIAL TRANSFORMS [J].
NUSSBAUMER, HJ ;
QUANDALLE, P .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1978, 22 (02) :134-144
[6]  
PARSONS TW, 1979, IEEE T ASSP, V22, P398
[7]   DISCRETE FOURIER TRANSFORMS WHEN NUMBER OF DATA SAMPLES IS PRIME [J].
RADER, CM .
PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1968, 56 (06) :1107-&
[8]  
WINOGRAD S, 1978, MATH COMPUT, V32, P175, DOI 10.1090/S0025-5718-1978-0468306-4