Digital Electronics and Microprocessors

ES ZC261

Lecture-1
Second Semester 2009-2010

Nirmal K Gupta
Lecturer, CS/IS Group
Birla Institute of Technology and Science, Pilani, (India)
Email: nirmal@bits-pilani.ac.in
Course Outline
• Binary logic gates
• logic circuits
• Boolean algebra and K-map simplification
• Number systems and code
• Arithmetic logic units
• Flip-flops
• Registers and counters
• Introduction to microprocessors
• Architecture
• Instruction set and programming
• Memory and I/O interfacing
• Examples of system design
Binary Logic
Basic Logic Gates
More than 2 Inputs?
AND/OR can take any number of inputs.
• AND = 1 if all inputs are 1.
• OR = 1 if any input is 1.
• Similar for NAND/NOR.

Can implement with multiple two-input gates,

or with single CMOS circuit.
AND
In order for current to flow, both switches must be closed
• Logic notation AB = C

A B C

0 0 0

0 1 0

1 0 0

1 1 1
OR
Current flows if either switch is closed
• Logic notation A + B = C

A B C

0 0 0

0 1 1

1 0 1

1 1 1
Properties of AND and OR
Commutation
• A+B=B+A
• AB=BA

Same as

Same as
Properties of AND and OR
Associative Property
• A + (B + C) = (A + B) + C

• A  (B  C) = (A  B)  C =
Properties of AND and OR
Distributive Property
• A + B  C = (A + B)  (A + C)
• A+BC

A B C Q

0 0 0 0

0 0 1 0

0 1 0 0

1 0 0 1

1 0 1 1

1 1 0 1

1 1 1 1
Distributive Property
(A + B)  (A + C)

A B C Q

0 0 0 0

0 0 1 0

0 1 0 0

1 0 0 1

1 0 1 1

1 1 0 1

1 1 1 1
Inversion (NOT)

A Q

0 1

QA
Logic: 1 0
Exclusive OR (XOR)

Either A or B, but not both A B S

This is sometimes called the 0 0 0

inequality detector, because the
result will be 0 when the inputs are the 1 0 1
same and 1 when they are different. 0 1 1

The truth table is the same as for 1 1 0

S on Binary Addition. S = A  B
Getting the XOR
A B S

Two ways of getting S = 1 0 0 0

A  B or A  B 1 0 1

0 1 1

1 1 0
Circuit for XOR

A  B  AB  AB

Accumulating our results: Binary addition is the

result of XOR plus AND
NAND (NOT AND)

A B Q

Q  AB 0 0 1

0 1 1

1 0 1

1 1 0
NOR (NOT OR)

A B Q

QAB 0 0 1

0 1 0

1 0 0

1 1 0
Exclusive NOR

Q  AB A B Q

0 0 1

0 1 0
Equality Detector
1 0 0

1 1 1
Summary
Summary for all 2-input gates

Inputs Output of each gate

 A   B  AND NAND  OR  NOR XOR XNOR

0 0 0 1 0 1 0 1

0 1 0 1 1 0 1 0

1 0 0 1 1 0 1 0

1 1 1 0 1 0 0 1
Algebras
Common Postulates
Example Algebra
Boolean Algebra
Boolean vs. Ordinary Algebra
Two-valued Boolean Algebra
Check Huntington Postulates
Boolean Algebra
Thanks!!