The convergence problems of conventional DC analysis can be partly avoided by using piecewise-linear analysis. This paper proposes a piecewise-linear DC analysis method that can e$ciently handle arbitrary couplings between non-linear circuit elements. Piecewise-linear modelling of the non-linear cir
Canonical piecewise-linear analysis: Generalized breakpoint hopping algorithm
โ Scribed by Leon O. Chua; An-Cheng Deng
- Publisher
- John Wiley and Sons
- Year
- 1986
- Tongue
- English
- Weight
- 794 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0098-9886
No coin nor oath required. For personal study only.
โฆ Synopsis
As an extension to the breakpoint hopping algorithm developed in reference 1, the algorithm presented in this paper efficiently solves the d.c. problem for finding the d.c. operating point(s) and for tracing the driuing-point and transfer characteristics of an extremely broad class of non-linear resistive circuits. In particular, bipolar and MOS transistor circuits are included. A user-friendly C program has been written to implement this algorithm where the input format for describing the circuit is compatible with the SPICE program.
๐ SIMILAR VOLUMES
In possibilistic regression analysis proposed by Tanaka and lshibuchi (1992), linear programming (LP) formulation of necessity analysis has no feasible solution under the enormous variation of the given data. This work proposes a general piecewise necessity regression analysis based on LP rather tha
A new efficient algorithm is presented for finding all driving-point characteristic (DP) and transfer characteristic (TC) plots for a broad class of piecewise-linear (PWL) resistive circuits without the need for initial points for each solution branch. The piecewise-linear circuits t o be considered