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...

תיאור מלא

מידע ביבליוגרפי

Principais autores:	Yanan Dou, Yanqing Liu, Xueyan Niu, Bo Bai, Wei Han, Yanlin Geng
פורמט:	Artigo
שפה:	Inglês
יצא לאור:	MDPI AG 2024-02-01
סדרה:	Entropy
נושאים:	Blahut–Arimoto algorithm broadcast channel capacity region superposition coding inner bound Marton’s inner bound UV outer bound
גישה מקוונת:	https://www.mdpi.com/1099-4300/26/3/178
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!