Predicting Bounds on Ranges of Variables in an Algorithm using Polynomials

Add to your list(s) Download to your calendar using vCal

• David P Boland (Imperial College)
• Friday 10 July 2009, 12:00-13:00
• Room 611, EEE.

If you have a question about this talk, please contact George A Constantinides.

The amount of precision used in an algorithm trades error for silicon area usage, impacting the potential parallelism. This talk will walk through a formal description of a method which first constructs a polynomial describing the potential range of any variable in an algorithm and then uses this to calculate robust bounds for the range of this variable. It will then demonstrate the benefits of this approach on some simple test cases, and highlight the current limitations of this work.

This talk is part of the CAS Talks series.

This talk is included in these lists:

• Andrea Picciau's list
• CAS Talks
• Circuits and Systems Group: Internal Seminars
• Room 611, EEE

Note that ex-directory lists are not shown.