Efficient Approximation of Channel Capacities

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

SUTTER, Tobias, David SUTTER, Peyman Mohajerin ESFAHANI, John LYGEROS, 2015. Efficient Approximation of Channel Capacities. In: IEEE Transactions on Information Theory. IEEE. 61(4), pp. 1649-1666. ISSN 0018-9448. eISSN 1557-9654. Available under: doi: 10.1109/TIT.2015.2401002

@article{Sutter2015Effic-55748, title={Efficient Approximation of Channel Capacities}, year={2015}, doi={10.1109/TIT.2015.2401002}, number={4}, volume={61}, issn={0018-9448}, journal={IEEE Transactions on Information Theory}, pages={1649--1666}, author={Sutter, Tobias and Sutter, David and Esfahani, Peyman Mohajerin and Lygeros, John} }

Sutter, David eng Efficient Approximation of Channel Capacities Esfahani, Peyman Mohajerin Lygeros, John Lygeros, John terms-of-use Sutter, David Sutter, Tobias Esfahani, Peyman Mohajerin 2021-12-02T13:49:47Z 2021-12-02T13:49:47Z 2015 Sutter, Tobias We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and lower bounds for the capacity. The presented method requires O(M <sub>2</sub> N√log N/ε) to provide an estimate of the capacity to within ε, where N and M denote the input and output alphabet size; a single iteration has a complexity O(MN). We also show how to approximately compute the capacity of memoryless channels having a bounded continuous input alphabet and a countable output alphabet under some mild assumptions on the decay rate of the channel's tail. It is shown that discrete-time Poisson channels fall into this problem class. As an example, we compute sharp upper and lower bounds for the capacity of a discrete-time Poisson channel with a peak-power input constraint.

This item appears in the following Collection(s)

Search KOPS


My Account