DocumentCode :
773818
Title :
Direct Computation of Type-II Discrete Hartley Transform
Author :
Shu, Huazhong ; Wang, Yuan ; Senhadji, Lotfi ; Luo, Limin
Author_Institution :
Lab. of Image Sci. & Technol., Southeast Univ., Nanjing
Volume :
14
Issue :
5
fYear :
2007
fDate :
5/1/2007 12:00:00 AM
Firstpage :
329
Lastpage :
332
Abstract :
We present in this letter an efficient direct method for the computation of a length-N type-II generalized discrete Hartley transform (GDHT) when given two adjacent length-N/2 GDHT coefficients. The computational complexity of the proposed method is lower than that of the traditional approach for length Nges8. The arithmetic operations can be saved from 16% to 24% for N varying from 16 to 64. Furthermore, the new approach can be easily implemented
Keywords :
computational complexity; discrete Hartley transforms; GDHT coefficients; computational complexity; type-II generalized discrete Hartley transform; Arithmetic; Bismuth; Computational complexity; Discrete cosine transforms; Discrete transforms; Helium; Image coding; Image processing; Signal processing; Signal processing algorithms; Compressed-domain processing; discrete Hartley transform; fast algorithm;
fLanguage :
English
Journal_Title :
Signal Processing Letters, IEEE
Publisher :
ieee
ISSN :
1070-9908
Type :
jour
DOI :
10.1109/LSP.2006.888362
Filename :
4154736
Link To Document :
بازگشت