Module 7 Assignment 1

Boolean Algebra and Digital Logic

With Multimedia Logic and Powered Breadboards
1. Go to the web site http:www.pla!"hoo#e!.comdigitaladder.html
$. %se MultiMedia Logic to design the Half Adder below& and con'irm that !our
circuit generates the truth table pro(ided.
). *he *ruth *able 'or the +ull Adder is gi(en below. Gi(e de'initions 'or the
(ariables 'ound at the top o' the truth table& A, B, C in , C out, and Sum.

,. -t is NOT a simple matter to deri(e the logic circuits 'or the +ull Adder.
.b(iousl!& with / rows in the table& it is more di''icult to gi(e a simple e0pression
'or 1out 21arr! out3 and 4 2'or 4um3. Presentl!& we do not ha(e a diagram o' the
+ull Adder& and we will use this series o' lessons to deri(e a solution.
Defintions:
A 5
B 5
1 in 5
1 out 5
4 5
-n spite o' the long
e0planation 'or the Full
Adder pro(ided on the
web site& there is a simple
e0planation 'or
mathematical rule
go(erning the *ruth *able.
What is the simple rule 6
2 in 7nglish & please 8 3
Module 7 Assignment $
Boolean Algebra and Digital Logic
With Multimedia Logic and Powered Breadboards
Boolean Algebra ules
*he table below lists basic rules 'or simpli'!ing Boolean !"#ressions. When ma#ing
!our own proo's starting on page 7& 9usti'! each line o' !our proo' b! :uoting the ;ule
<umber or 4hort +orm o' the e0pressions listed below.
Number Rule
1 A A = + = or A A= + =
2
1 1= + A
or
1 1 = + A
3 = = = A or = = = A
4 A A = 1 or A A= 1
5 A A A = + or A A A = +
6 1 = + A A or 1 = + A A
7 A A A = or A A A =
8 = = A A or = = A A
9
A A=
or
A A=
10 A AB A = + or A A AB = +
11 B A B A A + = + or B A A B A + = +
12
BC A C A B A + = + + 3 32 2
or
BC A B A C A + = + + 3 32 2
A& B and 1 ma! represent a single (ariable or an entire boolean e0pression.
DeMorgan$s T%eorems
*he theorems de(eloped b! DeMorgan are listed below.
Theorem Short Form
Y X Y X + =
DM1
Y X Y X = +
DM2
Module 7 Assignment )
Boolean Algebra and Digital Logic
With Multimedia Logic and Powered Breadboards
La&s of O#eration
Law Eam!le Short Form
"ommutat#$e Law
A B B A
A B B A
+ = +
=
"%M
&''o(#at#$e Law
3 2 3 2
3 2 3 2
C B A C B A
C B A C B A
+ + = + +
=
&SS%"
D#'tr#but#$e Law
3 2 3 2 3 2
3 2
C A B A C B A
C A B A C B A
+ + = +
+ = +
D)ST
Module 7 Assignment ,
Boolean Algebra and Digital Logic
With Multimedia Logic and Powered Breadboards
Boolean Algebra 'roofs
All Boolean Algebra Proo's 'ollow a rigorous and consistent approach as outlined below:
1. All wor# is completed within a 'our"column table labeled 2'rom le't to right3:
ST!' 2lists the step number& starting at 13
L!FT S(D! )denoting the le't side o' the e:uation !ou wish to pro(e3&
(*HT S(D! 2denoting the right side o' the e:uation !ou wish to pro(e3
!ASON )either ;ule 1 to 1$& an .perations ;ule 21.M& A44.1& D-4*3 or De
Morgan>s Laws 2DM1 or DM$3
$. 7ach line shows onl! one step 2unless the simpli'ication is e0actl! the same where
multiple simpli'ications are allowed3. +or e0ample:
AB C C AB AB A + + + could be simpli'ied to: ( ) ( ) C C AB B A + + + 1 using the
Distributi(e Law 2D-4*3 in one step.
). B A is the same as AB.
Sam#le 'roofs:
ule To 'ro+e: ;ule 1= using onl! ;ules 1 through ? and the
Distributi(e Law
P;..+:

Ste# Left Side ig%t Side ,ustification
1 A Gi(en
$
3 1 2 B A +
A D-4*
) 1 A A ;ule $
, A A ;ule ,
RS LS =
A AB A = +
Module 7 Assignment @
Boolean Algebra and Digital Logic
With Multimedia Logic and Powered Breadboards
ule To 'ro+e: ;ule 11: B A B A A + = + using onl! ;ules 1 through 1= and the
Distributi(e Law 2D-4*3. <ote: AB is the same as B A A*his is a 4<7ABC oneD.
'OOF:

Ste# Left Side ig%t Side ,ustification
1 B A A+ B A+ Gi(en
$ B A A + 1 B A+
;ule ,
) B A B A + + 3 1 2
B A+
;ule $
, B A B A A + + 1 B A+
D-4*
@ B A B A A + + B A+
;ule ,
E B A A A 3 2 + +
B A+
D-4*
7 B A +1 B A+ ;ule E
/
B A+ B A+
;ule ,
RS LS =
B A B A A + = +
Boolean Algebra Sim#lifications
Boolean Algebra 4impli'ications are done the same as Boolean Algebra Proo's. *he onl!
e0ception is that there are onl! three columns instead o' 'our columns as there is no right
side.
4impli'!: B A B A B A + +
Ste# Left Side ,ustification
1 B A B A B A + + Gi(en
$ ( ) B A B B A + + D-4*
) ( ) B A A + 1 E
, AB A + ,
@
B A A +
?
E B A + 11
4tep @ is another e0ample o' a 4<7ABC one8
Module 7 Assignment E
Boolean Algebra and Digital Logic
With Multimedia Logic and Powered Breadboards
'ractice:
4impli'!:
AC BC ABC C B A C B A BC A Y + = + + + =
Ste# Left Side ,ustification
ABC C B A C B A BC A + + + Gi(en
1 C B A C B A BC A ABC + + + 1.M
$ ( ) C B A C B A BC A A + + + D-4*
) ( ) C B A C B A BC + + 1 E
, C B A C B A BC + + ,
@ C B A BC+ @
E ( ) C B A B + D-4*
/ ( ) C A B B + 1.M
?
( ) C A B +
11
1= AC BC+ 1.M
Boolean Algebra Circuit 'ractice
+or the diagram below:
1. Write the Boolean 7:uation as shown b! the circuit diagram.
$. 4impli'! the Boolean 7:uation using Boolean Algebra ;ules.
3 33 2 2 B B A A Y + = 3 simpli'ies to B B A Y = 3 2
). Draw the circuit diagram o' the simpli'ied Boolean 7:uation.
,. 1onstruct a *ruth *able showing all gates o' the original circuit diagram.
@. -nclude a column showing the simpli'ied circuit diagram.
E. What do !ou notice about both these columns6 2*he! will be identical3
7. What can !ou conclude6 2*hat we ha(e done it correctl! b! algebra rules. *he truth
table (eri'ies our answer.3


Module 7 Assignment 7
Boolean Algebra and Digital Logic
With Multimedia Logic and Powered Breadboards
More 'ractice:
+or each logic diagram below:
a3 Write the Boolean 7:uation.
b3 4impli'! the Boolean 7:uation using ;ules o' Boolean Algebra and De Morgan>s
;ules. 24how as a two"column table F include reasons 'or simpli'ication3.
c3 Write out the *ruth *able 'or the simpli'ied Boolean 7:uation.
d3 Draw the Logic Diagram o' the simpli'ied Boolean 7:uation.
e3 Pro(e with *ruth *ables that the original and simpli'ied Boolean 70pressions are
e:ui(alent.
1. $.

). ,.
Module 7 Assignment /
Boolean Algebra and Digital Logic
With Multimedia Logic and Powered Breadboards
Min-terms )Sum-of-'roducts met%od.
Gow to de(elop a circuit 'rom a truth table& using HmintermsH.
a3 Write the needed truth table to sol(e the speci'ic problem.
b3 .n each line where the truth table has a 1 in the output& write the HmintermH.
c3 .; the minterms together to get the 'inal e:uation. *his gi(es a correct e:uation 'or
the truth table& but not necessaril! the simplest e:uation.
What is a minterm6 A minterm is an e0pression made 'rom the inputs 2A& B& 1...3 or the
in(erses o' the inputs 2
A & B & 1
3 combined with A<D. -' the input is a 1& use the inputI
i' the input is a =& use the in(erse.
4ummar! o' minterms:
A B M-<*7;M 4imple 70ample: A B J M-<*7;M
= = A B = = =
= 1 A B = 1 1 A B
1 = A B 1 = =
1 1
A B
1 1 =
*he e:uation is B A X =
*he minterm is written onl! 'or the line with a 1 in the output. *he e:uation 'or this truth
table is there'ore B A X =
70ercise: %se minterms to ma#e the e:uation 'or this truth table. -tKs e:ui(alent to J.;
A B J M-<*7;M
= = =
= 1 1
1 = 1
1 1 =
Write the result as an e:uation with J.; on the le't and the minterm e0pression on the
right:
A B 5L L L L L L L L L L L L L
70ercise: %se Minterms to get an e0pression e:ui(alent to J<.;.
Module 7 Assignment ?
Boolean Algebra and Digital Logic
With Multimedia Logic and Powered Breadboards
Write the result as an e:uation with J<.; on the le't and the minterm e0pression on the
right:
A B 5L L L L L L L L L L L L L
*hose two e:uations are #nown as J.; theorems. *he! come in hand! 'or simpli'!ing
e:uations.
Module 7 Assignment 1=
Boolean Algebra and Digital Logic
With Multimedia Logic and Powered Breadboards
Finall/ Sol+ing t%e 'roblem of t%e Full Adder:
<ow let us return to the original problem o' the Full Adder.
Gere was the truth table 'or Adding 4ingle Binar! Digits A& B and 1in 'rom a pre(ious
addition:
0uestion: Gow might we appl! min"terms to deri(e a correct solution 'or
this circuit6
Ans&er: We must actuall! deri(e an e0pression 'or 1out and an e0pression
'or 4 separatel!:
1out 5 A>B1 M AB>1 M AB1> M AB1 2is the min"term e0pression 'or the
, 1>s 'ound in the 1out column3
<ow use the rules 'rom the pre(ious lessons to simpli'!:
1out 5 A>B1 M AB>1 M AB1> M AB1
2student to calculate the 'ollowingN3
5 AB1> M AB1 M A>B1 M AB>1 2reordering o' terms3
5 AB21> M 13 M 12A>B M AB>3
3 2 3 1 2 B A C AB + =
5
3 3 22 3 2 C B A B A +
And 'or the 4um& 4& we ha(e
4 5 A>B>1 M A>B1> M AB>1> M AB1
2student to calculate the 'ollowingN3
5A>B>1 M AB1 M A>B1> M AB>1> 2reordering terms3
512A>B> M AB3 M 1>2A>B M AB>3 2distributi(e propert!3
2b! truth table A>B> M AB 5 13
C B A
B A C C
=
+ = 3 2 K 3 1 2
2b! de'inition o' e0clusi(e or3
Module 7 Assignment 11
Boolean Algebra and Digital Logic
With Multimedia Logic and Powered Breadboards
%se the diagram o' the Full Adder& gi(en below and copied 'rom http:www.pla!"
hoo#e!.comdigitaladder.html to (eri'! !our answer.
1our c%allenge is to use MultiMedia Logic to build and connect the circuits represented
b! the schematic on the le't. *he , bits o' A and B are numbered = to ) going rig%t to
left& which corresponds to bottom to to# in the schematic below.
Gi(e the *ruth *able 'or Adding two ,"bit Binar!
numbers b! testing !our circuit.
Boolean
Algebra
ules
& * Sum "out
(4 bits ) (4 bits) (4 bits) (4 bits)
0000 0000
0001 0001
0010 0010
0011 0011
0100 0100
0101 0101
0110 0110
0111 0111
1000 1000
1001 1001
1010 1010
1011 1011
1100 1100
1101 1101
1110 1110
1111 1111
Module 7 Assignment 1$
Boolean Algebra and Digital Logic
With Multimedia Logic and Powered Breadboards
T%in2 About (t:
Ho& did /ou teac% Boolean Algebra3
M! 'irst teachings will be that an! Boolean e0pression with identical truth tables are in
'act identical e0pressions. Much 'ollows 'rom this basic premise. *hat was co(ered also
in grade 11.
- thought it best to use basic rules at 'irst F man! ob(ious ones. *hen& do 1ommutati(e&
Associati(e and Distributi(e Law. *hen& DeMorgan>s *heorems and 'inall! Minterms.
*his was su''icient to sol(e the initial in(estigation about building the +ull Adder.
*here are still DeMorgan *rans'ormations and Barnaugh Maps to teach& but the! were
not needed 'or this in(estigation.
Did /ou integrate it into /our teac%ing of (ntegrated Circuits3 Ho& did /ou de+elo#
t%e rules and t%eir a##lication to Boolean e4uations3 5ere Trut% Tables de+elo#ed
in con6unction &it% t%e sc%ematics and t%e e4uations3
*he abo(e rules were integrated with circuits& because students were 'amiliar 'rom grade
11 with the tas# o' building the ,"bit adder. 4o to in(estigate G.W the circuit was
deri(ed was a good& natural e0tension o' grade 11& and it moti(ated much o' the abo(e
discussions.
*ruth tables would ha(e been used to pro(e laws 1 to ?& which can then easil! be
e0trapolated to laws 1=& 11 and 1$ 2as was done in the e0amples abo(e3.
5%at tools do /ou use to ma2e circuit diagrams easier to create and read3
- use Multimedia Logic. 4ome others use 1ircuitMa#er $===.
As /ou de+elo# /our assignment, t%in2 about t%e students7 2no&ledge of Logic
Circuits and %o& com#le" a #roblem t%e/ could sol+e and document )Circuit
Diagram and Trut% Table.8
B! starting with a 'amiliar problem& students were able to e0pand the comple0it! o'
problems which the! could attempt.
5or2 5it% (t:
*he big decision is whether the assignment is 'ormati(e or summati(e. -s the student
learning 'rom this e0perience or showing o'' their #nowledge6 *he design o' !our
assignment and its comple0it! hinges on these premises.
Module 7 Assignment 1)
Boolean Algebra and Digital Logic
With Multimedia Logic and Powered Breadboards
As !ou de(elop !our assignment& loo# at the (ariet! o' wa!s that a student could learn
2ac:uire3 the sub9ect material 'rom the assignment. .r& in the case o' a summati(e
assignment& how man! di''erent wa!s could a student demonstrate that the! had mastered
the material6
As stated at the beginning& most o' this assignment WA4 'ormati(e. .<LC the last
deri(ation o' 1sum and 4 could be construed as 'ormati(e F and that being so onl! i'
students were as#ed to repeat the process on a test. 1ertainl! the! could do so. *he!
would need to stud! their notes up to that point.
4tudents ha(e demonstrated their master o' the material in steps: 4imple *ruth *ables to
deri(e laws 1 to ?& e0tension o' laws 1 to ? to 1=& 11 and 1$ b! arguments& Boolean
proo's b! citing rules& and simpli'ication with rules. *hen 'inall!& simpli'ication b!
minterms.
All o' these steps rel! upon #nowing the pre(ious steps.
*hus& a student who does not understand ALL o' the abo(e could still demonstrate
considerable achie(ement.
Discussion *opic: Learning +rom Multiple ;epresentations
*here are a (ariet! o' models o' learning and there are a number o' learning theories. We
ha(e to tr! to de(elop materials that cater to these di''erences in our students. -t ma!
re:uire a (ariet! o' e0planations and representations to produce understanding in all !our
students.
Gow do !ou present material so that all learners in !our classroom are ta#en into
account6
We use truth tables& simulation so'tware and mathematical e0pressions F all intertwined.
4ome students will alwa!s resort to truth tables& and others ma! alwa!s resort to
simulation so'tware. <ot man! would resort to 'inal real circuits on a breadboard&
because o' the di''icult! o' doing so. But the 'act is& man! di''erent media are used to
achie(e the desired outcomes& and lessons are deli(ered in a manner which allows natural
transmediation between the di''erent methods.