|
welcome!
 Welcome to pecelleleosk.blogspot.my! We provide information and notes about Computer Organization and Architecture for you to access just by your fingertips! Easy and no stress! Enjoy your study :D recent entries
Credits
| Digital Logic
LOGIC GATES
1.
AND
Y =
A.B or Y = AB
2.
OR
Y =
A + B
3.
NOT
Y =
A’ or Y = !A
4.
NAND
Y =
(A.B)’
5.
NOR
Y =
(A + B)’
6.
XOR
Y =
A.B’ + A’.B
COMBINATIONAL CIRCUIT
·
Logic block contains no memory and computes the
output given the current input.
·
Can be defined in 3 ways :
¨
Truth Table
¨
Graphical symbols (Logic circuit)
¨
Boolean equations
BOOLEAN EQUATION FORMS
v
The combinations of variables and operators
v
Has one or more inputs
v
Produce an output in the range of 0 or 1
v
Boolean equation can be represented in 2 forms :
Ø
SOP (Sum-Of-Products)
§
Multiply first then Add
§
Only choose the truth output (1)
§
Easier to derive from truth table
Ø
POS (Product-Of-Sums)
§
Add first then Multiply
§
Only choose the false output (0)
§
The output is not the simplified version
LAWS OF BOOLEAN ALGEBRA
2 ways to simplify
Boolean equation :
1.
Laws of Boolean Algebra
2.
Karnaugh Map
*Refer Chapter 5*
 |  |
0 Comments:
Post a Comment