.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Data compression
high-throughput entropy coding
variable-to-fixed codes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
Enabling the Internet of Arctic Things with Freely-Drifting Small-Satellite Swarms.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSaveShareSaveLower Bounds on the Redundancy of Huffman Codes With Known and Unknown ProbabilitiesIEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSaveShareSave
View more