Willingham, David J. and Kale, Izzet (2008) A system for calculating the greatest common denominator implemented using asynchrobatic logic. In: 26th Norchip Conference, Tallinn, Estonia, 17  18 November 2008. Formal proceedings. IEEE, pp. 194197. ISBN 9781424424924

PDF
Willingham_Kale_2008_2_as_published.pdf Download (220kB) 
Abstract
An asynchrobatic system that uses Euclid's algorithm to calculate the greatest common denominator of two numbers is presented. This algorithm is a simple system that contains both repetition and decision, and therefore demonstrates that asynchrobatic logic can be used to implement arbitrarily complex computational systems. Under typical conditions on a 0.35 mum process, a 16bit implementation can perform a 24cycle test vector in 2.067 mus with a power consumption of 3.257 nW.
Item Type:  Book Section 

Subjects:  University of Westminster > Science and Technology > Electronics and Computer Science, School of (No longer in use) 
Depositing User:  Miss Nina Watts 
Date Deposited:  27 Jan 2010 14:36 
Last Modified:  11 Aug 2010 14:36 
URI:  http://westminsterresearch.wmin.ac.uk/id/eprint/7390 
Actions (login required)
Edit Item (Repository staff only) 