Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Advances in Computer Systems Architecture|
|Publisher:||Springer Berlin Heidelberg|
|Hooman Nikmehr and Cheng-Chew Lim|
|Abstract:||Digit recurrence operations mainly use redundant representation, mostly in signed-digit format. These operations generate results one digit per iteration from left to right. Since the final result has to be converted into 2s complement format, to eliminate the end of operation conversion delay, on-the-fly algorithms are employed. These algorithms, with no use of carry propagating adders, convert the result into the conventional format as the signed-digits are generated. Some applications like rounding non-normalized results, positive or negative offsetting, coding and cryptography require not only the original result in 2s complement format, but also to generate the original result summed with (n)ulp 1, where n is an integer, in the ordinary representation. This paper proposes a new algorithm applying to digit recurrence operations to generate that value on-the-fly.|
|Description:||The original publication is available at www.springerlink.com|
|Appears in Collections:||Aurora harvest 6|
Electrical and Electronic Engineering publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.