Header menu link for other important links
X
Radix-2 decimation-in-frequency algorithm for the computation of the real-valued FFT
K. M.Muraleedhara Prabhu
Published in IEEE
1999
Volume: 47
   
Issue: 4
Pages: 1181 - 1184
Abstract
An efficient algorithm for computing the real-valued FFT (of length N) using radix-2 decimation-in-frequency (DIF) approach has been introduced. The fact that the odd coefficients are the DFT values of an N/2-length linear phase sequence introduces a redundancy in the form of the symmetry X (2k + 1) = X* (N - 2k - 1), which can be exploited to reduce the arithmetic complexity and memory requirements. The arithmetic complexity and memory requirements of the algorithm presented are exactly the same as the most efficient decimation-in-time (DIT) algorithm for the real-valued FFT that exists to date. A C++ program that implements this algorithm has been included.
About the journal
JournalData powered by TypesetIEEE Transactions on Signal Processing
PublisherData powered by TypesetIEEE
ISSN1053587X
Open AccessNo
Concepts (8)
  •  related image
    Algorithms
  •  related image
    Computational complexity
  •  related image
    Digital signal processing
  •  related image
    Redundancy
  •  related image
    ARITHMETIC COMPLEXITY
  •  related image
    DECIMATION IN FREQUENCY
  •  related image
    LINEAR PHASE SEQUENCE
  •  related image
    Fast fourier transforms