...
首页> 外文期刊>IEEE Transactions on Vehicular Technology >Peak Power Reduction of OFDM Systems Through Tone Injection via Parametric Minimum Cross-Entropy Method
【24h】

Peak Power Reduction of OFDM Systems Through Tone Injection via Parametric Minimum Cross-Entropy Method

机译:通过参数最小交叉熵方法通过音调注入降低OFDM系统的峰值功率

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

摘要

It is well known that the major drawback of orthogonal frequency-division multiplexing (OFDM) is its high peak-to-mean envelope power ratio (PMEPR). One of the promising schemes proposed for alleviating the high PMEPR of OFDM signals is tone injection (TI). In this paper, we propose a novel low-complexity algorithm for PMEPR reduction using TI. This algorithm first formulates the TI scheme as a combinatorial optimization problem and then finds a near-optimal solution to this problem via parametric minimum cross-entropy (PMCE) method. We also demonstrate that by effectively exploiting TI schemes in conjunction with cross constellations, it is possible to reduce the peak power of the system by more than 2 dB compared with sign selection schemes over conventional quadrature-amplitude modulation (QAM) constellations. Simulation results show that our algorithm outperforms similar existing algorithms, including the cross-entropy (CE) TI algorithm, the greedy sign selection algorithm, and the derandomization sign selection algorithm, in terms of PMEPR. We also present a threshold-based PMCE algorithm for TI that results in significant complexity reduction. Numerical results show that to achieve a prescribed PMEPR threshold, this threshold-based PMCE algorithm requires less computational complexity than the CE TI algorithm.
机译:众所周知,正交频分多路复用(OFDM)的主要缺点是其峰均包络功率比(PMEPR)高。为减轻OFDM信号的高PMEPR而提出的有希望的方案之一是音调注入(TI)。在本文中,我们提出了一种使用TI降低PMEPR的新颖的低复杂度算法。该算法首先将TI方案表述为组合优化问题,然后通过参数最小交叉熵(PMCE)方法找到该问题的近似最优解。我们还证明,通过有效利用TI方案和交叉星座,与传统正交幅度调制(QAM)星座上的符号选择方案相比,可以将系统的峰值功率降低2 dB以上。仿真结果表明,就PMEPR而言,我们的算法优于现有的相似算法,包括交叉熵(CE)TI算法,贪婪符号选择算法和去随机符号选择算法。我们还提出了基于阈值的TI PMCE算法,该算法可显着降低复杂度。数值结果表明,要达到规定的PMEPR阈值,这种基于阈值的PMCE算法比CE TI算法需要更少的计算复杂度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号