A new formulation for the channel capacity problem is derived by using the duality theory of convex programming. The simple nature of this dual representation is suitable for computational purposes. The results are derived in a unified way by formulating the channel capacity problem as a special case of a general class of concave programming problems involving a generalized information measure recently introduced by Burbea and Rao 10.
展开▼