An Improved Algorithm for the Simplification of Switching Functions Using Unique Identifiers on a Karnaugh Map

Marcovitz, Alan B.; Shub, Charles M.

doi:10.1109/t-c.1969.222666

Cited by 4 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is achieved because it is more difficult to optimize expression with a greater set of variables than just a lesser set of variables. For Boolean algebra equations with parameter numbers three (3), four(4), five(5), six (6), and seven (7), the Table III displays relative and absolute errors. From Table III, we do see that relative error increases like those of the numbers of expression as well as the numbers of variables increases.…”

Section: Performance Discussionmentioning

confidence: 99%

“…Two main activities work for QM method is as follows: a) Prime Implicates Determination b) Collection of Critical Prime Implicates [5]. Main sickening aspect of QM seems: QM is a NP Complete problem and computation times of the algorithm enhance exponentially by the increasing length of input [6]. Therefore, it is quite difficult for primitive level DLD students to manage the tabular method of QM.…”

Section: Related Workmentioning

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

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: Performance Discussionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%