摘要
为解决时分双工长期演进(TDD-LTE)系统中预编码码本选择算法计算复杂度高的问题,在基于容量最大化和基于误码率最小为准则的预编码选择算法的基础上,提出了一种基于信道奇异值分解的预编码选择算法.该算法采用信道平均的思想和发射信号有效功率最大化的准则,在不损失吞吐量性能的前提下,大大降低了算法复杂度.仿真结果表明,该算法所需的计算量只有上述传统算法的26%～33%,而吞吐量性能损失不大.
To solve high computational complexity problems in selection algorithm of precoding codebook for time division duplex （TDD） long term evolution （LTE） , two traditional selection algorithms, i.e. maximizing mutual information and minimizing error rate are studied. And based on singular value de- composition of channel matrix, a new precoding matrix index selection algorithm is presented. The algo- rithm reduces the computational complexity enormously by using the idea of channel average and maximi- zes effective power of transmitted signals. Simulations show that the computation of the algorithm presen- ted is 26% -33% of those above these traditional algorithms but performance loss is very small.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2012年第3期30-33,共4页
Journal of Beijing University of Posts and Telecommunications
基金
高等学校学科创新引智计划项目(B08038)
中央高校基本科研业务费专项资金项目(72124669)
关键词
长期演进
多输入多输出
预编码
信干噪比
奇异值分解
long term evolution
multi-input multi-output
precoding matrix
signal to interference noise ratio
singular value decomposition
