Chunxiong Zheng, Xianwei Wen, Jinyu Zhang and Zhenya Zhou
{"title":"Asymptotic Theory for the Circuit Envelope Analysis","authors":"Chunxiong Zheng, Xianwei Wen, Jinyu Zhang and Zhenya Zhou","doi":"10.4208/jcm.2301-m2022-0208","DOIUrl":null,"url":null,"abstract":"Asymptotic theory for the circuit envelope analysis is developed in this paper. A typical feature of circuit envelope analysis is the existence of two significantly distinct timescales: one is the fast timescale of carrier wave, and the other is the slow timescale of modulation signal. We first perform pro forma asymptotic analysis for both the driven and autonomous systems. Then resorting to the Floquet theory of periodic operators, we make a rigorous justification for first-order asymptotic approximations. It turns out that these asymptotic results are valid at least on the slow timescale. To speed up the computation of asymptotic approximations, we propose a periodization technique, which renders the possibility of utilizing the NUFFT algorithm. Numerical experiments are presented, and the results validate the theoretical findings.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4208/jcm.2301-m2022-0208","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Asymptotic theory for the circuit envelope analysis is developed in this paper. A typical feature of circuit envelope analysis is the existence of two significantly distinct timescales: one is the fast timescale of carrier wave, and the other is the slow timescale of modulation signal. We first perform pro forma asymptotic analysis for both the driven and autonomous systems. Then resorting to the Floquet theory of periodic operators, we make a rigorous justification for first-order asymptotic approximations. It turns out that these asymptotic results are valid at least on the slow timescale. To speed up the computation of asymptotic approximations, we propose a periodization technique, which renders the possibility of utilizing the NUFFT algorithm. Numerical experiments are presented, and the results validate the theoretical findings.