Radix-2 SRT division algorithm with simple quotient digit selection

1991 ◽  
Vol 27 (21) ◽  
pp. 1910 ◽  
Author(s):  
N. Burgess
Keyword(s):  
Division Algorithm ◽  
Quotient Digit ◽  
Simple Quotient

scholarly journals Review of Basic Classes of Dividers Based on Division Algorithm

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 23035-23069
Author(s):  
Udayan S. Patankar ◽  
Ants Koel
Keyword(s):  
Division Algorithm

scholarly journals Analysis of the Pope-stein division algorithm

1977 ◽  
Vol 6 (5) ◽  
pp. 151-155 ◽  
Author(s):  
George E. Collins ◽  
David R. Musser
Keyword(s):  
Division Algorithm

A NOVEL DIVISION ALGORITHM AND ARCHITECTURES FOR PARALLEL AND SEQUENTIAL PROCESSING

2005 ◽  
Vol 14 (02) ◽  
pp. 281-295
Author(s):  
K. TATAS ◽  
D. J. SOUDRIS ◽  
D. SIOMOS ◽  
A. THANAILAKIS
Keyword(s):  
Variable Number ◽  
Point Of View ◽  
Division Algorithm ◽  
Cost Performance ◽  
Sequential Processing ◽  
Trade Offs ◽  
Computation Analysis ◽  
Division Operation ◽  
Partial Division

A new algorithm for reducing the division operation to a series of smaller divisions is introduced. Partitioning the dividend into segments, we perform divisions, shifts, and accumulations taking into account the weight of dividend bits. Each partial division can be performed by any existing division algorithm. From an algorithmic point of view, computation analysis is performed in comparison with the existing algorithms. From an implementation point of view, since the division can be performed by any existing divider, the designer can choose the divider which best meets his specifications. Although the algorithm is presented for integer numbers, it can be easily generalized for fractions, since it is only a matter of representation. Two possible implementations of the algorithm, namely the sequential and parallel are derived, with several variations, allowing performance, cost, and cost/performance trade-offs. Exhaustive comparisons of the derived implementations with many existing implementations in terms of area cost, performance, and cost/performance are done. A plethora of alternative implementations can be derived due to a variable number of partitions.

scholarly journals Improved Modular Division Implementation with the Akushsky Core Function

Computation ◽  
2022 ◽  
Vol 10 (1) ◽  
pp. 9
Author(s):  
Mikhail Babenko ◽  
Andrei Tchernykh ◽  
Viktor Kuchukov
Keyword(s):  
Approximate Method ◽  
Chinese Remainder Theorem ◽  
Number System ◽  
Residue Number System ◽  
Division Algorithm ◽  
Incorrect Result ◽  
Core Function ◽  
Residue Number ◽  
Division Operation

The residue number system (RNS) is widely used in different areas due to the efficiency of modular addition and multiplication operations. However, non-modular operations, such as sign and division operations, are computationally complex. A fractional representation based on the Chinese remainder theorem is widely used. In some cases, this method gives an incorrect result associated with round-off calculation errors. In this paper, we optimize the division operation in RNS using the Akushsky core function without critical cores. We show that the proposed method reduces the size of the operands by half and does not require additional restrictions on the divisor as in the division algorithm in RNS based on the approximate method.

scholarly journals The division algorithm for the finite decimals

2011 ◽  
Vol 50 (3) ◽  
pp. 309-327
Author(s):  
Chang-Su Kim ◽  
Young-Bae Jun ◽  
Eun-Hwan Roh
Keyword(s):  
Division Algorithm
Sign in / Sign up

Export Citation Format

Share Document