Name
Abstract | ||
|---|---|---|
Data compression is becoming an essential component of high speed data communications and storage. Lossless data compression is when the de- compressed data must be identical to the original. Textual substitution methods are among the most powerful approaches to lossless data compression, where repeated substrings are replaced by pointers into a dynamically changing dic- tionary of strings. We present a massively parallel architecture for textual substitution that is based on a systolic pipe of 3,839 identical processing ele- ments that forms what is essentially an associative memory for strings that can "learn" new strings based on the text processed thus far. Key to the design of this architecture is the formulation of an inherently "top-down" serial learn- ing strategy as a "bottom up" parallel strategy. A custom VLSI chip for this architecture that operates at 300 million bits per second has been fabricated. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0743-7315(91)90091-M | J. Parallel Distrib. Comput. |
Keywords | Field | DocType |
parallel architecture,high-speed data compression,application specific integrated circuits,prototypes,top down,compression algorithms,computer science,vlsi,bottom up,very large scale integration,data compression,decoding,associative memory,chip | Computer architecture,Architecture,Content-addressable memory,Computer science,Parallel computing,Chip,Application-specific integrated circuit,Custom vlsi,Data compression,Very-large-scale integration,Parallel architecture | Journal |
Volume | Issue | ISSN |
13 | 2 | Journal of Parallel and Distributed Computing |
Citations | PageRank | References |
10 | 1.28 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| James A. Storer | 1 | 931 | 156.06 |
| John H. Reif | 2 | 4180 | 810.75 |