UNIDFT - A PACKAGE OF OPTIMIZED DISCRETE FOURIER-TRANSFORMS

被引:2
作者
CABRAS, G
ROBERTO, V
SALEMI, G
机构
[1] UNIV UDINE,DIPARTIMENTO MATEMAT & INFORMAT,I-33100 UDINE,ITALY
[2] UNIV UDINE,IST SCI TERRA,I-33100 UDINE,ITALY
关键词
D O I
10.1016/0010-4655(87)90071-3
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
引用
收藏
页码:113 / 127
页数:15
相关论文
共 9 条
[1]  
[Anonymous], 1979, PROGRAMS DIGITAL SIG
[2]  
BERGLAND GD, 1968, MATH COMPUT, V22, P275
[3]  
Brigham E. O., 1974, FAST FOURIER TRANSFO
[4]   AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].
COOLEY, JW ;
TUKEY, JW .
MATHEMATICS OF COMPUTATION, 1965, 19 (90) :297-&
[5]  
GENTLEMAN WM, 1966, AFIPS P, V29, P563
[6]   COMPARATIVE-STUDY OF TIME EFFICIENT FFT AND WFTA PROGRAMS FOR GENERAL PURPOSE COMPUTERS [J].
MORRIS, LR .
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1978, 26 (02) :141-150
[7]  
Oppenheim A., 1975, DIGIT SIGNAL PROCESS
[8]   AN ALGORITHM FOR COMPUTING MIXED RADIX FAST FOURIER TRANSFORM [J].
SINGLETO.RC .
IEEE TRANSACTIONS ON AUDIO AND ELECTROACOUSTICS, 1969, AU17 (02) :93-&
[9]  
WINOGRAD S, 1978, MATH COMPUT, V32, P175, DOI 10.1090/S0025-5718-1978-0468306-4