Asynchronous Computer Arithmetic

Rajit Manohar 

Thursday, November 10, 2011 
11:00 AM, 1240 CS
(Cookies: 10:30)

Abstract: The time and energy complexity of arithmetic operations are highly dependent on their input operands. Synchronous implementations tend to treat all input scenarios uniformly due to a uniform clock cycle period constraint. In this talk I will show how asynchronous circuits can exploit operand-dependent behavior to provide implementations of common arithmetic operations that are, on average, more efficient than conventional solutions.