Student N°: 246485585 Digital Electronics 1 Page 1

Numerical Representations
Analog Representations:
• One quantity is represented by another, which is directly proportional to the first.
• They can gradually vary over a continuous range of values.
• Examples: Auto speedometer, Room thermostat, Audio microphone,
Wristwatch

Digital Representations:
• Quantities are represented not by proportional quantities but by symbols called
DIGITS.
• Quantities change in discrete steps (i.e. step by step)
• Examples: Resistor Substitution box, Sand Grains on a beach, Digital Clock

Luke Cole Page 1

Student N°: 246485585 Digital Electronics 1 Page 2

Number Systems
• Number systems are defined by there base value
• E.g. base 8; means: 8n, where n = 0, 1, 2, 3, …
• The digital number system that is used is the Binary System.
• Below is the equivalent values between the four number systems:

Decimal (Base 10) Binary (Base 2) Octal (Base 8) Hex (Base 16)
0 0 0 0
1 1 1 1
2 10 2 2
3 11 3 3
4 100 4 4
5 101 5 5
6 110 6 6
7 111 7 7
8 1000 10 8
9 1001 11 9
10 1010 12 A
11 1011 13 B
12 1100 14 C
13 1101 15 D
14 1110 16 E
15 1111 17 F
16 10000 20 10
17 10001 21 11
18 10010 22 12
19 10011 23 13
20 10100 24 14
21 10101 25 15
22 10111 26 16
23 11000 27 17
24 11001 30 18
25 11010 31 19
26 11011 32 1A

Equation: DN = 2n − 1
DN = Greatest decimal number that can be represented by ‘n’ bits
n = Number of bits

Luke Cole Page 2

Student N°: 246485585 Digital Electronics 1 Page 3

Digit Weighting:
• Digit weighting means a digits positional value in the number.
E.g.(1) The weight of “3” in the number 318910 is: 3 × 103
E.g.(2) The weight of “1” in the number 10002 is: 1 × 23

Conversion of Number Systems:

Converting Decimal to Another Base
• This is achieved by continuously dividing the decimal number by the new base, and
keeping track of the remainder after each division.
E.g. 10510 ⇒ Binary

A 2∣105
52 + 1
26 + 0
13 + 0
6+1
3+0
1+1
0+1
Working up the remainders
10510 ⇒ 11010012

Converting Another Base to Decimal

• This is achieved by Expand using digit weights
E.g. 75168 ⇒ Decimal

A 75168 = 7 × 83 + 5 × 82 + 1 × 81 + 6 × 80
= 3918

Luke Cole Page 3

Student N°: 246485585 Digital Electronics 1 Page 4

Boolean Expressions (For Binary Only)

• An expression that defines the output result.

Single Variable Theorems:

Theorem: X.0 = 0

Theorem: X.1 = X

Theorem: X.X = X

Theorem: X . X =0

Theorem: X+0=X

Theorem: X+1=1

Theorem: X+X=X

Theorem: X  X =0

Theorem: X =X

Multivariable Theorems:
Theorem: X(Y + Z) = X.Y + X.Z

Theorem: (W + X)(Y + Z) = W.Y + W.Z + X.Y + X.Z

Theorem: X  X . Y = X Y

Theorem: X + X.Y = X

De Morgan’s Theorems:

Luke Cole Page 4

Student N°: 246485585 Digital Electronics 1 Page 5

Theorem: X . Y = X Y

Theorem: X Y = X . Y

Logic Circuits
• Digital circuits or logic circuits are made up of binary numbers.
• In an electrical circuit, the range between 5 - 2 volt or amps is considered as a logic
1, where as the range between 0.8 - 0 volts or amps is considered as a logic 0.

Note: In digital systems 3.6V means the same as

4.3V, whereas in an analog system the exact value
is important.

Positive Logic Diagram:

‘
1’

‘
0’

Negative Logic Diagram:

‘0
’

‘1
’

Truth Tables:
• Represent all possible input conditions
Equation: C = 2n
C = Number of input combinations
N = Number of inputs (variables)

• For a unknown 2-input logic gate there are 22 = 4 combinations, the truth table is
represent below, where ‘A’ & ‘B’ are the inputs and ‘Z’ the output.
A B Z
0 0 1
0 1 0
Luke Cole Page 5
1 0 1
1 1 0
Student N°: 246485585 Digital Electronics 1 Page 6

Karnaugh Maps (K Map)

• Used to give a boolean expression from a truth table.

E.g. (1)
Truth Table K Map
B B
A B Z A 1 0
0 0 1 ⇒ A. B A 0 1
0 1 0
1 0 0
1 1 1 ⇒ A.B

∴ Z = A . B + A.B

E.g. (2)
Truth Table
K Map
A B C Z C C
0 0 0 0 A. B 0 0
0 0 1 0 A. B 1 1
0 1 0 1 ⇒ A. B 0 0
A. B.C A.B 0 0
0 1 1 1 ⇒
A. B.C
1 0 0 0
1 0 1 0
1 1 0 0
∴ Z = A. B.C + A. B.C or One can see that no matter
what ‘C’
= A . B  C C  is the answer is defined by A . B
= A. B

Luke Cole Page 6

Student N°: 246485585 Digital Electronics 1 Page 7

IC’s and Logic Gates

Integrated Circuits (IC):
An example of describing an IC is “7400 QUAD 2-INPUT NAND GATE” which
means:
• Dual-In-Line (7400 series are DIP’s) IC with four 2-input NAND gates
The pin-out is shown below:

When using an IC
• Do Not touch the pins
• Pin 1 can be found to the left of the cutout semi-circle
• Connect the power pins first (GND & VCC)
• Connect unused inputs to ground

