### Abstract

Often radix-2 division algorithms make use of over redundant digit-set in the selection of the quotient digits. The final step in such a division algorithm is the conversion of the quotient to the conventional two's complement notation. The best approach for this conversion, in the case of non-over-redundant digit sets, is the on-the-fly technique. In this paper, we explore two different alternatives to the on-the-fly conversion algorithm, for the conversion of an integer number from the radix-2 over-redundant representation into the two's complement notation. In the direct conversion approach, the conversion is realized in one step. In the redundancy reduction approach, the conversion is achieved in two steps: a redundancy reduction step and a binary conversion step. The discussion is carried out assuming no restrictions on the sequence of radix-2 over-redundant digits. Our main conclusion is that the redundancy reduction approach is the most efficient.

Original language | English (US) |
---|---|

Pages (from-to) | 81-84 |

Number of pages | 4 |

Journal | Proceedings - IEEE International Symposium on Circuits and Systems |

Volume | 4 |

State | Published - Jan 1 1996 |

### Fingerprint

### Cite this

*Proceedings - IEEE International Symposium on Circuits and Systems*,

*4*, 81-84.

**Radix-2 over-redundant digit set converters.** / Montalvo, Luis A.; Parhi, Keshab K.

Research output: Contribution to journal › Article

*Proceedings - IEEE International Symposium on Circuits and Systems*, vol. 4, pp. 81-84.

}

TY - JOUR

T1 - Radix-2 over-redundant digit set converters

AU - Montalvo, Luis A.

AU - Parhi, Keshab K

PY - 1996/1/1

Y1 - 1996/1/1

N2 - Often radix-2 division algorithms make use of over redundant digit-set in the selection of the quotient digits. The final step in such a division algorithm is the conversion of the quotient to the conventional two's complement notation. The best approach for this conversion, in the case of non-over-redundant digit sets, is the on-the-fly technique. In this paper, we explore two different alternatives to the on-the-fly conversion algorithm, for the conversion of an integer number from the radix-2 over-redundant representation into the two's complement notation. In the direct conversion approach, the conversion is realized in one step. In the redundancy reduction approach, the conversion is achieved in two steps: a redundancy reduction step and a binary conversion step. The discussion is carried out assuming no restrictions on the sequence of radix-2 over-redundant digits. Our main conclusion is that the redundancy reduction approach is the most efficient.

AB - Often radix-2 division algorithms make use of over redundant digit-set in the selection of the quotient digits. The final step in such a division algorithm is the conversion of the quotient to the conventional two's complement notation. The best approach for this conversion, in the case of non-over-redundant digit sets, is the on-the-fly technique. In this paper, we explore two different alternatives to the on-the-fly conversion algorithm, for the conversion of an integer number from the radix-2 over-redundant representation into the two's complement notation. In the direct conversion approach, the conversion is realized in one step. In the redundancy reduction approach, the conversion is achieved in two steps: a redundancy reduction step and a binary conversion step. The discussion is carried out assuming no restrictions on the sequence of radix-2 over-redundant digits. Our main conclusion is that the redundancy reduction approach is the most efficient.

UR - http://www.scopus.com/inward/record.url?scp=0029708025&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029708025&partnerID=8YFLogxK

M3 - Article

VL - 4

SP - 81

EP - 84

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

ER -