The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


Background/Objectives: Fast Fourier transforms (FFT) has become ubiquitous in many engineering applications. FFT is one of the most employed blocks in many communications and signal processing systems. This paper aims in designing SDF architecture for efficient FFT algorithms. Methods/Statistical analysis: Efficient algorithms are being designed to improve the architecture of FFT. Higher Radix FFT algorithms have the traditional advantage of using less numbers of computational elements and are more suitable for calculating FFT of long data sequence. Findings: In designing SDF architecture for efficient FFT algorithms like Radix 2, Radix 4 and Radix 22, the designs are compared by performing simulations using VERILOG HDL and power analysis. The comparison includes the number of logic gates used by every architectures and their power dissipation using various devices. Trade-off between accuracy, speed, hardware complexity and power consumption should be made so as to choose the best fit architectures for the given application. Improvements/Applications: From the comparison results, best fit architecture is chosen and is implemented at the software level for the desired device for the Multiple Input Multiple Output (MIMO) application using Orthogonal Frequency Division Multiplexing (OFDM) employed in 4G technologies.

Keywords

Fast Fourier Transform (FFT), Multiple Input Multiple Output (MIMO), Pipelined FFT, Power Analysis
User