Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/29534
Title: Fast radix-3/9 discrete Hartley transform
Authors: Lun, DPK 
Siu, WC 
Issue Date: 1993
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on signal processing, 1993, v. 41, no. 7, p. 2494-2499 How to cite?
Journal: IEEE transactions on signal processing 
Abstract: An efficient radix-3/9 fast Hartley transform (FHART) algorithm is proposed. It shows a great improvement over the previous radix-3 FHGART algorithm such that nearly 50% of the number of multiplications is saved. For the computation of real-valued discrete Fourier transforms (DFT's) with sequence lengths which are powers of 3, the proposed radix-3/9 algorithm also gives a significant improvement over the fastest real-valued radix-3/9 fast Fourier transform (FFT) algorithm.
URI: http://hdl.handle.net/10397/29534
ISSN: 1053-587X
EISSN: 1941-0476
DOI: 10.1109/78.224258
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Jan 21, 2018

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of Jan 21, 2018

Page view(s)

115
Last Week
1
Last month
Citations as of Jan 22, 2018

Google ScholarTM

Check

Altmetric


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