On-the-Fly Conversion of Redundant into Conventional Representations

An algorithm to convert redundant number representations into conventional representations is presented. The algorithm is performed concurrently with the digit-by-digit generation of redundant forms by schemes such as SRT division. It has a step delay roughly equivalent to the delay of a carry-save...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. C-36; no. 7; pp. 895 - 897
Main Authors ERCEGOVAL, M. D, LANG, T
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.07.1987
Institute of Electrical and Electronics Engineers
Subjects
2's complement
Applied sciences
Conditional sum addition
conversion
Exact sciences and technology
Information, signal and communications theory
most significant digit first algorithms
on-line algorithms
redundant number representation
square-root
SRT division
Telecommunications and information theory
Representation
Number
Redundancy
Algorithm
Information processing
Online AccessGet full text

Cover

More Information
Summary:An algorithm to convert redundant number representations into conventional representations is presented. The algorithm is performed concurrently with the digit-by-digit generation of redundant forms by schemes such as SRT division. It has a step delay roughly equivalent to the delay of a carry-save adder and simple implementation. The conversion scheme is applicable in arithmetic algorithms such as nonrestoring division, square root, and on-line operations in which redundantly represented results are generated in a digit-by-digit manner, from most significant to least significant.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.1987.1676986