Paper
2 October 1998 Power comparison of SRT and GST dividers
Martin Kuhlmann, Keshab K. Parhi
Author Affiliations +
Abstract
Generally divider algorithms can be separated into two different kinds of algorithms, the multiplicative algorithms (MA) and the iterative digit recurrence algorithms (IDRA). The number of iterations of the MA and IDRA are proportional to log2 and the word-length, respectively. However every iteration of the MA consists of two multiplications and one addition, while the iteration period time of the IDRA only consists of one addition. The IDRA includes the SRT approach which does not require prescaling, and the GST approach which requires prescaling of the operands. The iteration period of the GST is much smaller due to the fact that the GST only examines three bits to predict the next quotient digit. Due to this reason, the overall latency of the GST-divider is shorter. Alternatively, by fixing the latency, the supply voltage of the GST can be reduced, resulting in a low power implementation. Thus, the GST is more suitable for low latency and low power applications.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Martin Kuhlmann and Keshab K. Parhi "Power comparison of SRT and GST dividers", Proc. SPIE 3461, Advanced Signal Processing Algorithms, Architectures, and Implementations VIII, (2 October 1998); https://doi.org/10.1117/12.325717
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Multiplexers

Binary data

Clocks

Logic

Transistors

CMOS technology

Computer arithmetic

RELATED CONTENT

The seven wonders of computer arithmetic
Proceedings of SPIE (October 26 2004)
Versatile multimode 320 x 240 256 x 256...
Proceedings of SPIE (January 05 1993)
Arithmetic processor design for the T9000 transputer
Proceedings of SPIE (December 01 1991)
Optimization of spanning tree adders
Proceedings of SPIE (August 25 2006)

Back to Top