DocumentCode
1373739
Title
Fast odd-factor algorithm for discrete W transform
Author
Bi, Guoan ; Liu, Jian
Author_Institution
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
Volume
34
Issue
5
fYear
1998
fDate
3/5/1998 12:00:00 AM
Firstpage
431
Lastpage
433
Abstract
The authors present an odd-factor algorithm for type-II discrete W transforms (DWTs). They show that for N=p*q, where q is an odd integer, the length-N DWT can be decomposed into p length-q type-III DCTs and q length-p type-II DWTs. This is particularly useful for the computation of DWTs of arbitrarily composite length. A reduction in computational complexity is also achieved compared to other existing fast algorithms
Keywords
computational complexity; signal processing; transforms; arbitrarily composite length; computational complexity; odd-factor algorithm; signal processing; type-II discrete W transforms; type-III DCTs;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19980356
Filename
674195
Link To Document