FAST ODD-FACTOR ALGORITHM FOR DISCRETE W-TRANSFORM

The authors present an odd-factor algorithm for type-II discrete W tra nsforms (DWTs). They show that for N = pq, where q is an odd integer, the length-N DWT can be decomposed into p length-q type-m 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 algorithm s.