Abstract
The wavelet transform appears to be an efficient tool for image compression. Many works propose an implementation of the pyramid a1gorithm with some improvement to reduce its treatment time or to increase its performances. However, the pyramid a1gorithm remains silicon area costly, essentially because of its memory needs, and depending on the size of filters used. This paper proposes a new implementation of the wavelet transform using the lifting scheme. This method proposes many improvements such as in-place calculation, small memory needs, and easy inverse transform.