Integer fast Fourier transform (INTFFT)
S. Oraintara, Ying‐Jui Chen, Truong Q. Nguyen · 2002
The concept of integer fast Fourier transform (IntFFT) for approximating the discrete Fourier transform is introduced. Unlike the fixed-point fast Fourier transform (FxpFFT), the new transform has properties that it is an integer-to-integer mapping, power-adaptable and also reversible. A lifting scheme is used to approximate complex multiplications appearing in the FFT lattice structures. Split-radix FFT is used to illustrate the approach for the case of 2/sup N/-point FFT. The transform can be implemented by using only bit shifts and additions but no multiplication. While preserving the reversibility, the IntFFT is shown experimentally to yield the same accuracy as the FxpFFT when their coefficients are quantized to a certain number of bits. Complexity of the IntFFT is shown to be much lower than that of the FxpFFT in terms of the numbers of additions and shifts.