Please use this identifier to cite or link to this item:
Title: Fast radix-3 and radix-3/9 discrete Hartley transforms
Authors: Lun, DPK 
Siu, WC 
Issue Date: 1991
Publisher: IEEE
Source: Proceedings - IEEE International Symposium on Circuits and Systems, 1991, v. 1, p. 638-641 How to cite?
Abstract: An efficient radix-3/9 fast Hartley transform (FHT) algorithm is proposed. It shows a great improvement over the previous radix-3 FHT algorithm such that nearly 50% of the number of multiplications is saved. For the computation of real-valued DFTs (discrete Fourier transforms) with sequence lengths which are powers of 3, the proposed radix-3/9 algorithm gives an average of 16.2% reduction in the number of multiplications over the fastest radix-3/9 FFT (fast Fourier transform) algorithm. The improvement is mainly the result of the simplicity of the computing structure of the proposed algorithm and the use of fast length-3 and fast length-9 DHT modules.
Description: 1991 IEEE International Symposium on Circuits and Systems Part 1 (of 5), Singapore, Singapore, 11-14 June 1991
ISSN: 0271-4310
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Feb 14, 2019

Page view(s)

Last Week
Last month
Citations as of Feb 17, 2019

Google ScholarTM


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