ScholarLens Back to search
2013•Radio and communications technologyRequires access

Research on FPGA Parallel Implementation of Two-dimension Long FFT Algorithm

Zhang Li-jun

Open publisher page 0 citations

Abstract

For high speed real-time signal processing using ultra long fast Fourier transform(FFT),a fast computed FFT method based on 2-dimension FFT algorithm is proposed,which uses the abundant resource of the FPGA.This method achieves the max 16M point FFT by parallel processing with the unit of short FFT.It resolves the problem that the FFT point is too short by using IP core and improves the FFT computation speed.It is proved that the algorithm is accurate and reliable.

About this research paper

What this paper is about

For high speed real-time signal processing using ultra long fast Fourier transform(FFT),a fast computed FFT method based on 2-dimension FFT algorithm is proposed,which uses the abundant resource of the FPGA.This method achieves the max 16M point FFT by parallel processing with the unit of short FFT.It resolves the problem that the FFT point is too short by using IP core and improves the FFT computation speed.It is proved that the algorithm is accurate and reliable.

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

For high speed real-time signal processing using ultra long fast Fourier transform(FFT),a fast computed FFT method based on 2-dimension FFT algorithm is proposed,which uses the abundant resource of the FPGA.This method achieves the max 16M point FFT by parallel processing with the unit of short FFT.It resolves the problem that the FFT point is too short by using IP core and improves the FFT computation speed.It is proved that the algorithm is accurate and reliable.

Key concepts: Fast Fourier transform, Split-radix FFT algorithm, Prime-factor FFT algorithm, Rader's FFT algorithm, Twiddle factor, Computer science, Field-programmable gate array, Dimension (graph theory)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Research on FPGA Parallel Implementation of Two-dimension Long FFT Algorithm — Research Paper | ScholarLens