Abstract

The need for wireless communication has driven the communication systems to high performance. However, the main bottleneck that affects the communication capability is the Fast Fourier Transform (FFT), which is the core of most modulators. This study presents an on-chip implementation of pipeline digit-slicing multiplier-less butterfly for FFT structure. The approach is taken, in order to reduce computation complexity in the butterfly, digit-slicing multiplier-less single constant technique was utilized in the critical path of Radix-2 Decimation In Time (DIT) FFT structure. The proposed design focused on the trade-off between the speed and active silicon area for the chip implementation. The new architecture was investigated and simulated with MATLAB software. The Verilog HDL code in Xilinx ISE environment was derived to describe the FFT Butterfly functionality and was downloaded to Virtex II FPGA board. Consequently, the Virtex-II FG456 Proto board was used to implement and test the design on the real hardware. As a result, from the findings, the synthesis report indicates the maximum clock frequency of 549.75 MHz with the total equivalent gate count of 31,159 is a marked and significant improvement over Radix 2 FFT butterfly. In comparison with the conventional butterfly architecture, the design that can only run at a maximum clock frequency of 198.987 MHz and the conventional multiplier can only run at a maximum clock frequency of 220.160 MHz, the proposed system exhibits better results. The resulting maximum clock frequency increases by about 276.28% for the FFT butterfly and about 277.06% for the multiplier. It can be concluded that on-chip implementation of pipeline digit-slicing multiplier-less butterfly for FFT structure is an enabler in solving problems that affect communications capability in FFT and possesses huge potentials for future related works and research areas.

Highlights

  • Fast Fourier Transform (FFT) plays an important role in many Digital Signals Processing (DSP) applications such as in communication systems and image processing

  • In view of the fact, the twiddle factors in the FFT processor were known in advance we proposed to use the pipeline digit slicing multiplier-less butterfly to replace the traditional butterfly in FFT

  • The ModelSim simulation result of pipelined digit-slicing multiplier-less radix-2 Decimation In Time (DIT) butterfly is shown in Fig. 12 and 13, while the synthesis results for the two models are presented in Table 1, which demonstrates the hardware specifications for the design

Read more

Summary

Introduction

FFT plays an important role in many Digital Signals Processing (DSP) applications such as in communication systems and image processing. In order to reduce the complexity computation of the FFT algorithm many modules have been designed and implemented in different platforms. These modules focus on the radix order or twiddle factors to perform a simple and efficient algorithm which includes the higher radix FFT (Bergland, 1969), the mixed-radix FFT (Singleton, 1969), the prime-factor FFT (Kolba and Parks, 1977), the recursive FFT (Varkonyi-Koczy, 1995), low-memory reference FFT (Wang et al, 2007), Multiplier-less based FFT (Zhou et al, 2007; Prasanthi et al, 2005; Mahmud and Othman, 2006) and Application-Specific Integrated Circuits (ASIC) system such as stated by Baas (1999). The study of the digit-slicing technique has been dealt by Bin Nun and Woodward (1976); Peled and Liu (1976) and Sharrif (1980) for the digital filters

Methods
Results
Conclusion

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

Disclaimer: 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.