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...
Saved in:
| Main Authors: | , |
|---|---|
| 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!
|
| _version_ | 1832553955318562816 |
|---|---|
| author | Da-gang Tian Yi-qun Huang |
| author_facet | Da-gang Tian Yi-qun Huang |
| author_sort | Da-gang Tian |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-8609fc74332f484f8408a04dc340d73f |
| institution | Kabale University |
| issn | 2090-0147 2090-0155 |
| language | English |
| publishDate | 2012-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Electrical and Computer Engineering |
| spelling | doaj-art-8609fc74332f484f8408a04dc340d73f2025-02-03T05:52:50ZengWileyJournal of Electrical and Computer Engineering2090-01472090-01552012-01-01201210.1155/2012/318946318946Computation of Channel Capacity Based on Self-Concordant FunctionsDa-gang Tian0Yi-qun Huang1Search Center for Complex System Science, University of Shanghai for Science and Technology, Shanghai 200093, ChinaShanghai Stock Communication Co., Ltd., Shanghai 200131, ChinaThe 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.http://dx.doi.org/10.1155/2012/318946 |
| spellingShingle | Da-gang Tian Yi-qun Huang Computation of Channel Capacity Based on Self-Concordant Functions Journal of Electrical and Computer Engineering |
| title | Computation of Channel Capacity Based on Self-Concordant Functions |
| title_full | Computation of Channel Capacity Based on Self-Concordant Functions |
| title_fullStr | Computation of Channel Capacity Based on Self-Concordant Functions |
| title_full_unstemmed | Computation of Channel Capacity Based on Self-Concordant Functions |
| title_short | Computation of Channel Capacity Based on Self-Concordant Functions |
| title_sort | computation of channel capacity based on self concordant functions |
| url | http://dx.doi.org/10.1155/2012/318946 |
| work_keys_str_mv | AT dagangtian computationofchannelcapacitybasedonselfconcordantfunctions AT yiqunhuang computationofchannelcapacitybasedonselfconcordantfunctions |