Abstract
Since the floating-point operation is very expensive, numbers are quantized to a fixed number of bits. The number of bits at each internal node in the implementation of FFT is fixed to a certain number of bits. Denote this number as N n . The most significant bits (MSBs) of the result after each operation is kept up to N n bits, and the tail is truncated. Thus this conventional fixed-point arithmetic affects the invertability of the DFT because DFT coefficients are quantized.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
W. Sweldens, The lifting scheme: A custom-design construction of biorthogonal wavelets. J. Appl. Comput. Harmonic Anal. 3(2), 186–200 (1996)
F.A.M.L. Bruekers, A.W.M.V.D. Enden, New networks for perfect inversion and perfect reconstruction. IEEE J. Sel. Areas Commun. 10, 130–137 (Jan. 1992)
S.-C. Pei, J.-J. Ding, The integer transforms analogous to discrete trigonometric transforms. IEEE Trans. SP 48, 3345–3364 (Dec. 2000)
S. Oraintara, Y. Chen, T.Q. Nguyen, Integer fast Fourier transform. IEEE Trans. SP 50, 607–618 (Mar. 2002)
S.C. Chan, P.M. Yiu, An efficient multiplierless approximation of the fast Fourier transform using sum-of-powers-of-two (SOPOT) coefficients. IEEE SP Lett. 9, 322–325 (Oct. 2002)
Y. Yokotani et al., A comparison of integer FFT for lossless coding, in IEEE ISCIT, vol. 2, Sapporo, Japan, Oct. 2004, pp. 1069–1073
W.-H. Chang, T. Nguyen, An OFDM-specified lossless FFT architecture. IEEE Trans. Circ. Syst. I (regular papers) 53, 1235–1243 (June 2006)
S.C. Chan, P.M. Yiu, A multiplier-less 1-D and 2-D fast Fourier transform-like transformation using sum-of-power-of-two (SOPOT) coefficients, in IEEE ISCAS’2002, vol. 4, Phoenix-Scottsdale, Arizona, May 2002, pp. 755–758
W.Y. Zou, W. Yiyan, COFDM: An overview. IEEE Trans. Broadcast. 41, 1–8 (Mar. 1995)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Rao, K.R., Kim, D.N., Hwang, J.J. (2010). Integer Fast Fourier Transform. In: Fast Fourier Transform - Algorithms and Applications. Signals and Communication Technology. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6629-0_4
Download citation
DOI: https://doi.org/10.1007/978-1-4020-6629-0_4
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-6628-3
Online ISBN: 978-1-4020-6629-0
eBook Packages: EngineeringEngineering (R0)