ScholarLens Back to search
2009•Jisuanji yingyong yanjiuRequires access

Using symmetry accelerating real FFT and its FPGA implementation

Guo Sheng-wei

Open publisher page 0 citations

Abstract

Regarding the input of FFT being generally real sequence in engineering practices,making full use of symmetrical property,this papar proposed a improvement algorithm for real FFT.Real FFT computation of 2N points were transformed to complex FFT computation of N points.The amount of calculation could significantly reduce while parallel calculating.And gave a hardware implementation on FPGA.

About this research paper

What this paper is about

Regarding the input of FFT being generally real sequence in engineering practices,making full use of symmetrical property,this papar proposed a improvement algorithm for real FFT.Real FFT computation of 2N points were transformed to complex FFT computation of N points.The amount of calculation could significantly reduce while parallel calculating.And gave a hardware implementation on FPGA.

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

Regarding the input of FFT being generally real sequence in engineering practices,making full use of symmetrical property,this papar proposed a improvement algorithm for real FFT.Real FFT computation of 2N points were transformed to complex FFT computation of N points.The amount of calculation could significantly reduce while parallel calculating.And gave a hardware implementation on FPGA.

Key concepts: Fast Fourier transform, Computer science, Computation, Field-programmable gate array, Split-radix FFT algorithm, Parallel computing, Prime-factor FFT algorithm, Twiddle factor

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Using symmetry accelerating real FFT and its FPGA implementation — Research Paper | ScholarLens