Abstract:
There are many ways a Boolean function can be The most popular one is a truth table representation. size the truth table increases exponentially with the increase n Another commonly used approach AND-OR represent also known as the Sum-of-Products than
During last two decade researchers focused their eyes logic functions using EXOR-based circuits which is more compact than AND-OR representation. example, for representing a function an AND-OR AND-EXOR representation takes n product In this chapter, classification of AND-OR AND-EXOR logic is presented along with details description.
Description:
This thesis submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering of East West University, Dhaka, Bangladesh.
