Coded data generation or conversion – Digital code to digital code converters – To or from number of pulses
Patent
1998-03-12
2000-09-19
Young, Brian
Coded data generation or conversion
Digital code to digital code converters
To or from number of pulses
341106, H03M 730
Patent
active
061219045
ABSTRACT:
An adaptive linear predictor is used to predict samples, and residuals from such predictions are encoded using Golomb-Rice encoding. Linear prediction of samples of a signal which represents digitized sound tends to produce relatively low residuals and those residuals tend to be distributed exponentially. Accordingly, linear prediction combined with Golomb-Rice encoding produces particularly good compression rates with very efficient and simple implementation. 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. In addition, the influence of each residual processed in the adaptation of the code length is directly related to the recency of the processing of the sample to which the residual corresponds. Furthermore, no resetting of the code length adaptation mechanism is required since influence of particularly distant residuals upon the adaptation of the code length diminishes to negligible amounts over time. The efficiency of Golomb-Rice encoding is improved by limiting the predicted samples to an efficient range. The maximum of the efficient range is the maximum valid value of a sample less the maximum positive value of the fixed-length, binary portion of an encoded residual. The adaptive predictor adapts to residuals between actual and predicted samples at a particular rate.
REFERENCES:
patent: 5414796 (1995-05-01), Jacobs et al.
patent: 5418713 (1995-05-01), Allen
patent: 5434948 (1995-07-01), Holt et al.
patent: 5636276 (1997-06-01), Brugger
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.
Ivey James D.
Liquid Audio Inc.
Young Brian
LandOfFree
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.
Profile ID: LFUS-PAI-O-1077660