CHOICES OF OPERAND TRUNCATION IN THE SRT DIVISION ALGORITHM

Authors
BURGESS N WILLIAMS T
Citation
N. Burgess et T. Williams, CHOICES OF OPERAND TRUNCATION IN THE SRT DIVISION ALGORITHM, I.E.E.E. transactions on computers, 44(7), 1995, pp. 933-938
Citations number
19
Categorie Soggetti
Computer Sciences","Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture
Journal title
I.E.E.E. transactions on computers → ACNP
ISSN journal
00189340
Volume
44
Issue
7
Year of publication
1995
Pages
933 - 938
Database
ISI
SICI code
0018-9340(1995)44:7<933:COOTIT>2.0.ZU;2-9
Abstract
This paper presents an analysis of the number of partial remainder dig its and divisor bits that must be examined in the SRT division algorit hm. The number of examined digits is found to be the same for both sig ned-digit and 2s-complement partial remainder representations, and app ears to increase as 3log(2)r approximately, where r is the radix of th e divider. In some cases, it proves advantageous to examine a fraction al number of remainder digits by inspecting more positive than negativ e bits.