By Topic

Fast M-band orthogonal wavelet transform algorithm when base length equals 2M

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sang-Keun Kwon ; Dept. of Commun. Eng., Kumoh Nat. Univ. of Technol., Kyungbuk, South Korea ; Young-Seek Oh ; Dong Shin Seo

The fast implementation algorithm of M-band orthogonal wavelet filter bank (OWFB) with length L equal to 2M is proposed by using the lossless matrix factorisation method. The computational complexity of the proposed algorithm becomes lower than that of the direct filtering method (DFM):(M2+M+1) multiplications and M2+2M-1) additions against 2M2 and (2M2-M), respectively

Published in:

Electronics Letters  (Volume:33 ,  Issue: 6 )