Coded data generation or conversion – Digital code to digital code converters – Adaptive coding
Reexamination Certificate
2008-10-14
2011-12-27
Pierre, Peguy Jean (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
Adaptive coding
C341S050000
Reexamination Certificate
active
08085171
ABSTRACT:
A method is provided for compressing data from a stream of values using one or many distinct memory addresses as workspace, each memory address containing one or many values. The method works by reading two contiguous data values, of length K and N bits, from the stream, as a memory address reference (MAR) and a symbol, respectively. If the symbol does not match any of the values in the memory address pointed to by MAR, the symbol replaces one of those values, and a MISS code, followed by the symbol, is appended to the compressed stream; otherwise, a HIT code is appended to the compressed stream, said code representing a function of the location where the matched value was found in the memory address. Advantageously, the workspace behaves analogous to a cache memory used in computer architecture, allowing hardware or software parallel implementations using content addressable memory or associative arrays.
REFERENCES:
patent: 3675211 (1972-07-01), Raviv
patent: 6657565 (2003-12-01), Kampf
patent: 7064489 (2006-06-01), Price
patent: 7180433 (2007-02-01), Grotmol
patent: 7224293 (2007-05-01), Parker
patent: 7233265 (2007-06-01), Cockburn et al.
patent: 2007/0245097 (2007-10-01), Gschwind et al.
Welch, T. A., A Technique for High-Performance Data Compression. IEEE Computer.17(6):8-19, Jun. 1984.
Salomon, D., Data Compression, 2nded. Springer-Verlag, New York, NY, 2000.
Ziv, J., and Lempel, A., A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theory. IT-23(3):337-343, 1977.
Huffman, D., A Method for the Construction of Minimum Redundancy Codes, Proceedings of the IRE 40(9):1098-1101, 1952.
Ott, E., Compact Encoding of Stationary Markov Sources, IEEE Trans. On Information Theory, vol. IT-1, No. 1, Jan. 1967, pp. 82-86.
Mommens, J. H., Raviv, J., Coding for Data Compation, IBM Research Report RC5150, T.J. Watson Research Center, Yorktown, NY, 1974.
Teuhola, J., Raita, T., Text Compression Using Prediction, Proc. of ACM Conf. on Information Retrieval (SIGIR), pp. 97-102, 1986.
Smith, A.J., Cache Memories, Computing Surveys, vol. 14, pp. 473-530, Sep. 1982.
Tanenbaum, A., Structured Computer Organization, 4th ed., Prentice Hall, New Jersey, 1999.
Jean Pierre Peguy
Myers, Jr. Richard S.
Stites & Harbison PLLC
University of Mississippi
Weyer Stephen J.
LandOfFree
High-speed data compression based on set associative cache... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with High-speed data compression based on set associative cache..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High-speed data compression based on set associative cache... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4261676