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

Descrizione completa

Dettagli Bibliografici

Autori principali:	Yanan Dou, Yanqing Liu, Xueyan Niu, Bo Bai, Wei Han, Yanlin Geng
Natura:	Artigo
Lingua:	Inglês
Pubblicazione:	MDPI AG 2024-02-01
Serie:	Entropy
Soggetti:	Blahut–Arimoto algorithm broadcast channel capacity region superposition coding inner bound Marton’s inner bound UV outer bound
Accesso online:	https://www.mdpi.com/1099-4300/26/3/178
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!