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

Islam, Md. Jahidul; Hussain, Md Gulzar; Sultana, Babe; Rahman, Mohammad Lutfur; Rahman, Md. Saidur; Rahaman, Muhammad Aminur

doi:10.3329/gubjse.v7i0.54025

Cited by 2 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Karnough map is truly a crucial tool for processing algebraic logic that has minimal parameters. For a large number of variables, it can be said that working with a wide range of variables for the Karnaugh map will be a noteworthy accomplishment [13]. The construction map will be 2n cells in size, with "n" representing the number of cylinders (assuming each cylinder has just two end-of-stroke sensors) as well as additional memory if necessary [7].…”

Section: Methodology Of Karnaugh Mapsmentioning

confidence: 99%

Developing Multiple-Actuator Pneumatic Circuits Using the Karnaugh Maps Designing PLC Controlled

Fawzi,

Salloom

2023

JESA

View full text Add to dashboard Cite

Industrial processes need to be adjusted fast in order to generate a variety of products. The response to these modifications, the pneumatic control must be rebuilt in accordance with the new requirements, i.e., the control mechanism must be rebuilt. These issues could be resolved by utilizing the Karnaugh mapping method. The objective of this work is to develop multiple-actuator pneumatic circuits and reduce start-up times by merging various operational sequences into a single process. The Karnaugh maps is a technique for reducing logical equations or transforming truth tables into logic circuits. The method allows for circuit control using a programmable controller (PLC). One of the key advantages of using the suggested technique is the ease with which electrical schematic command circuits may be obtained. Schema will be created by simply using the pneumatic cylinder motion equations that were acquired from the Karnaugh map. The suggested technique assures not only the intended sequential cycle but also the minimizing of control command variables. This study focuses use Karnaugh Maps to develop a pneumatic control system in difficult cases with three different control sequences for five cylinders. Simulation software for pneumatic/electro-pneumatic circuits is utilized to apply the technique (Automation Studio and Fluid Sim). By applying the suggested rules, the logic equations were extracted in a simpler form, and they are simple to use pneumatically and electro pneumatically. It is also easily converted to Ladder Diagram Language. This method allows us to fast work in production cycles.

show abstract

Section: Methodology Of Karnaugh Mapsmentioning

confidence: 99%

Developing Multiple-Actuator Pneumatic Circuits Using the Karnaugh Maps Designing PLC Controlled

Fawzi,

Salloom

2023

JESA

View full text Add to dashboard Cite

show abstract

“…The algorithms in this approach do not achieve distinguished success because they inherit the drawbacks of the methods of the logic design or because they suffer from weak points resulting from the incomplete matching between the FI mining, FIM, problem and the logic circuit design. So let's consider the three most famous algorithms for logic circuit design, which are the Karnaugh map or Kmap [16], Quine-McCluskey Q-M [17], and Espresso [18], with the three algorithms that emerged from them to mine association rules, with a brief description of the drawbacks inhered from the former algorithms:…”

Section: Introductionmentioning

confidence: 99%

“…International Journal of Intelligent Engineering and Systems, Vol 16,. No.2, 2023 DOI: 10.22266/ijies2023.0430.49 Figure.…”

mentioning

confidence: 99%

A Logic Design-based Approach for Frequent Itemsets Mining Using LCO Algorithm

2023

IJIES

View full text Add to dashboard Cite

Frequent itemsets (FIs) mining is the main challenge in analyzing association rules since the complexity of association rule mining is determined mainly by identifying all frequent itemsets. There are many approaches to FIs mining; each approach includes many algorithms, but there is a major weakness in the logic-design-based FIs approach because there is a limited number of methods for logic circuit or expression optimization, each of which suffers from some drawbacks that are transferred to the mining process when they are utilized for this purpose. We propose LCOFI, a new algorithm for frequent itemset mining based on the LCO algorithm, in this paper. LCOA is a new algorithm for logic circuit optimization. LCOFI utilizes the suggested operations for a bipartite graph in LCOA. The proposed algorithm is simple and efficient and supports a large number of input items. It scans the transaction database only once to construct the bipartite graphs of frequent 1-itemsets and avoids the generation of candidate itemsets. It does not require complex data structures such as trees and hash tables to validate the frequency of FIs. When applied to a variety of datasets with varying characteristics, the proposed algorithm, LCOFI, outperformed the Apriori and Fp-growth algorithms in all the experiments.

show abstract

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

Cited by 2 publications

References 18 publications

Developing Multiple-Actuator Pneumatic Circuits Using the Karnaugh Maps Designing PLC Controlled

Developing Multiple-Actuator Pneumatic Circuits Using the Karnaugh Maps Designing PLC Controlled

A Logic Design-based Approach for Frequent Itemsets Mining Using LCO Algorithm

Contact Info

Product

Resources

About