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

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

نتاج البحث: Conference contribution

ملخص

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.

اللغة الأصليةEnglish
عنوان منشور المضيف6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015
ناشرInstitute of Electrical and Electronics Engineers Inc.
رقم المعيار الدولي للكتب (الإلكتروني)9781479979844
المعرِّفات الرقمية للأشياء
حالة النشرPublished - يناير 29 2016
الحدث6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015 - Denton, United States
المدة: يوليو ١٣ ٢٠١٥يوليو ١٥ ٢٠١٥

سلسلة المنشورات

الاسم6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015

Other

Other6th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2015
الدولة/الإقليمUnited States
المدينةDenton
المدة٧/١٣/١٥٧/١٥/١٥

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1705???
  • ???subjectarea.asjc.1700.1708???

بصمة

أدرس بدقة موضوعات البحث “Determining the possible minimal Boolean expressions via a newly developed procedure and tool'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا