Division algorithms and implementations

SF Obermann, MJ Flynn - IEEE Transactions on computers, 1997 - ieeexplore.ieee.org
Many algorithms have been developed for implementing division in hardware. These
algorithms differ in many aspects, including quotient convergence rate, fundamental …

SRT division architectures and implementations

DL Harris, SF Oberman… - Proceedings 13th IEEE …, 1997 - ieeexplore.ieee.org
SRT [Sweeney, Robertson and Tocher (1958)] dividers are common in modern floating point
units. Higher division performance is achieved by retiring more quotient bits in each cycle …

[图书][B] Digit-serial computation

R Hartley, KK Parhi - 2012 - books.google.com
Digital signal processing (DSP) is used in a wide range of applications such as speech,
telephone, mobile radio, video, radar and sonar. The sample rate requirements of these …

Review of basic classes of dividers based on division algorithm

US Patankar, A Koel - IEEE Access, 2021 - ieeexplore.ieee.org
The electronics world is very well described in two distinct but dependent interdisciplinary
areas, namely hardware and software. Arithmetic operations are very vital building blocks of …

[图书][B] Design Issues in High performance floating-point arithmetic units

SF Oberman - 1997 - search.proquest.com
In recent years computer applications have increased in their computational complexity. The
industry-wide usage of performance benchmarks, such as SPECmarks, forces processor …

Low latency floating-point division and square root unit

JD Bruguera - IEEE Transactions on Computers, 2019 - ieeexplore.ieee.org
Digit-recurrence algorithms are widely used in actual microprocessors to compute floating-
point division and square root. These iterative algorithms present a good trade-off in terms of …

Very-high radix division with prescaling and selection by rounding

MD Ercegovac, T Lang… - IEEE Transactions on …, 1994 - ieeexplore.ieee.org
A division algorithm in which the quotient-digit selection is performed by rounding the shifted
residual in carry-save form is presented. To allow the use of this simple function, the divisor …

Faster modular multiplication by operand scaling

CD Walter - Advances in Cryptology—CRYPTO'91: Proceedings 11, 1992 - Springer
There are a number of techniques known for speeding up modular multiplication, which is
the main arithmetic operation in RSA cryptography. This note shows how to gain speed by …

Unified mixed radix 2-4 redundant CORDIC processor

E Antelo, JD Bruguera… - IEEE transactions on …, 1996 - ieeexplore.ieee.org
We present a unified mixed radix CORDIC algorithm with carry-save arithmetic with a
constant scale factor. The pipelined architecture of the processor is determined by a unique …

Very high radix square root with prescaling and rounding and a combined division/square root unit

T Lang, P Montuschi - IEEE Transactions on Computers, 1999 - ieeexplore.ieee.org
An algorithm for square root with prescaling and selection by rounding is developed and
combined with a similar scheme for division. Since division is usually more frequent than …