An efficient pipelined FFT architecture

Yun Nan Chang; Keshab K. Parhi

doi:10.1109/TCSII.2003.811439

An efficient pipelined FFT architecture

Yun Nan Chang, Keshab K. Parhi

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

65 Scopus citations

Abstract

This paper presents an efficient VLSI architecture of the pipeline fast Fourier transform (FFT) processor based on radix-4 decimation-in-time algorithm with the use of digit-serial arithmetic units. By combining both the feedforward and feedback commutator schemes, the proposed architecture can not only achieve nearly 100% hardware utilization, but also require much less memory compared with the previous digit-serial FFT processors. Furthermore, in FFT processors, several modules of ROM are required for the storage of twiddle factors. By exploiting the redundancy of the factors, the overall ROM size can be effectively reduced by a factor of 2.

Original language	English (US)
Pages (from-to)	322-325
Number of pages	4
Journal	IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Volume	50
Issue number	6
DOIs	https://doi.org/10.1109/TCSII.2003.811439
State	Published - Jun 2003

Bibliographical note

Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.

Keywords

Digit-serial
Fast Fourier transform (FFT)
Pipelined FFT
Radix-4 FFT

Access

10.1109/TCSII.2003.811439

Fingerprint Dive into the research topics of 'An efficient pipelined FFT architecture'. Together they form a unique fingerprint.

Cite this

@article{297fb0d585564aacbaab2a8a9cbafc44,

title = "An efficient pipelined FFT architecture",

abstract = "This paper presents an efficient VLSI architecture of the pipeline fast Fourier transform (FFT) processor based on radix-4 decimation-in-time algorithm with the use of digit-serial arithmetic units. By combining both the feedforward and feedback commutator schemes, the proposed architecture can not only achieve nearly 100% hardware utilization, but also require much less memory compared with the previous digit-serial FFT processors. Furthermore, in FFT processors, several modules of ROM are required for the storage of twiddle factors. By exploiting the redundancy of the factors, the overall ROM size can be effectively reduced by a factor of 2.",

keywords = "Digit-serial, Fast Fourier transform (FFT), Pipelined FFT, Radix-4 FFT",

author = "Chang, {Yun Nan} and Parhi, {Keshab K.}",

year = "2003",

month = jun,

doi = "10.1109/TCSII.2003.811439",

language = "English (US)",

volume = "50",

pages = "322--325",

journal = "IEEE Transactions on Circuits and Systems II: Express Briefs",

issn = "1549-8328",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "6",

}

TY - JOUR

T1 - An efficient pipelined FFT architecture

AU - Chang, Yun Nan

AU - Parhi, Keshab K.

PY - 2003/6

Y1 - 2003/6

N2 - This paper presents an efficient VLSI architecture of the pipeline fast Fourier transform (FFT) processor based on radix-4 decimation-in-time algorithm with the use of digit-serial arithmetic units. By combining both the feedforward and feedback commutator schemes, the proposed architecture can not only achieve nearly 100% hardware utilization, but also require much less memory compared with the previous digit-serial FFT processors. Furthermore, in FFT processors, several modules of ROM are required for the storage of twiddle factors. By exploiting the redundancy of the factors, the overall ROM size can be effectively reduced by a factor of 2.

AB - This paper presents an efficient VLSI architecture of the pipeline fast Fourier transform (FFT) processor based on radix-4 decimation-in-time algorithm with the use of digit-serial arithmetic units. By combining both the feedforward and feedback commutator schemes, the proposed architecture can not only achieve nearly 100% hardware utilization, but also require much less memory compared with the previous digit-serial FFT processors. Furthermore, in FFT processors, several modules of ROM are required for the storage of twiddle factors. By exploiting the redundancy of the factors, the overall ROM size can be effectively reduced by a factor of 2.

KW - Digit-serial

KW - Fast Fourier transform (FFT)

KW - Pipelined FFT

KW - Radix-4 FFT

UR - http://www.scopus.com/inward/record.url?scp=0038721318&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038721318&partnerID=8YFLogxK

U2 - 10.1109/TCSII.2003.811439

DO - 10.1109/TCSII.2003.811439

M3 - Article

AN - SCOPUS:0038721318

VL - 50

SP - 322

EP - 325

JO - IEEE Transactions on Circuits and Systems II: Express Briefs

JF - IEEE Transactions on Circuits and Systems II: Express Briefs

SN - 1549-8328

IS - 6

ER -

An efficient pipelined FFT architecture

Abstract

Bibliographical note

Keywords

Access

Other files and links

Cite this