Direct computation of type-II discrete Hartley transform

Huazhong Shu; Yuan Wang; Lotfi Senhadji; Limin Luo

Journal articles

Direct computation of type-II discrete Hartley transform

Huazhong Shu ^{1, 2, *} Yuan Wang ^{1, 2, 3} Lotfi Senhadji ^{2, 3} Limin Luo ^{1, 2}

* Corresponding author

1 LIST - University of Science & Technology

2 CRIBS - Centre de Recherche en Information Biomédicale sino-français

3 LTSI - Laboratoire Traitement du Signal et de l'Image

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 N ≥ 8. 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 : Compressed-domain processing discrete Hartley transform computational complexity discrete Hartley transforms Fast algorithm

Document type :

Journal articles

Domain :

Life Sciences [q-bio] / Bioengineering

Engineering Sciences [physics] / Signal and Image processing

Mathematics [math] / Representation Theory [math.RT]

Computer Science [cs] / Information Theory [cs.IT]

Computer Science [cs] / Computational Complexity [cs.CC]

Computer Science [cs] / Signal and Image Processing

Complete list of metadatas

Cited literature [7 references] Display Hide Download

https://www.hal.inserm.fr/inserm-00149853
Contributor : Lotfi Senhadji <>
Submitted on : Tuesday, May 29, 2007 - 11:39:35 AM
Last modification on : Tuesday, July 3, 2018 - 10:58:04 AM
Long-term archiving on: : Thursday, April 8, 2010 - 6:05:39 PM

Direct computation of type-II discrete Hartley transform

File

Identifiers

Collections

Citation

Export

Metrics

265

511

Direct computation of type-II discrete Hartley transform

File

Identifiers

Collections

Citation

Export

Share

Metrics

265

511