A parallel architecture for high speed data compression

The authors discuss textural substitution methods. They present a massively parallel architecture for textural substitution that is based on a systolic pipe of 3839 identical processing elements that forms what is essentially an associative memory for strings that can learn new strings on the basis of the text processed thus far. The key to the design of this architecture is the formulation of an inherently top-down serial learning strategy as a bottom-up parallel strategy. A custom VLSI chip for this architecture that is capable of operating at 320-Mb/s has passed all simulations and is being fabricated with 1.2- mu m double-metal technology.<<ETX>>

[1]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[2]  Terry A. Welch,et al.  A Technique for High-Performance Data Compression , 1984, Computer.

[3]  Abraham Lempel,et al.  On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.

[4]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[5]  Mark N. Wegman,et al.  Variations on a theme by Ziv and Lempel , 1985 .

[6]  Jacob Ziv,et al.  On universal quantization , 1985, IEEE Trans. Inf. Theory.

[7]  James A. Storer,et al.  Parallel algorithms for data compression , 1985, JACM.