DocumentCode :
818802
Title :
Computing m DFTs over GF(q) with one DFT over GF( qm)
Author :
Hong, Jonathan ; Vetterli, Martin
Author_Institution :
Dept. of Electr. Eng., Columbia Univ., New York, NY, USA
Volume :
39
Issue :
1
fYear :
1993
fDate :
1/1/1993 12:00:00 AM
Firstpage :
271
Lastpage :
274
Abstract :
Over the field of complex numbers, it is well-known that if the input is real then it is possible to compute two real DFTs with one complex DFT. The authors extend the result to finite fields and show how to compute m DFTs over GF(q) with one DFT over GF(qm)
Keywords :
fast Fourier transforms; information theory; DFT; GF(q); complex numbers; discrete Fourier transform; finite fields; Computational efficiency; Discrete Fourier transforms; Equations; Galois fields;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.179373
Filename :
179373
Link To Document :
بازگشت