Lossless data compression with low complexity
US6121904A · kind A · utility
Assignee
Inventor
Key dates
| Filing date | Mar 12, 1998 |
| Grant date | Sep 19, 2000 |
| Priority date | — |
| Expiry date | Mar 12, 2018 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG10L19/04
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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 th…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.