A Novel Split-Radix Fast Algorithm for 2-D Discrete Hartley Transform - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Circuits and Systems Part 1 Fundamental Theory and Applications Year : 2010

A Novel Split-Radix Fast Algorithm for 2-D Discrete Hartley Transform

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

Abstract

This paper presents a fast split-radix-(2×2)/(8×8) algorithm for computing the two-dimensional (2-D) discrete Hartley transform (DHT) of length N×N with N = q*2m, where q is an odd integer. The proposed algorithm decomposes an N×N DHT into one N/2×N/2 DHT and forty-eight N/8×N/8 DHTs. It achieves an efficient reduction on the number of arithmetic operations, data transfers and twiddle factors compared to the split-radix-(2×2)/(4×4) algorithm. Moreover, the characteristic of expression in simple matrices leads to an easy implementation of the algorithm. If implementing the above two algorithms with fully parallel structure in hardware, it seems that the proposed algorithm can decrease the area complexity compared to the split-radix-(2×2)/(4×4) algorithm, but requires a little more time complexity. An application of the proposed algorithm to 2-D medical image compression is also provided.
Fichier principal
Vignette du fichier
A_Novel_Split-Radix_Fast_Algorithm_for_2-D_Discrete_Hartley_Transform.pdf (714.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inserm-00405223 , version 1 (17-05-2010)

Identifiers

Cite

Longyu Jiang, Huazhong Shu, Jiasong Wu, Lu Wang, Lotfi Senhadji. A Novel Split-Radix Fast Algorithm for 2-D Discrete Hartley Transform. IEEE Transactions on Circuits and Systems Part 1 Fundamental Theory and Applications, 2010, 57 (4), pp.911-924. ⟨10.1109/TCSI.2009.2028639⟩. ⟨inserm-00405223⟩
139 View
980 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More