Parallel architecture FFT/IFFT processor

Hong Xing Wan; He Chen; Yue Qiu Han

Parallel architecture FFT/IFFT processor

Hong Xing Wan^*, He Chen, Yue Qiu Han

^*Corresponding author for this work

School of Information and Electronics

Beijing Institute of Technology

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

3 Citations (Scopus)

Abstract

Fast Fourier transform is adopted in many applications. Through the study of the character of the radix-2 and radix-4 decimation-in-time Cooley-Turkey FFT algorithm, a kind of high performance FFT/IFFT processor is proposed. With the modified radix-4 butterfly unit it can process stride-by-2 permutation. The processor allows conflict-free access of the four operands distributed over parallel memory modules. Simulation result shows that the processor can be used in many situations demanding high speed and area.

Original language	English
Pages (from-to)	338-341
Number of pages	4
Journal	Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology
Volume	26
Issue number	4
Publication status	Published - Apr 2006

Keywords

Butterfly unit
FFT/IFFT processor
Parallel data

Cite this

@article{32bcbdcdd3e34971ad8b6fe8b08fa40e,

title = "Parallel architecture FFT/IFFT processor",

abstract = "Fast Fourier transform is adopted in many applications. Through the study of the character of the radix-2 and radix-4 decimation-in-time Cooley-Turkey FFT algorithm, a kind of high performance FFT/IFFT processor is proposed. With the modified radix-4 butterfly unit it can process stride-by-2 permutation. The processor allows conflict-free access of the four operands distributed over parallel memory modules. Simulation result shows that the processor can be used in many situations demanding high speed and area.",

keywords = "Butterfly unit, FFT/IFFT processor, Parallel data",

author = "Wan, {Hong Xing} and He Chen and Han, {Yue Qiu}",

year = "2006",

month = apr,

language = "English",

volume = "26",

pages = "338--341",

journal = "Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology",

issn = "1001-0645",

publisher = "Beijing Institute of Technology",

number = "4",

}

TY - JOUR

T1 - Parallel architecture FFT/IFFT processor

AU - Wan, Hong Xing

AU - Chen, He

AU - Han, Yue Qiu

PY - 2006/4

Y1 - 2006/4

N2 - Fast Fourier transform is adopted in many applications. Through the study of the character of the radix-2 and radix-4 decimation-in-time Cooley-Turkey FFT algorithm, a kind of high performance FFT/IFFT processor is proposed. With the modified radix-4 butterfly unit it can process stride-by-2 permutation. The processor allows conflict-free access of the four operands distributed over parallel memory modules. Simulation result shows that the processor can be used in many situations demanding high speed and area.

AB - Fast Fourier transform is adopted in many applications. Through the study of the character of the radix-2 and radix-4 decimation-in-time Cooley-Turkey FFT algorithm, a kind of high performance FFT/IFFT processor is proposed. With the modified radix-4 butterfly unit it can process stride-by-2 permutation. The processor allows conflict-free access of the four operands distributed over parallel memory modules. Simulation result shows that the processor can be used in many situations demanding high speed and area.

KW - Butterfly unit

KW - FFT/IFFT processor

KW - Parallel data

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

M3 - Article

AN - SCOPUS:33745748639

SN - 1001-0645

VL - 26

SP - 338

EP - 341

JO - Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology

JF - Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology

IS - 4

ER -

Parallel architecture FFT/IFFT processor

Abstract

Keywords

Other files and links

Fingerprint

Cite this