An efficient DC root solving algorithm with guaranteed convergence for analog integrated CMOS circuits.
Francky LeynGeorges G. E. GielenWilly M. C. SansenPublished in: ICCAD (1998)
Keyphrases
- dynamic programming
- dc programming
- search space
- analog vlsi
- learning algorithm
- computational complexity
- k means
- iterative algorithms
- worst case
- computationally efficient
- convergence rate
- combinatorial optimization
- detection algorithm
- expectation maximization
- linear programming
- simulated annealing
- preprocessing
- optimal solution
- tree structure
- matching algorithm
- transfer function
- np hard
- global convergence
- convergence property
- gradient projection