Decoding bit streams compressed with compression techniques employing variable length codes
US6765513B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Dec 9, 2002 |
| Grant date | Jul 20, 2004 |
| Priority date | — |
| Expiry date | Dec 9, 2022 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M7/40
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
A maximum length (M) of compressed codes desired to be decoded in a single lookup is determined. 2M rows are generated, with each row having a bit indicating whether a corresponding M-bit combination, when viewed from the first bit, contains a compression code and a source code corresponding to the compression code. A matching row corresponding to a value represented by M-bits of a source bit stream (“present portion”) is first determined, and the source code in the matching row is set as the decoded value if the matching row is indicated to contain a compression code. If the length (P) of the compression code corresponding to the decoded value is less than M, the last (M−P) bits of the present portion are used as a part of the next portion. Additional bits are used to generate the decoded value if the present portion does not contain the entire compression code.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.