基于RLS_DCD的查找表更新算法  

Look-up Table Update Algorithm based on RLS_DCD

作　　者：刘忠乐[1] 蔡灿辉[1] 强建龙[1] 

机构地区：[1]华侨大学信息科学与工程学院,福建厦门361021

出　　处：《通信技术》2013年第5期111-114,共4页Communications Technology

摘　　要：在间接学习结构的数字预失真技术中,需要使用自适应算法来更新查找表(LUT,Look UpTable)。在各种自适应算法中,RLS算法收敛快但是复杂度高。为降低其计算复杂度,这里提出采用二维坐标下降的RLS(RLS_DCD,RLS using Dichotomous Coordinate Descent)算法更新查找表,达到在数字预失真器系数的预测过程中以较低的运算量实现快速收敛的目的。仿真结果和分析表明,与采用RLS的自适应查找表更新算法比较,在邻信道功率比(ACPR,Adjacent Channel Power Ratio)改善指标相当的情况下,采用RLS_DCD的自适应查找表更新算法能大幅度降低其运算量。For the digital predistortion technology of indirect learning structure an adaptive algorithm is adopted to update the look-up table. Among those adaptive algorithms, RLS algorithm is fast in convergence but complex in computing. To reduce this computational complexity, RLS_DCD （RLS using dichotomous coordinate descent） algorithm for look-up table update is proposed, thus realizing fast convergence with fairly low computational complexity in the prediction of predistortion coefficients. Simulation and analysis results indicate that as compared with RLS-based look-up table update algorithm, the proposed algorithm could greatly reduce the computational complexity under the same condition of improved ACPR （Adjacent Channel Power Ratio）.

关 键 词：数字预失真 查找表 RLS_DCD 计算复杂度 

分 类 号：TN929.5[电子电信—通信与信息系统]