Design and Implementation of Fft Architecture for Real-valued Signals Based on Radix-2 Algorithm
نویسنده
چکیده
A new FFT architecture for real-valued signal is proposed using Radix-2 algorithm. It is based on modifying flow graph of the FFT algorithm such that it has both real and complex datapaths. A redundant operation in flow graph is replaced by imaginary part. Using folding technique RFFT architecture with any level of parallelism can be achieved. This RFFT architecture will lead to low hardware complexity as compare to radix-2 and radix 2 algorithm in terms of adder, multiplier and delay. N-point 2 parallel radix-2 architecture requires (log8N-1) complex multiplier,2log2N adders, 3N/2-2 delays. RFFT which is used for real time applications and in portable devices for which low power consumption is main requirement, so accordingly carry propagate adder which has least power consumption and CSD multiplier is selected for our proposed architecture. Keywords— FFT, Parallel Processing, Pipelining, Real Signals, radix-2 , Folding
منابع مشابه
A Study on High Performance Split Radix FFT
43 Abstract— A high performance hardware FFT have numerous application in instrumentation and communication systems. It describes new parallel FFT architecture which combines the split-radix algorithm with a constant geometry interconnect structure. The split-radix algorithm knows to have lower multiplicative complexity than both radix-2 as well as radix-4 algorithm. The split-radix algorithm...
متن کاملASIC Design of Butterfly Unit Based on Non-Redundant and Redundant Algorithm
Fast Fourier Transform (FFT) processors employed with pipeline architecture consist of series of Processing Elements (PE) or Butterfly Units (BU). BU or PE of FFT performs multiplication and addition on complex numbers. This paper proposes a single BU to compute radix-2, 8 point FFT in the time domain as well as frequency domain by replacing a series of PEs. This BU comprises of fused floating ...
متن کاملReal-valued fast Fourier transform algorithms
This tutorial paper describes the methods for constructing fast algorithms for the computation of the discrete Fourier transform (DFT) of a real-valued series. The application of these ideas to all the major fast Fourier transform (FFT) algorithms is discussed, and the various algorithms are compared. We present a new implementation of the real-valued split-radix FFT, an algorithm that uses few...
متن کاملVlsi Implementation and Performance Analysis of Efficient Mixed-radix 8-2 Fft Algorithm with Bit Reversal for the Output Sequences
In recent years, as a result of advancing VLSI technology, OFDM has received a great deal of attention and been adopted in many new generation wideband data communication systems such as IEEE 802.11a, HiPerLAN/2,digital audio/video broadcasting (DAB/DVB-T) and asymmetric digital subscriber line (ADSL), very high speed digital subscriber line (VDSL) in wireless and wired communications, respecti...
متن کاملImplementation of Optimized 128-point Pipeline Fft Processor Using Mixed Radix 4-2 for Ofdm Applications
Abstract This paper proposes a 128-point FFT processor for Orthogonal Frequency Division Multiplexing (OFDM) systems to process the real time high speed data based on cached-memory architecture (CMA) with the resource Mixed Radix 4-2 algorithm using MDC style. The design and implementation of FFT processor has been done using the above technique to reduce the size and power. Using the above alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014