Closed-Loop Sign Algorithms for Low-Complexity Digital Predistortion

P. Campo, Vesa Lampu, L. Anttila, Alberto Brihuega, M. Allén, M. Valkama
{"title":"Closed-Loop Sign Algorithms for Low-Complexity Digital Predistortion","authors":"P. Campo, Vesa Lampu, L. Anttila, Alberto Brihuega, M. Allén, M. Valkama","doi":"10.1109/IMS30576.2020.9223904","DOIUrl":null,"url":null,"abstract":"In this paper, we study digital predistortion (DPD) based linearization with specific focus on millimeter wave (mmW) active antenna arrays. Due to the very large channel bandwidths and beam-dependence of nonlinear distortion in such systems, we propose a closed-loop DPD learning architecture, look-up table (LUT) based memory DPD models, and low-complexity sign-based estimation algorithms, such that even continuous DPD learning could be technically feasible. To this end, three different learning algorithms - sign, signed regressor, and sign-sign - are formulated for the LUT-based DPD models, such that the potential rank deficiencies, experienced in earlier methods, are avoided. Then, extensive RF measurements utilizing a state-of-the-art mmW active antenna array system at 28 GHz are carried out and reported to validate the methods. Additionally, the processing and learning complexities of the considered methods are analyzed, which together with the measured linearization performance figures allow to assess the complexity-performance tradeoffs. Overall, the results show that efficient mmW array linearization can be obtained through the proposed methods.","PeriodicalId":6784,"journal":{"name":"2020 IEEE/MTT-S International Microwave Symposium (IMS)","volume":"29 1","pages":"841-844"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE/MTT-S International Microwave Symposium (IMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMS30576.2020.9223904","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, we study digital predistortion (DPD) based linearization with specific focus on millimeter wave (mmW) active antenna arrays. Due to the very large channel bandwidths and beam-dependence of nonlinear distortion in such systems, we propose a closed-loop DPD learning architecture, look-up table (LUT) based memory DPD models, and low-complexity sign-based estimation algorithms, such that even continuous DPD learning could be technically feasible. To this end, three different learning algorithms - sign, signed regressor, and sign-sign - are formulated for the LUT-based DPD models, such that the potential rank deficiencies, experienced in earlier methods, are avoided. Then, extensive RF measurements utilizing a state-of-the-art mmW active antenna array system at 28 GHz are carried out and reported to validate the methods. Additionally, the processing and learning complexities of the considered methods are analyzed, which together with the measured linearization performance figures allow to assess the complexity-performance tradeoffs. Overall, the results show that efficient mmW array linearization can be obtained through the proposed methods.
低复杂度数字预失真的闭环符号算法
在本文中,我们研究了基于数字预失真(DPD)的线性化,特别关注毫米波(mmW)有源天线阵列。由于这种系统中非常大的信道带宽和非线性失真的波束依赖性,我们提出了一种闭环DPD学习架构,基于查找表(LUT)的记忆DPD模型和低复杂度的基于符号的估计算法,这样即使连续DPD学习在技术上也是可行的。为此,为基于lut的DPD模型制定了三种不同的学习算法-符号,有符号回归器和符号-符号,从而避免了早期方法中遇到的潜在秩缺陷。然后,利用最先进的毫米波有源天线阵列系统在28 GHz进行了广泛的射频测量,并报告了验证方法的方法。此外,还分析了所考虑的方法的处理和学习复杂性,并结合测量的线性化性能数据来评估复杂性与性能之间的权衡。总体而言,结果表明,通过提出的方法可以获得有效的毫米波阵列线性化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信