Research Article
Approximation of DAC Codeword Distribution for Equiprobable Binary Sources Along Proper Decoding Paths
@INPROCEEDINGS{10.1007/978-3-030-67514-1_1, author={Nan Yang and Yong Fang}, title={Approximation of DAC Codeword Distribution for Equiprobable Binary Sources Along Proper Decoding Paths}, proceedings={IoT as a Service. 6th EAI International Conference, IoTaaS 2020, Xi’an, China, November 19--20, 2020, Proceedings}, proceedings_a={IOTAAS}, year={2021}, month={1}, keywords={Slepian-Wolf coding Distributed arithmetic coding Codeword distribution Polynomial approximation}, doi={10.1007/978-3-030-67514-1_1} }- Nan Yang
Yong Fang
Year: 2021
Approximation of DAC Codeword Distribution for Equiprobable Binary Sources Along Proper Decoding Paths
IOTAAS
Springer
DOI: 10.1007/978-3-030-67514-1_1
Abstract
Distributed Arithmetic Coding (DAC) is an effective implementation of Slepian-Wolf coding. To research its properties, the concept of DAC codeword distribution along proper decoding paths has been introduced. For DAC codeword distribution of equiprobable binary sources along proper decoding paths, the problem was formatted as solving a system of functional equations. However, in general cases, to find the closed form of DAC codeword distribution still remains a very difficult task. This paper proposes an approximation method for DAC codeword distribution of equiprobable binary sources along proper decoding paths: polynomial approximation. At rates lower than 0.5, DAC codeword distribution can be well approximated by a polynomial. Some simulation results are given to verify theoretical analyses.
