Coded data generation or conversion – Digital code to digital code converters – Tree structure
Patent
1992-11-18
1996-07-16
Lee, Thomas C.
Coded data generation or conversion
Digital code to digital code converters
Tree structure
341 55, 364DIG2, 364919, 364DIG1, 3642606, 3642604, H03M 730, H03M 748, G06F 1516
Patent
active
055375510
ABSTRACT:
A method for compressing and subsequently decompressing digital data communicated in an interactive computer network, the network designed to provide informational and transactional services to a very large population of users. The method features steps for compressing bytes of network data before transmission by substituting variable-length code words obtained from a fixed, look-up table, and, reconstituting the bytes using a fixed, decompression look-up table when the code words are received at the data reception site. In accordance with the invention, the compression and decompression look-up tables are statistically compiled by sampling the occurrence frequency of byte pairs in the network data stream, and where byte pairs are found to occur above a predetermined frequency, code words having lengths inversely related to the occurrence frequency are created for inclusion in the table so that a code word may be substituted for one byte of a pair when the other byte of the pair is found to precede it during compression, and the byte reconstituted from the code word using the decompression table when the code word is received at the reception site. Additionally, where a byte and its preceding byte constitute a pair not found within the pairs compression table, the method features steps for transmitting the byte compressed in accordance with a context-free encoding scheme, together with a suitable escape code word. Yet further, the method features steps for combining other compression and decompression procedures with the byte-pair compression and decompression to produce a compound compression scheme for the network data stream.
REFERENCES:
patent: 3675211 (1972-07-01), Raviv
patent: 3675212 (1972-07-01), Raviv et al.
patent: 3694813 (1972-09-01), Loh et al.
patent: 3701108 (1972-10-01), Loh et al.
patent: 3883847 (1975-05-01), Frank
patent: 3935379 (1976-01-01), Thornburg et al.
patent: 4099257 (1978-07-01), Arnold et al.
patent: 4396906 (1983-08-01), Weaver
patent: 4464650 (1984-08-01), Eastman et al.
patent: 4494108 (1985-01-01), Langdon, Jr. et al.
patent: 4626829 (1986-12-01), Hauh
patent: 4782325 (1988-11-01), Jeppsson et al.
patent: 4839649 (1989-06-01), Imal et al.
patent: 4847619 (1989-07-01), Kato et al.
patent: 4988998 (1991-01-01), O'Brien
patent: 5109433 (1992-04-01), Notenboom
Bell et al., Modeling for Text Compression, Dec. 1989, ACM Computing Surveys, vol. 21, No. 4, pp. 557-590.
Fila et al., Data Compression With Finite Windows, Apr. 1989, Communications Of The ACM, vol. 32, No. 4, pp. 490-505.
Ziv et al., Compression Of Individual Sequences Via Variable--Rate Coding, Sep. 1978, IEEE Transactions On Information Theory, vol. IT-24, No. 5, pp. 530-505.
Ziv et al., A Universal Algorithm For Sequential Data Compression, May 1977, IEEE Transactions On Information Theory, + vol. IT-23, No. 3, pp. 337-343.
Denenberg Jeffrey N.
Gordon Michael L.
Weinberger Edward D.
Dinh D.
Lee Thomas C.
Scifo Paul C.
LandOfFree
Data compression method for use in a computerized informational does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data compression method for use in a computerized informational , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data compression method for use in a computerized informational will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1792058