Computational Performances of OFDM using Different Pruned Radix FFT Algorithms

Abstract

The Fast Fourier Transform (FFT) and its inverse (IFFT) are very important algorithms in signal processing, software-defined radio, and the most promising modulation technique i.e. Orthogonal Frequency Division Multiplexing (OFDM). From the standard structure of OFDM we can find that IFFT/FFT modules play the vital role for any OFDM based transceiver. So when zero valued inputs/outputs outnumber nonzero inputs/outputs, then general IFFT/FFT algorithm for OFDM is no longer efficient in term of execution time. It is possible to reduce the execution time by “pruning” the FFT. In this paper we have implemented a novel and efficient input zero traced radix FFT pruning (algorithm based on radix-2 DIF FFT, radix-4 DIF FFT, radix-8 DIF FFT). An intuitive comparison of the computational complexity of orthogonal frequency division multiplexing (OFDM) system has been made in terms of complex calculations required using different radix Fast Fourier transform techniques with and without pruning. The different transform techniques are introduced such as various types of Fast Fourier transform (FFT) as radix-2 FFT, radix-4 FFT, radix-8 FFT, mixed radix 4/2, mixed radix 8/2 and split radix 2/4. With intuitive mathematical analysis, it has been shown that with the reduced complexity can be offered with pruning, OFDM performance can be greatly improved in terms of calculations needed.

Authors and Affiliations

Alekhya Chundru, P. Krishna Kanth Varma

Keywords

Related Articles

An Experimental Investigation of Thermal Performance of Solar Air Heater with ‘W’ Wire Mesh

Solar air heater is one of the most valuable heat sources with variety of applications such as space heating, industrial process heating and drying of fruits and vegetables etc. Needless to say that it is a renewable an...

Study on factors affecting Job Satisfaction, Loyalty, and Commitment among managerial staff with reference to e-Publishing organisations in ITES / BPM industry

Job satisfaction, loyalty and commitment are important attributes for employee retention. The paper investigates the factors that would affect satisfaction, loyalty and commitment amongst the managerial staff in ITES /...

Cayley-Hamilton Theorem for Fuzzy Matrix

The classical Cayley-Hamilton theorem says that every square matrix satisfies its own characteristic equation. The Cayley-Hamilton theorem has been extended to rectangular matrices, block matrices, pairs of commuting ma...

Sign Language Glove using Arduino

Communication between speakers and non-speakers of American Sign Language can be problematic, inconvenient, and expensive. This project attempts to bridge the communication gap by designing a portable glove that capture...

Analysis of Spectrum Sensing Techniques for Cognitive Radio Networks (CRN): A Boon for Wireless Communication

Increasing demand of multimedia services requiring use of higher data rates and the overcrowding of the fixed spectrum has led to the concept of spectrum holes. The white spaces can be exploited by Cognitive Radio (CR)...

Download PDF file
  • EP ID EP18809
  • DOI -
  • Views 293
  • Downloads 8

How To Cite

Alekhya Chundru, P. Krishna Kanth Varma (2014). Computational Performances of OFDM using Different Pruned Radix FFT Algorithms. International Journal for Research in Applied Science and Engineering Technology (IJRASET), 2(9), -. https://europub.co.uk/articles/-A-18809