Abstract
An efficient Fast Fourier Transform (FFT) algorithm is used in the Orthogonal Frequency Division Multiplexing (OFDM) applications in order to compute the discrete Fourier transform. Also, a Single Path Delay Feedback (SDF) which is pipeline FFT architecture is used for faster performance to achieve high throughput. In conventional method, the FFT design has high delay and power due to time taken by the multiplication part. To decrease the delay, Kogge Stone Parallel Prefix Adder (KSPPA) is used with booth multiplier. As SDF is a simpler approach to realize FFT in different length, 64-point Radix-4 SDF-FFT algorithm using KSPPA in the booth multiplier is discussed in this study. The system is implemented in Xilinx 12.4 ISE and simulated using MODELSIM 6.3c. Results show that the system reduces the delay and power.
Highlights
The fast execution of Orthogonal Frequency Division Multiplexing (OFDM) is required in many real time applications such as radar and biomedical instrumentation in military domain
The fast execution of OFDM is required in many real time applications such as radar and biomedical instrumentation in military domain
Radix-4 Single Path Delay Feedback (SDF) utilizes the register more efficiently by storing one output of each butterfly in the feedback shift registers. It has the same number of multipliers and butterfly units as in radix-2 MDC but reduces the memory registers requirement by (N-1)
Summary
The fast execution of OFDM is required in many real time applications such as radar and biomedical instrumentation in military domain. The design of FFT using multiple radix algorithm is described in [2]. A generalized reconfigurable high radix FFT is described in [4] within a single clock domain The pipeline SDF FFT architecture for Radix 22 is described in [5]. A Radix-2 FFT using serial rapid single flux quantum multipliers-adders is described in [13]. A pipeline architecture using adder compressors with new XOR gate structure for Radix-2 DIT-FFT is described in [15]. It reduces the number of critical path structures as well as real multipliers.
Sign-in/Register to view highlights & summary 
Published Version (
Free)
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 call