This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Systolic Self-Organizing Lists Under Transpose
January 1995 (vol. 6 no. 1)
pp. 102-105

Abstract—Systolic array architectures for self-organizing linear lists under the transpose update heuristic are presented. The first model has linear delay and restricts input on every other system cycle. The second system combines a systolic array with trees to provide logarithmic delay and input on every clock cycle. These preliminary designs can be the basis of hardware used to achieve high-speed lossless data compression for data communication and storage. On large files (greater than 40 kilobytes), our designs provide better compression than other systolic list compression schemes.

Index Terms—Self-organizing lists, transpose, systolic array, dictionary compression, lossless data compression

[1] T.C. Bell, J.G. Cleary, and I.H. Witten, Text Compression.Englewood Cliffs, N.J.: Prentice Hall, 1990.
[2] S. Bunton and G. Borriello,“Practical dictionary management for hardware data compression,”Commun. ACM, vol. 35, pp. 95–104, Jan. 1992.
[3] M. E. Gonzalez-Smith and J. A. Storer,“Parallel algorithms for data compression,”J. ACM, vol. 32, no. 2, pp. 344–373, Apr. 1985.
[4] J. H. Hester and D. S. Hirschberg,“Self-organizing linear search,”ACM Comput. Surv., vol. 17, no. 3, pp. 295–311, Sep. 1985.
[5] J. A. Storer,“Massively parallel system for high-speed data compression,”patent pending.
[6] ——,“Massively parallel systolic algorithms for real-time dictionary-based text compression,”in J. A. Storer, Ed.,Image and Text Compression.Boston: Kluwer Academic, 1992.
[7] J. A. Storer and J. H. Reif,“A parallel architecture for high-speed data compression,”J. Parallel Distrib. Comput., vol. 13, pp. 222–227, 1991.
[8] C. D. Thomborson and B. W. Wei,“Systolic implementations of a move-to-front text compressor,”Proc. Symp. Parallel Alg. Arch., 1989.
[9] T. A. Welch,“A technique for high-performance data compression,”Comput., vol. 17, no. 6, pp. 8–19, June 1984.
[10] R. J. Zito-Wolf,“A broadcast/reduce architecture for high-speed data compression,”Proc. 2nd IEEE Symp. Parallel Distrib. Processing, 1990.
[11] ——,“A systolic architecture for sliding-window data compression,”Proc. IEEE VLSI Signal Proc. Conf., 1990, pp. 339–351.

Citation:
L. M. Stauffer, D. S. Hirschberg, "Systolic Self-Organizing Lists Under Transpose," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 1, pp. 102-105, Jan. 1995, doi:10.1109/71.363406
Usage of this product signifies your acceptance of the Terms of Use.