FAST-NUCES

ISLAMABAD

Applied Physics

Abdul Rahman
 Digital Binary Logic
• Digital electronics represent signals by discrete bands of analog levels, rather than
by a continuous range.
 Digital Binary Logic
• Digital electronics represent signals by discrete bands of analog levels, rather than
by a continuous range.

• All levels within a band represent the same signal state.

• Small changes to the analog signal levels due to manufacturing tolerance, or noise do
not leave the discrete envelope, and as a result are ignored by signal state sensing
circuitry.
 Digital Binary Logic
• Digital electronics represent signals by discrete bands of analog levels, rather than
by a continuous range.

• All levels within a band represent the same signal state.

• Small changes to the analog signal levels due to manufacturing tolerance, or noise do
not leave the discrete envelope, and as a result are ignored by signal state sensing
circuitry.

• Binary logic is the most common style of digital logic.

• The signal is either a 0 (low, false) or a 1 (high, true) - Positive Logic Convention
 Digital Binary Logic
• Digital electronics represent signals by discrete bands of analog levels, rather than
by a continuous range.

• All levels within a band represent the same signal state.

• Small changes to the analog signal levels due to manufacturing tolerance, or noise do
not leave the discrete envelope, and as a result are ignored by signal state sensing
circuitry.

• Binary logic is the most common style of digital logic.

• The signal is either a 0 (low, false) or a 1 (high, true) - Positive Logic Convention

• Mathematical representation of logical operations is Boolean algebra: set of

operations (NOT, AND, OR, NAND, NOR, etc.) with binary or logical elements.
•
• To perform general logical operations, a logic family must contain NOT and at least
one another function of two inputs OR or AND.
 Review of Boolean Algebra
A Z A B Z A B Z A B Z A B Z
0 1 0 0 0 0 0 0 0 0 1 0 0 1
1 0 0 1 1 0 1 0 0 1 0 0 1 1
1 0 1 1 0 0 1 0 0 1 0 1
1 1 1 1 1 1 1 1 0 1 1 0
NOT OR AND NOR NAND
Truth Table Truth Table Truth Table Truth Table Truth Table
ZA Z  A B Z = AB Z = A +B Z = AB


 Review of Boolean Algebra
A Z A B Z A B Z A B Z A B Z
0 1 0 0 0 0 0 0 0 0 1 0 0 1
1 0 0 1 1 0 1 0 0 1 0 0 1 1
1 0 1 1 0 0 1 0 0 1 0 1
1 1 1 1 1 1 1 1 0 1 1 0
NOT OR AND NOR NAND
Truth Table Truth Table Truth Table Truth Table Truth Table
ZA Z  A B Z = AB Z = A +B Z = AB


 Review of Boolean Algebra
A Z A B Z A B Z A B Z A B Z
0 1 0 0 0 0 0 0 0 0 1 0 0 1
1 0 0 1 1 0 1 0 0 1 0 0 1 1
1 0 1 1 0 0 1 0 0 1 0 1
1 1 1 1 1 1 1 1 0 1 1 0
NOT OR AND NOR NAND
Truth Table Truth Table Truth Table Truth Table Truth Table
ZA Z  A B Z = AB Z = A +B Z = AB


 Review of Boolean Algebra
A Z A B Z A B Z A B Z A B Z
0 1 0 0 0 0 0 0 0 0 1 0 0 1
1 0 0 1 1 0 1 0 0 1 0 0 1 1
1 0 1 1 0 0 1 0 0 1 0 1
1 1 1 1 1 1 1 1 0 1 1 0
NOT OR AND NOR NAND
Truth Table Truth Table Truth Table Truth Table Truth Table
ZA Z  A B Z = AB Z = A +B Z = AB


 Review of Boolean Algebra
A Z A B Z A B Z A B Z A B Z
0 1 0 0 0 0 0 0 0 0 1 0 0 1
1 0 0 1 1 0 1 0 0 1 0 0 1 1
1 0 1 1 0 0 1 0 0 1 0 1
1 1 1 1 1 1 1 1 0 1 1 0
NOT OR AND NOR NAND
Truth Table Truth Table Truth Table Truth Table Truth Table
ZA Z  A B Z = AB Z = A +B Z = AB


 Review of Boolean Algebra
A Z A B Z A B Z A B Z A B Z
0 1 0 0 0 0 0 0 0 0 1 0 0 1
1 0 0 1 1 0 1 0 0 1 0 0 1 1
1 0 1 1 0 0 1 0 0 1 0 1
1 1 1 1 1 1 1 1 0 1 1 0
NOT OR AND NOR NAND
Truth Table Truth Table Truth Table Truth Table Truth Table
ZA Z  A B Z = AB Z = A +B Z = AB


 Logic Gate Symbols and Boolean
Expressions
• A logic gate is a physical model of a Boolean function:
it performs a logical operation on one or more logic inputs and produces a
single logic output.
 Logic Gates: AND
The simples gates are AND and OR. They can be built from switches or using
the simplest form of electronic logic - diode logic.

A = 0 , B = 0  both diodes are forward biased  both diodes conduct out is LOW  0.
 Logic Gates: AND
The simples gates are AND and OR. They can be built from switches or using
the simplest form of electronic logic - diode logic.

A = 0 , B = 0  both diodes are forward biased  both diodes conduct out is LOW  0.

A = 0 , B = 1  DB is reverse biased  does not conduct,

DA is forward biased  conducts out is LOW  0.
 Logic Gates: AND
The simples gates are AND and OR. They can be built from switches or using
the simplest form of electronic logic - diode logic.

A = 0 , B = 0  both diodes are forward biased  both diodes conduct out is LOW  0.

A = 0 , B = 1  DB is reverse biased  does not conduct,

DA is forward biased  conducts out is LOW  0.

A = 1 , B = 0  DA is reverse biased  does not conduct,

DB is forward biased  conducts out is LOW  0.
 Logic Gates: AND
The simples gates are AND and OR. They can be built from switches or using
the simplest form of electronic logic - diode logic.

A = 0 , B = 0  both diodes are forward biased  both diodes conduct out is LOW  0.

A = 0 , B = 1  DB is reverse biased  does not conduct,

DA is forward biased  conducts out is LOW  0.

A = 1 , B = 0  DA is reverse biased  does not conduct,

DB is forward biased  conducts out is LOW  0.

A = 1 , B = 1  both diodes are reverse biased 

both the diodes do not conduct  out is HIGH  1.
 Logic Gates: OR

A = 0 , B = 0  both diodes are reverse biased  does not conduct out is LOW  0.

A = 0 , B = 1  DA is reverse biased  does not conduct,

DB is forward biased  conducts out is HIGH  1.

A = 1 , B = 0  DB is reverse biased  does not conduct,

DA is forward biased  conducts out is HIGH  1.

A = 1 , B = 1  both diodes are reverse biased 

both the diodes conduct  out is HIGH  1.
 Logic Gates: NOT
We use transistor in cut-off and saturation
region to use it as a NOT switch