Distributed joint source-channel arithmetic coding

Cheng

et al. 2016

IEEE Trans. Commun.

Distributed Arithmetic Coding (DAC) is a variant of Arithmetic Coding (AC) that can realize Slepian-Wolf Coding (SWC) in a nonlinear way. In the previous work, we defined Codebook Cardinality Spectrum (CCS) and Hamming Distance Spectrum (HDS) for DAC. In this paper, we make use of CCS and HDS to analyze tailed DAC, a form of DAC mapping the last few symbols of each source block onto non-overlapped intervals as traditional AC. We first derive the exact HDS formula for tailless DAC, a form of DAC mapping all symbols of each source block onto overlapped intervals, and show that the HDS formula previously given is actually an approximate version. Then the HDS formula is extended to tailed DAC. We also deduce the average codebook cardinality, which is closely related to decoding complexity, and rate loss of tailed DAC with the help of CCS. The effects of tail length are extensively analyzed. It is revealed that by increasing tail length to a value not close to the bitstream length, closely-spaced codewords within the same codebook can be removed at the cost of a higher decoding complexity and a larger rate loss. Finally, theoretical analyses are verified by experiments.

“…showing that the approximate value of ψ n,R (n) given by (32) is roughly half of its exact value given by (15), which explains experimental results accurately (cf. Subsect.…”

Section: Case Of Small (N − |W N |)supporting

confidence: 54%

“…II, its computational complexity is too large for practical use. Therefore, it is necessary to simplify (15). Before doing so, let us give the following conjecture.…”

Section: Ceiling Errors Of Geometric Seriesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Analysis on Tailed Distributed Arithmetic Codes for Uniform Binary Sources

Cheng

et al. 2016

IEEE Trans. Commun.

“…DAC can be extended to realize Distributed Joint Source-Channel Coding (DJSCC), as shown in [17], where the Distributed Joint Source-Channel Arithmetic Coding (DJSCAC) was proposed, which is an extension of IEAC by allowing the coexistence of overlapped intervals and forbidden intervals. The overlapped intervals can remove the symbol-domain redundancy between the source and side information, while the forbidden intervals can counter the bitdomain noises of transmission channel.…”

Section: A Improvements and Extensions Of Dacmentioning

confidence: 99%

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

IEEE Trans. Inform. Theory

2020

It was demonstrated that, as a nonlinear implementation of Slepian-Wolf Coding (SWC), 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 (HDS), to analyze DAC for Stationary Memoryless Binary Sources (SMBS) with uniform distribution. This paper extends our work on CCS from uniform SMBS to biased SMBS. We begin with the final CCS and then deduce each level of CCS backwards by recursion. The main finding of this paper is that the final CCS of biased SMBS is not uniformly distributed over [0, 1). This paper derives the final CCS of biased SMBS and proposes a numerical algorithm for calculating CCS effectively in practice. All theoretical analyses are well verified by experimental results.

“…In fact, DAC codes are dual codes of JSCAC codes, so they can be realized by either interval overlapping [15], [16], [17] or bitstream puncturing [18], [19], [20]. Naturally, DAC codes can be combined with JSCAC codes to obtain the so-called distributed JSCAC (DJSCAC) codes, which allow the coexistence of overlapped and forbidden intervals to realize data compression and error correction simultaneously [21].…”

Section: Introductionmentioning

confidence: 99%

Hamming Distance Spectrum of DAC Codes for Equiprobable Binary Sources

Cheng

et al. 2016

IEEE Trans. Commun.

This version is available at https://strathprints.strath.ac.uk/55413/ Strathprints is designed to allow users to access the research output of the University of Strathclyde. Unless otherwise explicitly stated on the manuscript, Copyright © and Moral Rights for the papers on this site are retained by the individual authors and/or other copyright owners. Please check the manuscript for details of any other licences that may have been applied. You may not engage in further distribution of the material for any profitmaking activities or any commercial gain. You may freely distribute both the url (https://strathprints.strath.ac.uk/) and the content of this paper for research or private study, educational, or not-for-profit purposes without prior permission or charge.Any correspondence concerning this service should be sent to the Strathprints administrator: strathprints@strath.ac.ukThe Strathprints institutional repository (https://strathprints.strath.ac.uk) is a digital archive of University of Strathclyde research outputs. It has been developed to disseminate open access research outputs, expose data about those outputs, and enable the management and persistent access to Strathclyde's intellectual output. Abstract-Distributed Arithmetic Coding (DAC) is an effective technique for implementing Slepian-Wolf coding (SWC). It has been shown that a DAC code partitions source space into unequalsize codebooks, so that the overall performance of DAC codes depends on the cardinality and structure of these codebooks. The problem of DAC codebook cardinality has been solved by the so-called Codebook Cardinality Spectrum (CCS). This paper extends the previous work on CCS by studying the problem of DAC codebook structure. We define Hamming Distance Spectrum (HDS) to describe DAC codebook structure and propose a mathematical method to calculate the HDS of DAC codes. The theoretical analyses are verified by experimental results.