首页> 外文会议> >Low complexity basis selection algorithm for per-common basis rate control
【24h】

Low complexity basis selection algorithm for per-common basis rate control

机译:低复杂度的基础选择算法,用于常见的基础速率控制

获取原文

摘要

Considering per-common basis modulation and coding scheme at the transmitter and successive interference cancellation at the receiver, the active basis subset and the corresponding decoding order are determined where equal powers are allocated to the active bases. We first take into account a maximum likelihood decision strategy in which the optimal active basis subset and its decoding order are jointly determined such that the system capacity is maximized among all possible decoding orders over all possible basis subsets. We then propose a serial decision procedure consisting of a successive process that tests whether basis selection gain exists or not when the basis with the lowest post-processing SINR is discarded at each stage. The serial decision procedure that simply drops the worst basis at each stage leads to the globally optimal solution with considerably reduced complexity. Numerical results show that the proposed serial decision procedure induces no capacity loss compared with the maximum likelihood decision strategy.
机译:考虑到在发射机处的按公共基础的调制和编码方案以及在接收机处的连续干扰消除,在将相等的功率分配给有源基站的情况下,确定有源基础子集和相应的解码顺序。我们首先考虑最大似然决策策略,其中共同确定最佳有效基础子集及其解码顺序,以使系统容量在所有可能的基础子集上的所有可能的解码顺序中最大化。然后,我们提出了一个由一系列连续过程组成的串行决策过程,该过程将测试在每个阶段丢弃具有最低后处理SINR的基础时是否存在基础选择增益。简单地在每个阶段放弃最差基础的串行决策过程将导致全局最佳解决方案,其复杂性大大降低。数值结果表明,与最大似然决策策略相比,该序列决策程序不会引起容量损失。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号