A memory efficient algorithm for multi-dimensional wavelet transform based on lifting

The conventional implementation of multi-dimensional wavelet transform (e.g. 3D wavelet) requires either a high amount of "in access" memory or a continual access to slow memory of a processor which makes it infeasible for most applications. In this paper, we propose a novel algorithm for computation of an nD discrete wavelet transform (DWT) based on a lifting scheme. In addition to the benefits of the lifting scheme (which causes a major reduction in computational complexity and performs the total computations in the time domain), our real-time approach computes the coefficients for all kinds of 1^st and 2^nd generation wavelets with short delay and optimized utilization of the slow and fast memories of a processor.