Distributed Arithmetic Coding for Sources with Hidden Markov Correlation

2021/01/07 by Fang, Yong, Jeong, Jechang
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2101.02336

Abstract

Distributed arithmetic coding (DAC) has been shown to be effective for Slepian-Wolf coding, especially for short data blocks. In this letter, we propose to use the DAC to compress momery-correlated sources. More specifically, the correlation between sources is modeled as a hidden Markov process. Experimental results show that the performance is close to the theoretical Slepian-Wolf limit.

Related

• Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem
• Distributed Joint Source-Channel Coding for arbitrary memoryless correlated sources and Source coding for Markov correlated sources using LDPC codes
• DALC: Distributed Arithmetic Coding Aided by Linear Codes
• LDPC-Based Iterative Algorithm for Compression of Correlated Sources at Rates Approaching the Slepian-Wolf Bound
• Improved Modeling of the Correlation Between Continuous-Valued Sources in LDPC-Based DSC