Back to Search Start Over

Codebook Cardinality Spectrum of Distributed Arithmetic Coding for Independent and Identically-Distributed Binary Sources.

Authors :
Fang, Yong
Stankovic, Vladimir
Source :
IEEE Transactions on Information Theory. Oct2020, Vol. 66 Issue 10, p6580-6596. 17p.
Publication Year :
2020

Abstract

It was demonstrated that, as a nonlinear implementation of Slepian-Wolf Coding, Distributed Arithmetic Coding (DAC) outperforms traditional Low-Density Parity-Check (LPDC) codes for short code length and biased sources. This fact triggers research efforts into theoretical analysis of DAC. In our previous work, we proposed two analytical tools, Codebook Cardinality Spectrum (CCS) and Hamming Distance Spectrum, to analyze DAC for independent and identically-distributed (i.i.d.) binary sources with uniform distribution. This article extends our work on CCS from uniform i.i.d. binary sources to biased i.i.d. binary sources. We begin with the final CCS and then deduce each level of CCS backwards by recursion. The main finding of this article is that the final CCS of biased i.i.d. binary sources is not uniformly distributed over [0, 1). This article derives the final CCS of biased i.i.d. binary sources and proposes a numerical algorithm for calculating CCS effectively in practice. All theoretical analyses are well verified by experimental results. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
00189448
Volume :
66
Issue :
10
Database :
Academic Search Index
Journal :
IEEE Transactions on Information Theory
Publication Type :
Academic Journal
Accession number :
146079935
Full Text :
https://doi.org/10.1109/TIT.2020.3014965