Abstract
Self-timed circuits present an attractive solution to the problem of process variation. However, implementing selftimed combinational logic is complex and expensive. This paper presents a novel method for synthesising indicating implementations of arbitrary encoded function blocks. The synthesis method reduces the cost of the implementations by distributing indication between the individual outputs of a function block. Covers are constructed by determining the minimal cost set of Prime Indicants which are required to indicate all of the input transitions of the function block. The results of the procedure are demonstrated on a wide range of combinational logic blocks and show a reduction in literal count of between 38-99%. © 2009 IEEE.
Original language | English |
---|---|
Title of host publication | Proceedings - International Symposium on Asynchronous Circuits and Systems|Proc. Int. Symp. Asynchr. Circuits Syst. |
Place of Publication | USA |
Publisher | IEE |
Pages | 139-150 |
Number of pages | 11 |
ISBN (Print) | 9780769536163 |
DOIs | |
Publication status | Published - 2009 |
Event | 15th International Symposium on Asynchronous Circuits and Systems, ASYNC 2009 - Chapel Hill, NC Duration: 1 Jul 2009 → … |
Conference
Conference | 15th International Symposium on Asynchronous Circuits and Systems, ASYNC 2009 |
---|---|
City | Chapel Hill, NC |
Period | 1/07/09 → … |
Keywords
- combinational circuits , network synthesis