Title :
An efficient radix-3 FHT algorithm
Author_Institution :
Dept. of Electr. Eng., Indian Inst. of Technol., Madras, India
Abstract :
By modifying the conventional decomposition formula for the decimation-in-frequency (DIF) case, a more efficient radix-3 fast Hartley transform (FHT) algorithm has been introduced resulting in a fewer number of multiplications. The reduction in the number of multiplications is of the order of 25-30 percent. It is useful in cases where the sequence length is closer to a power of 3 rather than a power of 2
Keywords :
Hartley transforms; digital arithmetic; sequences; signal processing; digital arithmetic; efficient radix-3 FHT algorithm; fast Hartley transform; modified decomposition formula; multiplications reduction; real-valued signal; sequence length; signal processing; Content addressable storage; Costs; Digital signal processing; Discrete Fourier transforms; Equations; Fast Fourier transforms; Fourier transforms;
Conference_Titel :
Digital Signal Processing Proceedings, 1997. DSP 97., 1997 13th International Conference on
Conference_Location :
Santorini
Print_ISBN :
0-7803-4137-6
DOI :
10.1109/ICDSP.1997.628097
