论文部分内容阅读
针对球译码中性能与复杂度无法兼顾的问题,提出了消除固定复杂度球译码算法复杂度冗余的方法.该方法以满分集度为性能基准,经过合理的半径构造,使发送向量落在超球体外的概率足够小且避免分集度的损失,在平均意义上显著降低了复杂度,从而减少了算法在执行时的功耗.仿真结果表明,在满足性能最优和最大时延条件下,算法的功耗大幅度降低.
Aiming at the problem that the performance and complexity of ball decoding can not be reconciled, this paper proposes a method to eliminate the complexity redundancy of the algorithm of fixed complexity ball decoding.This method takes the full diversity as the performance benchmark and through reasonable radius construction, The probability of falling outside the hypersphere is small enough and the loss of diversity is avoided, which reduces the complexity significantly in an average sense, thus reducing the power consumption of the algorithm during execution. The simulation results show that, in meeting the optimal performance and the maximum delay Under the conditions, the power consumption of the algorithm is greatly reduced.