United States Patent
US Patent 6018303: Methods and means for image and voice compression
US 6018303 · granted 2000-01-25
Abstract
A system for lossy compression of digital data for transmission to a remote location or to a storage medium and subsequently reconstructing the digital data includes an encoder which compares sequences of characters with an encoder database of data records to generate a compressed code. The compressed code includes pointer information relating to locations within the encoder database of data records corresponding within a given average distortion tolerance level per character to the sequences, and update information for the addition to the encoder database of new data records corresponding within the average distortion tolerance level per character to the sequences. The system also includes a decoder for receiving the compressed code, the receiver processing the compressed code to substantially reconstruct the digital data.
| Patent Number | 6018303 |
|---|---|
| Title | Methods and means for image and voice compression |
| Filed | 1998-11-10 |
| Granted | 2000-01-25 |
| Inventor(s) | Sadeh; Ilan |
| Assignee | Visnet Ltd. |
| CPC Classification | H03M 7/30 |
| Number of Claims | 113 |
Abstract
A system for lossy compression of digital data for transmission to a remote location or to a storage medium and subsequently reconstructing the digital data includes an encoder which compares sequences of characters with an encoder database of data records to generate a compressed code. The compressed code includes pointer information relating to locations within the encoder database of data records corresponding within a given average distortion tolerance level per character to the sequences, and update information for the addition to the encoder database of new data records corresponding within the average distortion tolerance level per character to the sequences. The system also includes a decoder for receiving the compressed code, the receiver processing the compressed code to substantially reconstruct the digital data.
Claim 1
A method for compressing source data for transmission to a remote location or to a storage medium, the source data being made up of data units from a first alphabet U, thesource data units being mappable on to code data units of a second alphabet V, there being defined a distortion measure indicative of the distortion caused by encoding any given source data unit as any given code data unit, the method comprising thesteps of: (a) setting a current string length, l, to an initial value; (b) imputting l data units of source data to generate a current string; (c) searching within at least part of a tree-structured database of code data units for a database substring corresponding within a given non-zero average distortion tolerance level per data unit to said current string, said tree-structureddatabase of code data units being structured as a multi-branch structure in which at least one node has in excess of two nodes branching therefrom; (d) in a case that such a said database substring is found: (i) storing last-find pointer information relating to the location within said database of said database substring which corresponds within said average distortion tolerance level per data
Claims
113 totalA method for compressing source data for transmission to a remote location or to a storage medium, the source data being made up of data units from a first alphabet U, thesource data units being mappable on to code data units of a second alphabet V, there being defined a distortion measure indicative of the distortion caused by encoding any given source data unit as any given code data unit, the method comprising thesteps of: (a) setting a current string length, l, to an initial value; (b) imputting l data units of source data to generate a current string; (c) searching within at least part of a tree-structured database of code data units for a database substring corresponding within a given non-zero average distortion tolerance level per data unit to said current string, said tree-structureddatabase of code data units being structured as a multi-branch structure in which at least one node has in excess of two nodes branching therefrom; (d) in a case that such a said database substring is found: (i) storing last-find pointer information relating to the location within said database of said database substring which corresponds within said average distortion tolerance level per data