Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ognen J. Nastov

dblp:53/3126 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
4 papers
Electronic design automation · 80% Performance modeling and evaluation · 18% Integrated circuit design · 2%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
circuit simulation
0.142007
Fundamentals of Fast Simulation Algorithms for RF Circuits · Proc. IEEE 2007
Transient sensitivity computation in controlled explicit piecewiselinear simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2000
Time-Mapped Harmonic Balance · DAC 1999
Electronic design automation › circuit simulation
periodic steady-state analysis
0.112007
Fundamentals of Fast Simulation Algorithms for RF Circuits · Proc. IEEE 2007
Electronic design automation › circuit simulation › analog circuit simulation
RF circuit simulation
0.112007
Fundamentals of Fast Simulation Algorithms for RF Circuits · Proc. IEEE 2007
Performance modeling and evaluation › statistical analysis › sensitivity analysis
adjoint sensitivity analysis
0.012000
Transient sensitivity computation in controlled explicit piecewiselinear simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2000
Electronic design automation › circuit simulation › nonlinear circuit simulation
piecewise linear simulation
0.012000
Transient sensitivity computation in controlled explicit piecewiselinear simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2000
Performance modeling and evaluation › statistical analysis › sensitivity analysis
transient sensitivity analysis
0.012000
Transient sensitivity computation in controlled explicit piecewiselinear simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2000
Electronic design automation › circuit simulation › periodic steady-state analysis
harmonic balance
0.011999
Time-Mapped Harmonic Balance · DAC 1999
Performance modeling and evaluation › statistical analysis
sensitivity analysis
0.011998
Adjoint Transient Sensitivity Computation in Piecewise Linear Simulation · DAC 1998
Integrated circuit design
analog and mixed-signal circuits
0.012000
Transient sensitivity computation in controlled explicit piecewiselinear simulation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2000

Methods — techniques the papers use, named apart from their topics

shooting method · 0.1finite difference · 0.1basis-collocation · 0.1adjoint method · 0.0event-driven simulation · 0.0direct sensitivity method · 0.0spectral methods · 0.0shooting-newton method · 0.0krylov subspace method · 0.0piece-wise linear simulation · 0.0
YearPublicationVenuePosition
2007 Fundamentals of Fast Simulation Algorithms for RF Circuits
abstract
Designers of RF circuits such as power amplifiers, mixers, and filters make extensive use of simulation tools which perform periodic steady-state analysis and its extensions, but until the mid 1990s, the computational costs of these simulation tools restricted designers from simulating the behavior of complete RF subsystems. The introduction of fast matrix-implicit iterative algorithms completely changed this situation, and extensions of these fast methods are providing tools which can perform periodic, quasi-periodic, and periodic noise analysis of circuits with thousands of devices. Even though there are a number of research groups continuing to develop extensions of matrix-implicit methods, there is still no compact characterization which introduces the novice researcher to the fundamental issues. In this paper, we examine the basic periodic steady-state problem and provide both examples and linear algebra abstractions to demonstrate connections between seemingly dissimilar methods and to try to provide a more general framework for fast methods than the standard time-versus-frequency domain characterization of finite-difference, basis-collocation, and shooting methods
Ognen J. Nastov, Ricardo Telichevesky, Kenneth S. Kundert, Jacob K. White 0001
Proc. IEEE1
2000 Transient sensitivity computation in controlled explicit piecewiselinear simulation
abstract
This paper presents a general method for computing transient sensitivities using both direct and adjoint methods in controlled explicit event driven simulation algorithms that employ piecewise linear device models. Sensitivity information provides first order assessment of circuit variability with respect to design variables and parasitics. This information is particularly useful for noise analysis, timing rule generation, and circuit optimization. Techniques for incorporating transient sensitivity into adaptively controlled explicit simulation, a general piecewise linear simulator, are presented. Sensitivity computation includes algorithms to handle instantaneous charge redistribution due to the discontinuous conductance models of the piecewise linear elements, and the loss of simulation accuracy due to the nonmonotonic responses in autonomous adjoint circuits with nonzero initial conditions. Results demonstrate the efficiency and accuracy of the proposed techniques.
Tuyen V. Nguyen, Anirudh Devgan, Ognen J. Nastov, David W. Winston
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
1999 Time-Mapped Harmonic Balance
abstract
Matrix-implicit Krylov-subspace methods have made it possible to efficiently compute the periodic steady-state of large circuits using either the time-domain shooting-Newton method or the frequencydomain harmonic balance method. However, the harmonic balance methods are not so efficient at computing steady-state solutions with rapid transitions, and the low-order integration methods typically used with shooting-Newton methods are not so efficient when high accuracy is required. In this paper we describe a Time-Mapped Harmonic Balance method (TMHB), a fast Krylovsubspace spectral method that overcomes the inefficiency of standard harmonic balance in the case of rapid transitions. TMHB features a non-uniform grid to resolve the sharp features in the signals. Results on several examples demonstrate that the TMHB method achieves several orders of magnitude improvement in accuracy compared to the standard harmonic balance method. The TMHB method is also several times faster than the standard harmonic balance method in reaching identical solution accuracy. 1
Ognen J. Nastov, Jacob K. White 0001
DAC1
1998 Adjoint Transient Sensitivity Computation in Piecewise Linear Simulation
abstract
This paper presents a general method for computing transient sensitivities using the adjoint method in event driven simulation algorithms that employ piecewise linear device models. Sensitivity information provides first order assessment of circuit variability with respect to design variables and parasitics. This information is particularly useful for noise stability analysis, timing rule generation, and circuit optimization. Techniques for incorporating adjoint transient sensitivity into ACES, a general piecewise linear simulator, are presented. Sensitivity computation includes algorithms to handle instantaneous charge redistribution due to the discontinuous conductance models of the piecewise linear elements, and the loss of simulation accuracy due to the non-monotonous responses in autonomous adjoint circuits with non-zero initial conditions. Results demonstrate the efficiency and accuracy of the proposed techniques.
Tuyen V. Nguyen, Anirudh Devgan, Ognen J. Nastov
DAC3