.png){kind=icon}
返回
High-Throughput Variable-to-Fixed Entropy Codec Using Selective, Stochastic Code Forests
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2991314.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Efficient high-throughput (HT) compression algorithms are paramount to meet the stringent constraints of present and upcoming data storage, processing, and transmission systems. In particular, latency, bandwidth and energy requirements are critical for those systems. Most HT codecs are designed to maximize compression speed, and secondarily to minimize compressed lengths. On the other hand, decompression speed is often equally or more critical than compression speed, especially in scenarios where decompression is performed multiple times and/or at critical parts of a system. In this work, an algorithm to design variable-to-fixed (VF) codes is proposed that prioritizes decompression speed. Stationary Markov analysis is employed to generate multiple, jointly optimized codes (denoted code forests). Their average compression efficiency is on par with the state of the art in VF codes, e.g., within 1% of Yamamoto et al.'s algorithm. The proposed code forest structure enables the implementation of highly efficient codecs, with decompression speeds 3.8 times faster than other state-of-the-art HT entropy codecs with equal or better compression ratios for natural data sources. Compared to these HT codecs, the proposed forests yields similar compression efficiency and speeds.
Keyword:
Data compression
high-throughput entropy coding
variable-to-fixed codes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Enabling the Internet of Arctic Things with Freely-Drifting Small-Satellite Swarms.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏An Efficient and Robust Data Compression Algorithm in Wireless Sensor Networks一种高效鲁棒的无线传感器网络数据压缩算法
PREAI
分享收藏Lower Bounds on the Redundancy of Huffman Codes With Known and Unknown Probabilities具有已知和未知概率的Huffman码冗余的下界IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏
查看更多内容