Direct computation of type-II discrete Hartley transform

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.

Mots clés

Compressed-domain processing discrete Hartley transform computational complexity discrete Hartley transforms Fast algorithm

Domaines

Ingénierie biomédicale Traitement du signal et de l'image [eess.SP] Théorie des représentations [math.RT] Théorie de l'information [cs.IT] Complexité [cs.CC] Traitement du signal et de l'image [eess.SP]

Fichier principal

Direct_computation_of_type-II_DHT_print_format_.pdf (65.53 Ko)

Lotfi Senhadji : Connectez-vous pour contacter le contributeur

https://inserm.hal.science/inserm-00149853

Soumis le : mardi 29 mai 2007-11:39:35

Dernière modification le : vendredi 19 avril 2024-14:37:51

Archivage à long terme le : jeudi 8 avril 2010-18:05:39

Dates et versions

inserm-00149853 , version 1 (29-05-2007)

Identifiants

HAL Id : inserm-00149853 , version 1

Citer

Huazhong Shu, Yuan Wang, Lotfi Senhadji, Limin M. Luo. Direct computation of type-II discrete Hartley transform. IEEE Signal Processing Letters, 2007, 14 (5), pp.329 - 332. ⟨inserm-00149853⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

INSERM UNIV-RENNES1 LTSI CRIBS UR1-MATH-STIC UNIV-RENNES UR1-MATH-NUM UR1-BIO-SA

121 Consultations

531 Téléchargements