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

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

doi:10.1109/ICCCNT.2015.7395241

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

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

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781479979844
DOIs	https://doi.org/10.1109/ICCCNT.2015.7395241
Publication status	Published - Jan 29 2016
Event	6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015 - Denton, United States Duration: Jul 13 2015 → Jul 15 2015

Other

Other	6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015
Country/Territory	United States
City	Denton
Period	7/13/15 → 7/15/15

Keywords

Adjacency
Boolean Expression
Gray code
minimization
minterms

ASJC Scopus subject areas

Computer Networks and Communications
Hardware and Architecture

Access to Document

10.1109/ICCCNT.2015.7395241

Cite this

Determining the possible minimal Boolean expressions via a newly developed procedure and tool. / Ahmad, A.; Ruelens, D.; Ahmad, S.; Pathuri, L.

6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015. Institute of Electrical and Electronics Engineers Inc., 2016. 7395241.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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., 6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015, Denton, United States, 7/13/15. https://doi.org/10.1109/ICCCNT.2015.7395241

@inproceedings{dababd372150454b8b6e12ccc2d7dd78,

title = "Determining the possible minimal Boolean expressions via a newly developed procedure and tool",

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

keywords = "Adjacency, Boolean Expression, Gray code, minimization, minterms",

author = "A. Ahmad and D. Ruelens and S. Ahmad and L. Pathuri",

year = "2016",

month = jan,

day = "29",

doi = "10.1109/ICCCNT.2015.7395241",

language = "English",

booktitle = "6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015 ; Conference date: 13-07-2015 Through 15-07-2015",

}

TY - GEN

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

AU - Ahmad, A.

AU - Ruelens, D.

AU - Ahmad, S.

AU - Pathuri, L.

PY - 2016/1/29

Y1 - 2016/1/29

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

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

KW - Adjacency

KW - Boolean Expression

KW - Gray code

KW - minimization

KW - minterms

UR - http://www.scopus.com/inward/record.url?scp=84964555828&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84964555828&partnerID=8YFLogxK

U2 - 10.1109/ICCCNT.2015.7395241

DO - 10.1109/ICCCNT.2015.7395241

M3 - Conference contribution

AN - SCOPUS:84964555828

BT - 6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015

Y2 - 13 July 2015 through 15 July 2015

ER -

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

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this