DocumentCode
1497802
Title
On computation of the discrete W transform
Author
Bi, Guoan
Author_Institution
Sch. of Electr. & Electron Eng., Nanyang Technol. Univ., Singapore
Volume
47
Issue
5
fYear
1999
fDate
5/1/1999 12:00:00 AM
Firstpage
1450
Lastpage
1453
Abstract
This article presents new fast algorithms for the type-II, -III, and -IV discrete W transform (DWT). The type-II and -III DWT is decomposed into two length-N/2 type-I DWTs, and the type-IV is converted into two length-N/2, type-II or type-III DWTs. The proposed algorithms achieve a simple computational structure and naturally support a wide range of sequence lengths. Savings on the number of arithmetic operations are achieved for the type-II to -IV DWT when N=15*2r
Keywords
digital arithmetic; discrete transforms; sequences; signal processing; algorithms; arithmetic operations; computational complexity minimisation; digital signal processing; discrete W transform; fast algorithms; sequence lengths; simple computational structure; type-II DWT; type-III DWT; type-IV DWT; Arithmetic; Bismuth; Computational complexity; Content addressable storage; Digital signal processing; Discrete cosine transforms; Discrete transforms; Discrete wavelet transforms; Signal processing algorithms; Two dimensional displays;
fLanguage
English
Journal_Title
Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
1053-587X
Type
jour
DOI
10.1109/78.757242
Filename
757242
Link To Document