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

K.M. Iftekharuddin; A.A.S. Awwal; M.A. Karim

doi:10.1109/NAECON.1992.220625

Back

Conference proceeding

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

K.M. Iftekharuddin, A.A.S. Awwal and M.A. Karim

IEEE National Aerospace and Electronics Conference, 1992, pp.1124-1129 vol.3

1992

DOI: https://doi.org/10.1109/NAECON.1992.220625

Abstract

Arithmetic

CADCAM

Computer aided manufacturing

Digital control

Optical propagation

Parallel architectures

Process control

Signal processing algorithms

Logic

Signal Processing

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.< >

Metrics

1 Record Views

Details

Title: A systematic approach of finding the minimum minterms in MSD binary addition
Creators: K.M. Iftekharuddin - University of Dayton
A.A.S. Awwal - Wright State University
M.A. Karim - University of Dayton
Publication Details: IEEE National Aerospace and Electronics Conference, 1992, pp.1124-1129 vol.3
Publisher: IEEE
Academic Unit: Department of Electrical and Computer Engineering
Language: English
Resource Type: Conference proceeding
ISBN: 9780780306523; 078030652X
DOI: https://doi.org/10.1109/NAECON.1992.220625
Record Identifier: 9914539739701301

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

Abstract

Related links

Metrics

Details