Yanan Dou

Mrs. Yanan Dou


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 February 2024 in Entropy
Verified
Journal Article
Open access
PDF file
YDYanan Dou
Yanan Dou
YLYanqing Liu
Yanqing Liu
Xueyan NiuXueyan Niu
Xueyan Niu
BBBai Bai
Bai Bai
WHWei Han
Wei Han
Yanlin GengYanlin Geng
Yanlin Geng
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 capacity region are again cast as maximization problems. In this work, we consider general broadcast channels and extend this algorithm to compute inner and outer bounds on the capacity regions. Our main contributions are as follows: first, we show that the optimization problems are max–min problems and that the exchange of minimum and maximum holds; second, we design Blahut–Arimoto algorithms for the maximization part and gradient descent algorithms for the minimization part; third, we provide convergence analysis for both parts. Numerical experiments validate the effectiveness of our algorithms.