To address the high peak-to-average power ratio (PAPR) problem in orthogonal frequency division multiplexing with index modulation (OFDM-IM) systems, this paper proposes a novel PAPR reduction approach called the joint partial transmit sequence and index modulation mapping (J-IMM-PTS) scheme. The J-IMM-PTS method operates in two stages: the first stage applies index modulation mapping (IMM) rules to achieve an initial reduction in PAPR, while the second stage employs the partial transmit sequence (PTS) technique to further process signals that still exhibit high PAPR. A threshold mechanism is introduced to decide whether the PTS stage should be executed, enabling a balance between PAPR reduction performance and computational complexity. Simulation results demonstrate that the proposed J-IMM-PTS scheme achieves superior PAPR reduction compared to the traditional IMM method while also reducing computational complexity.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Joint PTS and IMM Scheme for PAPR Reduction in OFDM-IM Systems

  • Yi-Hang Ma,
  • Si-Yu Zhang,
  • Ruo-Yan Li,
  • Jie-Yu Cheng,
  • Xiao-Yan Tian,
  • Bo Yang

摘要

To address the high peak-to-average power ratio (PAPR) problem in orthogonal frequency division multiplexing with index modulation (OFDM-IM) systems, this paper proposes a novel PAPR reduction approach called the joint partial transmit sequence and index modulation mapping (J-IMM-PTS) scheme. The J-IMM-PTS method operates in two stages: the first stage applies index modulation mapping (IMM) rules to achieve an initial reduction in PAPR, while the second stage employs the partial transmit sequence (PTS) technique to further process signals that still exhibit high PAPR. A threshold mechanism is introduced to decide whether the PTS stage should be executed, enabling a balance between PAPR reduction performance and computational complexity. Simulation results demonstrate that the proposed J-IMM-PTS scheme achieves superior PAPR reduction compared to the traditional IMM method while also reducing computational complexity.