Shannon's Capacity as a Convex Optimization Problem | Convex Optimization Application # 11

Ahmad Bazzi
Ahmad Bazzi
85.9 هزار بار بازدید - 2 سال پیش - 📚📚About📚📚The Capacity is an achievable
📚📚About📚📚
The Capacity is an achievable upper-bound of date rates on communication channels.
In this one, we formulate the famous capacity as a convex optimization and discuss the primal/dual formulations. We also solve these problems using the famous CVX toolbox on MATLAB. Formulations are highly inspired by [1]. The outline is as follows:

⏲⏲Outline⏲⏲
00:00 Introduction
02:42 The binary symmetric channel (BSC)
05:11 Mutual Information
08:23 Capacity as a convex optimization problem
15:35 Installing CVX
16:30 Primal Capacity Problem
19:38 Interpretation of the Primal solution in BSC (1-H(p))
24:40 Dual problem
38:18 Dual Capacity on MATLAB
42:35 ideal instances of the problem
44:11 Outro

🎗🎗Support 🎗🎗
🔴 Subscribe for more videos on Wireless communications, Information Theory or Convex Optimization
👍 Smash that like button, in case you find this tutorial useful.
👁‍🗨 Speak up and comment, I am all ears.

📚📚Related Lectures 📚📚
📝Entropy in Information Theory Entropy in Information Theory - Dr. A...
📝Learn CVX on MATLAB Lecture 12: Learn CVX on MATLAB | Exp...

📚📚References📚📚
[1] Stephen P. Boyd, and Lieven Vandenberghe. Convex optimization. Cambridge university press, 2004.

📹📹 Video 📹📹  
NB: Lecture available in 4K


#Shannon#Capacity#Convex
2 سال پیش در تاریخ 1401/01/27 منتشر شده است.
85,907 بـار بازدید شده
... بیشتر