Abstract
This paper describes the theory and design of digital high-radix multiplier-dividers (Patent Pending). The theory of high-radix division is extended to high-radix multiplier-dividers that can perform fused multiplication and division operations using a single recurrence relation. With the fused implementation of multiplication and division, the two operations can be executed using a single instruction, implying only a single rounding operation. The recurrence relation is described, the quotient digit selection function derived, and important design parameters together with their optimal values and relations are defined. Efficient design procedure and implementation hardware are described and important system parameter values for various radix systems computed. Compared to pure dividers, the multiplier-divider requires a slightly more complex data path and quotient digit selection function.
| Original language | English |
|---|---|
| Article number | 5453337 |
| Pages (from-to) | 1009-1022 |
| Number of pages | 14 |
| Journal | IEEE Transactions on Computers |
| Volume | 59 |
| Issue number | 8 |
| DOIs | |
| State | Published - 2010 |
Bibliographical note
Funding Information:The authors would like to acknowledge the support of the Computer Engineering Department of King Fahd University of Petroleum & Minerals (KFUPM) and King Abdul-Aziz City for Science & Technology (KACST). This work was partially supported by a grant from King Abdul-Aziz City for Science & Technology under grant AR 22-17. The authors would like to also acknowledge the reviewers of the paper as well as the associate editor Professor Elisardo Antelo for their insightful comments and suggestions that have further improved the quality of the work presented here.
Keywords
- Computer arithmetic
- SRT
- division
- multiplier-divider
- quotient digit selection
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics