Analysis on tailed distributed arithmetic codes for uniform binary sources

Yong Fang, Vladimir Stankovic, Samuel Cheng, En-hui Yang

Research output: Contribution to journalArticle

3 Citations (Scopus)
98 Downloads (Pure)

Abstract

Distributed Arithmetic Coding (DAC) is a variant of Arithmetic Coding (AC) that can realise 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.
Original languageEnglish
Pages (from-to)4305-4319
Number of pages15
JournalIEEE Transactions on Communications
Volume64
Issue number10
Early online date12 Aug 2016
DOIs
Publication statusPublished - 31 Oct 2016

Keywords

  • distributed source coding
  • Slepian-Wolf coding
  • distributed arithmetic coding
  • hamming distance spectrum
  • codebook cardinality spectrum
  • tail length
  • codebooks

Fingerprint Dive into the research topics of 'Analysis on tailed distributed arithmetic codes for uniform binary sources'. Together they form a unique fingerprint.

Cite this