Design of Slepian-Wolf codes by channel code partitioning

V. Stankovic, A.D Liveris, Z.X. Xiong, C.N. Georghiades

Research output: Contribution to conferencePaper

51 Citations (Scopus)

Abstract

A Slepian-Wolf coding scheme that can achieve arbitrary rate allocation among two encoders was outlined in the work of Pradhan and Ramchandran. Inspired by this work, we start with a detailed solution for general (asymmetric or symmetric) Slepian-Wolf coding based on partitioning a single systematic channel code, and continue with practical code designs using advanced channel codes. By using systematic IRA and turbo codes, we devise a powerful scheme that is capable of approaching any point on the Slepian-Wolf bound. We further study an extension of the technique to multiple sources, and show that for a particular correlation model among the sources, a single practical channel code can be designed for coding all the sources in symmetric and asymmetric scenarios. If the code approaches the capacity of the channel that models the correlation between the sources, then the system will approach the Slepian-Wolf limit. Using systematic IRA and punctured turbo codes for coding two binary sources, each being independent identically distributed, with correlation modeled by a binary symmetric channel, we obtain results which are 0.04 bits away from the theoretical limit in both symmetric and asymmetric Slepian-Wolf settings.
LanguageEnglish
Pages302-311
Number of pages10
DOIs
Publication statusPublished - Mar 2004
EventData Compression Conference (DCC 2004) - Snowbird, United States
Duration: 23 Mar 200425 Mar 2004

Conference

ConferenceData Compression Conference (DCC 2004)
CountryUnited States
CitySnowbird
Period23/03/0425/03/04

Fingerprint

Turbo codes

Keywords

  • design
  • Slepian-Wolf codes
  • channel code
  • partitioning

Cite this

Stankovic, V., Liveris, A. D., Xiong, Z. X., & Georghiades, C. N. (2004). Design of Slepian-Wolf codes by channel code partitioning. 302-311. Paper presented at Data Compression Conference (DCC 2004) , Snowbird, United States. https://doi.org/10.1109/DCC.2004.1281475
Stankovic, V. ; Liveris, A.D ; Xiong, Z.X. ; Georghiades, C.N. / Design of Slepian-Wolf codes by channel code partitioning. Paper presented at Data Compression Conference (DCC 2004) , Snowbird, United States.10 p.
@conference{c1f8ee4960384ee88e538f1373a4b8a2,
title = "Design of Slepian-Wolf codes by channel code partitioning",
abstract = "A Slepian-Wolf coding scheme that can achieve arbitrary rate allocation among two encoders was outlined in the work of Pradhan and Ramchandran. Inspired by this work, we start with a detailed solution for general (asymmetric or symmetric) Slepian-Wolf coding based on partitioning a single systematic channel code, and continue with practical code designs using advanced channel codes. By using systematic IRA and turbo codes, we devise a powerful scheme that is capable of approaching any point on the Slepian-Wolf bound. We further study an extension of the technique to multiple sources, and show that for a particular correlation model among the sources, a single practical channel code can be designed for coding all the sources in symmetric and asymmetric scenarios. If the code approaches the capacity of the channel that models the correlation between the sources, then the system will approach the Slepian-Wolf limit. Using systematic IRA and punctured turbo codes for coding two binary sources, each being independent identically distributed, with correlation modeled by a binary symmetric channel, we obtain results which are 0.04 bits away from the theoretical limit in both symmetric and asymmetric Slepian-Wolf settings.",
keywords = "design, Slepian-Wolf codes, channel code, partitioning",
author = "V. Stankovic and A.D Liveris and Z.X. Xiong and C.N. Georghiades",
year = "2004",
month = "3",
doi = "10.1109/DCC.2004.1281475",
language = "English",
pages = "302--311",
note = "Data Compression Conference (DCC 2004) ; Conference date: 23-03-2004 Through 25-03-2004",

}

Stankovic, V, Liveris, AD, Xiong, ZX & Georghiades, CN 2004, 'Design of Slepian-Wolf codes by channel code partitioning' Paper presented at Data Compression Conference (DCC 2004) , Snowbird, United States, 23/03/04 - 25/03/04, pp. 302-311. https://doi.org/10.1109/DCC.2004.1281475

Design of Slepian-Wolf codes by channel code partitioning. / Stankovic, V.; Liveris, A.D; Xiong, Z.X.; Georghiades, C.N.

2004. 302-311 Paper presented at Data Compression Conference (DCC 2004) , Snowbird, United States.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Design of Slepian-Wolf codes by channel code partitioning

AU - Stankovic, V.

AU - Liveris, A.D

AU - Xiong, Z.X.

AU - Georghiades, C.N.

PY - 2004/3

Y1 - 2004/3

N2 - A Slepian-Wolf coding scheme that can achieve arbitrary rate allocation among two encoders was outlined in the work of Pradhan and Ramchandran. Inspired by this work, we start with a detailed solution for general (asymmetric or symmetric) Slepian-Wolf coding based on partitioning a single systematic channel code, and continue with practical code designs using advanced channel codes. By using systematic IRA and turbo codes, we devise a powerful scheme that is capable of approaching any point on the Slepian-Wolf bound. We further study an extension of the technique to multiple sources, and show that for a particular correlation model among the sources, a single practical channel code can be designed for coding all the sources in symmetric and asymmetric scenarios. If the code approaches the capacity of the channel that models the correlation between the sources, then the system will approach the Slepian-Wolf limit. Using systematic IRA and punctured turbo codes for coding two binary sources, each being independent identically distributed, with correlation modeled by a binary symmetric channel, we obtain results which are 0.04 bits away from the theoretical limit in both symmetric and asymmetric Slepian-Wolf settings.

AB - A Slepian-Wolf coding scheme that can achieve arbitrary rate allocation among two encoders was outlined in the work of Pradhan and Ramchandran. Inspired by this work, we start with a detailed solution for general (asymmetric or symmetric) Slepian-Wolf coding based on partitioning a single systematic channel code, and continue with practical code designs using advanced channel codes. By using systematic IRA and turbo codes, we devise a powerful scheme that is capable of approaching any point on the Slepian-Wolf bound. We further study an extension of the technique to multiple sources, and show that for a particular correlation model among the sources, a single practical channel code can be designed for coding all the sources in symmetric and asymmetric scenarios. If the code approaches the capacity of the channel that models the correlation between the sources, then the system will approach the Slepian-Wolf limit. Using systematic IRA and punctured turbo codes for coding two binary sources, each being independent identically distributed, with correlation modeled by a binary symmetric channel, we obtain results which are 0.04 bits away from the theoretical limit in both symmetric and asymmetric Slepian-Wolf settings.

KW - design

KW - Slepian-Wolf codes

KW - channel code

KW - partitioning

U2 - 10.1109/DCC.2004.1281475

DO - 10.1109/DCC.2004.1281475

M3 - Paper

SP - 302

EP - 311

ER -

Stankovic V, Liveris AD, Xiong ZX, Georghiades CN. Design of Slepian-Wolf codes by channel code partitioning. 2004. Paper presented at Data Compression Conference (DCC 2004) , Snowbird, United States. https://doi.org/10.1109/DCC.2004.1281475