| Chapter title | A system for calculating the greatest common denominator implemented using asynchrobatic logic |
|---|
| Authors | Willingham, D.J. and Kale, I. |
|---|
| Editors | Ellervee, P., Jervan, G. and Nielsen, I.R. |
|---|
| 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. |
|---|
| Book title | 26th Norchip Conference, Tallinn, Estonia, 17 - 18 November 2008. Formal proceedings |
|---|
| Page range | 194-197 |
|---|
| Year | 2008 |
|---|
| Publisher | IEEE |
|---|
| Publication dates |
|---|
| Published | 2008 |
|---|
| ISBN | 9781424424924 |
|---|
| Digital Object Identifier (DOI) | https://doi.org/10.1109/NORCHP.2008.4738310 |
|---|
| File | |
|---|