Systolic Implementations of a Move-To-Front Text Compressor

Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

Volumn , Issue , 1989, Pages 283-290

  Thomborson, Clark D ^a   Welt, Belle W Y ^b  

^a UNIVERSITY OF MINNESOTA DULUTH   (United States)

^b SAN JOSE STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; BANDWIDTH; DIGITAL STORAGE; HARDWARE; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; VIRTUAL STORAGE;

BENTLEY; CODING ALGORITHMS; DATA STORAGE DEVICES; HIGH COMPRESSIONS; JOURNAL ARTICLES; MOVE-TO-FRONT; SOFTWARE AND HARDWARES; TEXT COMPRESSIONS;

BANDWIDTH COMPRESSION;

EID: 84941859585     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/72935.72965     Document Type: Conference Paper

References (16)

1. 2-nm CMOS Standard Cell Data Book (SRSD001). Texas Instruments, 1986.
2. Jon Louis Bentley, Daniel D. Sleator, Robert E. Tarjan, and Victor K. Wei. A locally adaptive data compression scheme. Communications of the ACM, 29(4):320-330, April 1986.
3. John G. Cleary and Ian H. Witten. Data compression using adaptive coding and partial string matching. IEEE Transactions on Computers, COM-32(4):396-402, April 1984.
4. Peter Elias. Interval and recency rank source coding: Two on-line adaptive variable-length schemes. IEEE Transactions on Information Theory, IT- 33(1):3-10, January 1987.
5. Edward W. Fiala and Daniel H. Greene. Data compression with finite windows. Communications of the ACM, 32(4):490-505, April 1989.
6. R. Nigel Horspool and Gordon V. Cormack. Technical correspondence. Communications of the ACM, 30(9):792-794, September 1987.
7. Douglas W. Jones. Application of splay trees to data compression. Communications of the ACM, 31(8):996-1007, August 1988.
8. Debra A. Lelewer and Daniel S. Hirschberg. Data compression. ACM Computing Surveys, 19(3):261- 296, September 1987.
9. Jonna Rissanen. A universal data compression system. IEEE Transactions on Information Theory, IT-29(5):656-664, September 1983.
10. Clyde Rogers and Clark D. Thomborson. Enhancements to Ziv-Lempcl Data Compression. Technical Report 89-2, University of Minnesota at Duluth, Computer Science Department. January 1989.
11. B.Y. Ryabko. Technical correspondence. Communications of the ACM, 30(9):792, September 1987.
12. M. E. Gonzalez Smith and J. A. Storer. Parallel algorithms for data compression. Journal of the -ACM, 32(2) :344-373, April 1985.
13. Belle W, Y Wei. Synthesis and optimization of VLSI prefix circuits. PhD thesis, Computer Science Division, UC Berkeley, May 1987.
14. Terry A. Welch. A technique for high-performance data compression. Computer, 17(6):8-19, June 1984.
15. Ian H. Witten, Radford M. Neal, and John G. Cleary. Arithmetic coding for data compression. Communications of the ACM, 30(6):520-540, June 1987.
16. J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory, IT-24(5):530-536, 1978.