Prof. Giancarlo Succi, Ph.D., P.Eng.

Prof. Giancarlo Succi, Ph.D., P.Eng. E-mail: Giancarlo.Succi@unibz.it
Boolean Algebra Prof. Giancarlo Succi, Ph.D., P.Eng. Prof. G. Succi, Ph.D., P.Eng.

Introduction Mathematical rules are based on the defining limits we place on the particular numerical quantities dealt with. When we say that 1+1=2 or 3+4=7, we are implying the use of integer quantities. What most people assume to be self-evident rules of arithmetic – valid at all times and for all purposes – actually depend on what we define a number to be. Prof. G. Succi, Ph.D., P.Eng.

George Boole The English mathematician George Boole ( ) sought to give symbolic form to Aristotle's system of logic. Boole wrote a treatise on the subject in 1854, titled An Investigation of the Laws of Thought, on Which Are Founded the Mathematical Theories of Logic and Probabilities, which codified several rules of relationship between mathematical quantities limited to one of two possible values: true or false, 1 or 0. His mathematical system became known as Boolean algebra. Prof. G. Succi, Ph.D., P.Eng.

Boolean Algebra All arithmetic operations performed with Boolean quantities have but one of two possible outcomes: either 1 or 0. Claude Shannon of MIT fame recognized how Boolean algebra could be applied to on-and-off circuits, where all signals are characterized as either "high" (1) or "low" (0). His 1938 thesis, titled A Symbolic Analysis of Relay and Switching Circuits, put Boole's theoretical work to use in a way Boole never could have imagined, giving us a powerful mathematical tool for designing and analyzing digital circuits. Prof. G. Succi, Ph.D., P.Eng.

Addition Let us begin our exploration of Boolean algebra by adding numbers together: Prof. G. Succi, Ph.D., P.Eng.

OR Gates Boolean addition corresponds to the logical function of an "OR" gate, as well as to parallel switch contacts. Prof. G. Succi, Ph.D., P.Eng.

Subtraction and division
There is no such thing as subtraction in the realm of Boolean mathematics. Subtraction implies the existence of negative numbers: is the same thing as 5 + (-3), and in Boolean algebra negative quantities are forbidden. There is no such thing as division in Boolean mathematics, either, since division is really nothing more than compounded subtraction, in the same way that multiplication is compounded addition. Prof. G. Succi, Ph.D., P.Eng.

Multiplication Multiplication is valid in Boolean algebra, and thankfully it is the same as in real-number algebra: anything multiplied by 0 is 0, and anything multiplied by 1 remains unchanged: Prof. G. Succi, Ph.D., P.Eng.

AND Gates Boolean multiplication corresponds to the logical function of an "AND" gate, as well as to series switch contacts: Prof. G. Succi, Ph.D., P.Eng.

Variables Like "normal" algebra, Boolean algebra uses alphabetical letters to denote variables. Unlike "normal" algebra, though, Boolean variables are always CAPITAL letters, never lower-case. Prof. G. Succi, Ph.D., P.Eng.

Complement (1) Each and every variable has a complement: the opposite of its value. Boolean notation uses a bar above the variable character to denote complementation In written form, the complement of "A" denoted as "A-not" or "A-bar". Sometimes a "prime" symbol is used to represent complementation. For example, A' would be the complement of A. Prof. G. Succi, Ph.D., P.Eng.

Complement (2) Boolean complementation finds equivalency in the form of the NOT gate, or a normally-closed switch or relay contact Prof. G. Succi, Ph.D., P.Eng.

Review Boolean addition is equivalent to the OR logic function, as well as parallel switch contacts. Boolean multiplication is equivalent to the AND logic function, as well as series switch contacts. Boolean complementation is equivalent to the NOT logic function, as well as normally-closed relay contacts. Prof. G. Succi, Ph.D., P.Eng.

Boolean algebraic identities (1)
In mathematics, an identity is a statement true for all possible values of its variable or variables. The algebraic identity of x + 0 = x tells us that anything (x) added to zero equals the original "anything," no matter what value that "anything" (x) may be. Like ordinary algebra, Boolean algebra has its own unique identities based on the bivalent states of Boolean variables. Prof. G. Succi, Ph.D., P.Eng.

