1. |
|
Course Introduction |
Course Introduction |
|
|
|
Basic Boolean equation |
Basic Boolean equation |
|
2. |
|
De Morgan theorem |
De Morgan theorem |
|
|
|
Equation simplification |
Equation simplification |
|
3. |
|
Equation simplification |
Equation simplification |
|
|
|
NAND, NOR gate logics |
NAND, NOR gate logics |
|
4. |
|
Truth Table |
Truth Table |
|
|
|
Truth Table |
Truth Table |
|
5. |
|
Min Term / Max Term Expression |
Min Term / Max Term Expression |
|
|
|
Min Term / Max Term Expression |
Min Term / Max Term Expression |
|
6. |
|
K-Map for simplification |
K-Map for simplification |
|
|
|
Design with simplified equation |
Design with simplified equation |
|
7. |
|
Design with Gate Array/Decoder |
Design with Gate Array/Decoder |
|
8. |
|
Design with Mux |
Design with Mux |
|
|
|
Design with Memory |
Design with Memory |
|
|
|
Flexible Design |
Flexible Design |
|
9. |
|
Parity code system |
Parity code system |
|
10. |
|
2's complement for sign conversion |
2's complement for sign conversion |
|
|
|
2's complement for sign conversion |
2's complement for sign conversion |
|
11. |
|
Add/Subtract Algorithm |
Add/Subtract Algorithm |
|
|
|
Add/Subtract Algorithm |
Add/Subtract Algorithm |
|
12. |
|
Full Adder |
Full Adder |
|
|
|
Full Subtractor |
Full Subtractor |
|
13. |
|
Carry Look Ahead Adder |
Carry Look Ahead Adder |
|
|
|
Carry Look Ahead Adder |
Carry Look Ahead Adder |
|