inserm-00405223, version 1
A Novel Split-Radix Fast Algorithm for 2-D Discrete Hartley Transform
IEEE Transactions on Circuits and Systems. Part I, Regular Papers 57, 4 (2010) 911-924
Résumé : 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.
- 1 :
- SouthEast University – School of Computer Science and Engineering
- 2 :
- INSERM : LABORATOIRE INTERNATIONAL ASSOCIÉ – Université de Rennes 1 – SouthEast University
- 3 :
- INSERM : U642 – Université de Rennes 1
- Domaine : Sciences de l'ingénieur/Traitement du signal et de l'image
Sciences du Vivant/Ingénierie biomédicale
Mathématiques/Théorie des représentations
Sciences du Vivant/Ingénierie biomédicale/Imagerie
Informatique/Traitement du signal et de l'image - Mots-clés : Two-dimensional (2-D) discrete Hartley transform (DHT) – split-radix – fast algorithm – data compression
- inserm-00405223, version 1
- http://www.hal.inserm.fr/inserm-00405223
- oai:www.hal.inserm.fr:inserm-00405223
- Contributeur :
- Soumis le : Lundi 17 Mai 2010, 10:45:07
- Dernière modification le : Lundi 17 Mai 2010, 10:45:07




Documents associés
Exporter