2015
Skodras, Athanassios; Aburdene, Maurice; Nandi, Asoke
Two-band fast Hartley transform Journal Article
In: Electronics Letters, vol. 51, no. 1, pp. 57-59, 2015, ISSN: 0013-5194.
Abstract | Links | BibTeX | Tags: computational complexity, DFT, DHTs, discrete Fourier transform, discrete Fourier transforms, discrete Hartley transforms, fast Fourier transform, fast Fourier transforms, FFT algorithms, FHT, forward discrete Hartley transforms, input data, input data shuffling, inverse discrete Hartley transforms, inverse transforms, out data shuffling, radix-2 fast Hartley transform, two-band decomposition, two-band fast Hartley transform
@article{Skodras2015,
title = {Two-band fast Hartley transform},
author = {Athanassios Skodras and Maurice Aburdene and Asoke Nandi},
doi = {10.1049/el.2014.3170},
issn = {0013-5194},
year = {2015},
date = {2015-01-01},
journal = {Electronics Letters},
volume = {51},
number = {1},
pages = {57-59},
abstract = {Efficient algorithms have been developed over the past 30 years for computing the forward and inverse discrete Hartley transforms (DHTs). These are similar to the fast Fourier transform (FFT) algorithms for computing the discrete Fourier transform (DFT). Most of these methods seek to minimise the complexity of computations and/or the number of operations. A new approach for the computation of the radix-2 fast Hartley transform (FHT) is presented. The proposed algorithm, based on a two-band decomposition of the input data, possesses a very regular structure, avoids the input or out data shuffling, requires slightly less multiplications than the existing approaches, but increases the number of additions.},
keywords = {computational complexity, DFT, DHTs, discrete Fourier transform, discrete Fourier transforms, discrete Hartley transforms, fast Fourier transform, fast Fourier transforms, FFT algorithms, FHT, forward discrete Hartley transforms, input data, input data shuffling, inverse discrete Hartley transforms, inverse transforms, out data shuffling, radix-2 fast Hartley transform, two-band decomposition, two-band fast Hartley transform},
pubstate = {published},
tppubtype = {article}
}
Efficient algorithms have been developed over the past 30 years for computing the forward and inverse discrete Hartley transforms (DHTs). These are similar to the fast Fourier transform (FFT) algorithms for computing the discrete Fourier transform (DFT). Most of these methods seek to minimise the complexity of computations and/or the number of operations. A new approach for the computation of the radix-2 fast Hartley transform (FHT) is presented. The proposed algorithm, based on a two-band decomposition of the input data, possesses a very regular structure, avoids the input or out data shuffling, requires slightly less multiplications than the existing approaches, but increases the number of additions.