An Extensive Karnaugh Mapping Tool for Boolean Expression Simplification

Rahman, Md. Saidur; Hasib, Rifat; Sultana, Babe; Hussain, Gulzar; Rahman, Mohammad Lutfur; Rahaman, Muhammad Aminur

doi:10.1109/sti47673.2019.9068037

Cited by 5 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The experimental outcome of their contribution and interpretation gives us an idea that they function only for no more than 5 vari-ables. Authors of [10] proposed a modified algorithm of K-Map algorithm and implemented a K-map solver which works up to 6 variables. It also performs better than C-Minimizer algorithm [7].…”

Section: Related Workmentioning

confidence: 99%

“…[9] Design a simulation system that finds optimal expression and reduces the cost of the circuit. Rahman et al [10] Develop a Karnaugh mapping that can deal with a big number of variables with minimum cost and also a comparison with C-Minimizer algorithm. Rushdi et al [11] Present a prominent basic digital circuit design issue using Variable-Entered Karnaugh Maps (VEKMs) with don't care notation.…”

Section: Overview Of Kaurnaugh Map Toolmentioning

confidence: 99%

See 1 more Smart Citation

Simplifying the Boolean Equation Based on Simulation System using Karnaugh Mapping Tool in Digital Circuit Design

Islam

Hussain

Sultana

et al. 2021

GUB JOURNAL OF SCIENCE AND ENGINEERING

Self Cite

View full text Add to dashboard Cite

In computerized integrated circuits, the fundamental principle intends to avoid the multifaceted nature of the circuitry by making it as brief as attainable and minimize the expenditure. Techniques like Quine- McCluskey (QM) and Karnaugh Map (K-Map) are often used approaches of simplifying Boolean functions. This study presents a recreation framework of simplification of the Boolean capacities by the utilize of the K- Map definition for beginner-level learners. It uses the algebraic expression of the Boolean function to decrease the number of terms, generates a circuit, and does not use any redundant sets. In this way, it gets to be competent to deal with lots of parameters and minimize the computational cost. The result of the assessment is performed in this paper by contrasting it with the C- Minimizer algorithm. In computation time terms, the result appears that our comprehensive K mapping tool outflanks in current procedures, and the relative error accomplishes a lower rate of percentage (2%), which fulfills the satisfactory level. GUB JOURNAL OF SCIENCE AND ENGINEERING, Vol 7, Dec 2020 P 76-84

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Overview Of Kaurnaugh Map Toolmentioning

confidence: 99%

Simplifying the Boolean Equation Based on Simulation System using Karnaugh Mapping Tool in Digital Circuit Design

Islam

Hussain

Sultana

et al. 2021

GUB JOURNAL OF SCIENCE AND ENGINEERING

Self Cite

View full text Add to dashboard Cite

show abstract

Simplifying Karnaugh Maps by Making Groups of Non-power-of-two Elements

Garrido

2022

Circuits Syst Signal Process

View full text Add to dashboard Cite

When we study the Karnaugh map in the switching theory course, we learn that the ones in the map are combined in rectangles whose length and width must be a power of two. The result is the logic function described as a sum of products. This paper shows that we can also make groups where the length and width of the rectangles are equal to three. This results in a logic function that is simpler than the sum of products in terms of logic gates, leading to more hardware-efficient circuits. This idea is extended later in the paper to other groups of elements. Finally, a new perspective on the Karnaugh map that integrates the proposed approach with the conventional one is provided. This can be used in switching theory courses to improve the explanation of the Karnaugh map.

show abstract