On the Search Algorithm for the Output Distribution That Achieves the Channel Capacity

DOI10.1109/TIT.2016.2636847zbMATH Open1364.94246arXiv1601.01394OpenAlexW2395726788MaRDI QIDQ2989641FDOQ2989641

Kenji Nakagawa, Kohei Watabe, Takuto Sabu

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We consider a search algorithm for the output distribution that achieves the channel capacity of a discrete memoryless channel. We will propose an algorithm by iterated projections of an output distribution onto affine subspaces in the set of output distributions. The problem of channel capacity has a similar geometric structure as that of smallest enclosing circle for a finite number of points in the Euclidean space. The metric in the Euclidean space is the Euclidean distance and the metric in the space of output distributions is the Kullback-Leibler divergence. We consider these two problems based on Amari's $alpha$-geometry. Then, we first consider the smallest enclosing circle in the Euclidean space and develop an algorithm to find the center of the smallest enclosing circle. Based on the investigation, we will apply the obtained algorithm to the problem of channel capacity.

Full work available at URL: https://arxiv.org/abs/1601.01394

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Cited In (2)

• Geometry of Arimoto algorithm
• Reverse EM-problem based on Bregman divergence and its application to classical and quantum information theory

This page was built for publication: On the Search Algorithm for the Output Distribution That Achieves the Channel Capacity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989641)