In this paper, we have applied the transform decomposition (TD) technique of pruning the fast Fourier transform (FFT) flow graph to the fast Hartley transform (FHT) flow graph. We have shown that efficient pruning is possible when the number of output points is limited. Any arbitrary band of spectra can also be computed using the method proposed. © 2005 Elsevier B.V. All rights reserved.

K. M.Muraleedhara Prabhu

Algorithms

Graph theory

Fast Hartley Transform (FHT)

INDEX MAPPING

RADIX-2 FFT AND FHT ALGORITHMS

TRANSFORM DECOMPOSITION (TD)

Fast Fourier transforms

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

Microprocessors and Microsystems

The discrete Hartley transform (DHT) is becoming increasingly popular as a tool for the processing of real signals. Fast Hartley transform (FHT) algorithms exist which compute the DHT in a time proportional to N log2N. In many applications, such as interpolation and convolution of signals, a significant number of zeros is padded to the nonzero valued samples before the transform is computed. It is shown that for such situations, significant saving in the number of additions and multiplications can be obtained by pruning the FHT algorithm. The modifications in the FHT algorithm as a result of pruning are developed and implemented in an FHT subroutine. The amount of saving in the operation count is also determined. © 1991 IEEE.

IEEE Transactions on Signal Processing

Fast Hartley Transform Pruning

Efficient computation of the DFT with only a subset of input or output points

IEEE Transactions on Acoustics, Speech, and Signal Processing

On computing the split-radix FFT

On computing the discrete Hartley transform

Electronics Letters

‘Split radix’ FFT algorithm

Transform decomposition method of pruning the FHT algorithms

Journal	Microprocessors and Microsystems
ISSN	01419331
Open Access	No