The first Boolean identity is that the sum of anything and zero is the same as the original "anything." This identity is no different from its real-number algebraic equivalent: No matter what the value of A, the output will always be the same: when A=1, the output will also be 1; when A=0, the output will also be 0. Prof. G. Succi, Ph.D., P.Eng.

The next identity is most definitely different from any seen in normal algebra. Here we discover that the sum of anything and one is one: No matter what the value of A, the sum of A and 1 will always be 1. In a sense, the "1" signal overrides the effect of A on the logic circuit, leaving the output fixed at a logic level of 1. Prof. G. Succi, Ph.D., P.Eng.

Next, we examine the effect of adding A and A together, which is the same as connecting both inputs of an OR gate to each other and activating them with the same signal: Prof. G. Succi, Ph.D., P.Eng.

In real-number algebra, the sum of two identical variables is twice the original variable's value (x + x = 2x), but remember that there is no concept of "2" in the world of Boolean math, only 1 and 0. We cannot say that A + A = 2A. Thus, when we add a Boolean quantity to itself, the sum is equal to the original quantity: = 0, and = 1. Prof. G. Succi, Ph.D., P.Eng.

Introducing the uniquely Boolean concept of complementation into an additive identity, we find an interesting effect. Since there must be one "1" value between any variable and its complement, and since the sum of any Boolean quantity and 1 is 1, the sum of a variable and its complement must be 1: Prof. G. Succi, Ph.D., P.Eng.

