期刊文献+

降低DCO-OFDM系统峰均功率比的IGA-SLM算法 被引量:1

Research on IGA-SLM Algorithm for Reducing PAPR in DCO-OFDM System
下载PDF
导出
摘要 针对可见光通信中直流偏置光-正交频分复用(DCO-OFDM)系统存在的高峰均功率比(PAPR)问题,可采用选择性映射算法来降低系统的PAPR。由于选择性映射算法只能在有限组相位旋转序列里选择局部最优,因此引入遗传算法来搜索全局最优解,同时针对遗传算法容易产生过早收敛的问题,文章提出自适应调整机制、自适应多点交叉机制、最优解保护机制和立即淘汰机制来改进遗传算法,进而提出改进型遗传选择性映射算法(IGA-SLM)。仿真结果表明,该算法可显著降低可见光通信DCO-OFDM系统的PAPR。 To solve the problem of high Peak to Average Power Ratio(PAPR) in Direct Current biased Optical-Orthogonal Frequency Division Multiplexing(DCO-OFDM) system in visible light communication, the selective mapping method can be used to reduce the PAPR of the system. Because the selective mapping algorithm can only select the local optimum in a limited set of phase rotation sequences, the genetic algorithm is introduced to search for the global optimum solution. Meanwhile, the genetic algorithm has the problem of premature convergence. In order to solve this issue, we apply several methods including the adaptive adjustment mechanism, the adaptive multi-point crossover mechanism, the optimal solution protection mechanism and the immediate elimination mechanism to improve the genetic algorithm. Therefore, an Improved Genetic Algorithm-Selected Mapping(IGA-SLM) is proposed. The simulation results show that the proposed algorithm can significantly reduce the PAPR of DCO-OFDM system.
作者 李天屿 李蔚泽 洪文昕 陈建飞 LI Tian-yu;LI Wei-ze;HONG Wen-xin;CHEN Jian-fei(College of Telecommunications&Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210023,China;College of Electronic and Optical Engineering&College of Microelectronics,Nanjing University of Posts and Telecommunications,Nanjing 210023,China)
出处 《光通信研究》 北大核心 2020年第4期17-19,78,共4页 Study on Optical Communications
基金 国家自然科学基金资助项目(61601237) 江苏省自然科学基金资助项目(SJ216039) 江苏省高校自然科学研究面上资助项目(16KJB420001) 南京邮电大学校级科研资助项目(XK1060918088)。
关键词 可见光通信 直流偏置光-正交频分复用系统 峰均功率比 改进型遗传选择性映射算法 visible light communication DCO-OFDM system peak-to-average power ratio IGA-SLM
  • 相关文献

参考文献2

二级参考文献15

  • 1任子武,伞冶.自适应遗传算法的改进及在系统辨识中应用研究[J].系统仿真学报,2006,18(1):41-43. 被引量:166
  • 2高海昌,冯博琴,朱利b.智能优化算法求解TSP问题[J].控制与决策,2006,21(3):241-247. 被引量:120
  • 3彭丹平,林志毅,王江晴.求解TSP的一种改进遗传算法[J].计算机工程与应用,2006,42(13):91-93. 被引量:19
  • 4Yannis Marinakis,Magdalene Marinaki.A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem[J].Computers and Operations Research,2010,37(3):432-442.
  • 5Darrell Whitley,Doug Hains,Adele Howe.A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover[C].Proc of the 11th Int Conf on Parallel Problem Solving from Nature.Berlin:Springer Heidelberg,2010,6283:566-575.
  • 6Zakir H Ahmed.Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator[J].Int J of Biometrics and Bioinformatics,2010,3(6):96-105.
  • 7Murat Albayrak,Novruz Allahverdi.Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms[J].Expert Systems with Applications,2011,38(3):1313-1320.
  • 8Baidu Baike.Traveling saleman problem[EB/OL].(2014-3-17).http://baike.baidu.com/view/1162183.htm.
  • 9Lin W,Delgadofiras Y G,Gause D C,et al.Hybrid Newton-Raphson genetic algorithm for the travelling salesman problem[J].Cybernetics and Systems,1995,26(4):387-412.
  • 10Srinivas M,Patnail K L M.Adaptive probabilities of crossover and mutation in genetic algorithms[J].IEEE Trans on System,Man and Cybernetics,1994,24(4):656-667.

共引文献157

同被引文献8

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部