DocumentCode
925208
Title
Fast radix-3/9 discrete Hartley transform
Author
Lun, Daniel Pak-Kong ; Siu, Wan-chi
Author_Institution
Dept. of Electr. Eng., Hong Kong Polytech., Kowloon, Hong Kong
Volume
41
Issue
7
fYear
1993
fDate
7/1/1993 12:00:00 AM
Firstpage
2494
Lastpage
2499
Abstract
An efficient algorithm for computing radix-3/9 discrete Hartley transforms (DHTs) is presented. It is shown that the radix-3/9 fast Hartley transform (FHT) algorithm reduces the number of multiplications required by a radix-3 FHT algorithm for nearly 50%. For the computation of real-valued discrete Fourier transforms (DFTs) with sequence lengths that are powers of 3, it is shown that the radix-3/9 FHT algorithm reduces the number of multiplications by 16.2% over the fastest real-valued radix-3/9 fast Fourier transform (FFT) algorithm
Keywords
signal processing; transforms; DFT; DHT; FFT; efficient algorithm; radix-3/9 discrete Hartley transforms; radix-3/9 fast Hartley transform; real-valued discrete Fourier transforms; real-valued radix-3/9 fast Fourier transform; signal processing; Algorithm design and analysis; Arithmetic; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Flow graphs; Power engineering and energy; Signal processing algorithms;
fLanguage
English
Journal_Title
Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
1053-587X
Type
jour
DOI
10.1109/78.224258
Filename
224258
Link To Document