Coded data generation or conversion – Digital code to digital code converters – To or from bit count codes
Patent
1998-01-27
1999-08-31
Young, Brian
Coded data generation or conversion
Digital code to digital code converters
To or from bit count codes
341 65, 341106, H03M 740
Patent
active
059459336
ABSTRACT:
According to the present invention, there is provided a method for compressing each of a plurality of data packets to form a compressed packet for transmission by a communication device, the data packets being composed of a sequence of data elements and the data packets being stored on a first computer such that the method is performed by the first computer, the method comprising the steps of: (a) receiving one of the plurality of data packets designated as packet P.sub.m ; (b) parsing the packet P.sub.m, such that the sequence of data elements of the packet P.sub.m is parsed into a sequence of parsed elements, each of the parsed elements having a form selected from the group consisting of a character, a pair of offset and length components, and a run length encoding consisting of a repetition factor component and a character component, and each of parsed elements and each of the components of the parsed elements having a frequency of occurrence; (c) selecting an encoding table from a historical array, the historical array including at least one encoding table from compression of at least one previously compressed data packet, the encoding table having been constructed according to the frequencies of occurrence of a plurality of parsed elements of the at least one previously compressed data packet, independent of data from the packet P.sub.m.
REFERENCES:
patent: 4701745 (1987-10-01), Waterworth
patent: 5016009 (1991-05-01), Whiting et al.
patent: 5126739 (1992-06-01), Whiting et al.
patent: 5532694 (1996-07-01), Mayers et al.
patent: 5841376 (1998-11-01), Hayashi
Ziv et al., "A Universal Algorithm for Sequential Data Compression", IEEE Trans. on Inf. Theory, vol. IT-23, pp. 337-343, 1977.
Ziv et al, "Compression of Individual Sequence Via Variable Rate Coding", IEEE Trans on Inf. Theory, vol. I-T, pp. 530-536, 1977.
Huffman, D., "A Method for the Construction of Minimum Redundancey Codes", Proc. IRE, vol. 1098-1101, 1652
Williams, R.N., "An Extremely Fast Ziv-Lempel Data Compression Algorithm", Proc. Data Compressioin Conf. DCC'91 Snowbird Utah, IEEE Computer Society Press, Los Alamitos, CA, pp. 362-371, 1991.
Brent, R.P., "A Linear Algorithm for Data Compression", The Australian Computer Journal,vol. 19, pp. 64-68, 1987.
Shell, D.L., "A High Speed Sorting Procedure", Comm of the ACM, vol., 2, pp. 30-32, 1959.
Heaps, H.S., "Information Retrieval: Computation and Theoretical", Academic Press, NY, 1978.
Cormen et al, "Introduction to Algorithms", The MIT Press, Cambridge, MA, Ch 17, 1990.
Friedman Mark M.
Infit Ltd.
Young Brian
LandOfFree
Adaptive packet compression apparatus and method does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Adaptive packet compression apparatus and method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive packet compression apparatus and method will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2427426