2012•Journal of the Institute of Electronics Engineers of KoreaRequires access

Low-area FFT Processor Structure using Radix-4^2 Algorithm

Han-Jin Kim, Young-Beom Jang

Open publisher page 3 citations

Abstract

In this paper, a low-area FFT structure using algorithm is proposed. The large point FFT structure consists of cascade connection of the many stages. In implementation of large point FFT using algorithm, stages which number of different coefficients are only 3 appear in every 2 stages. For example, in the 4096-point FFT, the stages that number of different coefficients are 3 appear in stage 1, 3, and 5 among 6 stages. Multiplication block area of these 3 stages can be reduced using CSD(Canonic Signed Digit) and common sub-expression sharing techniques. Using the proposed structure, the 256-point FFT is implemented with the Verilog-HDL coding and synthesized by cell area in tsmc CMOS library. This result shows 23% cell area reduction compared with the conventional structure.

About this research paper

What this paper is about

In this paper, a low-area FFT structure using algorithm is proposed. The large point FFT structure consists of cascade connection of the many stages. In implementation of large point FFT using algorithm, stages which number of different coefficients are only 3 appear in every 2 stages. For example, in the 4096-point FFT, the stages that number of different coefficients are 3 appear in stage 1, 3, and 5 among 6 stages. Multiplication block area of these 3 stages can be reduced using CSD(Canonic Signed Digit) and common sub-expression sharing techniques. Using the proposed structure, the 256-point FFT is implemented with the Verilog-HDL coding and synthesized by cell area in tsmc CMOS library. This result shows 23% cell area reduction compared with the conventional structure.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, a low-area FFT structure using algorithm is proposed. The large point FFT structure consists of cascade connection of the many stages. In implementation of large point FFT using algorithm, stages which number of different coefficients are only 3 appear in every 2 stages. For example, in the 4096-point FFT, the stages that number of different coefficients are 3 appear in stage 1, 3, and 5 among 6 stages. Multiplication block area of these 3 stages can be reduced using CSD(Canonic Signed Digit) and common sub-expression sharing techniques. Using the proposed structure, the 256-point FFT is implemented with the Verilog-HDL coding and synthesized by cell area in tsmc CMOS library. This result shows 23% cell area reduction compared with the conventional structure.

Key concepts: Fast Fourier transform, Verilog, Twiddle factor, Computer science, Split-radix FFT algorithm, Algorithm, Prime-factor FFT algorithm, Array data structure

Related papers

Back to paper searchBrowse research topicsOriginal source
Low-area FFT Processor Structure using Radix-4^2 Algorithm — Research Paper | ScholarLens