Graduate Thesis Or Dissertation

 

A fast division algorithm Público Deposited

Contenido Descargable

Descargar PDF
https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/9306t2899

Descriptions

Attribute NameValues
Creator
Abstract
  • A radix 2n non-restoring division algorithm is described. The algorithm is designed to be compatible with hardware multiprecision multiplication methods currectly used in high speed digital computers. This enables the use of the same hardware, with only changes in control logic, to be used to implement both multiplication and division. This paper proves that in order to obtain n bits of the quotient at each iteration in a non-restoring algorithm it is only necessary to consider the first n + 3 bits (including the sign as one bit) of the divisor and the dividend to obtain a quotient estimator. A section is devoted to implementation of the algorithm in software as a way to extend the precision of the existing hardware division instruction on a digital computer.
Resource Type
Fecha Disponible
Fecha de Emisión
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Declaración de derechos
Publisher
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using Capture Perfect 3.0.82 on a Canon DR-9080C in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces

Relaciones

Parents:

This work has no parents.

En Collection:

Elementos