Error Probability of Distributed Arithmetic Coding

Distributed Arithmetic Coding (DAC) is an interesting realization of Slepian-Wolf coding that performs nonlinear coset-like partition for equiprobable binary sources. Just as in other coding problems, it is a very important issue to theoretically predict the decoding error probability of DAC. This l...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 25; no. 12; pp. 3814 - 3818
Main Authors: Fang, Yong, Yang, Nan, Chen, Jun
Format: Journal Article
Language:English
Published: New York IEEE 01.12.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Arithmetic
Arithmetic coding
Codes
coexisting interval
Decoding
Distributed arithmetic coding
Encoding
Error probability
frame error rate
Hamming distance
Slepian-Wolf coding
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Distributed Arithmetic Coding (DAC) is an interesting realization of Slepian-Wolf coding that performs nonlinear coset-like partition for equiprobable binary sources. Just as in other coding problems, it is a very important issue to theoretically predict the decoding error probability of DAC. This letter proposes a plausible solution to this difficult issue. Our analyses are based on the concept of coexisting interval introduced in our previous work. Specifically, we use it to deduce the probability that two given codewords coexist in the same coset. Experimental results confirm the correctness of our theoretical analyses.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2021.3114591