Lossless data compression with low complexity

Coded data generation or conversion – Digital code to digital code converters – Adaptive coding

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

341106, H03M 730

Patent

active

060437634

ABSTRACT:
An adaptive predictor is used to predict samples, and residuals from such predictions are encoded using Golomb-Rice encoding to thereby compress a digital signal which includes the samples. The adaptive predictor adapts to residuals between actual and predicted samples at a particular rate. The rate of adaptation is itself adapted periodically to ensure optimum performance of the compression. A number of samples are repeatedly compressed using different adaptation rates, and the adaptation rate which produces the best compression results is used. The adaptation rate can be an exponential power of 2 such that incrementing the adaptation rate effectively doubles the rate at which the predictor is adapted and decrementing the adaptation rate effectively halves the rate at which the predictor is adapted. Accordingly, fewer trials are needed to find a relatively optimal adaptation rate for the predictor. A code length used in Golomb-Rice, which is typically referred to as the parameter k, is adapted for each sample in a predictable and repeatable manner to further reduce the size of a Golomb-Rice encoding for each sample. An infinite incident response filter of processed residuals automatically reduces influences of previously processed residuals upon such adaptation as additional samples are processed. The efficiency of Golomb-Rice encoding is improved by limiting the predicted samples to an efficient range.

REFERENCES:
patent: 5414796 (1995-05-01), Jacobs et al.
patent: 5418713 (1995-05-01), Allen
patent: 5434948 (1995-07-01), Holt et al.
patent: 5680129 (1997-10-01), Weinberger et al.
patent: 5682152 (1997-10-01), Wang et al.
patent: 5734823 (1998-03-01), Saigh et al.
patent: 5734891 (1998-03-01), Saigh
patent: 5794217 (1998-08-01), Allen
patent: 5819215 (1998-10-01), Dobson et al.
patent: 5835034 (1998-11-01), Seroussi et al.
Weinberger, et al., "LOCO-I: A Low Complexity, Context-Based, Lossless Image Compression Algorithm," IEEE Computer Society Press, Mar. 31-Apr. 3, 1996, pp. 140-149.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Lossless data compression with low complexity does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Lossless data compression with low complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lossless data compression with low complexity will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1329722

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.