Just as there are four Boolean additive identities (A+0, A+1, A+A, and A+A'), so there are also four multiplicative identities: Ax0, Ax1, AxA, and AxA'. Of these, the first two are no different from their equivalent expressions in regular algebra: Prof. G. Succi, Ph.D., P.Eng.

The third multiplicative identity expresses the result of a Boolean quantity multiplied by itself. In normal algebra, the product of a variable and itself is the square of that variable (3 x 3 = 32 = 9). However, the concept of "square" implies a quantity of 2, which has no meaning in Boolean algebra, so we cannot say that A x A = A2. Instead, we find that the product of a Boolean quantity and itself is the original quantity, since 0 x 0 = 0 and 1 x 1 = 1: Prof. G. Succi, Ph.D., P.Eng.

The fourth multiplicative identity has no equivalent in regular algebra because it uses the complement of a variable, a concept unique to Boolean mathematics. Since there must be one "0" value between any variable and its complement, and since the product of any Boolean quantity and 0 is 0, the product of a variable and its complement must be 0: Prof. G. Succi, Ph.D., P.Eng.

To summarize, then, we have four basic Boolean identities for addition and four for multiplication: Prof. G. Succi, Ph.D., P.Eng.

Another identity having to do with complementation is that of the double complement: a variable inverted twice. Complementing a variable twice (or any even number of times) results in the original Boolean value. This is analogous to negating (multiplying by -1) in real-number algebra: an even number of negations cancel to leave the original value: Prof. G. Succi, Ph.D., P.Eng.

Boolean algebraic laws (1)
Another type of mathematical identity, called a "property" or a "law," describes how differing variables relate to each other in a system of numbers. One of these properties is known as the commutative property, and it applies equally to addition and multiplication. In essence, the commutative property tells us we can reverse the order of variables that are either added together or multiplied together without changing the truth of the expression Prof. G. Succi, Ph.D., P.Eng.

Prof. G. Succi, Ph.D., P.Eng.

Along with the commutative properties of addition and multiplication, we have the associative property, again applying equally well to addition and multiplication. This property tells us we can associate groups of added or multiplied variables together with parentheses without altering the truth of the equations. Prof. G. Succi, Ph.D., P.Eng.

Lastly, we have the distributive property, illustrating how to expand a Boolean expression formed by the product of a sum, and in reverse shows us how terms may be factored out of Boolean sums-of-products: Prof. G. Succi, Ph.D., P.Eng.

Review To summarize, here are the three basic properties: commutative, associative, and distributive. Prof. G. Succi, Ph.D., P.Eng.

Boolean rules for simplification (1)
Boolean algebra finds its most practical use in the simplification of logic circuits. If we translate a logic circuit's function into symbolic (Boolean) form, and apply certain algebraic rules to the resulting equation to reduce the number of terms and/or arithmetic operations, the simplified equation may be translated back into circuit form for a logic circuit performing the same function with fewer components. If equivalent function may be achieved with fewer components, the result will be increased reliability and decreased cost of manufacture. Prof. G. Succi, Ph.D., P.Eng.

To this end, there are several rules of Boolean algebra presented in this section for use in reducing expressions to their simplest forms. The identities and properties already reviewed in this chapter are very useful in Boolean simplification, and for the most part bear similarity to many identities and properties of "normal" algebra. However, the rules shown in this section are all unique to Boolean mathematics. Prof. G. Succi, Ph.D., P.Eng.

This rule may be proven symbolically by factoring an "A" out of the two terms, then applying the rules of A + 1 = 1 and 1A = A to achieve the final result. Prof. G. Succi, Ph.D., P.Eng.

Please note how the rule A + 1 = 1 was used to reduce the (B + 1) term to 1. When a rule like "A + 1 = 1" is expressed using the letter "A", it doesn't mean it only applies to expressions containing "A". What the "A" stands for in a rule like A + 1 = 1 is any Boolean variable or collection of variables. This is perhaps the most difficult concept for new students to master in Boolean simplification: applying standardized identities, properties, and rules to expressions not in standard form. Prof. G. Succi, Ph.D., P.Eng.

The next rule looks similar to the first one shown in this section, but is actually quite different and requires a more clever proof: Prof. G. Succi, Ph.D., P.Eng.

Note how the last rule (A + AB = A) is used to "un-simplify" the first "A" term in the expression, changing the "A" into an "A + AB". While this may seem like a backward step, it certainly helped to reduce the expression to something simpler! Sometimes in mathematics we must take "backward" steps to achieve the most elegant solution. Knowing when to take such a step and when not to is part of the art-form of algebra, just as a victory in a game of chess almost always requires calculated sacrifices. Prof. G. Succi, Ph.D., P.Eng.

Another rule involves the simplification of a product-of-sums expression: Prof. G. Succi, Ph.D., P.Eng.

Review To summarize, here are the three new rules of Boolean simplification expounded in this section: Prof. G. Succi, Ph.D., P.Eng.

Example Let's begin with a semiconductor gate circuit in need of simplification. The "A," "B," and "C" input signals are assumed to be provided from switches, sensors, or perhaps other gate circuits. Where these signals originate is of no concern in the task of gate reduction Prof. G. Succi, Ph.D., P.Eng.

Example Our first step in simplification must be to write a Boolean expression for this circuit. This task is easily performed step by step if we start by writing sub-expressions at the output of each gate, corresponding to the respective input signals for each gate. Remember that OR gates are equivalent to Boolean addition, while AND gates are equivalent to Boolean multiplication. For example, I'll write sub-expressions at the outputs of the first three gates: Prof. G. Succi, Ph.D., P.Eng.

Example . . . then another sub-expression for the next gate:
Finally, the output ("Q") is seen to be equal to the expression AB+BC(B+C) Prof. G. Succi, Ph.D., P.Eng.

Example Now that we have a Boolean expression to work with, we need to apply the rules of Boolean algebra to reduce the expression to its simplest form (simplest defined as requiring the fewest gates to implement) Prof. G. Succi, Ph.D., P.Eng.

Example The final expression, B(A + C), is much simpler than the original, yet performs the same function. If you would like to verify this, you may generate a truth table for both expressions and determine Q's status (the circuits' output) for all eight logic-state combinations of A, B, and C, for both circuits. The two truth tables should be identical. Now, we must generate a schematic diagram from this Boolean expression. Prof. G. Succi, Ph.D., P.Eng.

Example To do this, evaluate the expression, following proper mathematical order of operations (multiplication before addition, operations inside parentheses before anything else), and draw gates for each step. Remember again that OR gates are equivalent to Boolean addition, while AND gates are equivalent to Boolean multiplication. In this case, we would begin with the sub-expression "A + C", which is an OR gate: Prof. G. Succi, Ph.D., P.Eng.

