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.

K. M.M. Prabu

Nagesh Anupindi

Mathematical transformations

DISCRETE HARTLEY TRANSFORMS (FHT)

FHT ALGORITHMS

Computer programming

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

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.

New Radix-3 FHT Algorithm

IEEE Transactions on Aerospace and Electronic Systems

Prefolding and zero fill in FFT processing

IEEE Transactions on Acoustics, Speech, and Signal Processing

On computing the discrete Hartley transform

Proceedings of the IEEE

The fast Hartley transform

Prefolding in Fht Algorithms

Journal	Electronics Letters
ISSN	00135194
Open Access	No