NEW ALGORITHMS FOR THE MULTIDIMENSIONAL DISCRETE FOURIER-TRANSFORM

被引：14

作者：

AUSLANDER, L ^{[1
]}

FEIG, E ^{[1
]}

WINOGRAD, S ^{[1
]}

机构：

[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598

来源：

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING | 1983年 / 31卷 / 02期

关键词：

D O I：

10.1109/TASSP.1983.1164081

中图分类号：

O42 [声学];

学科分类号：

070206 ; 082403 ;

摘要：

引用

页码：388 / 403

页数：16

共 10 条

[1]

AUSLANDER L, 1982, IBM RC9234

[2] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].

COOLEY, JW ;

TUKEY, JW .

[3]

NUSSBAUMER H, 1981, FAST FOURIER TRANSFO, pCH7

[4]

NUSSBAUMER H, 1979, IEEE T ACOUST SPEECH, V27, P174

[5]

NUSSBAUMER H, 1979, IEEE T ACOUST SPEECH, V27, P173

[6]

NUSSBAUMER H, 1979, IEEE T ACOUST SPEECH, V27, P171

NUSSBAUMER, HJ ;

QUANDALLE, P .

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1979, 27 (02) :169-181

[8] 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-&

[9]

WINOGRAD S, 1978, MATH COMPUT, V32, P175, DOI 10.1090/S0025-5718-1978-0468306-4

[10]

Winograd S, 1980, ARITHMETIC COMPLEXIT, V33