By Topic

The Queued-Code in Finite-State Markov Fading Channels with Large Delay Bounds

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)
Satashu Goel ; ECE department, Carnegie Mellon University. ; Rohit Negi

A 'queued-code' is a novel channel code, whose input rate is instantaneously adapted to the channel state information, assumed to be known to the transmitter. Previously, a queued-code was demonstrated for i.i.d. block fading channels, demonstrating significant gains, in terms of error exponent, over a fixed rate code. This paper demonstrates the performance gain of the queued-code in the more realistic case of a finite-state Markov fading channel. Similar to the block-fading result, the analysis required combines the concept of random coding bounds from information theory, and the concept of effective capacity, arising from large deviation theory analysis of queues. However, a result on the limiting moment generating function of Markov chains is the additional tool required for the analysis

Published in:

2006 IEEE International Symposium on Information Theory

Date of Conference:

9-14 July 2006