K-Map technique is a straight forward and simple method for minimizing Boolean functions. In this article, you will learn a special case of K-map, when the function is in a Standard Sum of Product and not in a Canonical Sum of Product form. For example In function1, each term is called a minterm( A’B’C). The … Read more
The adder is a combinational circuit that add binary digits for arithmetic computation. A combinational circuit is a kind of digital circuit that has an input, a logic circuit and an output. For variables, there are combinations of input variables and for each input combination, there is one and only one output. Therefore, output from … Read more
A Boolean function is expressed in two form. Sum of Minterms Product of Maxterms Sum of Minterms x’ y’ z , x y’ z’ , x y’ z , x y z’ , x y z , gives 1 as output in the above Truth Table. Literal – x, y, A, b etc is … Read more
We have detected that you are using extensions to block ads. Please support us by disabling these ads blocker.
