位置:成果数据库 > 期刊 > 期刊详情页
Low complexity robust linear transceiver design for MIMO interference channel
  • ISSN号:1005-8885
  • 期刊名称:《中国邮电高校学报:英文版》
  • 时间:0
  • 分类:TN[电子电信]
  • 作者机构:College of Information Engineering, Shanghai Maritime University, Shanghai 201306, China
  • 相关基金:supported by the National Natural Science Foundation of China (61401270, 61271283).
中文摘要:

这份报纸为多重输入集中于线性收发器设计多重产量(MIMO ) 干扰隧道(IC ) ,在哪个一个围住的隧道错误模型被假定。二个优化问题作为与每传输器力量限制最小化最大的 per-user 均方差(MSE ) 和和 MSE 被提出。因为这些优化问题不在他们的可变矩阵上是联合凸的,传输器和接收装置能分别地或者被优化。为每个矩阵,在限制的上面的界限被导出以便它有更少的 semidefinite 的地方,一条接近的途径被介绍,因此,这个问题能被看作 second-order-cone 编程(SOCP ) 并且得到更少的计算复杂性。与常规 S 过程方法相比,建议途径完成类似的性能,但是显著地减少复杂性,特别为有天线的大规模数字的系统。

英文摘要:

This paper focuses on the linear transceiver design for multiple input multiple output(MIMO) interference channel(IC), in which a bounded channel error model is assumed. Two optimization problems are formulated as minimizing maximum per-user mean square error(MSE) and sum MSE with the per-transmitter power constraint. Since these optimization problems are not jointly convex on their variable matrices, the transmitter and receiver can be optimized alternately respectively. For each matrix, an approximated approach is presented where the upper bound of constraint is derived so that it has less semidefinite, thus the problem can be viewed as second-order-cone programming(SOCP) and gets less computational complexity. Compared with the conventional S-procedure method, the proposed approach achieves similar performance, but reduces the complexity significantly, especially for the system with large scale number of antennas.

同期刊论文项目
同项目期刊论文
期刊信息
  • 《中国邮电高校学报:英文版》
  • 主管单位:高教部
  • 主办单位:北京邮电大学、南邮、重邮、西邮、长邮、石邮
  • 主编:LU Yinghua
  • 地址:北京231信箱(中国邮电大学)
  • 邮编:100704
  • 邮箱:jchupt@bupt.edu.cn
  • 电话:010-62282493
  • 国际标准刊号:ISSN:1005-8885
  • 国内统一刊号:ISSN:11-3486/TN
  • 邮发代号:2-629
  • 获奖情况:
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,波兰哥白尼索引,荷兰文摘与引文数据库,美国工程索引,美国剑桥科学文摘,英国科学文摘数据库
  • 被引量:127