Example The next step in evaluating the expression "B(A + C)" is to multiply (AND gate) the signal B by the output of the previous gate (A + C): Obviously, this circuit is much simpler than the original, having only two logic gates instead of five. Such component reduction results in higher operating speed (less delay time from input signal transition to output signal transition), less power consumption, less cost, and greater reliability. Prof. G. Succi, Ph.D., P.Eng.

The Exclusive-OR function (1)
One element conspicuously missing from the set of Boolean operations is that of Exclusive-OR. Whereas the OR function is equivalent to Boolean addition, the AND function to Boolean multiplication, and the NOT function (inverter) to Boolean complementation, there is no direct Boolean equivalent for Exclusive-OR. This hasn't stopped people from developing a symbol to represent it, though: Prof. G. Succi, Ph.D., P.Eng.

The Exclusive-OR function (2)
This symbol is seldom used in Boolean expressions because the identities, laws, and rules of simplification involving addition, multiplication, and complementation do not apply to it. However, there is a way to represent the Exclusive-OR function in terms of OR and AND, as has been shown in previous chapters: AB' + A'B Prof. G. Succi, Ph.D., P.Eng.

DeMorgan's Theorems (1) A mathematician named DeMorgan developed a pair of important rules regarding group complementation in Boolean algebra. By group complementation, I'm referring to the complement of a group of terms, represented by a long bar over more than one variable. You should recall from the chapter on logic gates that inverting all inputs to a gate reverses that gate's essential function from AND to OR, or vice versa, and also inverts the output. Prof. G. Succi, Ph.D., P.Eng.

DeMorgan's Theorems (2) So, an OR gate with all inputs inverted (a Negative-OR gate) behaves the same as a NAND gate, and an AND gate with all inputs inverted (a Negative-AND gate) behaves the same as a NOR gate. DeMorgan's theorems state the same equivalence in "backward" form: that inverting the output of any gate results in the same function as the opposite type of gate (AND vs. OR) with inverted inputs: Prof. G. Succi, Ph.D., P.Eng.

DeMorgan's Theorems (3) A long bar extending over the term AB acts as a grouping symbol, and as such is entirely different from the product of A and B independently inverted. Prof. G. Succi, Ph.D., P.Eng.

