全部 标题 作者
关键词 摘要

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

查看量下载量

相关文章

更多...

多用户MIMO下行系统迭代迫零预编码

DOI: 10.13190/jbupt.201004.102.zhangj, PP. 102-105

Keywords: 多用户多输入多输出,预编码,系统容量,复杂度

Full-Text   Cite this paper   Add to My Lib

Abstract:

针对多用户多入多出(MIMO)下行系统,在用户分配单路数据流情况下,提出了一种低复杂度迭代预编码算法.算法使用迫零准则设计预编码向量,采用最大比合并更新接收向量.在用户分配单流时,该算法与已有的迭代NuSVD算法相比,不仅在性能上几乎没有损失,而且单次迭代复杂度的数量级下降为原算法的1/K(K为用户数目,K≥2),总复杂度下降超过50%,仿真结果验证了所提算法的性能.

References

[1]  罗振东, 高宏, 刘元安, 等. MIMO 信道容量公式及渐近界[J]. 北京邮电大学学报, 2006, 29(6): 72-76. Luo Zhendong, Gao Hong, Liu Yuanan, et al. Formula and asymptotic bound of MIMO channel capacity[J]. Journal of Beijing University of Posts and Telecommunications, 2006, 29(6): 72-76.
[2]  Costa M. Writing on dirty paper[J]. IEEE Transactions on Information Theory, 1983, 29(3): 439-441.
[3]  Spencer Q H, Swindlehurst A L, Haardt M. Zero-forcing methods for downlink spatial multiplexing in multi-user MIMO channels[J]. IEEE Transactions on Signal Processing, 2004, 52(2): 461-471.
[4]  Lee S R, Park S, Moon S H, et al. New beamforming schemes with optimum receive combining for multiuser MIMO systems//2008 IEEE International Conference on Communications (ICC 2008). Beijing: IEEE Press, 2008: 4118-4122.
[5]  Pan Z, Wong K K, Ng T S. Generalized multiuser orthogonal space-division multiplexing[J]. IEEE Transactions on Wireless Communications, 2004, 3(6): 1969-1973.
[6]  Shen Z, Chen R, Andrews J G, et al. Low complexity user selection algorithms for multi-user MIMO systems with block diagonalization[J]. IEEE Transactions on Signal Processing, 2006, 54(9): 3658-3663.
[7]  程云鹏, 张凯院, 徐仲. 矩阵论[M]. 西安: 西北工业大学出版社, 2008: 315-319. Cheng Yunpeng, Zhang Kaiyuan, Xu Zhong. Matrix theory[M]. Xian: North Western Poly-technical University Press, 2008: 315-319.
[8]  Luo Zhendong, Zhao Ming, Liu Siyang, et al. Greville-to-inverse-greville algorithm for V-BLAST systems//2006 IEEE International Conference on Communications (ICC 2006). Istanbul: IEEE Press, 2006: 4214-4218.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133