High Throughput Realization of a New Systolic Array based FFT using CORDIC

High Throughput Realization of a New Systolic Array based FFT using CORDIC

Gourav Jain, Shaik Rafi Ahamed
Copyright: © 2012 |Pages: 7
DOI: 10.4018/ijmtie.2012040105
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In this paper, the authors propose a new systolic array for radix-2, N-point discrete Fourier Transform (DFT) computation based on CORDIC (CO-ordinate Rotation Digital Computer). Complex multiplication can be done by this in a rather simple and elegant way. A CORDIC based multiplier less DFT architecture is designed in order to improve the performance of the system. It is able to provide two transforms per each clock cycle. The proposed design is well suited for high speed DSP-applications.
Article Preview
Top

2. The Algorithm For Fft-Computation

Firstly we take review of the FFT-algorithm presented in (Choi & Boriakoff, 1992). Now N-point DFT is defined by:

ijmtie.2012040105.m01
(1) where N is a power of two and twiddle factor ijmtie.2012040105.m02

We can also rewrite above equation as followsY =W(N)X(2) whereInput vector X = [x0,x1,x2, …… xN-1]TOutput vector Y = [y0,y1,y2, …… yN-1]Tand transformation matrix

ijmtie.2012040105.m03
(3)

Complete Article List

Search this Journal:
Reset
Open Access Articles
Volume 7: 2 Issues (2018)
Volume 6: 2 Issues (2017)
Volume 5: 2 Issues (2015)
Volume 4: 2 Issues (2014)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing