✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
Also, in this context, the comparisions of the methods used for simplification of Boolean functions are given.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:This paper reports on the simplification of Boolean functions problem encountered in the logic circuit design.
📊
Key Findings & Data:The simplification process studied in this work is concentrated on the Petrick’s Method, produce all solutions exactly rather then Quine McCluskey or Karnaugh Method.
💡
Conclusion & Impact:Also, in this context, the comparisions of the methods used for simplification of Boolean functions are given.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters
Abstract
This paper reports on the simplification of Boolean functions problem encountered in the logic circuit design. The simplification process studied in this work is concentrated on the Petrick’s Method, produce all solutions exactly rather then Quine McCluskey or Karnaugh Method. The Petrick’s algorithm is described in detail. A specific example is worked through to explain the algorithm. On the example, all different possible solutions and “PLA” diagrams of these solutions are given as program outputs. Also, in this context, the comparisions of the methods used for simplification of Boolean functions are given.
🔖
Cite This Article
SERTBAŞ, A., ARSLAN, N. (2022). An educational computer tool for simplification of Boolean function's via Petrick's method. Istanbul University Journal of Electrical and Electronics Engineering, Cilt: 2 - Sayı: 2, 555–561. https://ajindex.com/articles/543930