Open AccessUnsigned SRT tables: theory and implementation
Author(s) -
Diraneyya O.M.,
Amin A.A.
Publication year - 2014
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2013.3169
Subject(s) - division (mathematics) , multiplication (music) , table (database) , arithmetic , reduction (mathematics) , lookup table , computer science , square root , diagram , symmetry (geometry) , algorithm , mathematics , data mining , programming language , database , combinatorics , geometry
The mathematical basis for developing an unsigned SRT table for division, multiplication–division or square‐root operations is summarised. This is possible through utilising the P–D diagram symmetry allowing a 50% reduction in table size. Efficient implementation that avoids a serious problem with the implementation suggested by Kornerup in 2003 is demonstrated and conditions for its error‐free operation are discussed.