现代电子技术2018，Vol.41Issue(3)：19-22,26,5.DOI:10.16652/j.issn.1004-373x.2018.03.005
降低OFDM系统PAPR的低复杂度ACE-C算法
A low-complexity ACE-C algorithm for PAPR reduction in OFDM system
摘要
Abstract
Since the available active constellation extension of projection onto convex sets(ACE-POCS)algorithm has low convergence speed and high complexity in the process of peak-to-average power ratio(PAPR)suppression of orthogonal frequency division multiplexing (OFDM) signal,a new ACE-C algorithm based on ACE-POCS algorithm and clipping algorithm is pro-posed. The input data sequence is divided into two groups by means of the new algorithm to perform the less-point IFFT and FFT only in calculation process,which can reduce the algorithm complexity. The PAPR,complexity,bit error rate(BER)and performance of the new algorithm are studied and analyzed in OFDM system model modulated with 4QAM. The results show that,in comparison with ACE-POCS algorithm,the complexity of ACE-C algorithm is reduced by more than a half,the conver-gence speed is improved greatly,and the ACE-C algorithm needn′t transmit the sideband information. Besides,the new algo-rithm has a compromise-balanced capability in the aspects of PAPR suppression efficiency,complexity and BER.关键词
正交频分复用/峰均功率比/星座扩展/限幅分组/复杂度/收敛速度Key words
OFDM/peak-to-average power ratio/ACE/clipping grouping/complexity/convergence speed分类
信息技术与安全科学引用本文复制引用
韩硕,李艳萍,张博叶..降低OFDM系统PAPR的低复杂度ACE-C算法[J].现代电子技术,2018,41(3):19-22,26,5.基金项目
国家自然科学基金项目(61271249) Project Supported by National Natural Science Foundation of China (61271249) （61271249）
