HIGH-RADIX MULTIPLIER-DIVIDER

摘要

The high-radix multiplier-divider provides a system and method utilizing an SRT digit recurrence algorithm that provides for simultaneous multiplication and division using a single recurrence relation. When A, B, D and Q are fractions (e.g., Q=0·_q−1 q₋₂ . . . q_−n), then the algorithm provides for computing; $$ S=\frac{\mathrm{AB}}{D}$$ ;to yield a w-bit quotient Q and w-bit remainder R by: (1) determining the next quotient digit q_−j using a quotient digit selection function; (2) generating the product q_−jD; and (3) performing the triple addition of rR_j−1, (−q_−jD) and; $$ b_{-\left(j-1\right)}\left(\frac{A}{r}\right)$$ ;where R₀=b₋₁A_r⁻¹. The recurrence relation may be implemented with carry-save adders for computation using bitwise logical operators (AND, OR, XOR).