DocumentCode
813417
Title
Generalized discrete Hartley transforms
Author
Hu, Neng-Chang ; Chang, Hong-I ; Ersoy, Okan K.
Author_Institution
Dept. of Electron. Eng., Nat. Taiwan Inst. of Technol., Taipei, Taiwan
Volume
40
Issue
12
fYear
1992
fDate
12/1/1992 12:00:00 AM
Firstpage
2931
Lastpage
2940
Abstract
The discrete Hartley transform is generalized into four classes in the same way as the generalized discrete Fourier transform. Fast algorithms for the resulting transforms are derived. The generalized transforms are expected to be useful in applications such as digital filter banks, fast computation of the discrete Hartley transform for any composite number of data points, fast computations of convolution, and signal representation. The fast computation of skew-circular convolution by the generalized transforms for any composite number of data points is discussed in detail
Keywords
signal processing; transforms; DHT; composite number; data points; digital filter banks; discrete Hartley transform; fast algorithms; generalized transforms; signal representation; skew-circular convolution; Content addressable storage; Convolution; Digital filters; Discrete Fourier transforms; Discrete transforms; Filter bank; Fourier transforms; Kernel; Signal design; Signal processing algorithms;
fLanguage
English
Journal_Title
Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
1053-587X
Type
jour
DOI
10.1109/78.175737
Filename
175737
Link To Document