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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE sensors journal Ročník 13; číslo 7; s. 2750 - 2756
Hlavní autoři: Zhou, Junwei, Wong, Kwok-Wo, Chen, Jianyong
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.07.2013
Témata:
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
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í: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