Patent · US Active

Low complexity compression of short messages

US7999704B2 · kind B2 · utility

3Cited by

1References

11Claims

0Family size

Assignee

Aalborg Universitet · DK

Inventors

Frank Fitzek · Aalborg, DK
Stephan Rein · Augsburg, DE
Clemens Guehmann · Berlin, DE

Key dates

Filing date	Mar 14, 2007
Grant date	Aug 16, 2011
Priority date	—
Expiry date	Aug 5, 2027

Classification

Technology area (CPC H)Electricity
CPC primaryH03M7/3084
WIPO fieldBasic communication processes
WIPO sectorElectrical engineering

Abstract

A method for data communication, where the data compression and decompression is performed by use of a specific hash table, by which data compression a symbol for each data segment is generated, which symbols are transmitted to the receiver where the symbols are decompressed by use of the specific hash table is modified by the specific hash table being performed as a hash table array, which hash table array generates symbols having at least a hash count and a parity check, in which hash table array the parity check comprises generating of a data string, which data string is compared with a parity stored in the hash table, where if both parities are the same, the data model returns the count in the hash table element for transmission, where a zero count is returned indicating that the data string is not valid in the hash table an no transmission is performed.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.