Radix-3×3 algorithm for the 2-D discrete Hartley transform - Inserm - Institut national de la santé et de la recherche médicale Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Circuits and Systems Part 2 Analog and Digital Signal Processing Année : 2008

Radix-3×3 algorithm for the 2-D discrete Hartley transform

Résumé

Abstract—In this correspondence, we propose a vector-radix algorithm for the fast computation of two-dimensional (2-D) discrete Hartley transform (DHT). For data sequences whose length is power of three, a radix-3×3 decimation in frequency algorithm is developed. It decomposes a length-N×N DHT into nine length-(N/3)×(N/3) DHTs. Comparison of the computational complexity with known algorithms shows that the proposed algorithm, in some cases, reduces significantly the number of arithmetic operations.
Fichier principal
Vignette du fichier
Radix-3x3_algorithm_for_the_2-D_discrete_Hartley_transform.pdf (252.66 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

inserm-00304144 , version 1 (22-07-2008)

Identifiants

Citer

Jiasong Wu, Huazhong Shu, Lotfi Senhadji, Limin M. Luo. Radix-3×3 algorithm for the 2-D discrete Hartley transform. IEEE Transactions on Circuits and Systems Part 2 Analog and Digital Signal Processing, 2008, 55 (6), pp.566-570. ⟨10.1109/TCSII.2007.916796⟩. ⟨inserm-00304144⟩
130 Consultations
197 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More