Title :
In-situ bit-reversed ordering for Hartley transforms
Author_Institution :
Dept. of Electr. Eng., Stanford Univ., CA, USA
fDate :
4/1/1989 12:00:00 AM
Abstract :
The Johnson-Burrus method of in situ ordering for FFTs is applied to fast Hartley transforms. It amounts to tying together two consecutive butterfly operations, involving eight real data, swapping some of their results. Pre- and postpermutation can thereby be avoided. The identification of negative indexes, significantly in Hartley transforms, is nontrivial but easily resolved
Keywords :
computerised signal processing; fast Fourier transforms; FFTs; Hartley transforms; Johnson-Burrus; butterfly operations; identification; in-situ bit-reversed ordering; postpermutation; prepermutation; Adaptive signal processing; Adaptive systems; Delay; Difference equations; Digital filters; Discrete transforms; Lattices; Prediction algorithms; Signal processing algorithms; Speech processing;
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
