{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:13:37Z","timestamp":1774628017185,"version":"3.50.1"},"reference-count":21,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T00:00:00Z","timestamp":1593475200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["18K19773, 20H04152"],"award-info":[{"award-number":["18K19773, 20H04152"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJCR1402"],"award-info":[{"award-number":["JPMJCR1402"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Toward strong demand for very high-speed I\/O for processors, physical performance growth of hardware I\/O speed was drastically increased in this decade. However, the recent Big Data applications still demand the larger I\/O bandwidth and the lower latency for the speed. Because the current I\/O performance does not improve so drastically, it is the time to consider another way to increase it. To overcome this challenge, we focus on lossless data compression technology to decrease the amount of data itself in the data communication path. The recent Big Data applications treat data stream that flows continuously and never allow stalling processing due to the high speed. Therefore, an elegant hardware-based data compression technology is demanded. This paper proposes a novel lossless data compression, called ASE coding. It encodes streaming data by applying the entropy coding approach. ASE coding instantly assigns the fewest bits to the corresponding compressed data according to the number of occupied entries in a look-up table. This paper describes the detailed mechanism of ASE coding. Furthermore, the paper demonstrates performance evaluations to promise that ASE coding adaptively shrinks streaming data and also works on a small amount of hardware resources without stalling or buffering any part of data stream.<\/jats:p>","DOI":"10.3390\/a13070159","type":"journal-article","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T16:06:54Z","timestamp":1593533214000},"page":"159","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Stream-Based Lossless Data Compression Applying Adaptive Entropy Coding for Hardware-Based Implementation"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3807-2726","authenticated-orcid":false,"given":"Shinichi","family":"Yamagiwa","sequence":"first","affiliation":[{"name":"Faculty of Engineering, Information and Systems, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, Ibaraki 305-8573, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eisaku","family":"Hayakawa","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, Ibaraki 305-8573, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koichi","family":"Marumo","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Tsukuba, 1-1-1 Tennodai, Tsukuba, Ibaraki 305-8573, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,6,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1016\/0306-4573(92)90066-9","article-title":"A universal algorithm for sequential data compression","volume":"28","author":"Howard","year":"1992","journal-title":"Inf. Process. Manag."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A Method for the Construction of Minimum-Redundancy Codes","volume":"40","author":"Huffman","year":"1952","journal-title":"Proc. IRE"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"23","author":"Ziv","year":"1977","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MC.1984.1659158","article-title":"A Technique for High-Performance Data Compression","volume":"17","author":"Welch","year":"1984","journal-title":"Computer"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Mentzer, F., Agustsson, E., Tschannen, M., Timofte, R., and Van Gool, L. (2019, January 15\u201320). Practical Full Resolution Learned Lossless Image Compression. Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Long Beach, SC, USA.","DOI":"10.1109\/CVPR.2019.01088"},{"key":"ref_6","unstructured":"Cover, T.M., and Thomas, J.A. (2012). Elements of Information Theory, John Wiley & Sons."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Deutsch, P. (1996). RFC 1951 DEFLATE Compressed Data Format Specification Version 1.3, Aladdin Enterprises.","DOI":"10.17487\/rfc1951"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1145\/31846.42227","article-title":"Design and Analysis of Dynamic Huffman Codes","volume":"34","author":"Vitter","year":"1987","journal-title":"J. ACM"},{"key":"ref_9","unstructured":"(2020, February 11). Google. Available online: https:\/\/github.com\/google\/snappy."},{"key":"ref_10","unstructured":"(2020, February 11). LZ4. Available online: https:\/\/lz4.github.io\/lz4\/."},{"key":"ref_11","unstructured":"Van Oord, A., Kalchbrenner, N., and Kavukcuoglu, K. (2016, January 19\u201324). Pixel Recurrent Neural Networks. Proceedings of the 33rd International Conference on Machine Learning, New York, NY, USA."},{"key":"ref_12","unstructured":"Van Oord, A., Kalchbrenner, N., Espeholt, L., Kavukcuoglu, K., Vinyals, O., and Graves, A. (2016, January 4\u20139). Conditional Image Generation with PixelCNN Decoders. Proceedings of the 30th International Conference on Neural Information Processing Systems, Barcelona, Spain."},{"key":"ref_13","unstructured":"Rajkumar, R., Koeppen, M., Ovaska, S., Furuhashi, T., and Hoffmann, F. (2002). Fast Text Compression Using Artificial Neural Networks. Soft Computing and Industry: Recent Applications, Springer."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Goyal, M., Tatwawadi, K., Chandak, S., and Ochoa, I. (2019, January 26\u201329). DeepZip: Lossless Data Compression Using Recurrent Neural Networks. Proceedings of the Data Compression Conference (DCC) 2019, Snowbird, UT, USA.","DOI":"10.1109\/DCC.2019.00087"},{"key":"ref_15","unstructured":"(2020, June 20). CMIX. Available online: https:\/\/github.com\/byronknoll\/cmix."},{"key":"ref_16","unstructured":"Franaszek, P.A., Lastras-Montano, L.A., Peng, S., and Robinson, J.T. (2006, January 28\u201330). Data compression with restricted parsings. Proceedings of the Data Compression Conference (DCC\u201906), Snowbird, UT, USA."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Marumo, K., Yamagiwa, S., Morita, R., and Sakamoto, H. (2016). Lazy Management for Frequency Table on Hardware-Based Stream Lossless Data Compression. Information, 7.","DOI":"10.3390\/info7040063"},{"key":"ref_18","unstructured":"(2020, February 11). LZ77. Available online: https:\/\/gist.github.com\/fogus\/5401265."},{"key":"ref_19","unstructured":"(2020, February 11). 7-zip. Available online: https:\/\/www.7-zip.org,."},{"key":"ref_20","unstructured":"(2020, February 11). Compressed Indexes and their Testbeds. Available online: http:\/\/pizzachili.dcc.uchile.cl."},{"key":"ref_21","unstructured":"(2020, February 11). Ultra Video Group. Available online: http:\/\/ultravideo.cs.tut.fi\/."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/7\/159\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:45:36Z","timestamp":1760175936000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/7\/159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,30]]},"references-count":21,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2020,7]]}},"alternative-id":["a13070159"],"URL":"https:\/\/doi.org\/10.3390\/a13070159","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,30]]}}}