Luke Cole Page 7

Student N°: 246485585 Digital Electronics 1 Page 8

AND Gate:
Schematic

Diagram

Boolean Expression: Z = A.B.C…

Z = Output
A = 1st input Note: Output will be ‘high’ if
B = 2nd input all inputs are ‘high’
C = 3rd input
… = etc.

Truth Table (For 2-Input Gate)

A B Z
0 0 0
0 1 0
1 0 0
1 1 1

Symbols
Conventional Symbol IEC Symbol

A A &
Z Z
B B

Using NOR Gates

A
≥
1

≥
1
Z
B Luke Cole Page 8
≥
1
Student N°: 246485585 Digital Electronics 1 Page 9

Using NAND Gates

A& &
Z
B

OR Gate:
Schematic

Diagram

Boolean Expression: Z = A + B + C + …
Z = Output
A = 1st input
B = 2nd input Note: Output will be ‘high’ if
C = 3rd input any or all inputs are ‘high’
… = etc.

Truth Table (For 2-Input Gate)

A B Z
0 0 0
0 1 1
1 0 1
1 1 1

Symbols
Conventional Symbol IEC Symbol

A A
Z ≥
1
Z
B B
Using NOR Gates

A &
&
Luke Cole Z Page 9
B &
Student N°: 246485585 Digital Electronics 1 Page 10

Using NAND Gates

A 1
≥ ≥
1
Z
B

NOT (or Inverter) Gate:

Schematic

Diagram

Boolean Expression: Z= A
Z = Output
A = 1st input Note: Output will be ‘high’ if
input is ‘low’

Truth Table (For 2-Input Gate)

A Z
0 1
1 0

Symbols
Conventional Symbol IEC Symbol

1
A Z A Z

Using a NOR Using a NAND

A A
≥
1
Z
&
Z

Luke Cole Page 10

Student N°: 246485585 Digital Electronics 1 Page 11

Using a XOR
A = 1
Z
‘
1’

Buffer Gate:
Boolean Expression: Z = A
Z = Output
A = 1st input Note: Output will be ‘high’ if
input is ‘high’

Truth Table (For 2-Input Gate)

A Z
0 0
1 1

Symbols
Conventional Symbol IEC Symbol

1
A Z A Z

Using a NOR Using a NAND

A A
≥
1
Z
&
Z

Luke Cole Page 11

Student N°: 246485585 Digital Electronics 1 Page 12

Using a XOR

A =
1
Z
‘
0’

NAND Gate:
Boolean Expression: Z = A . B . C 
Z = Output
A = 1st input Note: Output will be ‘high’ if
B = 2nd input none or any but all inputs are
C = 3rd input ‘high’
… = etc.

Truth Table (For 2-Input Gate)

A B Z
0 0 1
0 1 1
1 0 1
1 1 0

Symbols
Conventional Symbol IEC Symbol

A A
Z &
Z
B B

Luke Cole Page 12

Student N°: 246485585 Digital Electronics 1 Page 13

NOR Gate:
Boolean Expression: Z = A BC 
Z = Output
A = 1st input
B = 2nd input Note: Output will be ‘high’ if
C = 3rd input all inputs are ‘low’
… = etc.

Truth Table (For 2-Input Gate)

A B Z
0 0 1
0 1 0
1 0 0
1 1 0

Symbols
Conventional Symbol IEC Symbol
A A
Z ≥
1
Z
B B
Luke Cole Page 13
Student N°: 246485585 Digital Electronics 1 Page 14

XOR (or EOR) Gate:

Boolean Expression: Z = A ⊕ B ⊕C ⊕ 
Z = Output
A = 1st input
B = 2nd input Note: Output will be ‘high’ if
C = 3rd input any but not all inputs are ‘high’
… = etc.

Truth Table (For 2-Input Gate)

A B Z
0 0 0
0 1 1
1 0 1
1 1 0

Symbols
Conventional Symbol IEC Symbol
A A
Z Luke Cole =
1 Page 14
Z
B B
Student N°: 246485585 Digital Electronics 1 Page 15

XNOR (or ENOR) Gate:

Boolean Expression: Z = A ⊕ B ⊕ C ⊕ 
Z = Output
A = 1st input
B = 2nd input Note: Output will be ‘high’ if
C = 3rd input all inputs are ‘high’ or ‘low’
… = etc.

Truth Table (For 2-Input Gate)

A B Z
0 0 1
0 1 0
1 0 0
1 1 1

Luke Cole Page 15

Student N°: 246485585 Digital Electronics 1 Page 16

Symbols
Conventional Symbol IEC Symbol
A A
Z =
1
Z
B B

Glossary
MSD Most significant digit
E.g. 2345.9710; here “2000” is MSD
LSD Least significant digit
E.g. 2345.9710; here “0.07” is LSD
MSB Most significant bit
E.g. 1001.1012; here “1000” is MSB
LSB Least significant bit
E.g. 1001.1012: here “0.001” is LSB
IC Integrated circuit
DIP Dual-in-line IC package with 14, 16,24, 28 pins being most common
DUAL Two
TRIPLE Three
QUAD Four

Luke Cole Page 16

Student N°: 246485585 Digital Electronics 1 Page 17

HEX Six
BIT Binary Digit
TTL Transistor-Transistor Logic
LSTTL Low power Schottky TTL
CMOS Complementary Metal Oxide Semiconductor
ECL Emitter-Coupled Logic
SSI Small Scale Integration (1 - 12 gates)
MSI Medium SI (12 – 99 gates)
LSI Large SI (100 – 9 999 gates)
VLSI Very Large SI (10 000 – 99 999 gates)

Luke Cole Page 17