Computation of Channel Capacity Based on Self-Concordant Functions | Zendy

Tian Da-gang | Zendy; Yiqun Huang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Computation of Channel Capacity Based on Self-Concordant Functions

Author(s) -

Tian Da-gang,

Yiqun Huang

Publication year - 2012

Publication title -

journal of electrical and computer engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.318

H-Index - 25

eISSN - 2090-0155

pISSN - 2090-0147

DOI - 10.1155/2012/318946

Subject(s) - computation , channel (broadcasting) , channel capacity , entropy (arrow of time) , algorithm , computer science , information theory , mathematical optimization , theoretical computer science , mathematics , telecommunications , statistics , physics , quantum mechanics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research