About this Journal Submit a Manuscript Table of Contents
Journal of Electrical and Computer Engineering
Volume 2012 (2012), Article ID 318946, 9 pages
Research Article

Computation of Channel Capacity Based on Self-Concordant Functions

1Search Center for Complex System Science, University of Shanghai for Science and Technology, Shanghai 200093, China
2Shanghai Stock Communication Co., Ltd., Shanghai 200131, China

Received 14 July 2011; Revised 1 November 2011; Accepted 15 November 2011

Academic Editor: Tamal Bose

Copyright © 2012 Da-gang Tian and Yi-qun Huang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.