DocumentCode
2165259
Title
Extension of the fast Fourier number theoretic transform to multiple radix
Author
Lawrence, Brooks ; Polge, Robert ; Adhami, Reza
Author_Institution
Coleman Res. Corp., Huntsville, AL, USA
fYear
1989
fDate
26-28 Mar 1989
Firstpage
386
Lastpage
389
Abstract
A multi-radix fast Fourier number theoretic transform is proposed for the calculation of the discrete Fourier transform of sequences with a prime length P =2k1×3k2×5 k3+1, where k 1, k 2, and k 3 are integers. Advantages include availability of fast algorithms for a set of prime lengths, residue arithmetic with benefit in speed and hardware cost, and parallel implementation. A discrete power spectrum example is included
Keywords
fast Fourier transforms; number theory; series (mathematics); discrete Fourier transform; discrete power spectrum; multi-radix fast Fourier number theoretic transform; parallel implementation; residue arithmetic; sequences; series; Convolution; Costs; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Floating-point arithmetic; Fourier transforms; Hardware; Performance analysis; Quantization;
fLanguage
English
Publisher
ieee
Conference_Titel
System Theory, 1989. Proceedings., Twenty-First Southeastern Symposium on
Conference_Location
Tallahassee, FL
ISSN
0094-2898
Print_ISBN
0-8186-1933-3
Type
conf
DOI
10.1109/SSST.1989.72497
Filename
72497
Link To Document