Division is one of the basic arithmetic operations supported by every computer system. The operation can be performed and implemented in either hardware or software, or a combination of the two. Although division is not as frequent as addition and multiplication, nowadays most processors implement it in hardware to not compromise the overall computation performances. In this note, we explain the basic algorithms, suitable for hardware and software, to implement division in computer systems. Two classes of algorithms implement division or square root: digit-recurrence and multiplicative (e.g., Newton-Raphson) algorithms. The first class of algorithms are of digit-recurrence type, and are especially suitable for hardware implementation as they require modest resources and provide good performance on contemporary technology. The second class of algorithms, multiplicative type, requires significant hardware resources and is more suitable for software implementation on the existing multiply units. The purpose of this note is to provide an introductory survey using a presentation style suitable for reading also by the interested non-specialist Readers.

Digital Arithmetic: Division Algorithms / Montuschi, Paolo; Alberto, Nannarelli - In: Encyclopedia of Computer Science and Technology / Phillip A. Laplante. - ELETTRONICO. - New York : CRC press - Taylor and Francis Group, 2016. - ISBN 978-1-4822-0822-1. - pp. 348-363 [10.1081/E-ECST2-120050816]

### Digital Arithmetic: Division Algorithms

#### Abstract

Division is one of the basic arithmetic operations supported by every computer system. The operation can be performed and implemented in either hardware or software, or a combination of the two. Although division is not as frequent as addition and multiplication, nowadays most processors implement it in hardware to not compromise the overall computation performances. In this note, we explain the basic algorithms, suitable for hardware and software, to implement division in computer systems. Two classes of algorithms implement division or square root: digit-recurrence and multiplicative (e.g., Newton-Raphson) algorithms. The first class of algorithms are of digit-recurrence type, and are especially suitable for hardware implementation as they require modest resources and provide good performance on contemporary technology. The second class of algorithms, multiplicative type, requires significant hardware resources and is more suitable for software implementation on the existing multiply units. The purpose of this note is to provide an introductory survey using a presentation style suitable for reading also by the interested non-specialist Readers.
##### Scheda breve Scheda completa Scheda completa (DC)
2016
978-1-4822-0822-1
978-1-4822-0819-1
Encyclopedia of Computer Science and Technology
File in questo prodotto:
Non ci sono file associati a questo prodotto.
##### Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: `https://hdl.handle.net/11583/2521489`
##### Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo