摘要
针对传统选择映射(selected mapping,SLM)中计算复杂度过高和抑制峰均比(PAPR)能力有限的问题,设计了一种低复杂度的SLM算法并用Matlab进行了仿真。该算法采用圆周移位的思想,使得整个过程仅需一个IFFT模块,同时又在IFFT后进行了序列重组来增加待选序列。最终的仿真结果表明,与传统SLM以及文献[12]中的SLM相比,在峰均比抑制效果相近时,使用该算法可以极大降低计算复杂度。
To solve the problem of high computational complexity and the limited ability of PAPR(peak-to-average power ratio) reduction in the conventional SLM(selected mapping),a low complexity SLM scheme was designed and simulated by MATLAB.The algorithm uses the idea of cyclically shifting to realize only one IFFT throughout the entire process,at the same time,it reorganizes the sequences after IFFT to generate new candidates.The final simulation result shows that comparing with conventional SLM and the SLM scheme in/,using this algorithm can dramatically reduce computational complexity under the similar PAPR reduction performance.
出处
《武汉理工大学学报(信息与管理工程版)》
CAS
2012年第2期131-134,150,共5页
Journal of Wuhan University of Technology:Information & Management Engineering
基金
国家科技重大专项基金资助项目(2009ZX03006-003-01)
关键词
正交频分复用
峰均比
选择映射
IFFT
orthogonal frequency division multiplexing
peak-to-average power radio
selected mapping
IFFT