{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:46:20Z","timestamp":1648759580804},"reference-count":14,"publisher":"Elsevier BV","issue":"13-15","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems Architecture"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s1383-7621(03)00023-7","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T01:09:24Z","timestamp":1052788164000},"page":"367-375","source":"Crossref","is-referenced-by-count":0,"title":["Approximate prefix coding for system-on-a-chip programs"],"prefix":"10.1016","volume":"48","author":[{"given":"Shlomo","family":"Weiss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Tsikel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S1383-7621(03)00023-7_BIB1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1147\/rd.452.0303","article-title":"Memory expansion technology (MXT): competitive impact","volume":"45","author":"Smith","year":"2001","journal-title":"IBM Journal of Research and Development"},{"key":"10.1016\/S1383-7621(03)00023-7_BIB2","unstructured":"J.L. Turley, Thumb squeezes ARM code size. Microprocessor Report, vol. 9(4), March 1995"},{"key":"10.1016\/S1383-7621(03)00023-7_BIB3","unstructured":"K. Kissell, MIPS16: High-density MIPS for the Embedded Market, Silicon Graphics MIPS Group, 1997"},{"key":"10.1016\/S1383-7621(03)00023-7_BIB4","doi-asserted-by":"crossref","unstructured":"T. Ishihara, H. Yasuura, A power reduction technique with object code merging for application specific embedded processors, in: Proceedings of the Design Automation and Test in Europe, March 2000","DOI":"10.1145\/343647.343871"},{"key":"10.1016\/S1383-7621(03)00023-7_BIB5","doi-asserted-by":"crossref","unstructured":"H. Lekatsas, J. Henkel, W. Wolf, Code compression for low power embedded system design, in: Proceedings of the 37th conference on Design automation, 2000, pp. 294\u2013299","DOI":"10.1145\/337292.337423"},{"key":"10.1016\/S1383-7621(03)00023-7_BIB6","doi-asserted-by":"crossref","unstructured":"C. Lefurgy, P. Bird, I.-C. Chen, T. Mudge, Improving code density using compression techniques, in: Proceedings of the International Symposium on Microarchitecture, December 1997, pp. 194\u2013203","DOI":"10.1109\/MICRO.1997.645810"},{"key":"10.1016\/S1383-7621(03)00023-7_BIB7","doi-asserted-by":"crossref","unstructured":"H. Lekatsas, W. Wolf, Random access decompression using binary arithmetic coding, in: Proceedings of the Data Compression Conference, March 1999, pp. 306\u2013315","DOI":"10.1109\/DCC.1999.755680"},{"issue":"5","key":"10.1016\/S1383-7621(03)00023-7_BIB8","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/92.894158","article-title":"Expression tree based algorithms for code compression on embedded RISC architectures","volume":"8","author":"Ara\u00fajo","year":"2000","journal-title":"IEEE Transactions on VLSI Systems"},{"key":"10.1016\/S1383-7621(03)00023-7_BIB9","doi-asserted-by":"crossref","unstructured":"A. Said, W.A. Pearlman, Low-complexity waveform coding via alphabet and sample-set partitioning, in: Visual Communications and Image Processing \u201997, Proceedings of SPIE, vol. 3024, February 1997, pp. 25\u201337","DOI":"10.1117\/12.263240"},{"key":"10.1016\/S1383-7621(03)00023-7_BIB10","doi-asserted-by":"crossref","unstructured":"A. Turpin, A. Moffat, Efficient approximate adaptive coding, in: Proceedings of the Data Compression Conference, 1997, pp. 357\u2013366","DOI":"10.1109\/DCC.1997.582059"},{"key":"10.1016\/S1383-7621(03)00023-7_BIB11","unstructured":"M. Game, A. Booker, CodePack: Code Compression for PowerPC Processors, International Business Machines (IBM) Corporation, 1998"},{"key":"10.1016\/S1383-7621(03)00023-7_BIB12","doi-asserted-by":"crossref","unstructured":"D.A. Huffman, A method for the construction of minimum redundancy codes, Proceedings of IRE, vol. 40(9), September 1952, pp. 1098\u20131101","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"10.1016\/S1383-7621(03)00023-7_BIB13","unstructured":"C.T. Weaver, Spec 2000 Binaries, www.eecs.umich.edu\/~chriswea\/benchmarks\/spec2000.html"},{"key":"10.1016\/S1383-7621(03)00023-7_BIB14","doi-asserted-by":"crossref","unstructured":"A. Wolfe, A. Chanin, Executing compressed programs on an embedded RISC architecture, in: Proceedings of the International Symposium on Microarchitecture, 1992, pp. 81\u201391","DOI":"10.1109\/MICRO.1992.697002"}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762103000237?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762103000237?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T13:20:21Z","timestamp":1584624021000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762103000237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":14,"journal-issue":{"issue":"13-15","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S1383762103000237"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(03)00023-7","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}