RECURSIVE CONVOLUTION ALGORITHMS FOR TIME-DOMAIN SIMULATION OF ELECTRONIC CIRCUITS
Blankiewicz Grzegorz 1, Janke Włodzimierz 2
1Techn. University of Gdańsk, Dept. of Electronics, Telecommunication and Informatics
Narutowicza 11, 80-952 Gdańsk, Poland
2Techn University of Koszalin, Dept of Electronics
Partyzantów 17, 75-411 Koszalin, Poland
Received:
Received 10 June, 2001
DOI: 10.12921/cmst.2001.07.02.91-109
OAI: oai:lib.psnc.pl:524
Abstract:
A family of semi-analytical recursive algorithms of convolution calculations as a convenient tool for electronic circuit simulation is described. The formulas defining these algorithms are presented and their numerical performance – accuracy, numerical complexity and stability are analyzed. The main purpose of this paper is to compare the recursive convolution algorithms with the known algorithms of differential equation integration in application to time-domain circuit simulation. In addition, simple examples of simulation are presented. The main advantage of the proposed approach results from the excellent stability performance of recursive convolution algorithms.
Key words:
numerical algorithms, recursive convolution, time-domain circuit simulation
References:
[1] L. O. Chua and P. M. Lin, Computer-aided analysis of electronic circuits, Prentice Hall (1975).
[2] L. T. Pillage and R. A. Rohrer, IEEE Trans, on Computer Aided Design, 9, 352 (1990).
[3] C. L. Ratzlaff and L. T. Pillage, RICE, IEEE Trans, on Computer Aided Design, 13, 763 (1994).
[4] T. Pillage and R. A. Rohrer, IEEE Circuits & Devices Magazine, 12 (1994).
[5] F. Y. Chang, IEEE Trans, on Computers, Packaging and Manufacturing Technology — Part B:
Advanced Packaging, 17, 3 (1994).
[6] M. Celik, O. Ocali, M. A. Tan, A. Atalar, IEEE Trans, on Circuits and Systems – 1 : Fundamental
Theory and Applications, 42, 6 (1995).
[7] F. Y. Chang, IEEE Trans, on Circuit and Systems – P. Fundamental Theory and Application, 39,
180(1992).
[8] K. G. Nichols et al., IEE Proceedings – Circuits Devices Systems. 141( 4), 242 (1994).
[9] N. Mohan et al., Proc. IEEE, 82(8), 1287 (1994).
[10] C. W. Gear, IEEE Trans. Circuit Theory, 18, 89 (1971).
[11] S. Lin and E. S. Kuh, IEEE Trans, on Circuits and Systems – P. Fundamental Theory and
Applications, 39, 879 (1992).
[12] T. V. Nguyen, IEEE Trans, on Computer-Aided Design oflntegrated Circuits and Systems, 13, 1301 (1994).
[13] W. Janke and J. Zarębski, ISCAS, 2377 (1990).
[14] A. Samlyen and A. Dabuleanu, IEEE Trans. Power App. Sys., 94, 561 (1975).
[15] W. Janke and G. Blakiewicz, IEE Proc. – Circuits Devices Sys., 142, 125 (1995).
[16] G. Blakiewicz and W. Janke, Proc of ECCTD’95, 2, 851 (1995).
[17] G. Blakiewicz and W. Janke, Proc. of The European Conference on Circuit Theory and Design, 3, 1452 (1997).
[18] B. Lindberg, BIT 14, 430 (1974).
[19] W. Janke and W. Pietrenko, Proc. of Third IEEE Conference on Electronics, Circuits and Systems (ICECS’96), 880 (1996).
A family of semi-analytical recursive algorithms of convolution calculations as a convenient tool for electronic circuit simulation is described. The formulas defining these algorithms are presented and their numerical performance – accuracy, numerical complexity and stability are analyzed. The main purpose of this paper is to compare the recursive convolution algorithms with the known algorithms of differential equation integration in application to time-domain circuit simulation. In addition, simple examples of simulation are presented. The main advantage of the proposed approach results from the excellent stability performance of recursive convolution algorithms.
Key words:
numerical algorithms, recursive convolution, time-domain circuit simulation
References:
[1] L. O. Chua and P. M. Lin, Computer-aided analysis of electronic circuits, Prentice Hall (1975).
[2] L. T. Pillage and R. A. Rohrer, IEEE Trans, on Computer Aided Design, 9, 352 (1990).
[3] C. L. Ratzlaff and L. T. Pillage, RICE, IEEE Trans, on Computer Aided Design, 13, 763 (1994).
[4] T. Pillage and R. A. Rohrer, IEEE Circuits & Devices Magazine, 12 (1994).
[5] F. Y. Chang, IEEE Trans, on Computers, Packaging and Manufacturing Technology — Part B:
Advanced Packaging, 17, 3 (1994).
[6] M. Celik, O. Ocali, M. A. Tan, A. Atalar, IEEE Trans, on Circuits and Systems – 1 : Fundamental
Theory and Applications, 42, 6 (1995).
[7] F. Y. Chang, IEEE Trans, on Circuit and Systems – P. Fundamental Theory and Application, 39,
180(1992).
[8] K. G. Nichols et al., IEE Proceedings – Circuits Devices Systems. 141( 4), 242 (1994).
[9] N. Mohan et al., Proc. IEEE, 82(8), 1287 (1994).
[10] C. W. Gear, IEEE Trans. Circuit Theory, 18, 89 (1971).
[11] S. Lin and E. S. Kuh, IEEE Trans, on Circuits and Systems – P. Fundamental Theory and
Applications, 39, 879 (1992).
[12] T. V. Nguyen, IEEE Trans, on Computer-Aided Design oflntegrated Circuits and Systems, 13, 1301 (1994).
[13] W. Janke and J. Zarębski, ISCAS, 2377 (1990).
[14] A. Samlyen and A. Dabuleanu, IEEE Trans. Power App. Sys., 94, 561 (1975).
[15] W. Janke and G. Blakiewicz, IEE Proc. – Circuits Devices Sys., 142, 125 (1995).
[16] G. Blakiewicz and W. Janke, Proc of ECCTD’95, 2, 851 (1995).
[17] G. Blakiewicz and W. Janke, Proc. of The European Conference on Circuit Theory and Design, 3, 1452 (1997).
[18] B. Lindberg, BIT 14, 430 (1974).
[19] W. Janke and W. Pietrenko, Proc. of Third IEEE Conference on Electronics, Circuits and Systems (ICECS’96), 880 (1996).
