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.
|Title of host publication||Proceedings of 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP '09)|
|Publication status||Published - 2009|
|Event||20th IEEE International Conference on Application-specific Systems, Architectures and Processors - Boston, USA.|
Duration: 1 Jan 2009 → …
|Conference||20th IEEE International Conference on Application-specific Systems, Architectures and Processors|
|Period||01/01/2009 → …|