Odd-time odd-frequency discrete Fourier transform for symmetric real-valued series
- 1 March 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 64 (3) , 392-393
- https://doi.org/10.1109/proc.1976.10139
Abstract
An efficient algorithm is obtained for the DFT of N point symmetric real-valued series if time samples are taken as odd multiples of half the sampling period T/2 and frequency samples are taken as odd multiples of 1/2NT.Keywords
This publication has 4 references indexed in Scilit:
- Matrix representations for sorting and the fast Fourier transformIEEE Transactions on Circuits and Systems, 1974
- A fast Fourier transform algorithm for symmetric real-valued seriesIEEE Transactions on Audio and Electroacoustics, 1972
- Real signals fast Fourier transform: Storage capacity and step number reduction by means of an odd discrete Fourier transformProceedings of the IEEE, 1971
- An Adaptation of the Fast Fourier Transform for Parallel ProcessingJournal of the ACM, 1968