Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


ucin1175881373.pdf (536.63 KB)

ETD Abstract Container

Abstract Header

AN INVESTIGATION OF THE SIMULATABILITY OF ITERATIVE METHODS FOR ANALYZING ANALOG CIRCUIT BEHAVIOR

SESHADRI, DILIP
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1175881373

Abstract Details

2007, MS, University of Cincinnati, Engineering : Computer Engineering.
Verification of electronic circuits is a process by which a circuit is shown to behave in a certain manner. For analog circuits, the only prevalent method of verification is simulation. Analog simulation is a lengthy and complex process. Simulating an analog circuit implies solving a complex system of Differential and Algebraic Equations (DAEs). It is a time consuming and arduous task to derive the solution of a system of DAEs. Simulators which solve an analog system do not provide appropriate error messages in cases of faults during simulations. However, certain important conclusions can be inferred about the matrix derived from the system of DAEs by using fundamental principles of linear algebra and matrix properties. These conclusions provide useful insight in identifying whether a given set of equations are solvable or not, which is equivalent to determining if a given circuit is simulatable or not. This principle of predicting simulation forms the core of this thesis. Prediction of linear system of equations and linear circuits is performed in this research and the results are verified. The application of prediction to non-linear circuits merits an experiment called matrix perturbations which helps in understanding the nature of non-linear circuits. Conclusive results from the matrix perturbation experiment indicate that the prediction of non-linear system of equations is possible, but only after the linearization step. A matrix which is positive definite at the first iterative step continues to remain so, with a probability of 33%. Also, a matrix which is singular at the first iterative step continues to remain so, with a probability of 22%. Application to non-linear circuits produces results which show us that circuits which yield an initial matrix to be positive definite at the first iterative step, has a 44.68 % probability of remaining positive definite. Similarly, circuits which yield an initial matrix to be singular at the first iterative step, has a 60.18 % probability of remaining singular. Thus inclusion of prediction system as part of the analog simulation process is very helpful. But, keeping in mind the time overhead for the prediction of simulation, the results obtained from our research show that it is sufficient to conduct the prediction test at the first iteration of every simulation process.
Dr. Harold Carter (Advisor)
83 p.
Analog Simulator; Simulatability; Simulation process

Recommended Citations

Citations

  • SESHADRI, D. (2007). AN INVESTIGATION OF THE SIMULATABILITY OF ITERATIVE METHODS FOR ANALYZING ANALOG CIRCUIT BEHAVIOR [Master's thesis, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1175881373

    APA Style (7th edition)

  • SESHADRI, DILIP. AN INVESTIGATION OF THE SIMULATABILITY OF ITERATIVE METHODS FOR ANALYZING ANALOG CIRCUIT BEHAVIOR. 2007. University of Cincinnati, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1175881373.

    MLA Style (8th edition)

  • SESHADRI, DILIP. "AN INVESTIGATION OF THE SIMULATABILITY OF ITERATIVE METHODS FOR ANALYZING ANALOG CIRCUIT BEHAVIOR." Master's thesis, University of Cincinnati, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1175881373

    Chicago Manual of Style (17th edition)

ucin1175881373
692
© 2007, all rights reserved.
This open access ETD is published by University of Cincinnati and OhioLINK.