Improved Binary DAC Codec with Spectrum for Equiprobable Sources

Slepian-Wolf coding (SWC) can be effectively implemented by distributed arithmetic coding (DAC) codes. A theoretical tool named spectrum has been developed to analyze the complexity of the full-search binary DAC (BDAC) decoder for equiprobable sources. Following this work, this paper aims at improvi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on communications Ročník 62; číslo 1; s. 256 - 268
Hlavní autoři: Fang, Yong, Chen, Liang
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.01.2014
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Applied sciences
Arithmetic coding
Codes
Coding
Coding, codes
Complexity theory
Decoding
distributed arithmetic coding
Encoding
Error analysis
Error detection
Error probability
Exact sciences and technology
Hamming distance
Indexes
Infinity
Information, signal and communications theory
permutation
Permutations
Probability
Random variables
Signal and communications theory
Slepian-Wolf coding
spectrum
Telecommunications and information theory
weighted branching
Performance evaluation
distributed arithmetic coding
Hamming distance
Error probability
Pruning algorithm
weighted branching
Slepian-Wolf coding
Decoding
Implementation
Codec
Codebook
Coding
spectrum
Arithmetic code
permutation
ISSN:0090-6778, 1558-0857
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Slepian-Wolf coding (SWC) can be effectively implemented by distributed arithmetic coding (DAC) codes. A theoretical tool named spectrum has been developed to analyze the complexity of the full-search binary DAC (BDAC) decoder for equiprobable sources. Following this work, this paper aims at improving the coding efficiency of BDAC codes. To achieve this goal, this paper analyzes how BDAC codes partition source space into codebooks and links codebook cardinalities with the initial spectrum. Further, by exploiting the final spectrum, this paper proves that the decoding error probability of BDAC codes will not tend to zero as code length goes to infinity, even at rates greater than the Slepian-Wolf limit. On the basis of theoretical analyses, two techniques are proposed to reduce the decoding error probability of BDAC codes, i.e., the permutation technique, which removes "near" (in the sense of Hamming distance) codewords in each codebook, and the weighted branching technique, which reduces the mis-pruning risk of proper paths during the decoding. The effectiveness of both techniques is well verified by experimental results.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2013.112613.120796