DocumentCode
1089635
Title
Fast algorithms for complex integer transforms
Author
Liu, K.Y. ; Reed, I.S. ; Truong, T.K.
Author_Institution
University of Southern California, Los Angeles, CA
Volume
25
Issue
5
fYear
1977
fDate
10/1/1977 12:00:00 AM
Firstpage
450
Lastpage
452
Abstract
In this correspondence both high-radix and real-valued input FFT algorithms are applied to transforms over the finite field GF(q2), where q is a Mersenne prime. Such transforms can be used to implement fast circular convolutions without roundoff error. Of particular interest is a new radix 8 FFT algorithm, which requires fewer multiplications than the conventional radix 8 FFT algorithm.
Keywords
Arithmetic; Equations; Fast Fourier transforms; Galois fields; Laboratories; NASA; Propulsion; Roundoff errors;
fLanguage
English
Journal_Title
Acoustics, Speech and Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
0096-3518
Type
jour
DOI
10.1109/TASSP.1977.1162978
Filename
1162978
Link To Document