A systematic approach of finding the minimum minterms in MSD binary addition

Abstract

The authors describe a systematic approach to find the minimum minterms from all possible truth tables of modified signed-digit (MSD) binary addition. MSD arithmetic is one of the signed digit (SD) number systems which has a fixed radix two. The inherent parallel architecture of the optical processor makes the best use of the carry-free features of the MSD binary number. The technique involves determining the number of reduced minterms which do not include all possible sets. The possible minimum minterms for MSD-based systems can be derived by using the approach. >