Blahut–Arimoto Algorithms for Inner and Outer Bounds on Capacity Regions of Broadcast Channels

Blahut–Arimoto Algorithms for Inner and Outer Bounds on Capacity Regions of Broadcast Channels

The celebrated Blahut–Arimoto algorithm computes the capacity of a discrete memoryless point-to-point channel by alternately maximizing the objective function of a maximization problem. This algorithm has been applied to degraded broadcast channels, in which the supporting hyperplanes of the capacit...

Full description

Bibliographic Details
Main Authors: Yanan Dou, Yanqing Liu, Xueyan Niu, Bo Bai, Wei Han, Yanlin Geng
Format: Article
Language:English
Published: MDPI AG 2024-02-01
Series:Entropy
Subjects:
Blahut–Arimoto algorithm
broadcast channel
capacity region
superposition coding inner bound
Marton’s inner bound
UV outer bound
Online Access:https://www.mdpi.com/1099-4300/26/3/178

Similar Items

Similar Items