Skip to Main content Skip to Navigation
Journal articles

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

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.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://www.hal.inserm.fr/inserm-00692219
Contributor : Lotfi Senhadji <>
Submitted on : Sunday, April 29, 2012 - 3:02:52 PM
Last modification on : Friday, July 5, 2019 - 10:16:02 AM
Long-term archiving on: : Monday, July 30, 2012 - 2:25:14 AM

File

Fast_Radix-3_Algorithm_for_the...
Files produced by the author(s)

Identifiers

Collections

Citation

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, Institute of Electrical and Electronics Engineers, 2012, 19 (6), pp.348 - 351. ⟨10.1109/LSP.2012.2194782⟩. ⟨inserm-00692219⟩

Share

Metrics

Record views

514

Files downloads

462