Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
0 of .
Results for:
No results containing your search query
P. 1
Digital Logic and Design (BOOLEAN ALGEBRA)

Digital Logic and Design (BOOLEAN ALGEBRA)

Ratings: (0)|Views: 111 |Likes:
Published by Insane Clown Prince

More info:

Published by: Insane Clown Prince on May 26, 2010
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less





Boolean Algebra:
The most obvious way to simplify Boolean expressions is to manipulate them in the same way as normalalgebraic expressions are manipulated. With regards to logic relations in digital forms, a set of rules for symbolic manipulation is needed in order to solve for the unknowns.A set of rules formulated by the English mathematician
George Boole
describe certain propositions whoseoutcome would be either 
true or false
. With regard to digital logic, these rules are used to describe circuitswhose state can be either,
1 (true) or 0 (false)
. In order to fully understand this, the relation between theAND gate,OR gateand NOT gateoperations should be appreciated. A number of rules can be derived from these relations as Table 1 demonstrates.
P1: X = 0 or X = 1
P2: 0 . 0 = 0
P3: 1 + 1 = 1
P4: 0 + 0 = 0
P5: 1 . 1 = 1
P6: 1 . 0 = 0 . 1 = 0
P7: 1 + 0 = 0 + 1 = 1Table 1: Boolean Postulates
Laws of Boolean Algebra:
Table 2shows the basic Boolean laws. Note that every law has two expressions, (a) and (b). This is known as
. These are obtained by changing every AND(.) to OR(+), every OR(+) to AND(.) and all 1's to 0's andvice-versa.It has become conventional to drop the
(AND symbol) i.e. A
B is written as AB.
T1 : Commutative Law
 A + B = B + A
 A B = B A
T2 : Associate Law
(A + B) + C = A + (B + C)
(A B) C = A (B C)
T3 : Distributive Law
 A (B + C) = A B + A C 
 A + (B C) = (A + B) (A + C)
T4 : Identity Law
 A + A = A
 A A = A
T5 :
T6 : Redundance Law
 A + A B = A
 A (A + B) = A
T7 :
0 + A = A
0 A = 0
T8 :
1 + A = 1
1 A = A
T9 :
T10 :
T11 : De Morgan's Theorem
Table 2: Boolean Laws
Prove T10 : (a)(1) Algebraically:(2) Using the truth table:Using the laws given above, complicated expressions can be simplified.
(a) Prove T10(b).2
(b) Copy or print out the truth table below and use it to prove T11: (a) and (b).
Numerical Representation
Take as an example the truth table of a three-variable function as shown below. Three variables, each of which can take the values 0 or 1, yields eight possible combinations of values for which the function may betrue. These eight combinations are listed in ascending binary order and the equivalent decimal value is alsoshown in the table.DecimalValueABCf 0000110010201013011141000510106110071111The function has a value 1 for the combinations shown, therefore:......(1)This can also be written as:f(A, B, C) = 000 + 010 + 011 + 111 Note that the summation sign indicates that the termsare "OR 'ed" together. The function can be further  reduced to the form:

Activity (6)

You've already reviewed this. Edit your review.
1 hundred reads
ravisayyes liked this
Aji Bx liked this
vanessa liked this
vanessa liked this
Amren Rahim liked this

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->