WestminsterResearch

A system for calculating the greatest common denominator implemented using asynchrobatic logic

Willingham, David J. and Kale, Izzet (2008) A system for calculating the greatest common denominator implemented using asynchrobatic logic. In: Ellervee, Peeter and Jervan, Gert and Nielsen, Ivan Ring, (eds.) 26th Norchip Conference, Tallinn, Estonia, 17 - 18 November 2008. Formal proceedings. IEEE, pp. 194-197. ISBN 9781424424924

[img]
Preview
PDF
214Kb

Official URL: http://dx.doi.org/10.1109/NORCHP.2008.4738310

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 16-bit implementation can perform a 24-cycle test vector in 2.067 mus with a power consumption of 3.257 nW.

Item Type:Book Section
Research Community:University of Westminster > Electronics and Computer Science, School of
ID Code:7390
Deposited On:27 Jan 2010 14:36
Last Modified:11 Aug 2010 15:36

Repository Staff Only: item control page