|
 |
|
|
| Step 3 - Feasibility Optimization |
Input
- Unfeasible Circuit
- Violated Constraints
|
- Automated Detection of violated constraints
- Analysis of best constraint optimization
- Automated Feasibility Optimization
find closest, find central
- Design point best satisfies all constraints
|
Output
- Feasible Circuit
- Constraints fulfilled
|
Of all possible sizings (=set of values of the design parameters), only a few satisfy all sizing rules. The restricted design space that contains all sizings that satisfy all sizing rules, is called the "feasible region". For many circuits, the feasible region is very small (<1% of the total design space), and it is sometimes difficult to find a set of design parameter values that satisfies all sizing rules.
WiCkeDTM Automated Feasible Optimization automatically modifies design parameter values in order to find a feasible point in the design space. The user chooses between algorithms "find closest" and "find central". "Find closest" modifies given design parameter values as little as necessary to fulfill the sizing rules. This is useful when a few rules are slightly violated, however the design is otherwise considered acceptable. "Find central" over-fulfills all sizing rules as far as possible. This approach is useful for quickly finding an initial sizing.
|
|
|
