CHOICES OF OPERAND TRUNCATION IN THE SRT DIVISION ALGORITHM

被引：15

作者：

BURGESS, N ^{[1
]}

WILLIAMS, T ^{[1
]}

机构：

[1] HAL COMP INC,CAMPBELL,CA 95008

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1995年 / 44卷 / 07期

关键词：

ARITHMETIC UNIT; COMPUTER ARITHMETIC; CUSTOM INTEGRATED CIRCUIT DESIGN; DIVISION; QUOTIENT DIGIT SELECTION; ROBERTSON DIAGRAMS; SRT DIVISION;

D O I：

10.1109/12.392852

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper presents an analysis of the number of partial remainder digits and divisor bits that must be examined in the SRT division algorithm. The number of examined digits is found to be the same for both signed-digit and 2s-complement partial remainder representations, and appears to increase as 3log(2)r approximately, where r is the radix of the divider. In some cases, it proves advantageous to examine a fractional number of remainder digits by inspecting more positive than negative bits.

引用

页码：933 / 938

页数：6

共 19 条

[1] HIGHER-RADIX DIVISION USING ESTIMATES OF DIVISOR AND PARTIAL REMAINDERS
ATKINS, DE
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1968, C 17 (10) : 925 - &
[2] BIRMAN M, 1990, IEEE MICRO FEB, P55
[3] BURGESS N, 1991, P IEEE INT C COMP DE, P560
[4] RADIX-16 SIGNED-DIGIT DIVISION
CARTER, TM
ROBERTSON, JE
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (12) : 1424 - 1433
[5] Ercegovac M. D., 1989, Journal of VLSI Signal Processing, V1, P169, DOI 10.1007/BF02427792
[6] SIMPLE RADIX-4 DIVISION WITH OPERANDS SCALING
ERCEGOVAC, MD
LANG, T
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (09) : 1204 - 1208
[7] ERCEGOVAC MD, 1987, IEEE T COMPUT, V36, P895, DOI 10.1109/TC.1987.1676986
[8] FANDRIANTO J, 1989, 9TH P IEEE S COMP AR, P68
[9] HWANG K, 1979, COMPUTER ARITHMETIC
[10] KNOWLES S, 1991, ASPAAI2

← 1 2 →