In this paper, we propose a class of division algorithms with the aim of reducing the delay of the selection of the quotient digit by introducing more concurrency and flexibility in its computation. From the proposed class of algorithms, we select one that moves part of the selection function out of the critical path, with a corresponding reduction in the critical path compared with existing alternatives. We present the algorithm and describe the architectures for radix 4 and for radix 16. For radix 16, we use the scheme of overlapping two radix-4 stages. In both cases, radix 4 and radix 16, we show that our algorithms allow the design of units with well-balanced critical paths with consequent decreases of the cycle times. Moreover, in the radix-16 case, we include some additional speculation techniques. To estimate the speedup, we used a rough timing model based on logical effort. For both radices, we estimate a speedup of about 25 percent with respect to previous implementations. In the radix-4 case, this is achieved by using roughly the same area, while, in the radix-16 case, the area is increased by about 30 percent. We verified our estimations by performing a synthesis of the radix-4 units.
Digit-recurrence dividers with reduced logical depth / ANTELO E; LANG T; MONTUSCHI P.; NANNARELLI A. - In: IEEE TRANSACTIONS ON COMPUTERS. - ISSN 0018-9340. - STAMPA. - 54:7(2005), pp. 837-851.
|Titolo:||Digit-recurrence dividers with reduced logical depth|
|Data di pubblicazione:||2005|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1109/TC.2005.115|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto:
|Digit-recurrence dividers with reduced logical depth.pdf||2. Post-print / Author's Accepted Manuscript||Non Pubblico - Accesso privato/ristretto||Administrator Richiedi una copia|