两跳中继通信系统中均衡和预编码联合优化算法  

An Optimal Equalization and Precoding Joint Optimization Algorithm in Dual Hop Relay Systems

作　　者：褚红发[1] 牛凯[1] 贺志强[1] 喻丹[1] 吴伟陵[1] 

机构地区：[1]北京邮电大学泛网无线通信教育部重点实验室,北京100876

出　　处：《北京邮电大学学报》2011年第6期5-9,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家重点基础研究发展计划项目(2009CB320401);新一代宽带无线移动通信网科技重大专项项目(2010ZX03003-003-01;2012ZX03004005-002);国家自然科学基金项目(60902048)

摘　　要：提出了两跳中继通信系统线性均衡和线性预编码的联合优化算法,该算法在中继节点上把源节点与中继节点通信的检测算法和中继与目的节点通信的预编码算法结合起来,从而联合优化问题就等效成对检测和预编码矩阵的乘积进行单一优化问题.通过放松约束条件,给出了性能下限的闭式解,并且克服了迭代算法可能带来的不收敛性,与迭代算法相比较,大大降低了复杂度.通过仿真分析可以看出,该算法在性能上要好于最小均方误差算法,与最优的三节点联合优化算法相比,性能损失在可接受的范围内,能达到性能与复杂度的良好折中.A new linear detection and linear precoding joint optimization algorithm is proposed for dual hop relay communication systems. The detection for the first phase and precoding for the second phase are jointed together in relay system, therefore the joint optimization can be equaled to the unique optimization for the product matrix of detection and precoding. When relax the power constraint at relay node, the closed form resolution is found as the low performance bound, also the non-convergence problems in iterating process is avoided. Compared with iterative optimization, the complexity burden of this algorithm is greatly reduced. Simulation shows that the performance is better than minimum mean square error solution. Even compared with joint optimization for source relay and destination node, the performance degra- dation is kept in the acceptable extent. Therefore, when complexity and performance are considered, this algorithm shows a better compromise.

关 键 词：中继 线性预编码 线性均衡 联合优化 迭代算法 

分 类 号：TN929.53[电子电信—通信与信息系统]