Fast Parallel Algorithms for Universal Lossless Source Coding

The O(N/B) parallel compression algorithm estimates the MDL source among all tree sources whose maximal depth is log( N/B). This algorithm can be extended to parallel algorithms that support unbounded context depths. This will provide low redundancy performance over a much broader class of sources, and may lead to new applications that until now were limited by the throughput bottleneck of serial compression algorithms.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Electrical Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Baron, Dror

Contributors dc:contributor

• Bresler, Yoram

• Engineering, Electronics and Electrical

Language dc:language

eng

Identifier

(MiAaPQ)AAI3111670

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/80852