By Topic

On the capacity of asymptotically memoryless continuous-time channels (Corresp.)

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
$31 $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

1 Author(s)

Previously, a coding theorem and its converse for stationary asymptotically memoryless continuous-time channels were proved, giving the capacityCwith an almost sure constraint on the input cost. For calculation, it is more convenient to find a capacitybar{C}with the constraint on the expected input cost. Obviously,C leq bar{C}, but the coding theorem may not hold forbar{C}. For a class of input costs typified by the time-average power, we prove the coding theorem forbar{C}by directly showingC = bar{C}.

Published in:

Information Theory, IEEE Transactions on  (Volume:19 ,  Issue: 4 )