MARVLE: A VLSI Chip for Data Compression Using Tree-Based Codes

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 1, Issue 2, 1993, Pages 203-214

  Mukherjee, Amar ^a   Ranganathan, N ^b   Flieder, Jeffrey W ^b   Acharya, Tinku ^a  

^a UNIVERSITY OF CENTRAL FLORIDA   (United States)

^b UNIVERSITY OF SOUTH FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; DATA COMPRESSION; IMAGING TECHNIQUES; MICROPROCESSOR CHIPS;

COMPRESSION CODES; IMAGE CODES; PICTORIAL DATA;

VLSI CIRCUITS;

EID: 0027612177     PISSN: 10638210     EISSN: 15579999     Source Type: Journal    
DOI: 10.1109/92.238415     Document Type: Article

References (51)

1. N. Abramson, Information Theory and Coding New York: McGraw-Hill, 1963.
2. R. B. Arps et al., ‘‘A multi-purpose VLSI chip for adaptive data compression of bilevel images,” IBM J. Res. Develop., vol. 32, no. 6, Nov 1988, pp. 775–795.
3. D. Auld, “A flexible chip set for intra-frame video compression,” in Proc. 36th Annual IEEE International Computer Conf. (COMPCON‘91, pp. 330–332, 1991.
4. A. Bassiouni and A. Mukherjee, “Multibit and multigroup techniques for data compression” Univ. of Central Florida, Aug. 1992, private communication.
5. M. Bassiouni, “Data compression in scientific and statistical data bases” IEEE Trans. Software Eng., vol. SE-11, pp. 1047–1058, Oct. 1985.
6. T. C. Bell, I. H. Witten, and J. G. Cleary, “Modeling for text compression,” ACM Comput. Surveys, vol. 21, no. 4, pp. 557–591, Dec. 1989.
7. D. Allan Bromley, “Grand challenges: High performance computing and communications” Office of Science and Technology Policy, Washington D.C. (Suppl. President's Fiscal Year 1992 Budget).
8. S. Bunton and G. Borriello, “Practical dictionary management for hardware data compression,” presented at the Sixth MIT Conf. on Advance Research in VLSI, Cambridge, MA, 1990.
9. C-Cube Microsystems, “CL550A JPEG image compression processor,” Preliminary Data Book, Feb. 1990.
10. S. F. Chang and D. G. Messerschmitt, “Designing high throughput VLC decoder: Part I — Concurrent VLSI architectures,” IEEE Transactions on Circuits and Systems for Video Technol., June 1992.
11. R. J. Clarke, Transform Coding of Images. New York: Academic, 1985.
12. P. Elias, “Universal codeword sets and representations of the integers,” IEEE Trans. Inform. Theory, vol. 21, pp. 194–203, Mar. 1975.
13. R. M. Fano, R. M., “ Transmission of Information. Cambridge, MA: M.I.T. Press, 1949.
14. A. S. Fraenkel and S. T. Klein, “Robust universal complete codes as alternatives to Huffman codes,” Tech. Rep. CS85-16, Dep. Appl. Math., Weizmann Inst. of Science, Rehovot, Israel, 1985.
15. M. Gonzalez-Smith and J. Storer, “Parallel alogrithms for data compression” J. Ass. Comput. Mach., vol. 32, no. 2, pp. 344–373, Apr. 1985.
16. J. L. Green, “Space data management at the NSSDC: Applications for data compression,” in Proc. Scientific Data Compression Workshop, Snowbird, UT, 1988.
17. D. Huffman, “A method for the construction of minimum redundancy codes” Proc. IRE, vol. 40, pp. 1098–1101, 1952.
18. D. Lelewer and D. Hirshberg, “Data compression,” ACM Comput. Surveys, vol. 19, no. 3, pp. 261–296, Sept. 1987.
19. Ming Li, ‘Toward a DNA sequencing theory,” in Proc. Foundation of Computer Science, St. Louis, MO, 1990.
20. R. Manepally and D. Sprague, “Intel's i750(R) video processor — The programmable solution,” in Proc. 36th Ann. IEEE Int. Computer Conf. (COMPCON ‘91), pp. 324–329, 1991.
21. R. B. Miller, et al., “Science data management: subpanel report”, Proc. of the Scientific Data Compression Workshop, Snowbird, Utah, 1988.
22. A. Mukherjee, N. Ranganathan, and M. Bassiouni, “Efficient VLSI designs for data transformation of tree-based codes,” IEEE Trans. Circuits Syst., vol. 38, pp. 306–314, Mar. 1991.
23. A. Mukherjee, H. Bheda, M. Bassiouni, and T. Acharya, “Multibit decoding/encoding of binary codes using memory-based architectures,” in Proc. Data Compression Conf., Snowbird, UT, pp. 352–361, Apr. 8–11 1991.
24. A. N. Netravali and B. G. Haskell, Digital Pictures. New York: Plenum, 1988.
25. J. W.Peake, R Decompaction,” IBM Technical Disclosure Bulletin, Vol. 26, no. 9, pp. 4794–4797.
26. S. Purcell, “The C-Cube CL550 JPEG image compression processor,” in Proc. 36th Ann. IEEE Int. Computer Conf. (COMPCON '91), pp. 318–323, 1991.
27. N. Ranganathan, “Hardware Algorithms for Data Compression” Ph. D. Dissertation, University of Central Florida, Aug. 1988.
28. N. Ranganathan and S. Henriques, “A parallel architecture for data compression,” in Proc. IEEE Int. Symp. on Parallel and Distributed Processing, Dallas, TX, Dec. 1990.
29. N. Ranganathan and S. Henriques, “High speed VLSI designs for Lempel-Ziv based data compression,” IEEE Trans. Circuits Syst. — II, to be published.
30. R. F. Rice, Y. Pen-Shu, and W. H. Miller, “ Algorithms for a very high speed universal noiseless coding module,” Jet Propulsion Laboratory, Pasadena, CA, Feb. 1991.
31. D. Sankoff, “Simultaneous solution of the ma folding, alignment and photosequence problems”, SIAM J. Appl. Math., vol. 45, no. 5, 1985.
32. C. E. Shannon and W. Weaver, The Mathematical Theory of Communication. Urbana, IL: Univ. Illinois Press, 1949.
33. J. L. Sicre and A. Leger, “Silicon complexity of VLC decoder vs. Q-coder,” JPEG N258, ISO/JTC1/SC2/WG8, CCITT SGVIII, Feb. 1989.
34. J. Storer and T. G. Szymanski, “Data compression by textual substitution,” J. Ass. Comput. Mach., vol. 29, no. 4, pp. 928–951, 1982.
35. James A. Storer, Data Compression: Methods and Theory. New York: Computer Science Press, 1988.
36. James A. Storer, John H. Reif, and Tassos Markas, “A massively parallel VLSI design for data compression,” in Proc. IEEE Workshop on VLSI Signal Processing, 1990.
37. M. T. Sun, T. C. Chen, and A. M. Gottlieb, “VLSI implementation of a 16x16 discrete cosine transform,” IEEE Trans. Circuits Syst., vol. 36, pp. 610–617, Apr. 1989.
38. M. T. Sun and S. M. Lei, “A parallel variable -length-code decoder for advanced television applications,” in Proc. 3rd Int. Workshop on HDTV, Aug. 1989.
39. M. T. Sun, “VLSI architecture and implementation of a high speed entropy decoder,” in Proc. Int. Symp. on Circuits and Systems, pp. 200–202, 1991.
40. M. T. Sun, K. M. Yang, and K. H. Tzou, “A high speed programmable VLSI for decoding variable length codes,” in Proc. SPIE, Applications of Digital Image Processing XII, vol. 1153, Aug. 1989.
41. J. Tarhio and e. Ukkonen, “A greedy approximation algorithm for constructing shortest common superstrings,” Theoretical Computer Sci., vol. 53, 1988.
42. J. Venbrux, N. Liu, K. Liu, P. Vincent, and R. Merrell, “A very high speed lossless compression/decompression chip set,” Jet Propulsion Lab., Pasadena, CA, May 1991.
43. M. Vetterli and A. Lightenberg, “A discrete Fourier-cosine transform chip,” IEEE J. Select. Areas Commun., vol. SAC-4, Jan. 1986.
44. G. K. Wallace, “The JPEG still picture compression standard,” Commun. ACM, vol. 34, no. 4, pp. 30–44, Apr. 1991.
45. T. Welch, “A technique for high-performance data compression” Computer, Vol. 17, no. 6, 1984, pp. 8–19.
46. T. Williams and K. Parker, “Design for testability—A survey,” IEEE Trans. Comput., vol. C-31, pp. 2–15, Jan. 1982.
47. I. H. Witten, R. M. Neal, and J. G. Cleary, “Arithmetic coding for data compression” CACM, vol. 30, no. 6, pp. 520–540, June 1987.
48. R. Zito-Wolf, “ A broadcast/reduce architecture for high speed data compression,” in Proc. IEEE Int. Symp, on Parallel and Distributed Processing, Dallas, TX, Dec. 1990.
49. R. Zito-Wolf, “A systolic architecture for sliding-window data compression,” in Proc. IEEE Workshop on VLSI Signal Processing, Nov. 1990.
50. J. Ziv and A. Lempel, “A universal algorithm for sequential data compression” IEEE Trans. Inform. Theory, vol. IT-23, pp. 337–343, 1977.
51. __, “Compression of individual sequences via variable-rate coding,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 530–536, 1978.