arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0906.2252cs.ITmath.IT
收藏

CSIT不理想的MIMO认知无线电信道的脏纸编码

Dirty Paper Coding for the MIMO Cognitive Radio Channel with Imperfect CSIT

Chinmay S. Vaze, Mahesh K. Varanasi

摘要:

研究了高斯多输入多输出(MIMO)认知无线电信道(CRC)中,当发射端(CSIT)和接收端分别存在不完全和完全信道知识时,基于脏纸编码(DPC)的传输方案.特别地,在发送协方差矩阵上优化MIMO CRC的和速率的问题被处理。在基于DPC的传输策略下,这种优化需要与对膨胀因子的优化联合执行。为此,首先研究在具有不完美CSIT的MIMO信道$Y=H_1 X + H_2 S + Z$上确定膨胀因子的问题。对于这个问题,两个迭代算法,推广了相应的算法提出的信道$Y=H(X+S)+Z$,开发。随后,推导出了在给定的膨胀因子选择下,MIMO CRC在传输协方差上的和速率最大化的必要条件。利用这些必要条件和确定膨胀因子的算法,提出了联合优化的迭代数值算法。一些有趣的意见,从算法得到的数值结果。此外,高SNR和速率缩放因子可实现的CRC与不完美的CSIT。

英文摘要:

A Dirty Paper Coding (DPC) based transmission scheme for the Gaussian multiple-input multiple-output (MIMO) cognitive radio channel (CRC) is studied when there is imperfect and perfect channel knowledge at the transmitters (CSIT) and the receivers, respectively. In particular, the problem of optimizing the sum-rate of the MIMO CRC over the transmit covariance matrices is dealt with. Such an optimization, under the DPC-based transmission strategy, needs to be performed jointly with an optimization over the inflation factor. To this end, first the problem of determination of inflation factor over the MIMO channel $Y=H_1 X + H_2 S + Z$ with imperfect CSIT is investigated. For this problem, two iterative algorithms, which generalize the corresponding algorithms proposed for the channel $Y=H(X+S)+Z$, are developed. Later, the necessary conditions for maximizing the sum-rate of the MIMO CRC over the transmit covariances for a given choice of inflation factor are derived. Using these necessary conditions and the algorithms for the determination of the inflation factor, an iterative, numerical algorithm for the joint optimization is proposed. Some interesting observations are made from the numerical results obtained from the algorithm. Furthermore, the high-SNR sum-rate scaling factor achievable over the CRC with imperfect CSIT is obtained.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