Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform

In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comparison of the computational complexity with the familiar row–column algorithm shows that the proposed approach reduces significantly the number of arithmetic operations. Moreover, the proposed method has very regular structure, thus, it is easy to implement.

Keywords

3D DWT fast algorithm decimation in frequency

Domains

Life Sciences [q-bio] Bioengineering Engineering Sciences [physics] Signal and Image processing Mathematics [math] Representation Theory [math.RT] Computer Science [cs] Signal and Image Processing

Fichier principal

radix-2_algorithm_for_the_fast_computation_of_type-III_3D_DWT.pdf (171.19 Ko)

Origin : Publisher files allowed on an open archive

Lotfi Senhadji : Connect in order to contact the contributor

https://www.hal.inserm.fr/inserm-00304096

Submitted on : Tuesday, July 22, 2008-3:40:43 PM

Last modification on : Wednesday, March 9, 2022-9:16:03 AM

Long-term archiving on: Monday, May 31, 2010-8:25:04 PM

Dates and versions

inserm-00304096 , version 1 (22-07-2008)

Identifiers

HAL Id : inserm-00304096 , version 1
DOI : 10.1016/j.sigpro.2007.07.007

Cite

Huazhong Shu, Jiasong Wu, Lotfi Senhadji, Limin M. Luo. Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform. Signal Processing, 2008, 88 (1), pp.210-215. ⟨10.1016/j.sigpro.2007.07.007⟩. ⟨inserm-00304096⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

INSERM UNIV-RENNES1 LTSI INSMI CRIBS UR1-MATH-STIC UNIV-RENNES UR1-MATH-NUM UR1-BIO-SA

199 View

209 Download