Skip to Main content Skip to Navigation
Journal articles

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

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

Cited literature [18 references]  Display  Hide  Download

https://www.hal.inserm.fr/inserm-00304144
Contributor : Lotfi Senhadji <>
Submitted on : Tuesday, July 22, 2008 - 6:09:47 PM
Last modification on : Friday, July 5, 2019 - 10:16:02 AM
Long-term archiving on: : Monday, May 31, 2010 - 8:28:15 PM

File

Radix-3x3_algorithm_for_the_2-...
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Jiasong Wu, Huazhong Shu, Lotfi Senhadji, Limin 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, Institute of Electrical and Electronics Engineers (IEEE), 2008, 55 (6), pp.566-570. ⟨10.1109/TCSII.2007.916796⟩. ⟨inserm-00304144⟩

Share

Metrics

Record views

284

Files downloads

307