Determining the possible minimal Boolean expressions via a newly developed procedure and tool

A. Ahmad, D. Ruelens, S. Ahmad, L. Pathuri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper proposes a new idea and implementation tool for two level minimization of Boolean expressions. A simpler and more versatile method is developed by exploiting the adjacency field relationships between Gray code and decimal numbers. Our algorithmic procedures also consider the optimal use of don't care terms. We implemented our algorithm in MATLAB and tested accuracy and efficiency for large values of input variables (more than 25). This developed novel technique is bound to provide all possible optimally minimized Boolean expressions.

Original languageEnglish
Title of host publication6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479979844
DOIs
Publication statusPublished - Jan 29 2016
Event6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015 - Denton, United States
Duration: Jul 13 2015Jul 15 2015

Other

Other6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015
CountryUnited States
CityDenton
Period7/13/157/15/15

    Fingerprint

Keywords

  • Adjacency
  • Boolean Expression
  • Gray code
  • minimization
  • minterms

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Ahmad, A., Ruelens, D., Ahmad, S., & Pathuri, L. (2016). Determining the possible minimal Boolean expressions via a newly developed procedure and tool. In 6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015 [7395241] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCCNT.2015.7395241