HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Automatic generation of 1-of-M QDI asynchronous adders

Abstract : This paper presents generalized structures to design 1-of-M QDI (quasi delay-insensitive) asynchronous adders. These structures allow one to design from simple ripple-carry adders to faster parallel-prefix adders. The proposed method is fully automated and integrated in the TAST (TIMA asynchronous synthesis tool) tools suite. This work also demonstrates that the most widely used dual-rail encoding (binary representation in QDI circuits) is not the best solution for number representation in asynchronous circuits. According to the domain of values to be represented, increasing the base leads to parallel-prefix adders with lower area, delay and power consumption. Hence, this work enables the designer to optimize his/her design by choosing the appropriated 1-of-M number representation.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00009582
Contributor : Lucie Torella Connect in order to contact the contributor
Submitted on : Thursday, October 6, 2005 - 2:18:57 PM
Last modification on : Friday, December 11, 2020 - 8:28:03 AM

Identifiers

  • HAL Id : hal-00009582, version 1

Collections

TIMA | CNRS | UGA

Citation

J. Fragoso, G. Sicard, Marc Renaudin. Automatic generation of 1-of-M QDI asynchronous adders. Proceedings-16th-Symposium-on-Integrated-Circuits-and-Systems-Design.-SBCCI-, 2003, Sao Paulo, Brazil. pp.149-54. ⟨hal-00009582⟩

Share

Metrics

Record views

84