On multiterminal source code design

Y. Yang, V. Stankovic, Z. Xiong, W. Zhao

Research output: Contribution to journalArticle

40 Citations (Scopus)
7 Downloads (Pure)

Abstract

Abstract-Multiterminal (MT) source coding refers to separate lossy encoding and joint decoding of multiple correlated sources. Recently, the rate region of both direct and indirect MT source coding in the quadratic Gaussian setup with two encoders was determined. We are thus motivated to design practical MT source codes that can potentially achieve the entire rate region. In this paper, we present two practical MT coding schemes under the framework of Slepian-Wolf coded quantization (SWCQ) for both direct and indirect MT problems. The first, asymmetric SWCQ scheme relies on quantization andWyner-Ziv coding, and it is implemented via source splitting to achieve any point on the sum-rate bound. In the second, conceptually simpler scheme, symmetric SWCQ, the two quantized sources are compressed using symmetric Slepian-Wolf coding via a channel code partitioning technique that is capable of achieving any point on the Slepian-Wolf sum-rate bound. Our practical designs employ trellis-coded quantization and turbo/low-density parity-check (LDPC) codes for both asymmetric and symmetric Slepian-Wolf coding. Simulation results show a gap of only 0.139-0.194 bit per sample away from the sum-rate bound for both direct and indirect MT coding problems.
Original languageEnglish
Pages (from-to)2278-2302
Number of pages25
JournalIEEE Transactions on Information Theory
Volume54
Issue number5
DOIs
Publication statusPublished - May 2008

Fingerprint

coding
Decoding
simulation

Keywords

  • ceo problem
  • multiterminal source coding
  • slepian–wolf coded quantization
  • slepian–wolf coding
  • trellis-coded quantization
  • wyner–ziv coding

Cite this

Yang, Y. ; Stankovic, V. ; Xiong, Z. ; Zhao, W. / On multiterminal source code design. In: IEEE Transactions on Information Theory. 2008 ; Vol. 54, No. 5. pp. 2278-2302.
@article{eb0628bb08d64655bffac028887877d1,
title = "On multiterminal source code design",
abstract = "Abstract-Multiterminal (MT) source coding refers to separate lossy encoding and joint decoding of multiple correlated sources. Recently, the rate region of both direct and indirect MT source coding in the quadratic Gaussian setup with two encoders was determined. We are thus motivated to design practical MT source codes that can potentially achieve the entire rate region. In this paper, we present two practical MT coding schemes under the framework of Slepian-Wolf coded quantization (SWCQ) for both direct and indirect MT problems. The first, asymmetric SWCQ scheme relies on quantization andWyner-Ziv coding, and it is implemented via source splitting to achieve any point on the sum-rate bound. In the second, conceptually simpler scheme, symmetric SWCQ, the two quantized sources are compressed using symmetric Slepian-Wolf coding via a channel code partitioning technique that is capable of achieving any point on the Slepian-Wolf sum-rate bound. Our practical designs employ trellis-coded quantization and turbo/low-density parity-check (LDPC) codes for both asymmetric and symmetric Slepian-Wolf coding. Simulation results show a gap of only 0.139-0.194 bit per sample away from the sum-rate bound for both direct and indirect MT coding problems.",
keywords = "ceo problem, multiterminal source coding, slepian–wolf coded quantization, slepian–wolf coding, trellis-coded quantization, wyner–ziv coding",
author = "Y. Yang and V. Stankovic and Z. Xiong and W. Zhao",
year = "2008",
month = "5",
doi = "10.1109/TIT.2008.920204",
language = "English",
volume = "54",
pages = "2278--2302",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
number = "5",

}

On multiterminal source code design. / Yang, Y.; Stankovic, V.; Xiong, Z.; Zhao, W.

In: IEEE Transactions on Information Theory, Vol. 54, No. 5, 05.2008, p. 2278-2302.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On multiterminal source code design

AU - Yang, Y.

AU - Stankovic, V.

AU - Xiong, Z.

AU - Zhao, W.

PY - 2008/5

Y1 - 2008/5

N2 - Abstract-Multiterminal (MT) source coding refers to separate lossy encoding and joint decoding of multiple correlated sources. Recently, the rate region of both direct and indirect MT source coding in the quadratic Gaussian setup with two encoders was determined. We are thus motivated to design practical MT source codes that can potentially achieve the entire rate region. In this paper, we present two practical MT coding schemes under the framework of Slepian-Wolf coded quantization (SWCQ) for both direct and indirect MT problems. The first, asymmetric SWCQ scheme relies on quantization andWyner-Ziv coding, and it is implemented via source splitting to achieve any point on the sum-rate bound. In the second, conceptually simpler scheme, symmetric SWCQ, the two quantized sources are compressed using symmetric Slepian-Wolf coding via a channel code partitioning technique that is capable of achieving any point on the Slepian-Wolf sum-rate bound. Our practical designs employ trellis-coded quantization and turbo/low-density parity-check (LDPC) codes for both asymmetric and symmetric Slepian-Wolf coding. Simulation results show a gap of only 0.139-0.194 bit per sample away from the sum-rate bound for both direct and indirect MT coding problems.

AB - Abstract-Multiterminal (MT) source coding refers to separate lossy encoding and joint decoding of multiple correlated sources. Recently, the rate region of both direct and indirect MT source coding in the quadratic Gaussian setup with two encoders was determined. We are thus motivated to design practical MT source codes that can potentially achieve the entire rate region. In this paper, we present two practical MT coding schemes under the framework of Slepian-Wolf coded quantization (SWCQ) for both direct and indirect MT problems. The first, asymmetric SWCQ scheme relies on quantization andWyner-Ziv coding, and it is implemented via source splitting to achieve any point on the sum-rate bound. In the second, conceptually simpler scheme, symmetric SWCQ, the two quantized sources are compressed using symmetric Slepian-Wolf coding via a channel code partitioning technique that is capable of achieving any point on the Slepian-Wolf sum-rate bound. Our practical designs employ trellis-coded quantization and turbo/low-density parity-check (LDPC) codes for both asymmetric and symmetric Slepian-Wolf coding. Simulation results show a gap of only 0.139-0.194 bit per sample away from the sum-rate bound for both direct and indirect MT coding problems.

KW - ceo problem

KW - multiterminal source coding

KW - slepian–wolf coded quantization

KW - slepian–wolf coding

KW - trellis-coded quantization

KW - wyner–ziv coding

U2 - 10.1109/TIT.2008.920204

DO - 10.1109/TIT.2008.920204

M3 - Article

VL - 54

SP - 2278

EP - 2302

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 5

ER -