DeMorgan's Theorems (4) In other words, (AB)' is not equal to A'B'. Because the "prime" symbol (') cannot be stretched over two variables like a bar can, we are forced to use parentheses to make it apply to the whole term AB in the previous sentence. A bar, however, acts as its own grouping symbol when stretched over more than one variable. This has profound impact on how Boolean expressions are evaluated and reduced, as we shall see. Prof. G. Succi, Ph.D., P.Eng.

DeMorgan's Theorems (5) DeMorgan's theorem may be thought of in terms of breaking a long bar symbol. When a long bar is broken, the operation directly underneath the break changes from addition to multiplication, or vice versa, and the broken bar pieces remain over the individual variables. To illustrate: Prof. G. Succi, Ph.D., P.Eng.

DeMorgan's Theorems (6) When multiple "layers" of bars exist in an expression, you may only break one bar at a time, and it is generally easier to begin simplification by breaking the longest (uppermost) bar first. To illustrate, let's take the expression (A + (BC)')' and reduce it using DeMorgan's Theorems: Prof. G. Succi, Ph.D., P.Eng.

DeMorgan's Theorems (7) Following the advice of breaking the longest (uppermost) bar first, I'll begin by breaking the bar covering the entire expression as a first step: As a result, the original circuit is reduced to a three-input AND gate with the A input inverted: Prof. G. Succi, Ph.D., P.Eng.

DeMorgan's Theorems (8) You should never break more than one bar in a single step, as illustrated here: As tempting as it may be to conserve steps and break more than one bar at a time, it often leads to an incorrect result, so don't do it! Prof. G. Succi, Ph.D., P.Eng.

DeMorgan's Theorems (9) It is possible to properly reduce this expression by breaking the short bar first, rather than the long bar first: Prof. G. Succi, Ph.D., P.Eng.

DeMorgan's Theorems (10) The end result is the same, but more steps are required compared to using the first method, where the longest bar was broken first. Note how in the third step we broke the long bar in two places. This is a legitimate mathematical operation, and not the same as breaking two bars in one step! The prohibition against breaking more than one bar in one step is not a prohibition against breaking a bar in more than one place. Breaking in more than one place in a single step is okay; breaking more than one bar in a single step is not. Prof. G. Succi, Ph.D., P.Eng.

DeMorgan's Theorems (11) You might be wondering why parentheses were placed around the sub-expression B' + C', considering the fact that I just removed them in the next step. I did this to emphasize an important but easily neglected aspect of DeMorgan's theorem. Since a long bar functions as a grouping symbol, the variables formerly grouped by a broken bar must remain grouped lest proper precedence (order of operation) be lost. Prof. G. Succi, Ph.D., P.Eng.

DeMorgan's Theorems (12) In this example, it really wouldn't matter if I forgot to put parentheses in after breaking the short bar, but in other cases it might. Consider this example, starting with a different expression: Prof. G. Succi, Ph.D., P.Eng.

DeMorgan's Theorems (13) As you can see, maintaining the grouping implied by the complementation bars for this expression is crucial to obtaining the correct answer. Let's now apply the principles of DeMorgan's theorems to the simplification of a gate circuit: Prof. G. Succi, Ph.D., P.Eng.

Example (1) As always, our first step in simplifying this circuit must be to generate an equivalent Boolean expression. We can do this by placing a sub-expression label at the output of each gate, as the inputs become known. Here's the first step in this process: Prof. G. Succi, Ph.D., P.Eng.

Example (2) Next, we can label the outputs of the first NOR gate and the NAND gate. When dealing with inverted-output gates, I find it easier to write an expression for the gate's output without the final inversion, with an arrow pointing to just before the inversion bubble. Then, at the wire leading out of the gate (after the bubble), I write the full, complemented expression. Prof. G. Succi, Ph.D., P.Eng.

Example (3) This helps ensure I don't forget a complementing bar in the sub-expression, by forcing myself to split the expression-writing task into two steps: Prof. G. Succi, Ph.D., P.Eng.

Example (4) Finally, we write an expression (or pair of expressions) for the last NOR gate: Prof. G. Succi, Ph.D., P.Eng.

Example (5) Now, we reduce this expression using the identities, properties, rules, and theorems (DeMorgan's) of Boolean algebra: Prof. G. Succi, Ph.D., P.Eng.

Example (6) The equivalent gate circuit for this much-simplified expression is as follows: Prof. G. Succi, Ph.D., P.Eng.

Review (1) DeMorgan's Theorems describe the equivalence between gates with inverted inputs and gates with inverted outputs. Simply put, a NAND gate is equivalent to a Negative-OR gate, and a NOR gate is equivalent to a Negative-AND gate. When "breaking" a complementation bar in a Boolean expression, the operation directly underneath the break (addition or multiplication) reverses, and the broken bar pieces remain over the respective terms. Prof. G. Succi, Ph.D., P.Eng.

Review (2) It is often easier to approach a problem by breaking the longest (uppermost) bar before breaking any bars under it. You must never attempt to break two bars in one step! Complementation bars function as grouping symbols. Therefore, when a bar is broken, the terms underneath it must remain grouped. Parentheses may be placed around these grouped terms as a help to avoid changing precedence. Prof. G. Succi, Ph.D., P.Eng.

Prof. Giancarlo Succi, Ph.D., P.Eng.

Similar presentations

Presentation on theme: "Prof. Giancarlo Succi, Ph.D., P.Eng."— Presentation transcript:

Similar presentations

About project

Feedback

Log in

Auth with social network:

Prof. Giancarlo Succi, Ph.D., P.Eng.

Similar presentations

Presentation on theme: "Prof. Giancarlo Succi, Ph.D., P.Eng."— Presentation transcript:

Similar presentations

About project

Feedback