首页> 外文会议>Annual IEEE India Conference >A low-complexity modified SLM with new phase sequences for PAPR reduction in OFDM system
【24h】

A low-complexity modified SLM with new phase sequences for PAPR reduction in OFDM system

机译:具有新相序的低复杂度改进SLM,可降低OFDM系统中的PAPR

获取原文

摘要

The major issue in orthogonal frequency division multiplexing (OFDM) system is a high peak-to-average power ratio (PAPR) of transmitting signal. Selective mapping (SLM) is the promising technique to reduce PAPR in OFDM system. However, it suffers from high computational complexity. In our proposed method, to achieve low computational complexity, the input data sequences are partitioned into two sub blocks in such a way that the candidate signals are generated by performing circular convolution for the first sub block and by conventional SLM in the second sub block. The candidate signals of modified SLM are obtained by combining two sub block candidate signals. The proposed method reduces PAPR marginally along with reduction in computational complexity. To further reduce PAPR, different phase sequences namely Riemann, New Riemann and chaotic sequences are used in C-SLM. The Matlab simulation shows that, the modified SLM with new Riemann sequence results in high PAPR reduction than other phase sequences. In addition, it provides significant reduction computational complexity compared to C-SLM.
机译:正交频分复用(OFDM)系统中的主要问题是发射信号的高峰均功率比(PAPR)。选择性映射(SLM)是降低OFDM系统中PAPR的有前途的技术。但是,它具有很高的计算复杂度。在我们提出的方法中,为了实现较低的计算复杂度,将输入数据序列划分为两个子块,以便通过对第一子块执行循环卷积并通过第二子块中的常规SLM生成候选信号。通过组合两个子块候选信号来获得修改后的SLM的候选信号。所提出的方法在降低计算复杂度的同时,还可以略微降低PAPR。为了进一步降低PAPR,在C-SLM中使用了不同的相序,即黎曼,新黎曼和混沌序列。 Matlab仿真表明,与其他相位序列相比,具有新黎曼序列的改进SLM可以显着降低PAPR。此外,与C-SLM相比,它显着降低了计算复杂度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号