Efficient Implementation of Fast Fourier Transform Using NOC

Abstract

In this paper, improved algorithms for radix-8 FFT are presented. Various schemes have been proposed for computing FFT. It has Different target domains of applications and different tradeoffs between flexibility and performance. Typically, they need reconfigurable array of processing elements .The applications have been restricted to domains based on floating arithmetic. We introduce floating-point Arithmetic which is based on processing elements. After developing the FFT design we present a routing Algorithm and use topology to reduce power dissipation. These modified radix-8 algorithms provide savings of more than 33% in the number of twiddle factor evaluations I. Introduction An Orthogonal frequency division multiplexing (OFDM) signal consists of a sum of subcarriers that are modulated by using Phase Shift Keying (PSK) or Quadrature Amplitude Modulation (QAM). These days, OFDM technique is widely used for high-speed digital communications, such as xDSL, DAB, DVB-T/H, and WLAN. In OFDM system, Discrete Fourier Transform (DFT)/Inverse-DFT are used and it is a very important operation. Since DFT/IDFT computation requires a large amount of arithmetic operations, we need an efficient FFT algorithm which can reduce the number of arithmetic operations to meet real time computation in OFDM systems.