Please use this identifier to cite or link to this item:
Title: Two-band fast Hartley transform
Authors: Skodras, AN
Aburdene, MF
Nandi, AK
Keywords: Efficient agorithms;Hartley transforms
Issue Date: 2015
Publisher: Institution of Engineering and Technology
Citation: Electronics Letters, 2015, 51 (1), pp. 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.
Description: This article has been made available through the Brunel Open Access Publishing Fund.
ISSN: 0013-5194
Appears in Collections:Brunel OA Publishing Fund
Dept of Electronic and Computer Engineering Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdf258.65 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.