检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东南大学信息科学与工程学院,南京210096 [2]南京信息工程大学电子与信息工程学院,南京210044
出 处:《电子与信息学报》2011年第6期1350-1355,共6页Journal of Electronics & Information Technology
基 金:国家重点基础研究发展计划项目(2007CB310603);国家科技重大专项(2009ZX03003-004);江苏省产学研项目(SBY201020107)资助课题
摘 要:针对在多个基站联合服务一个移动用户,并且基站和用户均配置多天线的应用场景下,该文研究了多基站协作预编码的最优设计问题。首先基于系统均方误差函数最小化准则建立了数学模型;进而对该数学模型进行等价变换。等价变换后,需要求解的问题变成了由原始问题的对角块矩阵中所有非零元素组成的列向量求解;最后利用拉格朗日乘子法对变换后的问题进行求解,最终得到问题最优解的解析表达式。基于该解析表达式,设计了一个联合优化多点协作发射机与接收机的迭代算法。计算机仿真表明,所提方案在系统误比特率、误符号率以及系统频谱效率方面都有着明显的增益。The optimum design of the cooperative precoding matrix is investigated for the system consisted of cooperative multi-antenna base stations and one multi-antenna mobile terminal. A mathematical model is first established for the cooperative precoding matrix optimization which is based on the minimization of the mean squared error. In order to deal with the difficulty as a result of the block diagonal structure of the cooperative precoding matrix, the original problem is then converted into an equivalent problem which involves a long column vector consisted of all non-zero elements in the block diagonal cooperative matrix. With the equivalent problem, the Lagrangian multiplier method is finally employed to obtain the optimum solution in an analytical form to the original problem. Moreover, based on this analytical expression of Cooperative Multi-Points (CoMP) precoder, an iterative algorithm is developed to jointly optimize the precoder of CoMP and the receiver of MT. Numerical simulations show the effectiveness of the proposed cooperative precoding schemes in terms of bit error rate, symbol error rate and the spectral efficiency of the whole system.
关 键 词:无线通信 多基站协作 闭环宏分集 协作预编码 多输入多输出 迭代算法
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222