A parallel two-pass MDL context tree algorithm for universal source coding
Published • Jun 1, 2014
NobleIDNI0P29W68R78S89
Authors:,,
Nikhil Krishnan
Dror Baron
M. Kıvanç Mıhçak
Abstract
We present a novel lossless universal source coding algorithm that uses parallel computational units to increase the throughput. The length-N input sequence is partitioned into B blocks. Processing each block independently of the other blocks can accelerate the computation by a factor of B, but degr...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!