11.12.2012 Views

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

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

indicating that this requirement is aggressive for this system at this uncertainty level.<br />

Therefore, to guarantee success through tailoring and tuning the system should be<br />

designed for maximum tunability <strong>with</strong> a robustness weight at or near α = 0. However,<br />

if this requirement is relaxed to 250µm then less tuning authority is necessary to<br />

meet requirements, and a higher weight, up to α =0.4, can be placed on robustness.<br />

Placing the maximum weight possible on robustness produces a design <strong>with</strong> a worst-<br />

case performance prediction that is closer to the requirement increasing the chance<br />

that the hardware will not need tuning at all.<br />

5.3.2 Hardware Simulations<br />

The results presented thus far indicate that the RPTT is more tunable than both<br />

the PT and RPT designs at the worst-case uncertainty vertex. This result is not<br />

surprising given the formulations of the design optimizations. PT does not consider<br />

uncertainty at all, and RPT is only concerned <strong>with</strong> being robust to uncertainty at<br />

the worst-case vertex and does not take advantage of hardware tuning. The RPTT<br />

formulation anticipates the decrease in uncertainty effected by building hardware and<br />

incorporates that benefit into the design by allowing different tuning configurations<br />

at each uncertainty vertex and minimizing the worst-case tuned performance. As a<br />

result, it is guaranteed that RPTT is tunable at the uncertainty vertices, but it is<br />

unclear if that assumption holds throughout the rest of the uncertainty space. In this<br />

final section, a series of hardware simulations are run to evaluate the performance of<br />

the designs across all of the uncertainty space.<br />

The algorithm used to generate the hardware simulations is given in Figure 5-6.<br />

The outer loop in the algorithm is over the number of simulations desired, nsims.<br />

For each simulation an uncertainty realization, �pMC, is chosen randomly from the<br />

uncertainty model. Recall from Equation 3.1 that the uncertainty values in the SCI<br />

development model are assumed to be uniformly distributed about the nominal val-<br />

ues <strong>with</strong>in bounds of ±∆%. A hardware simulation is generated for each of the three<br />

designs, PT, RPT and RPTT, by applying �pMC to the models and evaluating the<br />

performance, σHW. The hardware performance is then compared to the requirement.<br />

169

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!