An algorithm is presented for fast implementation of time-varying wavelet packets maintaining perfect reconstruction throughout transitions. It is based on filter banks known as the extended lapped transforms in an association following the paths of a binary-tree. Methods for pruning or expanding the branches of the tree are presented and a discussion on adaptation issues is carried.
Ricardo L. de Queiroz, K. Raghunath Rao