作者: Hao‐Yung Lo , Tsin‐Yuan Chang , Ming‐Che Lee
DOI: 10.1080/02533839.2001.9670645
关键词: Division algorithm 、 Complement (set theory) 、 Subtraction 、 Arithmetic 、 Divisor 、 Operand 、 Bit-length 、 Division (mathematics) 、 Algorithm 、 Short division 、 Mathematics
摘要: Abstract This paper describes the design of algorithms for unidirectional division. Rather than conventional, restoring or nonrestoring, divisions which require both subtraction and addition operations, alternately, during process division, proposed method needs only one direction, either addition, but not both, If operands, dividend divisor, are positive negative, is used. However, if other applied. can skip zero bits in dividend, consequently number additions/subtractions expected to be less conventional about (3/5)n compared 3/2n (or n MUXes used) nonrestoring. In division processed parallel semi‐parallel, bit length long enough. also easily extended apply two's complement divisions. The conversio...