FFT Algorithm for Both Input and Output Pruning

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 27, Issue 3, 1979, Pages 291-292

  Sreenivas, T V ^a   Rao, P V S ^a  

^a TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TRANSFORMATION - FAST FOURIER TRANSFORMS;

PRUNING ALGORITHMS;

COMPUTER PROGRAMMING;

EID: 0018478486     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASSP.1979.1163246     Document Type: Article

References (5)

1. J. D. Markel “FFT pruning,” IEEE Trans. Audio Electroacoust., vol. AU-19, pp. 305–311, Dec. 1971.
2. D. P. Skinner “Pruning the decimation-in-time FFT algorithm,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-24, pp. 193–194, Apr. 1976.
3. J. Makhoul, “Selective linear prediction and analysis-by-synthesis in speech analysis,” BBN Inc., A. I. Rep. 13, Apr. 1974.
4. T. V. Sreenivas and P. V. S. Rao, “A heuristic approach to pitch extraction in frequency domain,” Computer Group, Tata Inst. Fundamental Research, Bombay, India, Tech. Rep., Aug. 1977.
5. L. R. Morris “Automatic generation of time efficient digital signal processing software,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 74–79, Feb. 1977.