A Novel Accelerating Algorithm and Its Implement in Real Sequence FFT

Honggui Deng, Sheng-wei Guo and Jian Duan

International Journal of Sciences, 2013, vol. 2, issue 04, 84-88

Abstract: We propose an improved FFT algorithm, which costs only a half of the calculation time compared with the conventional FFT if the input data are real numbers. The algorithm is optimized by dividing 2N data points into 2 separated groups through parity. The odd part and even part of the 2N data points are used as the real part and imaginary part of a new complex data sequence with N data points. After FFT of this new data sequence, the FFT of the original 2N data points can be calculated through formulations. From our experiment based on FPGA, this new implementation is more effective than conventional FFT by saving half of calculation time.

Keywords: FFT; real sequence; FPGA (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.ijsciences.com/pub/article/171 (text/html)
https://www.ijsciences.com/pub/pdf/V2-201304-12.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:adm:journl:v:2:y:2013:i:4:p:84-88

Ordering information: This journal article can be ordered from
https://www.ijsciences.com/payment_guide.php

Access Statistics for this article

More articles in International Journal of Sciences from Office ijSciences Alkhaer Publications Manchester M8 8XG England.
Bibliographic data for series maintained by Staff ijSciences ().