EXISTENCE OF A 2N FFT ALGORITHM WITH A NUMBER OF MULTIPLICATIONS LOWER THAN 2N+1

被引：11

作者：

DUHAMEL, P

HOLLMANN, H

机构：

来源：

关键词：

D O I：

10.1049/el:19840474

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

引用

页码：690 / 692

页数：3

共 10 条

[1] CHO KM, 1978 IEEE ICASSP P, P634
[2] SPLIT RADIX FFT ALGORITHM
DUHAMEL, P
HOLLMANN, H
[J]. ELECTRONICS LETTERS, 1984, 20 (01) : 14 - 16
[3] Nussbaumer H. J., 1981, FAST FOURIER TRANSFO, P80
[4] VERY FAST COMPUTATION OF THE RADIX-2 DISCRETE FOURIER-TRANSFORM
PREUSS, RD
[J]. IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1982, 30 (04): : 595 - 607
[5] DISCRETE FOURIER TRANSFORMS WHEN NUMBER OF DATA SAMPLES IS PRIME
RADER, CM
[J]. PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1968, 56 (06): : 1107 - &
[6] NEW PRINCIPLE FOR FAST FOURIER TRANSFORMATION
RADER, CM
BRENNER, NM
[J]. IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1976, 24 (03): : 264 - 266
[7] VETTERLI M, UNPUB SIGNAL PROCESS
[8] MULTIPLICATIVE COMPLEXITY OF THE DISCRETE FOURIER-TRANSFORM
WINOGRAD, S
[J]. ADVANCES IN MATHEMATICS, 1979, 32 (02) : 83 - 117
[9] SOME BILINEAR FORMS WHOSE MULTIPLICATIVE COMPLEXITY DEPENDS ON FIELD OF CONSTANTS
WINOGRAD, S
[J]. MATHEMATICAL SYSTEMS THEORY, 1977, 10 (02): : 169 - 180
[10] YAVNE R, 1968, FALL JOINT COMP C AF, V33, P115