多波束卫星系统中低复杂度预编码技术  

Low-Complexity Precoding for Multi-beam Satellite Systems

作　　者：王杨[1] 赵旦峰[1] 廖希[1] 

机构地区：[1]哈尔滨工程大学信息与通信工程学院,哈尔滨150001

出　　处：《北京邮电大学学报》2015年第1期97-102,共6页Journal of Beijing University of Posts and Telecommunications

基　　金：中国博士后科学基金项目(2011M500640)

摘　　要：针对减格辅助Tomlinson-Harashima预编码(LRA-THP)算法复杂度高的问题,提出一种适用于多波束卫星系统的低复杂度预编码算法.该算法根据用户间的距离对用户进行分组,然后利用矩阵求逆及正交三角分解(QR)计算预处理矩阵,用于抑制分组间干扰.计算过程中充分利用多波束卫星系统特点,减小预处理矩阵的维度,从而进一步降低算法运算量.各分组内分别采用LRA-THP,消除残留用户间干扰.仿真结果表明,相比LRA-THP,该算法的运算复杂度能降低92.5%,同时性能损失控制在0.2 d B.另外,该算法能获得与已有的分组预编码算法相近的误码性能,同时使运算量降低69.7%.该算法的低复杂度及灵活性使其具有较强的实用价值.Conventional lattice reduction aided Tomlinson-Harashima precoding（ LRA-THP） is acknowledged complexity. A low-complexity precoding algorithm was proposed for multi-beam satellite systems.Users are grouped based on the distance between them in the proposed algorithm. Then,the matrix inversion and QR decomposition are used to calculate the preprocessing matrix by which the inter-group interference is suppressed. During calculation,the characteristic of multi-beam satellite systems is exploited to reduce the dimension of the preprocessing matrix and the computational complexity can be decreased further by this step. The LRA-THP is employed in each group to eliminate the residual interference. Simulations show that the proposed algorithm can reduce the complexity over the conventional LRA-THP by92. 5% while the performance loss is about 0. 2 d B. In addition,compared with the existing group precoding algorithm,the proposed algorithm can achieve the similar performance and has a 69. 7% reduction in the computational complexity. The low complexity and flexibility of the proposed algorithm is of higher practical value.

关 键 词：卫星通信 多波束 预编码 格基约减 

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