Fast running algorithm for discrete W transform

摘要

A fast algorithm for computing the running type-II discrete W transform (DWT-II) is proposed. The algorithm is based on a recursive relationship between three subsequent local DWT-II spectra. The computational complexity of the algorithm is compared with that of known fast and running DWT-II algorithms. Fast inverse algorithms for signal processing in the domain of the running DWT-II are also proposed.