Performance of parallel two-pass MDL context tree algorithm
Signal and Information Processing(2014)
摘要
Computing problems that handle large amounts of data necessitate the use of lossless data compression for efficient storage and transmission. We present numerical results that showcase the advantages of a novel lossless universal data compression algorithm that uses parallel computational units to increase the throughput with minimal degradation in the compression quality. Our approach is to divide the data into blocks, estimate the minimum description length (MDL) context tree source underlying the entire input, and compress each block in parallel based on the MDL source. Numerical results from a prototype implementation suggest that our algorithm offers a better trade-off between compression and throughput than competing universal data compression algorithms.
更多查看译文
关键词
data compression,parallel algorithms,MDL context tree source,compression quality,data storage,data transmission,lossless universal data compression algorithm,minimum description length,parallel computational units,parallel two-pass MDL context tree algorithm,big data,distributed computing,minimum description length,parallel algorithms,redundancy,two-pass code,universal data compression
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要