Canonic FFT flow graphs for real-valued even/odd symmetric inputs

Canonic FFT flow graphs for real-valued even/odd symmetric inputs

Abstract Canonic real-valued fast Fourier transform (RFFT) has been proposed to reduce the arithmetic complexity by eliminating redundancies. In a canonic N-point RFFT, the number of signal values at each stage is canonic with respect to the number of signal values, i.e., N. The major advantage of t...

Full description

Bibliographic Details
Main Authors: Yingjie Lao, Keshab K. Parhi
Format: Article
Language:English
Published: SpringerOpen 2017-06-01
Series:EURASIP Journal on Advances in Signal Processing
Subjects:
Fast Fourier transform (FFT)
Real-valued FFT (RFFT)
Canonic flow graph
Even symmetric inputs
Odd symmetric inputs
Twiddle factor transformation
Online Access:http://link.springer.com/article/10.1186/s13634-017-0477-9

Internet

http://link.springer.com/article/10.1186/s13634-017-0477-9

Similar Items