Computation of Channel Capacity Based on Self-Concordant Functions

The computation of channel capacity is a classical issue in information theory. We prove that algorithms based on self-concordant functions can be used to deal with such issues, especially when constrains are included. A new algorithm to compute the channel capacity per unit cost is proposed. The sa...

Full description

Saved in:
Bibliographic Details
Main Authors: Da-gang Tian, Yi-qun Huang
Format: Article
Language:English
Published: Wiley 2012-01-01
Series:Journal of Electrical and Computer Engineering
Online Access:http://dx.doi.org/10.1155/2012/318946
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The computation of channel capacity is a classical issue in information theory. We prove that algorithms based on self-concordant functions can be used to deal with such issues, especially when constrains are included. A new algorithm to compute the channel capacity per unit cost is proposed. The same view is suited to the computation of maximum entropy. All the algorithms are of polynomial time.
ISSN:2090-0147
2090-0155