Chapter 5 Robust Performance Tailoring with Tuning - SSL - MIT
Chapter 5 Robust Performance Tailoring with Tuning - SSL - MIT
Chapter 5 Robust Performance Tailoring with Tuning - SSL - MIT
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
for tailoring, but tuning parameters are the design variables:<br />
min z<br />
�y,z<br />
(4.12)<br />
s.t. �g(˜x, �y) ≤ 0<br />
hi (z, ˜x, �y, �pi)) ≤ 0 i =1...npv<br />
where the augmented constraints, hi (z, ˜x, �y, �pi), are defined as follows:<br />
hi (z, ˜x, �y, �pi) =−z + f (˜x, �y, �pi) (4.13)<br />
The goal of the AO tuning optimization is to find a set of tuning parameters that<br />
reduce the worst-case model performance over the uncertainty vertices. The resulting<br />
tuning parameters are then used to tune the hardware.<br />
Worst-Case Model <strong>Tuning</strong><br />
Another approach that is similar in nature to nominal model tuning and less con-<br />
servative than AO tuning is worst-case model tuning. Instead of tuning the nominal<br />
model to find a tuning configuration, or trying to tune over the entire uncertainty<br />
space, only the model at the worst-case uncertainty vertex is tuned. The worst-case<br />
combination of uncertainty parameters is found by searching over the uncertainty ver-<br />
tices of the untuned model. If the design has been tailored <strong>with</strong> RPT methods then<br />
this information may already be available. The optimization formulation is similar to<br />
that of nominal model tuning <strong>with</strong> the worst-case uncertainty values, �pWC, replacing<br />
the nominal values:<br />
min f (˜x, �y, �pWC)<br />
�y<br />
(4.14)<br />
s.t. �g (˜x, �y) ≤ 0<br />
129