A system for calculating the Greatest Common Denominator implemented using Asynchrobatic Logic

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