Real signals fast Fourier transform: Storage capacity and step number reduction by means of an odd discrete Fourier transform

1 October 1971

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE

Vol. 59 (10) , 1531-1532
https://doi.org/10.1109/proc.1971.8471

Abstract

An odd discrete Fourier transform (ODFT) which relates in several ways to the usual discrete Fourier transform (DFT) is introduced and discussed. Its main advantage is that it can readily be applied to spectrum and correlation computations on real signals, by halving the storage capacity and greatly reducing the number of necessary steps.

Keywords

FAST FOURIER TRANSFORMS
DISCRETE FOURIER TRANSFORMS
CONVOLUTION
SIGNAL PROCESSING
FREQUENCY
SAMPLING METHODS
FOURIER TRANSFORMS
DEMODULATION
SIGNAL ANALYSIS
PERFORMANCE ANALYSIS

This publication has 1 reference indexed in Scilit:

The finite Fourier transform
IEEE Transactions on Audio and Electroacoustics, 1969