Sparse graph codes and practical decoding algorithms for communicating over packet timings in networks

Todd P. Coleman, Negar Kiyavash

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper examines more closely the probabilistic dynamics of queueing channels and discusses a new practical coding scheme which is tailored to such channels and approaches the capacity. We discuss a shaping technique to map algebraic symbols to non-uniform codewords using the inverse cumulative distribution of a target random variable. We also exploit the graphical structure of the conditional distribution of the departure process given the arrival process of a queue to develop capacity approaching codes with low-complexity decoding algorithms.

Original languageEnglish (US)
Title of host publicationCISS 2008, The 42nd Annual Conference on Information Sciences and Systems
Pages447-452
Number of pages6
DOIs
StatePublished - 2008
EventCISS 2008, 42nd Annual Conference on Information Sciences and Systems - Princeton, NJ, United States
Duration: Mar 19 2008Mar 21 2008

Publication series

NameCISS 2008, The 42nd Annual Conference on Information Sciences and Systems

Other

OtherCISS 2008, 42nd Annual Conference on Information Sciences and Systems
Country/TerritoryUnited States
CityPrinceton, NJ
Period3/19/083/21/08

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Sparse graph codes and practical decoding algorithms for communicating over packet timings in networks'. Together they form a unique fingerprint.

Cite this