ABELIAN SEMI-SIMPLE ALGEBRAS AND ALGORITHMS FOR THE DISCRETE FOURIER-TRANSFORM

被引:20
作者
AUSLANDER, L [1 ]
FEIG, E [1 ]
WINOGRAD, S [1 ]
机构
[1] IBM CORP,THOMAS J WATSON RES CTR,DEPT MATH,YORKTOWN HTS,NY 10598
关键词
D O I
10.1016/0196-8858(84)90003-4
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:31 / 55
页数:25
相关论文
共 8 条
[1]  
AUSLANDER L, 1984, ADV APPL MATH, V5, P87, DOI 10.1016/0196-8858(84)90005-8
[2]   IS COMPUTING WITH THE FINITE FOURIER-TRANSFORM PURE OR APPLIED MATHEMATICS [J].
AUSLANDER, L ;
TOLIMIERI, R .
BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1979, 1 (06) :847-897
[3]  
AUSLANDER L, 1981, IBM RC9046
[4]   AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].
COOLEY, JW ;
TUKEY, JW .
MATHEMATICS OF COMPUTATION, 1965, 19 (90) :297-&
[5]  
HAWKINS T, 1978, RICE U STUDIES, V64, P57
[6]  
Nussbaumer H. J., 1981, FAST FOURIER TRANSFO, P80
[7]   FAST COMPUTATION OF DISCRETE FOURIER-TRANSFORMS USING POLYNOMIAL TRANSFORMS [J].
NUSSBAUMER, HJ ;
QUANDALLE, P .
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1979, 27 (02) :169-181
[8]  
WINOGRAD S, 1978, MATH COMPUT, V32, P175, DOI 10.1090/S0025-5718-1978-0468306-4