{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:34:10Z","timestamp":1761662050410,"version":"3.43.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1023\/a:1026559601791","type":"journal-article","created":{"date-parts":[[2003,11,6]],"date-time":"2003-11-06T12:11:16Z","timestamp":1068120676000},"page":"369-381","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A Hardware Architecture for the LZW Compression and Decompression Algorithms Based on Parallel Dictionaries"],"prefix":"10.1007","volume":"26","author":[{"given":"Ming-Bo","family":"Lin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,11,1]]},"reference":[{"key":"276577_CR1","doi-asserted-by":"crossref","unstructured":"Ming-Bo Lin, \u201cA parallel VLSI architecture for the LZW data compression algorithm,\u201d International Symposium on VLSI Technology, Systems, and Applications, June 3-5, 1997, Taiwan, pp. 98\u2013101.","DOI":"10.1109\/VTSA.1997.614737"},{"key":"276577_CR2","volume-title":"Text Compression","author":"T.C. Bell","year":"1990","unstructured":"T.C. Bell, J.G. Cleary, and I.H. Witten, Text Compression, Englewood Cliffs, N.J.: Prentice-Hall, 1990."},{"key":"276577_CR3","volume-title":"Digital Image Processing","author":"R. C. Gonzalez","year":"1992","unstructured":"Rafael C. Gonzalez and Richard E. Woods, Digital Image Processing, Reading, Massachusetts: Addison-Welsley Publishing Company, 1992."},{"key":"276577_CR4","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D. Huffman","year":"1952","unstructured":"D. Huffman, \u201cA method for the construction of minimum redundancy codes,\u201d Proceeding of IRE, vol. 40, 1952, pp. 1098\u20131101.","journal-title":"Proceeding of IRE"},{"issue":"4","key":"276577_CR5","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1145\/31846.42227","volume":"34","author":"J.S. Vitter","year":"1987","unstructured":"J.S. Vitter, \u201cDesign and analysis of dynamic Huffman codes,\u201d J. Association for Computing Machinery, vol. 34, no.4, 1987, pp. 825\u2013845.","journal-title":"J. Association for Computing Machinery"},{"key":"276577_CR6","volume-title":"The Mathematical Theory of Communication","author":"C.E. Shannon","year":"1949","unstructured":"C.E. Shannon and W. Weaver, The Mathematical Theory of Communication, Urbana, IL: Univ. Illinois Press, 1949."},{"key":"276577_CR7","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P. Elias","year":"1975","unstructured":"P. Elias, \u201cUniversal codeword sets and representations of the integers,\u201d IEEE Trans. Inform. Theory, vol. 21, 1975, pp. 194\u2013203.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"276577_CR8","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1109\/31.101323","volume":"38","author":"A. Mukheriee","year":"1991","unstructured":"A. Mukheriee, N. Ranganthan, and M. Bassiouni, \u201cEfficient VLSI designs for data transformation of tree-based codes,\u201d IEEE Trans. Circuits Syst., vol. 38, 1991, pp. 306\u2013314.","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"2","key":"276577_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/92.238415","volume":"1","author":"A. Mukheriee","year":"1993","unstructured":"A. Mukheriee, N. Ranganthan, and J.W. Flieder, \u201cMARVLE: A VLSI chip for data compression using tree-based codes,\u201d IEEE Trans. VLSI Syst., vol. 1, no.2, 1993, pp. 203\u2013214.","journal-title":"IEEE Trans. VLSI Syst."},{"issue":"3","key":"276577_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"IT-23","author":"J. Ziv","year":"1977","unstructured":"J. Ziv and A. Lempel, \u201cA universal algorithm for sequential data compression,\u201d IEEE Trans. Information Theory, vol. IT-23, no.3, 1977, pp. 337\u2013343.","journal-title":"IEEE Trans. Information Theory"},{"issue":"5","key":"276577_CR11","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"IT-24","author":"J. Ziv","year":"1978","unstructured":"J. Ziv and A. Lempel, \u201cA compression of individual sequences via variable-rate coding,\u201d IEEE Trans. Information Theory, vol. IT-24, no.5, 1978, pp. 530\u2013536.","journal-title":"IEEE Trans. Information Theory"},{"issue":"6","key":"276577_CR12","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MC.1984.1659158","volume":"17","author":"T. A. Welch","year":"1984","unstructured":"Terry A. Welch, \u201cA technique for high-performance data compression,\u201d IEEE Computer, vol. 17, no.6, 1984, pp. 8\u201319.","journal-title":"IEEE Computer"},{"key":"276577_CR13","unstructured":"D.J. Craft, \u201cADLC and a pre-processor extension, BDLC, provide ultra fast compression for general-purpose and bit-mapped image data,\u201d Proc. Data Compression Conf., 1995, p. 440."},{"issue":"3","key":"276577_CR14","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1109\/92.711318","volume":"6","author":"B. Jung","year":"1998","unstructured":"Bongjin Jung and Wayne P. Burleson, \u201cEfficienct VLSI for Lempel-Ziv compression in wireless data communication networks,\u201d IEEE Trans. VLSI Syst., vol. 6, no.3, 1998, pp. 475\u2013483.","journal-title":"IEEE Trans. VLSI Syst."},{"key":"276577_CR15","volume-title":"Data and Image Compression: Tools and Techniques","author":"G. Held","year":"1996","unstructured":"Gilbert Held, Data and Image Compression: Tools and Techniques, 4th edn., New York: John Wiley & Sons, 1996.","edition":"4th edn."},{"issue":"1","key":"276577_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/129617.129622","volume":"35","author":"S. Bunton","year":"1992","unstructured":"S. Bunton and G. Borriello, \u201cPractical dictionary management for hardware data compression,\u201d Communications of ACM, vol. 35, no.1, 1992, pp. 95\u2013104.","journal-title":"Communications of ACM"},{"issue":"4","key":"276577_CR17","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/63334.63341","volume":"32","author":"E. Fiala","year":"1989","unstructured":"E. Fiala and D. Greene, \u201cData compression with finite windows,\u201d Communications of ACM, vol. 32, no.4, 1989, pp. 490\u2013505.","journal-title":"Communications of ACM"},{"key":"276577_CR18","volume-title":"Data Compression Methods and Theory","author":"J. Storer","year":"1988","unstructured":"J. Storer, Data Compression Methods and Theory, Rockville, MD: Computer Science Press, 1988."},{"key":"276577_CR19","unstructured":"T. Halfhill, \u201cHow safe is data compression,\u201d BYTE, 1994, pp. 56\u201374."},{"issue":"6","key":"276577_CR20","first-page":"582","volume":"139","author":"J. Jiang","year":"1992","unstructured":"J. Jiang and S. Jones, \u201cWord-based dynamic algorithms for data compression,\u201d IEE Proceedings-I, vol. 139, no.6, 1992, pp. 582\u2013586.","journal-title":"IEE Proceedings-I"}],"container-title":["Journal of VLSI signal processing systems for signal, image and video technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026559601791.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026559601791\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026559601791.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T09:35:26Z","timestamp":1754904926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026559601791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["276577"],"URL":"https:\/\/doi.org\/10.1023\/a:1026559601791","relation":{},"ISSN":["0922-5773"],"issn-type":[{"type":"print","value":"0922-5773"}],"subject":[],"published":{"date-parts":[[2000,11]]},"assertion":[{"value":"1 November 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}