Fast radix-3 algorithm for the generalized discrete Hartley transform of type II - Archive ouverte HAL Access content directly
Journal Articles IEEE Signal Processing Letters Year : 2012

Fast radix-3 algorithm for the generalized discrete Hartley transform of type II

(1, 2) , (1, 2, 3) , (2, 3) , (3)
1
2
3

Abstract

We present a new fast radix-3 algorithm for the computation of the length-N generalized discrete Hartley transform of type-II (GDHT-II), where N = 3^m, m ≥ 2. Then we apply this algorithm to the direct computation of length-N GDHT-II coefficients when given three adjacent length-N/3 GDHT-II coefficients. The computational complexity of the proposed method is lower than that of the traditional approach for length N ≥ 9. The arithmetic operations can be saved from 19% to 29% for N = 3^m varying from 9 to 243 and from 17% to 29% for N = 3×2^m varying from 12 to 384. Furthermore, the new approach can be easily implemented.
Fichier principal
Vignette du fichier
Fast_Radix-3_Algorithm_for_the_Generalized_Discrete_Hartley_Transform_of_Type_II.pdf (929.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inserm-00692219 , version 1 (29-04-2012)

Identifiers

Cite

Huazhong Shu, Jiasong Wu, Chufeng Yang, Lotfi Senhadji. Fast radix-3 algorithm for the generalized discrete Hartley transform of type II. IEEE Signal Processing Letters, 2012, 19 (6), pp.348 - 351. ⟨10.1109/LSP.2012.2194782⟩. ⟨inserm-00692219⟩
148 View
277 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More