Abstract
The design of Fast Fourier Transform (FFT) architecture is one of the bottlenecks in the implementation of OFDM systems. With the recent progress on the development of lossless transform, its possible applications in communication systems have received more and more attentions. In this paper, a lossless integer FFT (IntFFT) architecture based on radix-22FFT algorithm is analyzed and implemented. By exploring the symmetric property, the overall memory usage is reduced by 27.4% for a 64-point FFT design. The variance of quantization loss for both IntFFT and conventional fixed-point FFT (FxpFFT) is derived. The signal to quantization loss ratio (SQNR) and the bit error rate (BER) performance in system level is also simulated to test the accuracy of IntFFT. Based on the simulation results, IntFFT can yield comparative performance while using less memory usage than FxpFFT designs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
