arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0810.0870cs.ITmath.IT
收藏

发射端具有部分信道状态信息的认知无线电

Cognitive Radio with Partial Channel State Information at the Transmitter

Pin-Hsun Lin, Shih-Chun Lin, Chung-Pi Lee, Hsuan-Jung Su

摘要:

本文提出了一种发射端部分信道状态信息已知的认知无线电系统设计方法,用线性分配Gelfand-Pinsker编码(LA-GPC)代替完全信道状态信息已知的认知无线电系统中的脏纸编码(DPC),更有效地利用了有限的信道信息。基于从LA-GPC推导出的可达速率,提出了快衰落信道和慢衰落信道下的两个优化问题。我们推导出半解析解,找到中继比和预编码系数。关键的观察是,在这些问题中的复率函数是密切相关的比率的二次型。仿真结果表明,所提出的半解析解的性能接近于暴力搜索找到的最优解,并优于基于朴素DPC的系统。渐近分析还表明,当Rician信道的K因子趋于无穷大时,这些解收敛到用完全CSIT求解的最优解。此外,提出了一种新的编码方案,以实现在实践中的LA-GPC。仿真结果表明,所提出的实用编码方案可以有效地达到理论码率性能。

英文摘要:

In this paper, we present the cognitive radio system design with partial channel state information known at the transmitter (CSIT).We replace the dirty paper coding (DPC) used in the cognitive radio with full CSIT by the linear assignment Gel'fand-Pinsker coding (LA-GPC), which can utilize the limited knowledge of the channel more efficiently. Based on the achievable rate derived from the LA-GPC, two optimization problems under the fast and slow fading channels are formulated. We derive semianalytical solutions to find the relaying ratios and precoding coefficients. The critical observation is that the complex rate functions in these problems are closely related to ratios of quadratic form. Simulation results show that the proposed semi-analytical solutions perform close to the optimal solutions found by brute-force search, and outperform the systems based on naive DPC. Asymptotic analysis also shows that these solutions converge to the optimal ones solved with full CSIT when the K-factor of Rician channel approaches infinity. Moreover, a new coding scheme is proposed to implement the LA-GPC in practice. Simulation results show that the proposed practical coding scheme can efficiently reach the theoretical rate performance.

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

↑