Boolean Algebraic Calculator

Abstract

Boolean Algebra stands among the most widely recognized technique used especially in computer science and electrical engineering. This branch largely relates to subjects such as digital logic design, circuit optimization, and computational problems resolution. This is basically the drive behind the present assignment: To develop an Algebraic Boolean calculator capable of accepting any standard user input for analysing and simplifying Boolean expressions. Two salient features of this calculator are the Simplification Mode and the Solving Mode. In the Simplification mode, the input is a Boolean expression, and the output is the possible simplified forms of equivalent expressions. This, in turn, is helpful in optimizing digital circuits because the reduction would lessen the required number of logic gates, thus making the design more efficient. In contrast, the Solving mode will evaluate Boolean expressions with variable values as conferred by the user. It performs logical operations to crunch numbers at an extremely fast speed. This mode will, therefore, be used to assess a particular circuit/function, make a truth table, and implement real-time Boolean evaluation. Hence, two modes combined make this Boolean Algebraic Calculator an utmost evaluator to digital electronics, logical circuit designing, and computation logic students, scholars, and practitioners. It enhances the productivity of Boolean function analysis, says \"as easy as ABC\" to solving problems and building up to a viable design option for logical systems.

Introduction

The Boolean Algebraic Calculator is a device designed to perform logical operations and simplify Boolean expressions using binary values (0 and 1) and fundamental logic operators like AND, OR, NOT, XOR. It assists in minimizing complex logic functions, generating truth tables, and analyzing digital circuits, making it valuable in digital electronics, computer science, and embedded systems education.

Building on prior work by Ajmal and Nisanth, this project enhances Boolean expression simplification through improved algorithms and a user-friendly interface, enabling faster and more accurate results. The system uses a Raspberry Pi Zero W as its core processor, accepting inputs via a 4x4 keypad and displaying outputs on an LCD screen. It runs simplification algorithms that provide real-time feedback, making the calculator interactive and educational.

The device is portable, powered by a rechargeable lithium-ion battery and equipped with a stable power management system. Users can enter Boolean expressions, which the calculator processes to display simplified forms or evaluation results, facilitating learning and practical circuit design.

Experimentation shows the system effectively simplifies Boolean expressions (e.g., simplifying A*(A+B*C) to A + C) and supports various logic operations, proving its accuracy and ease of use. The inclusion of touchscreen or physical buttons and a compact hardware design make the calculator a useful tool for students and professionals working with digital logic.

Conclusion

The Boolean Algebraic Calculator is a small, interactive learning aid that evaluates and simplifies Boolean expressions using a Raspberry Pi Zero W, a 4x4 keypad, and an LCD display. It helps reinforce concepts in digital logic and Boolean algebra by enabling users to perform logical operations like AND, OR, and NOT. It is intended for students, educators, and electronics enthusiasts. The system is portable and can be used in labs, classrooms, or while on the go thanks to its USB-C compatible rechargeable lithium-ion battery. It is simple to enter expressions and view results thanks to the user-friendly interface provided by the physical keypad and real-time display. It provides a useful platform for experimenting with logic gates, truth tables, and expression simplification outside of the classroom. The project is scalable and an interesting way to learn basic computing concepts because it also provides space for future improvements like digital circuit simulation or support for Karnaugh maps.

References

[1] Ajmal, M. A., & Nisanth, N. (2018). Boolean Expression Calculator. International Journal for Scientific Research & Development (IJSRD), 6(5), 735-740. [2] Orhani, S., Spahiu, X., & Kusari-Radoniqi, Y. (2024). Boolean Algebra and Proving Logic Circuits through Logicly. American Journal of Engineering Research (AJER), 13(6), 86-97. [3] Arslan, N., & Sertbas, A. (2002). An educational computer tool for simplification of Boolean functions via Petrick’s method. Journal of Electrical & Electronics Engineering, 2(2), 555-561. [4] Aagaard, M., & Leeser, M. (1994). PBS: Proven Boolean simplification. In IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (Vol. 13, No. 7, pp. 885-898). [5] Bhattacharjee, P. R. (2018). A novel method for solving simultaneous equations in Boolean/switching algebra. IETE Journal of Education, 59(2), 49-53 [6] Rompis, L. (2013). Boolean Algebra for XOR Gates. Journal of Computer Sciences and Applications, 1(1), 14-16.

Copyright

Copyright © 2025 Nathasha F Almeda, Nikhitha Yesudas, S Lavanya, Rahul V Alosious, Evan Kumar G. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.