ScholarLens Back to search
2012•China Integrated CircuitRequires access

A Kind of Improved Real-Valued Fast Fourier Transform(FFT) and implementation on DSP

Hao Wang

Open publisher page 0 citations

Abstract

Fast Fourier Transform(FFT) is one of most important digital signal processing algorithms. The normal FFT theory of the 2N real-valued is analyzed and a improved algorithms is introduced in this paper. The algorithms computer the odd number and even number sequence separately, the common factor of the twiddle factors is extracted, it reduced the number of addition and multiplication and the reference number of twiddle factors in the computer process enormously. The algorithms is implemented on the actual DSP platform, the data of experiment revealed the algorithms has a sizeable improvability in complexity and operation efficiency.

About this research paper

What this paper is about

Fast Fourier Transform(FFT) is one of most important digital signal processing algorithms. The normal FFT theory of the 2N real-valued is analyzed and a improved algorithms is introduced in this paper. The algorithms computer the odd number and even number sequence separately, the common factor of the twiddle factors is extracted, it reduced the number of addition and multiplication and the reference number of twiddle factors in the computer process enormously. The algorithms is implemented on the actual DSP platform, the data of experiment revealed the algorithms has a sizeable improvability in complexity and operation efficiency.

Why it matters

A significance statement is not available in the OpenAlex record.

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

Fast Fourier Transform(FFT) is one of most important digital signal processing algorithms. The normal FFT theory of the 2N real-valued is analyzed and a improved algorithms is introduced in this paper. The algorithms computer the odd number and even number sequence separately, the common factor of the twiddle factors is extracted, it reduced the number of addition and multiplication and the reference number of twiddle factors in the computer process enormously. The algorithms is implemented on the actual DSP platform, the data of experiment revealed the algorithms has a sizeable improvability in complexity and operation efficiency.

Key concepts: Twiddle factor, Fast Fourier transform, Split-radix FFT algorithm, Digital signal processing, Prime-factor FFT algorithm, Cooley–Tukey FFT algorithm, Rader's FFT algorithm, Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Kind of Improved Real-Valued Fast Fourier Transform(FFT) and implementation on DSP — Research Paper | ScholarLens