RIS辅助MIMO广播信道容量
RIS-Aided Multiple-Input Multiple-Output
Broadcast Channel Capacity论文阅读记录
基于泰勒展开求解了上行容量和最差用户的可达速率,学习其中的展开方法。
摘要
Scalable algorithms are conceived for obtaining the
sum-rate capacity of the reconfigurable intelligent surface (RIS)-
aided multiuser (MU) multiple-input multiple-output (MIMO)
broadcast channel (BC), where a multi-antenna base station (BS)
transmits signals to multi-antenna users with the help of an
RIS equipped with a massive number of finite-resolution pro-
grammable reflecting elements (PREs). As a byproduct, scalable
path-following algorithms emerge for determining the sum-rate
capacity of the conventional MIMO BCs, closing a long-standing
open problem of information theory. The paper also develops
scalable algorithms for maximizing the minimum rate (max-min
rate optimization) of the users achieved by the joint design of
RIS’s PRE and transmit beamforming for such an RIS-aided BC.
The simulations provided confirm the high performance achieved
by the algorithms developed, despite their low computational
complexity.
可扩展算法旨在获得可重构智能表面 (RIS) 辅助多用户 (MU) 多输入多输出 (MIMO) 广播信道 (BC) 的总速率容量,其中多天线基站 (BS) 进行传输借助配备大量有限分辨率可编程反射元件 (PRE) 的 RIS,向多天线用户发送信号。作为副产品,可扩展的路径跟踪算法出现了,用于确定传统 MIMO BC 的总速率容量,解决了信息论中长期存在的开放问题。该论文还开发了可扩展算法,通过 RIS PRE 的联合设计和针对 RIS 辅助 BC 的传输波束成形来最大化用户的最小速率(最大-最小速率优化)。所提供的模拟证实了所开发的算法所实现的高性能,尽管其计算复杂度较低。
RIS辅助的BC容量
K User
RIS N elements
Nr antenna UEs
Nt antenna BS
BS-RIS channel : LoS
RIS-UEs channel : NLoS 因为 RIS 通常位于高层建筑的显眼位置
从 BS 和 RIS 到 UE k 的准静态平坦衰落信道:
C
N
r
×
N
t
∋
H
k
(
θ
)
≜
H
~
R
,
k
R
R
,
k
1
/
2
diag
(
e
ȷ
θ
)
H
~
B
,
R
+
H
~
B
,
k
=
H
~
B
R
,
k
diag
(
e
ȷ
θ
)
H
B
,
R
+
H
~
B
,
k
\begin{aligned} \mathbb{C}^{N_{r} \times N_{t}} \ni \mathcal{H}_{k}(\boldsymbol{\theta}) & \triangleq \tilde{H}_{R, k} R_{R, k}^{1 / 2} \operatorname{diag}\left(e^{\jmath \boldsymbol{\theta}}\right) \tilde{H}_{B, R}+\tilde{H}_{B, k} \\ & =\tilde{H}_{B R, k} \operatorname{diag}\left(e^{\jmath \boldsymbol{\theta}}\right) H_{B, R}+\tilde{H}_{B, k} \end{aligned}
CNr×Nt∋Hk(θ)≜H~R,kRR,k1/2diag(eθ)H~B,R+H~B,k=H~BR,kdiag(eθ)HB,R+H~B,k
θ n ∈ B ≜ { ν 2 π 2 b , ν = 0 , 1 , … , 2 b − 1 } \boldsymbol{\theta}_{n} \in \mathcal{B} \triangleq\left\{\nu \frac{2 \pi}{2^{b}}, \nu=0,1, \ldots, 2^{b}-1\right\} θn∈B≜{ν2b2π,ν=0,1,…,2b−1}
for n ∈ N ≜ { 1 , … , N } , i.e. \text { for } n \in \mathcal{N} \triangleq\{1, \ldots, N\} \text {, i.e. } for n∈N≜{1,…,N}, i.e.
θ ∈ B N \boldsymbol{\theta} \in \mathcal{B}^{N} θ∈BN
injective,单射的
脏纸编码:
关于脏纸编码,理论基础是Costa 在1987 的一篇论文 Writing on Dirty paper。 Paper 中介绍了一种思路。在日常中,一张纸上假如已经写了很多内容或者已经有很多污点了,即脏纸,但是再在上面写上一些信息的话,这份信息在未知墨水颜色与位置下还是可读的。因此Costa 想把这种思路拓展且应用到通信领域中。为此他引用了一种新的信道模型,即:
需要传输的信息或数据为w,然后通过一定的编码机制即编码器,此编码器是已知一部分信道干扰s的(s符合一般正态分布),也就是说,编码器与这部分干扰通过一定机制对信息w编码,在编码机制后便会得到需要被传输的信息x,信息x将通过AWGN信道,其干扰为n且符合二项分布。最终在接收端得到信息y。通过一定的解码机制便能将w的判断值算出来。在一堆的数学分析与运算后,Costa便发现,在一定编码译码机制下,受到抑制干扰s与未知干扰n的信道容量可以达到只受到n一样的信道容量。当然,信道是受香农定理约束的。这就提供了一种可能,假如,把信息制作成s,且开发出相应的机制,就能将信息很完美且不损耗信道容量地隐藏,或者复用,亦或者移动通信的 MIMO技术。但,当下对于脏纸编码还是指处于相对的理论研究阶段。对于具体的实施方案也有了相应的论文,但是都不是特别具体的机制(也有可能只是笔者没找到),因此这项科技虽然被讨论很多,却没有还没有实质进展。理论的尝试倒是已经很多了。笔者因为毕业论文也尝试了一些方法尝试。利用CDMA方法进行拓频,利用拓频编码的特性进行累加且mod加法,但是,得到的结果不是特别理想,因此。项目就暂置了。因此当下只写个大概的内容,之后有进展便会继续拓展本博文。也希望假如有前辈从事类似方向的能够一起讨论。
————————————————
原文链接:https://blog.csdn.net/rogerwutao/article/details/25669613
矩阵形式的泰勒展开学习
log det ( I n d + H d K x H d H ) − log det ( K v ′ + H e K x H e H ) ≥ log det ( I n d + H d K x H d H ) − log det ( K v ′ ( 0 ) + H e K x ( 0 ) H e H ) − Tr ( H e H ( K v ′ ( 0 ) + H e K x ( 0 ) H e H ) − 1 H e K x ) + Tr ( H e H ( K v ′ ( 0 ) + H e K x ( 0 ) H e H ) − 1 H e K x ( 0 ) ) . \begin{array}{l} \log \operatorname{det}\left(\mathbf{I}_{n_{d}}+\mathbf{H}_{d} \mathbf{K}_{x} \mathbf{H}_{d}^{H}\right)-\log \operatorname{det}\left(\mathbf{K}_{v^{\prime}}+\mathbf{H}_{e} \mathbf{K}_{x} \mathbf{H}_{e}^{H}\right)\\ \ge \log \operatorname{det}\left(\mathbf{I}_{n_{d}}+\mathbf{H}_{d} \mathbf{K}_{x} \mathbf{H}_{d}^{H}\right)-\log \operatorname{det}\left(\mathbf{K}_{v^{\prime}}^{(0)}+\mathbf{H}_{e} \mathbf{K}_{x}^{(0)} \mathbf{H}_{e}^{H}\right) \\ -\operatorname{Tr}\left(\mathbf{H}_{e}^{H}\left(\mathbf{K}_{v^{\prime}}^{(0)}+\mathbf{H}_{e} \mathbf{K}_{x}^{(0)} \mathbf{H}_{e}^{H}\right)^{-1} \mathbf{H}_{e} \mathbf{K}_{x}\right) \\ +\operatorname{Tr}\left(\mathbf{H}_{e}^{H}\left(\mathbf{K}_{v^{\prime}}^{(0)}+\mathbf{H}_{e} \mathbf{K}_{x}^{(0)} \mathbf{H}_{e}^{H}\right)^{-1} \mathbf{H}_{e} \mathbf{K}_{x}^{(0)}\right) . \end{array} logdet(Ind+HdKxHdH)−logdet(Kv′+HeKxHeH)≥logdet(Ind+HdKxHdH)−logdet(Kv′(0)+HeKx(0)HeH)−Tr(HeH(Kv′(0)+HeKx(0)HeH)−1HeKx)+Tr(HeH(Kv′(0)+HeKx(0)HeH)−1HeKx(0)).
log det ( K v ′ + H e K x H e H ) ≤ log det ( K v ′ ( 0 ) + H e K x ( 0 ) H e H ) + Tr ( H e H ( K v ′ ( 0 ) + H e K x ( 0 ) H e H ) − 1 H e K x ) − Tr ( H e H ( K v ′ ( 0 ) + H e K x ( 0 ) H e H ) − 1 H e K x ( 0 ) ) \log \operatorname{det}\left(\mathbf{K}_{v^{\prime}}+\mathbf{H}_{e} \mathbf{K}_{x} \mathbf{H}_{e}^{H}\right) \le \log \operatorname{det}\left(\mathbf{K}_{v^{\prime}}^{(0)}+\mathbf{H}_{e} \mathbf{K}_{x}^{(0)} \mathbf{H}_{e}^{H}\right) \\ +\operatorname{Tr}\left(\mathbf{H}_{e}^{H}\left(\mathbf{K}_{v^{\prime}}^{(0)}+\mathbf{H}_{e} \mathbf{K}_{x}^{(0)} \mathbf{H}_{e}^{H}\right)^{-1} \mathbf{H}_{e} \mathbf{K}_{x}\right) \\ -\operatorname{Tr}\left(\mathbf{H}_{e}^{H}\left(\mathbf{K}_{v^{\prime}}^{(0)}+\mathbf{H}_{e} \mathbf{K}_{x}^{(0)} \mathbf{H}_{e}^{H}\right)^{-1} \mathbf{H}_{e} \mathbf{K}_{x}^{(0)}\right) logdet(Kv′+HeKxHeH)≤logdet(Kv′(0)+HeKx(0)HeH)+Tr(HeH(Kv′(0)+HeKx(0)HeH)−1HeKx)−Tr(HeH(Kv′(0)+HeKx(0)HeH)−1HeKx(0))
function:
f
=
log
(
d
e
t
(
H
⋅
X
⋅
Z
+
Y
)
)
f = \log(\mathrm{det}(H\cdot X\cdot Z+Y))
f=log(det(H⋅X⋅Z+Y))
gradient:
∂
f
∂
X
=
(
Z
⋅
i
n
v
(
Y
+
H
⋅
X
⋅
Z
)
⋅
H
)
⊤
\frac{\partial f}{\partial X} = (Z\cdot \mathrm{inv}(Y+H\cdot X\cdot Z)\cdot H)^\top
∂X∂f=(Z⋅inv(Y+H⋅X⋅Z)⋅H)⊤
张贤达《矩阵分析与应用》P160
多元函数的泰勒展开式
摘抄自https://zhuanlan.zhihu.com/p/33316479
实际优化问题的目标函数往往比较复杂。为了使问题简化,通常将目标函数在某点附近展开为泰勒(Taylor)多项式来逼近原函数。
一元函数在点 x k x_k xk处的泰勒展开式为
f ( x ) = f ( x k ) + ( x − x k ) f ′ ( x k ) + 1 2 ! ( x − x k ) 2 f ′ ′ ( x k ) + o n f(x)=f\left(x_{k}\right)+\left(x-x_{k}\right) f^{\prime}\left(x_{k}\right)+\frac{1}{2 !}\left(x-x_{k}\right)^{2} f^{\prime \prime}\left(x_{k}\right)+o^{n} f(x)=f(xk)+(x−xk)f′(xk)+2!1(x−xk)2f′′(xk)+on
二元函数在点
(
x
k
,
y
k
)
(x_k,y_k)
(xk,yk)处的泰勒展开式为:
f
(
x
,
y
)
=
f
(
x
k
,
y
k
)
+
(
x
−
x
k
)
f
x
′
(
x
k
,
y
k
)
+
(
y
−
y
k
)
f
y
′
(
x
k
,
y
k
)
+
1
2
!
(
x
−
x
k
)
2
f
x
x
′
′
(
x
k
,
y
k
)
+
1
2
!
(
x
−
x
k
)
(
y
−
y
k
)
f
x
y
′
′
(
x
k
,
y
k
)
+
1
2
!
(
x
−
x
k
)
(
y
−
y
k
)
f
y
x
′
′
(
x
k
,
y
k
)
+
1
2
!
(
y
−
y
k
)
2
f
y
y
′
′
(
x
k
,
y
k
)
+
o
n
\begin{array}{c} f(x, y)=f\left(x_{k}, y_{k}\right)+\left(x-x_{k}\right) f_{x}^{\prime}\left(x_{k}, y_{k}\right)+\left(y-y_{k}\right) f_{y}^{\prime}\left(x_{k}, y_{k}\right) \\ +\frac{1}{2 !}\left(x-x_{k}\right)^{2} f_{x x}^{\prime \prime}\left(x_{k}, y_{k}\right)+\frac{1}{2 !}\left(x-x_{k}\right)\left(y-y_{k}\right) f_{x y}^{\prime \prime}\left(x_{k}, y_{k}\right) \\ +\frac{1}{2 !}\left(x-x_{k}\right)\left(y-y_{k}\right) f_{y x}^{\prime \prime}\left(x_{k}, y_{k}\right)+\frac{1}{2 !}\left(y-y_{k}\right)^{2} f_{y y}^{\prime \prime}\left(x_{k}, y_{k}\right) \\ +o^{n} \end{array}
f(x,y)=f(xk,yk)+(x−xk)fx′(xk,yk)+(y−yk)fy′(xk,yk)+2!1(x−xk)2fxx′′(xk,yk)+2!1(x−xk)(y−yk)fxy′′(xk,yk)+2!1(x−xk)(y−yk)fyx′′(xk,yk)+2!1(y−yk)2fyy′′(xk,yk)+on
MM算法中的一阶泰勒展开代函数
舒尔补
Schur Complement