On digit-recurrence division algorithms for self-timed circuits - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

On digit-recurrence division algorithms for self-timed circuits

Arnaud Tisserand


The optimization of algorithms for self-timed or asynchronous circuits requires specific solutions. Due to the variable-time capabilities of asynchronous circuits, the average computation time should be optimized and not only the worst case of the signal propagation. If efficient algorithms and implementations are known for asynchronous addition and multiplication, only straightforward algorithms have been studied for division. This paper compares several digit-recurrence division algorithms (speed, area and circuit activity for estimating the power consumption). The comparison is based on simulations of the different operators described at the gate level. This work shows that the best solutions for asynchronous circuits are quite different from those used in synchronous circuits.
Fichier principal
Vignette du fichier
RR-4221.pdf (171.84 Ko) Télécharger le fichier

Dates and versions

inria-00072398 , version 1 (24-05-2006)


  • HAL Id : inria-00072398 , version 1


Nicolas Boullis, Arnaud Tisserand. On digit-recurrence division algorithms for self-timed circuits. [Research Report] RR-4221, INRIA. 2001. ⟨inria-00072398⟩
85 View
501 Download


Gmail Facebook Twitter LinkedIn More