Effects of demodulator errors on convergence time of look-up table based iterative algorithms for adaptive digital predistortion linearizer

K. Lee, P. Gardner
{"title":"Effects of demodulator errors on convergence time of look-up table based iterative algorithms for adaptive digital predistortion linearizer","authors":"K. Lee, P. Gardner","doi":"10.1109/MWSCAS.2004.1354018","DOIUrl":null,"url":null,"abstract":"This work presents, for the first time, a simulation study of the effects of demodulator errors on look-up table (LUT) based iterative algorithms for adaptive digital predistortion (ADP) linearizer. We compare the iterative algorithms found in one-dimensional LUT, namely the polar, secant and linear methods, on the convergence time with and without demodulator errors in the feedback path of the ADP. Simulation shows that the secant method, although it has the fastest convergence, is sensitive to changes in demodulator errors, which could be corrected by adding an adaptation factor to its formula. The polar method is the least sensitive out of the three to demodulator errors, followed by the linear method.","PeriodicalId":185817,"journal":{"name":"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.2004.1354018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This work presents, for the first time, a simulation study of the effects of demodulator errors on look-up table (LUT) based iterative algorithms for adaptive digital predistortion (ADP) linearizer. We compare the iterative algorithms found in one-dimensional LUT, namely the polar, secant and linear methods, on the convergence time with and without demodulator errors in the feedback path of the ADP. Simulation shows that the secant method, although it has the fastest convergence, is sensitive to changes in demodulator errors, which could be corrected by adding an adaptation factor to its formula. The polar method is the least sensitive out of the three to demodulator errors, followed by the linear method.
解调误差对自适应数字预失真线性器查找表迭代算法收敛时间的影响
这项工作首次提出了解调误差对基于查找表(LUT)的自适应数字预失真(ADP)线性器迭代算法的影响的仿真研究。我们比较了在一维LUT中发现的迭代算法,即极线法、割线法和线性法,在ADP的反馈路径上有和没有解调器误差的收敛时间。仿真结果表明,割线法虽然收敛速度快,但对解调误差的变化很敏感,可以通过在其公式中加入自适应因子进行校正。在三种解调方法中,极坐标法对解调误差最不敏感,其次是线性法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信