Codebook cardinality spectrum of distributed arithmetic codes for stationary memoryless binary sources

Fang, Yong and Stankovic, Vladimir (2020) Codebook cardinality spectrum of distributed arithmetic codes for stationary memoryless binary sources. IEEE Transactions on Information Theory, 66 (10). pp. 6580-6596. ISSN 0018-9448 (https://doi.org/10.1109/TIT.2020.3014965)

[thumbnail of Fang-Stankovic-IEEE-TIT-2020-Codebook-cardinality-spectrum-of-distributed-arithmetic-codes]
Preview
 Text. Filename: Fang_Stankovic_IEEE_TIT_2020_Codebook_cardinality_spectrum_of_distributed_arithmetic_codes.pdf
Accepted Author Manuscript
Download (517kB)| Preview

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.

ORCID iDs

Fang, Yong and Stankovic, Vladimir ORCID logoORCID: https://orcid.org/0000-0002-1075-2420;
CORE (COnnecting REpositories)