摘要
正交频分复用(OFDM)系统的主要缺点是发射机输出信号的高峰均功率比(PAPR)。选择性映射(SLM)法能有效地降低OFDM信号的PAPR概率,但它需要一组逆快速傅立叶变换(IFFT)来产生候选传输信号,这将导致高的计算复杂度。本文给出一种低复杂度的次优化SLM算法。仿真结果表明该次优化SLM算法在降低PAPR相似的情况下,具有更小的计算复杂度。
Orthogonal frequency division multiplexing (OFDM) system is the main disadvantage of transmitter output signal of high peak to average power ratio (PA-PR).The selected mapping (SLM) approach provides good performance for PAPR reduction, but it requires a bank of inverse fast Fourier transforms (IFFTs) to generate a set of candidate transmission signals, and this requirement usually results in high computational complexity. In this paper, we propose a low-complexi-ty sub-optimal SLM algorithm. Computer simulation results show that the PAPR performance of the pro-posed SLM is closely similar to the original SLM, while it has low computational complexity.
出处
《现代电信科技》
2014年第11期54-56,62,共4页
Modern Science & Technology of Telecommunications
基金
国家高新技术研究发展(863)计划(项目编号:2011AA05A305)