Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.
-
Upload
heather-gilmore -
Category
Documents
-
view
214 -
download
0
description
Transcript of Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.
![Page 1: Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.](https://reader035.fdocuments.net/reader035/viewer/2022062905/5a4d1aea7f8b9ab05997a69c/html5/thumbnails/1.jpg)
Boolean 4.1
Boolean Logic 4
©Paul GodinCreated September 2007
prgodin @ gmail.com
![Page 2: Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.](https://reader035.fdocuments.net/reader035/viewer/2022062905/5a4d1aea7f8b9ab05997a69c/html5/thumbnails/2.jpg)
Boolean 4.2
Solving Logic Problems
![Page 3: Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.](https://reader035.fdocuments.net/reader035/viewer/2022062905/5a4d1aea7f8b9ab05997a69c/html5/thumbnails/3.jpg)
Boolean 4.3
Solving Logic Problems◊ Digital logic problems are often expressed in a verbal
format.◊ “I need a circuit that does this when that happens...”
◊ Problem-solving steps generally involve structuring the problem into a logic format, simplifying, designing, simulating, prototyping, constructing and evaluating.
◊ There are application software tools available to help with the simplification process (seen later).
![Page 4: Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.](https://reader035.fdocuments.net/reader035/viewer/2022062905/5a4d1aea7f8b9ab05997a69c/html5/thumbnails/4.jpg)
Boolean 4.4
First Step: Logic Format
Convert the problem to a structured logic format.
A’C’ + BC + ABC’Truth TableBoolean equation
Timing DiagramA
B
Z
Logic Diagram
A A’ B C Y
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 1
1 0 0 0 1
1 0 0 1 0
1 0 1 0 1
1 0 1 1 0
![Page 5: Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.](https://reader035.fdocuments.net/reader035/viewer/2022062905/5a4d1aea7f8b9ab05997a69c/html5/thumbnails/5.jpg)
Boolean 4.5
Second Step: Simplify
Simplify the problem using reduction techniques.
00 01 11 10
00 0 0 0 0
01 1 0 0 1
11 1 0 0 1
10 0 0 0 0
DCBA
(AB+C)+(A+BD)+E
(ABC)+(ABC)+(ABC)+(ABC) = W
Boolean algebraic reduction
K-Mapping
SOP from a Truth Table to Boolean or K-Map
AB'C'+AC'D'+E
![Page 6: Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.](https://reader035.fdocuments.net/reader035/viewer/2022062905/5a4d1aea7f8b9ab05997a69c/html5/thumbnails/6.jpg)
Boolean 4.6
Third Step: Design
Create a logic circuit, preferably with simulation software. Consider universal gates.
Logic Circuit Logic Circuit, NAND Only
![Page 7: Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.](https://reader035.fdocuments.net/reader035/viewer/2022062905/5a4d1aea7f8b9ab05997a69c/html5/thumbnails/7.jpg)
Boolean 4.7
Fourth Step: Simulate
Analyse the functionality of the simulated circuit.
Input/Output Timing Diagram (Logic Analysis)
![Page 8: Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.](https://reader035.fdocuments.net/reader035/viewer/2022062905/5a4d1aea7f8b9ab05997a69c/html5/thumbnails/8.jpg)
Boolean 4.8
Fifth Step: Prototype
Construct a prototype circuit. Select the devices based on electrical, environmental, physical and other requirements.
![Page 9: Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.](https://reader035.fdocuments.net/reader035/viewer/2022062905/5a4d1aea7f8b9ab05997a69c/html5/thumbnails/9.jpg)
Boolean 4.9
Sixth Step: Construct and Evaluate
Design and assemble a circuit board. Evaluate the physical circuit’s functionality within the limits of the
environmental operating conditions.
![Page 10: Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.](https://reader035.fdocuments.net/reader035/viewer/2022062905/5a4d1aea7f8b9ab05997a69c/html5/thumbnails/10.jpg)
Boolean 4.10
Exercise: Word problem to circuit
◊ A water pump must start if any 2 adjacent sensors of its 4 sensors detects water, or if someone switches on an over-ride switch.
◊ Design and simulate this circuit.
![Page 11: Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.](https://reader035.fdocuments.net/reader035/viewer/2022062905/5a4d1aea7f8b9ab05997a69c/html5/thumbnails/11.jpg)
Boolean 4.11
©Paul R. Godinprgodin°@ gmail.com
END1011?
1101!