An efficient radix-3 fast Hartley transform (FHT) algorithm is introduced. The usual decomposition formula for a radix-FHT case is modified, resulting in less computations. It useful in cases where the sequence length is closer to a power of 3 than a power of 2. © 1990, The Institution of Electrical Engineers. All rights reserved.

Nagesh Anupindi

Siva Bala Narayanan

K. M.Muraleedhara Prabhu

Computer Programming--Algorithms

DISCRETE HARTLEY TRANSFORM

FAST HARTLEY TRANSFORM

RADIX-3 FHT ALGORITHM

Mathematical transformations

IIT Madras is a public technical and research university located in Chennai, Tamil Nadu. Founded in 1959, it is recognised as an Institute of National Importance.

IIT Madras has been ranked as the top engineering institute in India for four years in a row by the National Institutional Ranking Framework of the MHRD

It currently offers undergraduate, postgraduate and research degrees across 16 disciplines in Engineering, Sciences, Humanities and Management. About 596 faculty belonging to science and engineering departments and centres of the Institute are engaged in teaching, research and industrial consultancy.

IIT Madras

Electronics Letters

In this paper, a generalized pruning procedure on the input of radix-2 DIF FHT algorithm is presented. For situations in which relative number of zero-valued samples is quite large, a systematic pruning procedure can be introduced on the input of the FHT algorithms, thereby reducing the amount of computational complexity. The novelty of this procedure is that the exact number of non-zero samples is taken into consideration, instead of approximating them to the nearest higher 2-power integer.

Signal Processing

Generalized pruning at the input of radix-2 DIF FHT algorithm

Fast algorithms of a transform, like fast Fourier transform (FFT) algorithms, are based on different decomposition techniques. It is shown that these decomposition techniques can also be applied to the computation of the discrete Harley transform (DHT) for a real-valued sequence. Recently, an efficient decomposition technique for radix-3 decimation-in-time (DIT) FFT and fast Hartley transform (FHT) algorithms has been demonstrated. In this paper, such a decomposition technique is implemented for radix-3 and -6 decimation-in-frequency (DIF) FHT algorithms and found to improve the operation count.

Canadian Journal of Electrical and Computer Engineering

New radix-3 and -6 decimation-in-frequency fast Hartley transform algorithms

A generalised approach to prefolding the input sequence of the FHT algorithms m times for a radix-r case is introduced. The resulting output sequence is found, in the case of a decaying input sequence, to have the same spectral shape and resolution as the output sequence obtained with the nearest higher two-power sequence length input using zero padding. by this procedure, a significant reduction in the required amount of arithmetic can be obtained. © 1991, The Institution of Electrical Engineers. All rights reserved.

Journal	Electronics Letters
ISSN	00135194
Open Access	No