Consider K independent AWGN channels in parallel with a common power constraint P i.e.
- Yi=Xi+Zi, i=1,…,K where Xi⊥⊥Zj, ∀i,j
- Zi∼N(0,σi2), i=1,…,K
- Z1⊥⊥⋯⊥⊥ZK and i=1∑kE[Xi2]≤P Note that the network of K parallel channels is equivalent to a vector channel with input XK=(X1,…,XK) and output YK=(Y1,…,YK) where overall capacity is C(P)=FXK:i=1∑KE[Xi2]≤PsupI(XK;YK)≤i=1∑K21log(2πe\mboxVar(Yi))−i=1∑K21log(2πeσi2)but Yi=Xi+Zi and Xi⊥⊥Zi so \mboxVar(Yi)=\mboxVar(Xi)+\mboxVar(Yi)≤E[Xi2]+σi2=Pi+σi2so we get that I(XK;YK)≤i=1∑K[21log(1+σi2Pi)]with equality iff Xi⊥⊥Xj, ∀i,j and Xi∼N(0,Pi), ∀i. Hence C(P)=i=1∑K21log(1+σi2Pi)(∗)where Pi=E[Xi2] and i=1∑KPi≤P.
Theorem (Capacity of Uncorrelated Parallel Gaussian Channels)
The capacity of K uncorrelated parallel (and independent) AWGN channels in parallel with input XK=(X1,…,XK) and output YK=(Y1,…,YK) where Z1⊥⊥⋯⊥⊥Zk and Zj⊥⊥Xl, ∀j,l. With overall capacity C(P)=i=1∑K21log(1+σi2Pi)where Pi=E[Xi2] and i=1∑KPi≤P.
Now let’s look to a similar case to Capacity of Parallel Gaussian Channels but now we deal with K correlated AWGN Channels, with a common power constraint P. i.e.
- Yi=Xi+Zi, i=1,…,K where Xi⊥⊥Zj, ∀i,j.
- ZK=(Z1,…,ZK)=ZT∼N(0,KZ) where KZ invertible. and i=1∑kE[Xi2]=tr(KX)≤P and similar to how we applied the methodology with Optimal Power Allotment we find that network capacity is given by C(P)=i=1∑K21log2(1+λibii)where bii=max{0,Θ−λi}, i=1,…,K with Θ chosen such that i=1∑Kbii=P and λ1,…,λKare eigenvalues of KZ.