Dirty Paper Coding versus Linear GSVD-Based Precoding in MIMO Broadcast Channel with Confidential Messages
Dirty Paper Coding versus Linear GSVD-Based Precoding in MIMO Broadcast Channel with Confidential Messages
复制标题
DOI：
10.1109/glocom.2011.6134129
复制
发表时间：
2011-12
期刊：
影响因子：
--
通讯作者：
S. Fakoorian;A. L. Swindlehurst
中科院分区：
文献类型：
--
作者：
S. Fakoorian;A. L. Swindlehurst
本文研究了基于广义奇异值分解（GSVD）的线性波束成形，用于具有机密消息的双接收器多输入多输出（MIMO）高斯广播信道。发送器有两条独立的消息，每条消息均适用于其中一个接收器，但需要尽可能对另一个接收器保密。最近，已经证明，在输入功率协方差约束下，秘密脏纸编码（S-DPC）方案是最优的，但在平均功率约束下，一般MIMO情况下没有可计算的保密容量表达式。事实上，对于这种情况，通常必须通过对所有可能的矩阵功率约束集进行穷举搜索来找到保密容量区域。显然，这种详尽的搜索以及脏纸编码和解码的复杂性促使我们考虑低复杂度的线性波束形成技术，其性能接近最优的 S-DPC 方案。在本文中，我们提出了一种基于 GSVD 的波束成形方案，用于具有机密消息的通用 MIMO 广播信道。此外，在平均功率约束下，获得最佳功率分配以最大化基于GSVD的波束成形技术的和保密率。数值结果表明线性预编码方法的保密率区域与最优 S-DPC 方案的保密率区域几乎相同。
This paper studies linear beamforming based on the generalized singular value decomposition (GSVD) for the two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel with confidential messages. The transmitter has two independent messages, each of which is intended for one of the receivers but needs to be kept as secret as possible from the other. Recently, it has been proved that, under an input power-covariance constraint, the secret dirty paper coding (S-DPC) scheme is optimal, but under the average power constraint, there is not a computable secrecy capacity expression for the general MIMO case. In fact, for this case, the secrecy capacity region must in general be found through an exhaustive search over the set of all possible matrix power constraints. Clearly, this exhaustive search, as well as the complexity of dirty-paper encoding and decoding, motivates us to consider low complexity linear beamforming technique whose performance is close to the optimal S-DPC scheme. In this paper, we propose a GSVD-based beamforming scheme for the general MIMO broadcast channel with confidential messages. Moreover, an optimal power allocation is obtained to maximize the sum-secrecy rates for the GSVD-based beamforming technique, under the average power constraint. Numerical results are presented to illustrate that the secrecy rate region of the linear precoding approach is nearly identical to that of the optimal S-DPC scheme.