Title :
Analysis of delays in converting from a redundant representation
Author_Institution :
Dept. of Comput., Univ. of Manchester Inst. of Sci. & Technol., UK
fDate :
7/1/1997 12:00:00 AM
Abstract :
The use of a redundant number system allows many arithmetic operations to process digits sequentially, most significant digit first. Final conversion back to a standard binary representation can require time to propagate any carries. This paper analyses and reports on the delays encountered when this is done by an online algorithm, giving a good upper bound on the expected delay. The delay is approximately log,k for the kth digit in a representation with base r
Keywords :
computational complexity; delays; redundant number systems; arithmetic operations; binary representation; delays; kth digit; online algorithm; redundant number system; redundant representation; upper bound;
Journal_Title :
Computers and Digital Techniques, IEE Proceedings -
DOI :
10.1049/ip-cdt:19971284