Hamming distance spectrum of DAC codes for equiprobable binary sources

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

Research output: Contribution to journalArticle

2 Citations (Scopus)
61 Downloads (Pure)

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 unequal-size 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.
Original languageEnglish
Pages (from-to)1232-1245
Number of pages14
JournalIEEE Transactions on Communications
Volume64
Issue number3
Early online date18 Jan 2016
DOIs
Publication statusPublished - 1 Mar 2016

Fingerprint

Hamming distance

Keywords

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

Cite this

Fang, Yong ; Stankovic, Vladimir ; Cheng, Samuel ; Yang, En-hui. / Hamming distance spectrum of DAC codes for equiprobable binary sources. In: IEEE Transactions on Communications. 2016 ; Vol. 64, No. 3. pp. 1232-1245.
@article{e1afd3268a79470fb8d1a07ae3c58085,
title = "Hamming distance spectrum of DAC codes for equiprobable binary sources",
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 unequal-size 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.",
keywords = "distributed source coding, Slepian-Wolf coding, distributed arithmetic coding, hamming distance spectrum, codebook cardinality spectrum",
author = "Yong Fang and Vladimir Stankovic and Samuel Cheng and En-hui Yang",
note = "(c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.",
year = "2016",
month = "3",
day = "1",
doi = "10.1109/TCOMM.2016.2518680",
language = "English",
volume = "64",
pages = "1232--1245",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
number = "3",

}

Hamming distance spectrum of DAC codes for equiprobable binary sources. / Fang, Yong; Stankovic, Vladimir; Cheng, Samuel; Yang, En-hui.

In: IEEE Transactions on Communications, Vol. 64, No. 3, 01.03.2016, p. 1232-1245.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Hamming distance spectrum of DAC codes for equiprobable binary sources

AU - Fang, Yong

AU - Stankovic, Vladimir

AU - Cheng, Samuel

AU - Yang, En-hui

N1 - (c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.

PY - 2016/3/1

Y1 - 2016/3/1

N2 - 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 unequal-size 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.

AB - 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 unequal-size 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.

KW - distributed source coding

KW - Slepian-Wolf coding

KW - distributed arithmetic coding

KW - hamming distance spectrum

KW - codebook cardinality spectrum

UR - http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7384484

U2 - 10.1109/TCOMM.2016.2518680

DO - 10.1109/TCOMM.2016.2518680

M3 - Article

VL - 64

SP - 1232

EP - 1245

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 3

ER -