Share Email Print

Proceedings Paper

Minimum memory implementations of the lifting scheme
Author(s): Christos G. Chrysafis; Antonio Ortega
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

All publications on the lifting scheme up to now consider non-casual systems, where the assumption is that the whole input signal is buffered. This is problematic if we want to use lifting gin a low memory scenario. In this paper we present an analysis for making a lifting implementation of a filter bank causal, while at the same time reducing the amount of delay needed for the whole system. The amount of memory needed for the lifting implementation of any filter bank can br shown to be always smaller than the corresponding convolution implementation. The amount of memory saving sis filter bank dependent, it ranges form no savings for the Haar transform to 40 percent for a 2-10 filter bank. The amount of savings depends on the number of lifting steps as well as the length of the lifting steps used. We will also elaborate on the use of boundary extensions on each lifting step instead of the whole signal. This leads to lower memory requirements as well as simpler implementations.

Paper Details

Date Published: 4 December 2000
PDF: 12 pages
Proc. SPIE 4119, Wavelet Applications in Signal and Image Processing VIII, (4 December 2000); doi: 10.1117/12.408615
Show Author Affiliations
Christos G. Chrysafis, Hewlett-Packard Labs. (United States)
Antonio Ortega, Univ. of Southern California (United States)

Published in SPIE Proceedings Vol. 4119:
Wavelet Applications in Signal and Image Processing VIII
Akram Aldroubi; Andrew F. Laine; Michael A. Unser, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?