

The Making of a Boolean Logic Simplifying Calculator and its Development
Abstract
In this paper, I recommend a calculator that can limit your Product Total (Sop) simple logical expression to Boolean terms with up to four variables. By reducing the number of words, boolean simplicity makes it possible to use a slightly more complex rotation in a more practical manner. Work presented the ARDUINO NANO processor capabilities. The hardware is incorporated into the PCB leading group of the composite structure component. The procedure for opening a Karnaugh-map (k-map) is followed by the used algorithm. This is a crucial method for reducing any Boolean expression. In the context of digital electronics, chip construction frequently makes use of Boolean simplification. in a manner to bring down the entryways of good judgment, a nano-chip can be worked at a lower cost and space. Because it is quicker, more effective, and produces better results, this proposed device may be used to simplify Boolean.
References
Karnaugh, M. (1953). The map method for synthesis of combinational logic circuits. Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, 72(5), 593-599.
Tomaszewski, S. P., Celik, I. U., & Antoniou, G. E. (2003). WWW-based Boolean function minimization. International Journal of Applied Mathematics and Computer Science, 13(4), 577-584.
Bitincka, L., & Antoniou, G. E. (2004). PDA‐based Boolean Function Simplification: a Useful Educational Tool. Informatica, 15(3), 329-336.
Antoniou, L. B. G. E. (2005). Pocket– PC Boolean Function Simplification. Journal of Electrical Engineering, 56(7-8), 209-212.
Vollmer, H., Schnoor, H., Reith, S., Galota, M., & Creignou, N. (2012). Complexity classifications for different equivalence and audit problems for Boolean circuits. Logical Methods in Computer Science, 8.
Refbacks
- There are currently no refbacks.