全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

干扰泄漏最小的多小区MIMO干扰对齐算法

DOI: 10.11830/ISSN.1000-5013.2014.01.0022

Keywords: 干扰对齐, 干扰泄漏, 预编码, 和速率, 多输入多输出

Full-Text   Cite this paper   Add to My Lib

Abstract:

在3小区多输入多输出(MIMO)干扰对齐通信系统中, 提出一种基于系统总干扰泄漏最小的预编码矩阵组的选择算法.首先求出系统中所有变换矩阵,并基于干扰泄漏最小准则从中寻找出最优的变换矩阵;再依据干扰对齐的最大自由度选出一半的特征向量组成预编码矩阵.仿真结果表明:与现有干扰对齐预编码矩阵的设计方案相比,文中提出的算法在系统和速率性能上有明显的改善,而且该算法在统计信道状态信息下同样具有优势.

References

[1]  PATRICK M,GERHARD F.Uplink CoMP under a constrained backhaul and imperfect channel knowledge[J].IEEE Transactions on Wireless Communications,2011,10(6):1730-1742.
[2]  KLICHUN W,CHUJUNG Y.3-cell network MIMO architectures with sectorization and fractional frequency reuse[J]. IEEE Jouranal on Selected Areas in Communications, 2011,29(6):1185-1199.
[3]  CADAMBE V R,JAFAR S A.Interference alignment and degrees of freedom of the K-user interference channel[J].IEEE Transactions on Information Theory,2008,54(8):3425-3441.
[4]  GOMADAM K,CADAMBE V R,JAFAR S A.A distributed numerical approach to interference alignment and applications to wireless interference networks[J].IEEE Transactions on Information Theory,2011,57(6):3309-3322.
[5]  SUH C, HO M,TSE D.Downlink interference alignment[J]. IEEE Transactions on Communications,2011,59(9):2616-2626.
[6]  SONG S H,CHEN X,LETAIEF K B.Achievable diversity gain of k-user interference channel[J].IEEE International Conference on Communications,2012,28(9):4197-4201.
[7]  王存祥,邱玲.协作多点传输中一种基于特征子信道的干扰对齐预编码矩阵优化算法[J].信号处理,2011,27(3):395-399.
[8]  徐冰,谢显中,马彬,等.MIMO干扰信道下的协作干扰对齐优化算法[J].信号处理,2012,28(2):220-225.
[9]  KUMAR K R,XUE F.An iterative algorithm for joint signal and interference alignment[J].IEEE International Symposium Information Theory Proceedings,2010,55(7):2293-2297.
[10]  VANZELST A,SCHMIDT J S H.A single coefficient spatial correlation model for multiple-input multiple-output(MIMO)radio channels[C]//Pro URSI General Assembly. Maastricht:Netherlands,2002:1-4.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133