A novel overall in-place in-order prime factor FFT algorithm

This paper presents a new prime factor algorithm (PFA) for non-power-of-two point FFT. Compared with the conventional prime factor decomposition algorithms, the approach performs the in-place, in-order algorithm of the small factor DFT, and gets the in-order output finally by reading the results wit...

Full description

Saved in:
Bibliographic Details
Published in2012 5th International Congress on Image and Signal Processing pp. 1500 - 1503
Main Authors Lan-xiang Jiang, Chang-yin Liu, Peng Zhang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2012
Subjects
3780-point FFT
Adders
Algorithm design and analysis
Discrete Fourier transforms
in-order
in-place
Indexes
Nickel
PFA
Signal processing algorithms
Online AccessGet full text

Cover

More Information
Summary:This paper presents a new prime factor algorithm (PFA) for non-power-of-two point FFT. Compared with the conventional prime factor decomposition algorithms, the approach performs the in-place, in-order algorithm of the small factor DFT, and gets the in-order output finally by reading the results with the address generated by an easy and simple modular adder. It is a general purpose algorithm for variable size FFT/IFFT, which is more suitable for implementation in programmable logic device because of its regular and simple structure. As an example, this paper implements a 3780-point FFT processor for Chinese Digital Terrestrial Multimedia/Television Broadcasting (DTMB) standard, which combines the Winograd Fourier transform algorithm (WFTA) and the mixed-radix algorithm.
ISBN:9781467309653
1467309656
DOI:10.1109/CISP.2012.6469906