Compression based on channel characteristics
US6981060B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Dec 14, 2000 |
| Grant date | Dec 27, 2005 |
| Priority date | — |
| Expiry date | Dec 29, 2022 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L69/324
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
In a packet based data transmission including automatic repeat request (ARQ) protocols, the memory consumption of the ARQ protocol is reduced by compression/decompression of failed data block prior to combination with the retransmitted data blocks using low complexity compression/decompression algorithms. The compression algorithm includes of two parts: calculating and storing a scale factor that estimates the soft values in the data block, and storing the each soft values' sign in local memory instead of the complete soft value. Since one bit is sufficient to store the sign of each soft value, the memory consumption of a data block containing N soft values is N bits. Note, the scale factor increases the memory consumption, in bits, with the word length of the scale factor. However, the relative memory increase becomes smaller the larger the data block.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.