摘要
针对传统选择性映射(C-SLM)算法存在计算复杂度高的问题,提出了分组(G-SLM)的改进算法,在不增加系统计算复杂度的情况下,将时域备选信号的个数从M增加到M 24,并且通过仿真确定了最佳的α值;针对C-SLM算法存在峰均功率比(PAPR)抑制性能有限的问题,将G-SLM算法与μ-law压缩扩展法相结合,提出了μ-GSLM联合算法,进一步降低了系统PAPR。仿真结果表明:在互补累计分布函数(CCDF)取值为10-3时,与原始信号、G-SLM算法和μ-law压缩扩展法相比,μ-GSLM算法的PAPR分别降低了7.5 dB、3.2 dB和2.1 dB。
Aiming at the high computational complexity of traditional selective mapping(C-SLM)algorithm,an improved grouping(G-SLM)algorithm is proposed.Without increasing the computational complexity of the system,the number of time-domain candidate signals is increased from M to M 24,and the optimalαvalue is determined by simulation.In view of the limited peak-to-average power ratio(PAPR)suppression performance of C-SLM algorithm,aμ-GSLM joint algorithm is proposed by combining G-SLM algorithm withμ-law compression expansion method,which further reduces the PAPR of the system.The simulation results show that when complementary cumulative distribution function(CCDF)is 10-3,the PAPR ofμ-GSLM algorithm is reduced by 7.5 dB,3.2 dB and 2.1 dB respectively compared with the original signal,G-SLM algorithm andμ-law compression expansion method.
作者
秦岭
于利强
郭瑛
徐艳红
胡晓莉
QIN Ling;YU Liqiang;GUO Ying;XU Yanhong;HU Xiaoli(School of Information Engineering,Inner Mongolia University of Science and Technology,Baotou Inner Mongolia 014010,China)
出处
《光通信技术》
2021年第4期32-37,共6页
Optical Communication Technology
基金
国家自然科学基金(61961033)资助
内蒙古自然科学基金(2019MS06021、2019LH06005)资助
内蒙古自治区高等学校“青年科技英才支持计划”(NJYT-19-A15)资助。
关键词
可见光通信
正交频分复用
峰值平均功率比
选择性映射
计算复杂度
visible light communications
orthogonal frequency division multiplexing
peak-to-average power ratio
selective mapping
computational complexity
