ME‐303 MECHATRONICS

Dr. Fakhre Alam Khan

1
• Transistors
• Applications of Transistors
• Types of Transistors
• Gain

2
 NUMBERING SYSTEMS
(Decimal and Binary Number Systems)

3
 NUMBERING SYSTEMS
(Converting from Decimal to Binary)

4
 NUMBERING SYSTEMS
(Converting from Binary to Decimal)

5
NUMBERING SYSTEMS
(Hexadecimal System)

6
 NUMBERING SYSTEMS
(Converting between Binary and Hex)

7
 NUMBERING SYSTEMS
(Converting from Decimal to Hex)

8
 NUMBERING SYSTEMS
(Converting from Hex to Decimal)

9
NUMBERING SYSTEMS
(Addition of Hex Numbers)

10
 NUMBERING SYSTEMS
(Subtraction of Hex Numbers)

11
NUMBERING AND CODING SYSTEMS
(ASCII Code)

12
DIGITAL PRIMER (Binary Logic)

13
COMBINATIONAL LOGIC CIRCUITS

14
COMBINATIONAL LOGIC CIRCUITS

15
 COMBINATIONAL LOGIC CIRCUITS (Example)

four independent
two-input NOR gates

A’s and the B’s are inputs,

and Y’s are the gate’s output.

16
COMBINATIONAL LOGIC (BOOLEAN ALGEBRA)
 Rules that can be used to simplify Boolean expressions.

S.No Equation Name of Law or Property

1 Idempotent law (OR)
2 Domination law
3 Identity law (OR)
4 Idempotent law (AND)
5 Commutative law
6 Distributive law
7 Distributive law
8 Unit property
9 Zero property
10 Domination law
11 Identity law (AND)
12 De‐Morgan rule The last two rules are useful in converting
13 De‐Morgan rule between AND and OR gates.
17
COMBINATIONAL LOGIC (BOOLEAN ALGEBRA)
Circuit Simplification
The output of this circuit in terms of the inputs is given by

C = (A + B) . B

Using rule 6 and then rule 4, we can write the above expression as

C = A . B + B . B = A . B +B

Also applying rule 11 and then rule 6, we get

C = A . B + B = A . B + B . 1 = (A + 1) . B

Since A + 1 = 1 by rule 2 and (1 . B) = B by rule 11

The output of this circuit is C = B.

18
 BOOLEAN FUNCTION GENERATION
FROM TRUTH TABLES
The basic approach is to manipulate the logic functions into one of two equivalent forms.

Sum of products form:   A . B + A . C
Or Product of sums form: (A + B) . (A + C)

Sum of Products (SOP) form:

1. Inputs are AND-ed together to form products.
2. These products then are OR-ed together to generate the output.

Product of Sums (POS) form:

1. Inputs are OR-ed together to form sums.
2. These sums then are AND-ed together to generate the output.

Note: The Sum of Products form is more commonly used.

19