COMPUTATION OF CONVOLUTIONS AND DISCRETE FOURIER-TRANSFORMS BY POLYNOMIAL TRANSFORMS

被引:31
作者
NUSSBAUMER, HJ [1 ]
QUANDALLE, P [1 ]
机构
[1] UNIV NICE,F-06034 NICE,FRANCE
关键词
D O I
10.1147/rd.222.0134
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:134 / 144
页数:11
相关论文
共 18 条
[1]   FAST ONE-DIMENSIONAL DIGITAL CONVOLUTION BY MULTIDIMENSIONAL TECHNIQUES [J].
AGARWAL, RC ;
BURRUS, CS .
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1974, AS22 (01) :1-10
[2]   NUMBER THEORETIC TRANSFORMS TO IMPLEMENT FAST DIGITAL CONVOLUTION [J].
AGARWAL, RC ;
BURRUS, CS .
PROCEEDINGS OF THE IEEE, 1975, 63 (04) :550-560
[3]  
AGARWAL RC, 1977, 1977 P IEEE INT C AC, P360
[4]  
AGARWAL RC, 1977, RC6446 IBM THOM J WA
[5]   AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].
COOLEY, JW ;
TUKEY, JW .
MATHEMATICS OF COMPUTATION, 1965, 19 (90) :297-&
[6]  
GOLD B, 1969, DIGITAL PROCESSING S, P203
[7]   RELATIONSHIP BETWEEN 2 FAST FOURIER TRANSFORMS [J].
GOOD, IJ .
IEEE TRANSACTIONS ON COMPUTERS, 1971, C 20 (03) :310-+
[8]  
NAGELL T, 1964, INTRO NUMBER THEORY, P156
[9]   DIGITAL FILTERING USING POLYNOMIAL TRANSFORMS [J].
NUSSBAUMER, HJ .
ELECTRONICS LETTERS, 1977, 13 (13) :386-387
[10]   DIGITAL FILTERING USING COMPLEX MERSENNE TRANSFORMS [J].
NUSSBAUMER, HJ .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1976, 20 (05) :498-504