Implementasi Penyederhanaan Fungsi Boolean Menggunakan Metode Peta Karnaugh dalam Pemrograman Python
DOI:
https://doi.org/10.33508/jisem.v1i02.7362Keywords:
Penyederhanaan Fungsi Boolean, Peta Karnaugh, Pemrograman Python, Sistem Digital, TkinterAbstract
Penyederhanaan fungsi Boolean merupakan langkah fundamental dalam optimasi sistem digital untuk meningkatkan efisiensi rangkaian logika kombinatorial. Penelitian ini mengimplementasikan metode Peta Karnaugh dalam menyederhanakan fungsi Boolean menggunakan pemrograman Python dengan antarmuka grafis berbasis Tkinter, yang dibatasi pada 2 hingga 4 variabel. Algoritma yang dikembangkan mampu mengidentifikasi dan mengelompokkan minterm secara otomatis berdasarkan urutan Gray Code, kemudian menghasilkan ekspresi Boolean yang disederhanakan secara visual dan interaktif. Pengujian dilakukan terhadap 30 fungsi Boolean masing-masing 10 fungsi per jumlah variabel dan menghasilkan akurasi 100% dibandingkan metode manual. Waktu eksekusi rata-rata tercatat 0,12 detik untuk 2 variabel, 0,25 detik untuk 3 variabel, dan 0,45 detik untuk 4 variabel. Aplikasi terbukti efektif sebagai alat bantu pembelajaran logika digital yang interaktif dan intuitif.
Downloads
References
1) Islam, M. J., Hussain, M. G., Sultana, B., Rahman, M., Rahman, M. S., & Rahaman, M. A. (2021). Simplifying the Boolean Equation Based on Simulation System using Karnaugh Mapping Tool in Digital Circuit Design. GUB Journal of Science and Engineering, 76–84. https://doi.org/10.3329/gubjse.v7i0.54025
2) Comparative Analysis Using Boolean Algebra. (2020). In SAGE Research Methods Foundations. SAGE Publications Ltd. https://doi.org/10.4135/9781526421036889598
3) Karnaugh Maps: A Graphical Approach to Boolean Expression Simplification. (2025). International Research Journal of Modernization in Engineering Technology & Science. https://doi.org/10.56726/IRJMETS81258
4) Guo, Y., Hu, N., Liu, J., Yin, Y., Ding, Y., & An, Y. (2022). Design and Implementation of Educational Emulation Experiment Systems Based on Discrete Logic. IEEE Transactions on Education, 65(2), 132–140. https://doi.org/10.1109/TE.2021.3098446
5) Vuorikari, R., Pokropek, A., & Muñoz, J. C. (2025). Enhancing digital skills assessment: introducing compact tools for measuring digital competence. Technology, Knowledge and Learning. https://doi.org/10.1007/s10758-025-09825-x
6) Sengupta, P., Tyagi, A., Hu, J., Rajan, V. K., Mostafa, H., & Majumdar, S. (2024). MinBLoG: Minimization of Boolean Logic Functions using Graph Attention Network. 2024 ACM/IEEE 6th Symposium on Machine Learning for CAD (MLCAD), 1–8. https://doi.org/10.1109/MLCAD62225.2024.10740246
7) Vyas, V., Jiang-Wei, L., Zhou, P., Hu, X., & Friedman, J. S. (2021). Karnaugh Map Method for Memristive and Spintronic Asymmetric Basis Logic Functions. IEEE Transactions on Computers, 70(1), 128–138. https://doi.org/10.1109/TC.2020.2986970
8) Damiani, M. (2023). Partially unate Boolean functions: Properties of their sum-of-products representations. Discrete Applied Mathematics, 338, 278–292. https://doi.org/10.1016/j.dam.2023.05.028
9) Anggraini, D., Fitriana, N., Firmanto, B., Aziz, A. S., Sesoca, J., Kristianti, T., & Budijanto, A. (2025). DEVELOPMENT AND ANALYSIS OF A MATLAB GUI APPLICATION: AUTOMATIC COLOR DETECTION AND CONVERSION BASED ON RGB VALUES FOR EDUCATIONAL AND DIGITAL DESIGN. JIPI (Jurnal Ilmiah Penelitian Dan Pembelajaran Informatika), 10(3), 2317–2327. https://doi.org/10.29100/jipi.v10i3.8724
10) Garrido, M. (2022). Simplifying Karnaugh Maps by Making Groups of Non-power-of-two Elements. Circuits, Systems, and Signal Processing, 41(10), 5895–5902. https://doi.org/10.1007/s00034-022-02040-4
Downloads
- 1 310
Published
Issue
Section
License
Copyright (c) 2026 Bambang Herlambang, Daniel, Dustin Pranata Wangsawidjaja, Slamet Winardi
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
