Boolean Algebra (13)

Boolean Algebra Simplification

Boolean Algebra simplification is not that difficult to understand if you realise that the use of the symbols or signs of: "+" and "." represent the operation of logical functions. Logical functions test whether a condition or state is either TRUE or FALSE but not both at the sam...

Switching Theory

Switching Theory allows us to understand the operation and relationship between Boolean Algebra and two-level logic functions with regards to Digital Logic Gates. Switching theory can be used to further develop the theoretical knowledge and concepts of digital circuits when viewe...

Product of Sum

In the tutorial about the Sum-of-Products (SOP) expression, we saw that it represents a standard Boolean (switching) expression which "Sums" two or more "Products" by taking the output from two or more logic AND gates and OR's them together to create the final output. But we can ...

Sum of Product

Boolean Algebra is a simple and effective way of representing the switching action of standard logic gates and a set of rules or laws have been invented to help reduce the number of logic gates needed to perform a particular logical operation. Sum-of-Product form is a Boolean Alg...

DeMorgan’s Theorem

DeMorgan's Theorem uses two sets of rules or laws to solve various Boolean algebra expressions by changing OR's to AND's, and AND's to OR's Boolean Algebra uses a set of laws and rules to define the operation of a digital logic circuit with "0's" and "1's" being used to represent...

Boolean Algebra Examples

In this Boolean Algebra examples tutorial we will see that the Laws of Boolean Algebra can be used to identify unnecessary logic gates within a digital logic design reducing the number of gates required saving on both power consumption and cost. We have seen throughout this sect...

Boolean Algebra Truth Tables

As well as a standard Boolean Expression, the input and output information of any Logic Gate or circuit can be plotted into standard Boolean Algebra truth tables to give a visual representation of the switching function of the system. The table used to represent the boolean expr...

Laws of Boolean Algebra

A set of rules or Laws of Boolean Algebra expressions have been invented to help reduce the number of logic gates needed to perform a particular logic operation resulting in a list of functions or theorems known commonly as the Laws of Boolean Algebra. As well as the logic symbo...

Logic NOR Function

The logic NOR function is a combination of two separate logic functions, the Not function and the OR function (NOT-OR) connected together to form one single logic function which is the same as the OR function except that the output is inverted. To create a NOR gate, the OR funct...

Logic NAND Function

The logic NAND function is a combination of the two separate logical functions, the AND function and the NOT function (NOT-AND) in series. The logic NAND function can be expressed by the Boolean expression of, A.B     The Logic NAND Function will not produce an outp...