论文部分内容阅读
针对减格辅助Tomlinson-Harashima预编码(LRA-THP)算法复杂度高的问题,提出一种适用于多波束卫星系统的低复杂度预编码算法.该算法根据用户间的距离对用户进行分组,然后利用矩阵求逆及正交三角分解(QR)计算预处理矩阵,用于抑制分组间干扰.计算过程中充分利用多波束卫星系统特点,减小预处理矩阵的维度,从而进一步降低算法运算量.各分组内分别采用LRA-THP,消除残留用户间干扰.仿真结果表明,相比LRA-THP,该算法的运算复杂度能降低92.5%,同时性能损失控制在0.2 d B.另外,该算法能获得与已有的分组预编码算法相近的误码性能,同时使运算量降低69.7%.该算法的低复杂度及灵活性使其具有较强的实用价值.
Aiming at the high complexity of low-complexity Tomlinson-Harashima precoding (LRA-THP) algorithm, a low complexity precoding algorithm is proposed for multi-beam satellite system. This algorithm divides users according to the distance between users, Then, matrix preconditioning matrix and inverse triangular orthogonal decomposition (QR) are used to suppress inter-packet interference, which makes full use of the characteristics of multi-beam satellite system and reduces the dimension of preprocessing matrix to further reduce the computational complexity The LRA-THP is used in each sub-group to eliminate residual inter-user interference.The simulation results show that compared with LRA-THP, the computational complexity can be reduced by 92.5% and the performance loss controlled at 0.2 d B. In addition, Can get the bit error performance similar to the existing packet precoding algorithm, and reduce the computation amount by 69.7%. The low complexity and flexibility of the algorithm make it have strong practical value.