首页> 外文会议>IEEE Advanced Information Technology, Electronic and Automation Control Conference >A New Low-complexity Subblock Segmentation Method for PTS OFDM
【24h】

A New Low-complexity Subblock Segmentation Method for PTS OFDM

机译:一种新的低复杂性子块分段方法,用于截止物的PTS

获取原文

摘要

The algorithm of Partial Transmit Sequence (PTS) technique has high computational complexity in Orthogonal Frequency Division Multiplexing (OFDM) system. In this paper, a new low-complexity combined subblock segmentation method for PTS OFDM is proposed. For analytic purposes, we derive computational complexity expressions for the proposed segmentation method and analyze the computational complexity of the proposed segmentation method compared with that of the random segmentation method which has the best Peak to Average Power Ratio (PAPR) reduction performance. The simulation results show that the PAPR reduction performance is degraded only slightly compared with random segmentation method.
机译:部分发射序列(PTS)技术的算法在正交频分复用(OFDM)系统中具有高计算复杂性。本文提出了一种新的低复杂性组合的PTS OFDM的组合分段方法。为了分析目的,我们推导了所提出的分割方法的计算复杂性表达式,并与具有最佳峰值的随机分割方法(PAPR)减少性能的随机分割方法相比,分析所提出的分割方法的计算复杂性。仿真结果表明,PAPR降低性能与随机分割方法略微降低。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号