作者: 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.