By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Todd P. Coleman ; ECE Department, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 61801, USA ; Negar Kiyavash

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.

Published in:

Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on

Date of Conference:

19-21 March 2008