Lossless binary compression in a memory constrained environment
US10044370B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 1, 2017 |
| Grant date | Aug 7, 2018 |
| Priority date | — |
| Expiry date | Dec 1, 2037 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M7/3088
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
A method for decompressing a compressed data structure generated for a computing system includes generating a first block from the compressed data structure value by: reading a first indicator from a first field of the compressed data structure; reading a first symbol from a second field of the compressed data structure; determining, using the first indicator, whether the first symbol is compressed; reading, in response to determining that the first symbol is compressed, a block value of the first block from a third field of the compressed data structure, where the block value is stored in the third field at an index indicated by the first symbol, and a block size of each block value of the third field is determined by an instruction set of the computing system. The method further includes generating an uncompressed data structure by storing the first block in an uncompressed data structure.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.