Abstract | ||
---|---|---|
In this work, we present a radix-10 division unit that is based on the digit-recurrence algorithm and implements binary encodings (Binary Integer Decimal or BID) for significands. Recent decimal division designs are all based on the Binary Coded Decimal (BCD) encoding. We adapt the radix-10 digit-recurrence algorithm to BID representation and implement the division unit in standard cell technology. The implementation of the proposed BID division unit is compared to that of a BCD based unit implementing the same algorithm. The comparison shows that for normalized operands the BID unit has the same latency as the BCD unit and reduced area, but the normalization is more expensive when implemented in BID. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1109/ASAP.2009.42 | ASAP |
Keywords | Field | DocType |
recent decimal division design,bid unit,division unit,bid representation,radix-10 digit-recurrence algorithm,bcd unit,digit-recurrence algorithm,binary integer decimals,proposed bid division unit,binary coded decimal,radix-10 division unit,computer architecture,silicon,data mining,arithmetic,adders,hardware,convergence,informatics,encoding,registers,division,computer science | Adder,Computer science,Operand,Algorithm,Binary Integer Decimal,Standard cell,Decimal,Binary-coded decimal,Binary number,Encoding (memory) | Conference |
ISSN | Citations | PageRank |
2160-0511 | 3 | 0.38 |
References | Authors | |
7 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Tomás Lang | 1 | 3 | 0.38 |
Alberto Nannarelli | 2 | 190 | 20.41 |