首页> 外文期刊>Communications Letters, IEEE >A Low Complexity PTS Scheme Based on Tree for PAPR Reduction
【24h】

A Low Complexity PTS Scheme Based on Tree for PAPR Reduction

机译:一种基于树的低复杂度PTS降低PAPR方案

获取原文
获取原文并翻译 | 示例
           

摘要

The paper proposes a scheme called T-PTS to reduce the partial transmit sequence (PTS) complexity based on W-way tree. With the nodes in the tree corresponding to phase weighting factors and layers corresponding to subblocks, all the candidates can be calculated by the combination of layers and weighting factors on the paths from the root to the leaves. In each layer, we order the nodes in a 2W period, and set the last W nodes bilateral symmetry with the first W nodes, where only one weighting factor on the paths from root to the neighbor leaves is different. Therefore, all candidate signals can be obtained by adding the difference signal on the last candidate, which can reduce the complexity dramatically. Furthermore, extensive simulations show that the proposed T-PTS does not have performance degradation on the peak-to average power ratio (PAPR).
机译:提出了一种基于W-way树的T-PTS方案,以降低部分发送序列(PTS)的复杂度。由于树中的节点对应于相位加权因子,而各层对应于子块,则可以通过组合从根到叶子的路径上的层和加权因子来计算所有候选。在每一层中,我们以2W的周期对节点进行排序,并设置最后的W个节点与第一个W节点双边对称,其中从根到相邻叶子的路径上只有一个加权因子不同。因此,可以通过将差信号加到最后一个候选上来获得所有候选信号,这可以大大降低复杂度。此外,大量的仿真表明,所提出的T-PTS的峰均功率比(PAPR)不会降低性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号