Distributed Block Arithmetic Coding for Equiprobable Sources

Distributed arithmetic coding (DAC) is similar to syndrome coding, in the sense that message sequences sharing the same interval can be considered a coset of the space of the source sequences, and the codeword is the index of the coset. In this paper, the minimum Hamming distance of cosets is studie...

Full description

Saved in:
Bibliographic Details
Published in:IEEE sensors journal Vol. 13; no. 7; pp. 2750 - 2756
Main Authors: Zhou, Junwei, Wong, Kwok-Wo, Chen, Jianyong
Format: Journal Article
Language:English
Published: IEEE 01.07.2013
Subjects:
Arithmetic
arithmetic coding
Costs
Decoding
Distributed source coding
Error analysis
Hamming distances
low-complexity coding
Measurement
Parity check codes
Simulation
Slepian-Wolf coding
Source coding
Wireless sensor networks
ISSN:1530-437X, 1558-1748
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Distributed arithmetic coding (DAC) is similar to syndrome coding, in the sense that message sequences sharing the same interval can be considered a coset of the space of the source sequences, and the codeword is the index of the coset. In this paper, the minimum Hamming distance of cosets is studied and it is proved that such a distance is as small as one. By only allowing the sequences with a large Hamming distance to overlap in the same interval, an improved DAC scheme is proposed. Simulation results show that, for equiprobable memoryless sources, this approach outperforms DAC in terms of decoding error rate at the same coding cost. In addition, at small sequence length, the decoding error rate of the proposed scheme is lower than that of distributed source coding based on low-density parity-check codes for highly correlated sources.
ISSN:1530-437X
1558-1748
DOI:10.1109/JSEN.2013.2257944