Suppr超能文献

MIMO雅可比衰落信道遍历容量的上下界

Upper and lower bounds for the ergodic capacity of MIMO Jacobi fading channels.

作者信息

Nafkha Amor, Bonnefoi Rémi

出版信息

Opt Express. 2017 May 29;25(11):12144-12151. doi: 10.1364/OE.25.012144.

Abstract

In multi-(core/mode) optical fiber communication, the transmission channel can be modeled as a complex sub-matrix of the Haar-distributed unitary matrix (complex Jacobi unitary ensemble). In this letter, we present new analytical expressions of the upper and lower bounds for the ergodic capacity of multiple-input multiple-output Jacobi-fading channels. Recent results on the determinant of the Jacobi unitary ensemble are employed to derive a tight lower bound on the ergodic capacity. We use Jensen's inequality to provide an analytical closed-form upper bound to the ergodic capacity at any signal-to-noise ratio (SNR). Closed-form expressions of the ergodic capacity, at low and high SNR regimes, are also derived. Simulation results are presented to validate the accuracy of the derived expressions.

摘要

在多(芯/模式)光纤通信中,传输信道可建模为哈尔分布酉矩阵(复雅可比酉系综)的一个复子矩阵。在本信函中,我们给出了多输入多输出雅可比衰落信道遍历容量上下界的新解析表达式。利用关于雅可比酉系综行列式的最新结果推导出遍历容量的一个紧密下界。我们使用詹森不等式给出任意信噪比(SNR)下遍历容量的解析闭式上界。还推导了低信噪比和高信噪比区域遍历容量的闭式表达式。给出了仿真结果以验证所推导表达式的准确性。

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验