Integer fast Fourier transform (INTFFT)

作者: S. Oraintara , Ying-Jui Chen , T. Nguyen

DOI: 10.1109/ICASSP.2001.940592

关键词:

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

参考文章(13)
John G. Proakis, Dimitris G. Manolakis, Digital Signal Processing: Principles, Algorithms, and Applications ,(1992)
Alan V. Oppenheim, Ronald W. Schafer, Discrete-Time Signal Processing ,(1989)
Vladimir Britanak, Patrick Yip, K. R. Rao, Discrete Cosine Transform: Algorithms, Advantages, Applications ,(1990)
James S. Walker, Fast Fourier Transforms ,(1991)
Ingrid Daubechies, Wim Sweldens, Factoring wavelet transforms into lifting steps Journal of Fourier Analysis and Applications. ,vol. 4, pp. 131- 157 ,(1998) , 10.1007/BFB0011095
Ying-Jui Chen, Soontorn Oraintara, Truong Nguyen, Video compression using integer DCT international conference on image processing. ,vol. 2, pp. 844- 845 ,(2000) , 10.1109/ICIP.2000.899842
James W. Cooley, John W. Tukey, An algorithm for the machine calculation of complex Fourier series Mathematics of Computation. ,vol. 19, pp. 297- 301 ,(1965) , 10.1090/S0025-5718-1965-0178586-1
S. Oraintara, Y.J. Chen, T.Q. Nguyen, Integer fast Fourier transform IEEE Transactions on Signal Processing. ,vol. 50, pp. 607- 618 ,(2002) , 10.1109/78.984749
Tin-Chak Johnson Pang, Chiu-Sing Oliver Choy, Cheong-Fat Chan, Wai-Kuen Cham, A self-timed ICT chip for image coding IEEE Transactions on Circuits and Systems for Video Technology. ,vol. 9, pp. 856- 860 ,(1999) , 10.1109/76.785723