A Simplified Constrained Bayesian Optimization Approach to Optimize the Tx Equalization in SerDes Channels

IF 0.9 Q4 ENGINEERING, ELECTRICAL & ELECTRONIC
Majid Ahadi Dolatsara
{"title":"A Simplified Constrained Bayesian Optimization Approach to Optimize the Tx Equalization in SerDes Channels","authors":"Majid Ahadi Dolatsara","doi":"10.1109/LEMCPA.2023.3247777","DOIUrl":null,"url":null,"abstract":"Design of high-speed channels has become increasingly more complicated. Due to the eye diagram closure at higher speeds, designers use Tx equalization by placing a finite impulse response (FIR) filter at Tx. Assigning the FIR tap values can be time consuming and require domain expertise since it can require sweeping hundreds or more combinations of tap values. Therefore, in this letter, we propose a machine learning optimization approach to find the FIR tap values which result in the largest eye opening. Conventional optimization techniques may not be applicable in this context since specifications of the channel can require a constraint, which is the sum of the absolute value of the FIR taps needs to be equal to 1. Therefore, we have developed a simplified constrained Bayesian optimization (BO) approach that can automate this process and expedite calculation of the FIR tap values without requiring domain expertise. Numerical examples are provided to show efficiency of the proposed approach and compare its performance with BO and genetic algorithm for this problem.","PeriodicalId":100625,"journal":{"name":"IEEE Letters on Electromagnetic Compatibility Practice and Applications","volume":"5 2","pages":"41-47"},"PeriodicalIF":0.9000,"publicationDate":"2023-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Letters on Electromagnetic Compatibility Practice and Applications","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10050342/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Design of high-speed channels has become increasingly more complicated. Due to the eye diagram closure at higher speeds, designers use Tx equalization by placing a finite impulse response (FIR) filter at Tx. Assigning the FIR tap values can be time consuming and require domain expertise since it can require sweeping hundreds or more combinations of tap values. Therefore, in this letter, we propose a machine learning optimization approach to find the FIR tap values which result in the largest eye opening. Conventional optimization techniques may not be applicable in this context since specifications of the channel can require a constraint, which is the sum of the absolute value of the FIR taps needs to be equal to 1. Therefore, we have developed a simplified constrained Bayesian optimization (BO) approach that can automate this process and expedite calculation of the FIR tap values without requiring domain expertise. Numerical examples are provided to show efficiency of the proposed approach and compare its performance with BO and genetic algorithm for this problem.
SerDes信道中Tx均衡优化的简化约束贝叶斯优化方法
高速通道的设计变得越来越复杂。由于眼图在更高速度下闭合,设计师通过在Tx处放置有限脉冲响应(FIR)滤波器来使用Tx均衡。分配FIR抽头值可能很耗时,并且需要领域专业知识,因为它可能需要扫描数百个或更多的抽头值组合。因此,在这封信中,我们提出了一种机器学习优化方法来寻找FIR抽头值,这会导致最大的眼睛睁开。传统的优化技术可能不适用于这种情况,因为信道的规范可能需要约束,即FIR抽头的绝对值之和需要等于1。因此,我们开发了一种简化的约束贝叶斯优化(BO)方法,该方法可以使这一过程自动化,并在不需要领域专业知识的情况下加快FIR抽头值的计算。数值算例表明了该方法的有效性,并将其与BO和遗传算法的性能进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信