Differential equation description and Chebyshev approximation of linear time-invariant circuits

被引:0
作者
Huang, Liang [1 ]
Yao, Chang [2 ]
机构
[1] Beijing Jiaotong Univ, Sch Elect & Informat Engn, Beijing 100044, Peoples R China
[2] Natl Nat Sci Fdn China, Informat Ctr, Beijing 100085, Peoples R China
基金
中国国家自然科学基金; 高等学校博士学科点专项科研基金;
关键词
analogue circuit; approximation theory; Chebyshev polynomial; differential equation; FOURIER-SERIES; POLYNOMIALS; SIMULATION; INTERPOLATION; ZEROS; COEFFICIENTS; EXPANSION; SYSTEMS; NODES;
D O I
10.1002/cta.2461
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The approximation technology of analogue circuit functions is crucial to the computer-aided simulation, analysis, and design automation of electronic circuits. Chebyshev polynomials and various differential equations are proposed in this paper to approximate the functions of linear time-invariant circuits. The coefficient calculation methods of the Chebyshev expansion and the differential equation matrices are thoroughly deduced, and the construction methods employed in the functions and the actual time mapping of the linear time-invariant circuits are presented in this paper. An example of an analogue filter verifies the effectiveness and accuracy of the proposed approximation algorithm and elaborates on the selection process of the order number and the time step length of the Chebyshev expansion according to the demanded truncation error.
引用
收藏
页码:1111 / 1122
页数:12
相关论文
共 34 条