deposit_your_work

How Quickly Can We Approach Channel Capacity?

Files in this item

Files Size Format View
Bar2004Nov5HowQuickly.PDF 624.6Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: How Quickly Can We Approach Channel Capacity?
Author: Baron, Dror; Khojastepour, Mohammad; Baraniuk, Richard G.
Type: Conference paper
Citation: D. Baron, M. Khojastepour and R. G. Baraniuk, "How Quickly Can We Approach Channel Capacity?," vol. 1, pp. 1096-1100, 2004.
Abstract: Recent progress in code design has made it crucial to understand how quickly communication systems can approach their limits. To address this issue for the channel capacity C, we define the nonasymptotic capacity C/sub NA/(n, /spl epsi/) as the maximal rate of codebooks that achieve a probability /spl epsi/ of codeword error while using codewords of length n. We prove for the binary symmetric channel that C/sub NA/(n,/spl epsi/)=C-K(/spl epsi/)//spl radic/n+o(1//spl radic/n), where K(/spl epsi/) is available in closed form. We also describe similar results for the Gaussian channel. These results may lead to more efficient resource usage in practical communication systems.
Date Published: 2004-11-01

This item appears in the following Collection(s)

  • ECE Publications [1048 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students
  • DSP Publications [508 items]
    Publications by Rice Faculty and graduate students in digital signal processing.