Multiplex communications – Wide area network – Packet switching
Patent
1995-05-16
1996-06-11
Olms, Douglas W.
Multiplex communications
Wide area network
Packet switching
341 51, 341 87, H04J 316, H03M 730
Patent
active
055263631
ABSTRACT:
A system for transmitting compressed data for multiple channels or contexts from a single node which system reduces memory utilization without significant adverse effect on compression ratio by providing a separate history buffer for each channel, with a single hash table being provided for generating potential match addresses in the history buffer for at least selected ones of the channels. A single chain table may also be provided, the chain table having a single offset address for the corresponding offset addresses in the buffers for the selected channels. Collisions in the common hash table may be reduced by including channel address or the like as an additional input to the hash table, thereby biasing the address outputs therefrom.
REFERENCES:
patent: 3659052 (1972-04-01), Slavin
patent: 4054951 (1977-10-01), Jackson et al.
patent: 4558302 (1985-12-01), Welch
patent: 4701745 (1987-10-01), Waterworth
patent: 4730348 (1988-03-01), MacCrisken
patent: 4906991 (1990-03-01), Fiala
patent: 5003307 (1991-03-01), Whiting et al.
patent: 5016009 (1991-05-01), Whiting et al.
patent: 5049881 (1991-09-01), Gibson et al.
patent: 5051745 (1991-09-01), Katz
patent: 5126739 (1992-06-01), Whiting et al.
patent: 5140321 (1992-08-01), Jung
patent: 5155484 (1992-10-01), Chambers, IV
Bell, Timothy C., "Text Compression", 1990, Prentice Hall, pp. 12-123.
Roesgen, Jack and Ahmed, Hassan, "Gate Array Functional Specification", Jul. 23, 1993.
Ziv, "A Universal Algorithm for Sequential Data Compression", IEEE Transactions on Information Theory, IT IT-23-3, May 1977, pp. 337-343.
D. E. Knuth, "Dynamic Huffman Coding," Journal of Algorithms, Algorithms, vol. 6, 1985, pp. 163-180.
T. A. Welch, "A Technique for High-Performance Data Compression", Computer, Jun. 1984. pp. 8-19.
D. E. Knuth, "Sorting and Searching: The Art of Computer Programming", vol. 3, 1973, pp. 117-128, 506-549.
R. G. Gallagher, "Variations on a Theme by Huffman", IEEE Transactions on Information Theory, IT-24-6, Nov. 1978, pp. 668-674.
M. Wells, The Computer Journal, vol. 15, No. 4, Nov. 1972, pp. 307-313.
J. G. Cleary and Ian H. Witten, "Data Compression Using Adaptive Coding and Partial String Matching", IEEE Transactions on Communications, vol. Com. 32, No. 4, Apr. 1984, pp. 396-402.
M. E. Gonzalez Smith and J. A. Storer, "Parallel Algorithms for Data Compression", Journal of the Association for Computing Machinery, vol. 32, No. 2, Apr. 1985, pp. 344-373.
J. H. Mommens and J. Raviv, "Coding for Data Compaction", IBM Research No. 11, Nov. 1974.
D. A. Hoffman, "A Method for the Construction of Minimum-Redundancy Codes", Proceedings of the I.R.E., Sep. 1952, pp. 1098-1101.
Mark Nelson, "The Data Compression Handbook", M&T Publishing, 1991.
Black Jeffrey
Lam Wing
Weiss Jeffrey
Olms Douglas W.
Phillips Matthew C.
Telco Systems, Inc.
LandOfFree
Multicontext compression system with shared data structures does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Multicontext compression system with shared data structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multicontext compression system with shared data structures will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-359588