EET214 Basic circuit Design

Lecture 1

03/05/2024
 – Number System

03/05/2024
 Number System
• A number system is a code that uses symbols
to count the number of items. The most
common and familiar number system is the
decimal number system. The decimal number
system uses the symbols 0, 1, 2, 3, 4, 5, 6, 7, 8
and 9. Thus, the decimal system uses 10 digits
for counting the items.
• A binary system uses only two digits (0 and 1)
for counting the items.
03/05/2024
 Binary Number System

03/05/2024
 Binary Number System

03/05/2024
 Binary Number System

03/05/2024
 Binary Number System

03/05/2024
 Binary Number System

03/05/2024
 Binary Number System

03/05/2024
 Binary Number System

03/05/2024
 Binary Number System

03/05/2024
 Binary Number System

03/05/2024
 Binary Number System

03/05/2024
 Binary Number System

03/05/2024
 Binary Number System

03/05/2024
 Binary Number System

03/05/2024
 Binary Number System

03/05/2024
 Logic Gates

03/05/2024
 Logic Gates

03/05/2024
 OR Gate

03/05/2024
 AND Gate

03/05/2024
 AND Gate

03/05/2024
 NOT Gate or Inverter

03/05/2024
 The AND gate

03/05/2024
 The OR gate

03/05/2024
 The NOT gate (or inverter)

03/05/2024
 A Logic Buffer Gate

03/05/2024
 The NAND gate

03/05/2024
 The NOR gate

03/05/2024
 The Exclusive OR gate

03/05/2024
 The Exclusive NOR gate

03/05/2024
 Boolean Algebra

03/05/2024
 Boolean Theorems

03/05/2024
 Boolean Theorems

03/05/2024
Combinational Logic

 Digital systems may be divided into two broad

categories:
– combinational logic
 where the outputs are determined solely by the current states
of the inputs
– sequential logic
 where the outputs are determined not only by the current
inputs but also by the sequence of inputs that led to the
current state
 In this lecture we will look at combination logic
 Implementing a function from a Boolean expression
Example – see Example 1 in the course text
Implement the function X  A  BC
 Implementing a function from a Boolean expression
Example – see Example 2 in the course text
Implement the function Y  AB  CD
 Generating a Boolean expression from a logic
diagram
Example – see Example 3 in the course text
Example (continued)
– work progressively from the inputs to the output adding
logic expressions to the output of each gate in turn
 Implementing a logic function from a description
Example – see Example 4 in the course text
The operation of the Exclusive OR gate can be stated as:
“The output should be true if either of its inputs are true,
but not if both inputs are true.”
This can be rephrased as:
“The output is true if A OR B is true,
AND if A AND B are NOT true.”
We can write this in Boolean notation as
X  ( A  B)  ( AB )
Example (continued)
The logic function
X  ( A  B)  ( AB )
can then be implemented as before
 Implementing a logic function from a truth table
Example – see Example 6 in the course text
Implement the function of the following truth table
A B C X – first write down a Boolean
0 0 0 0
expression for the output
0 0 1 1
– then implement as before
0 1 0 0
0 1 1 0 – in this case
1 0 0 0
X  A BC  ABC  ABC
1 0 1 1
1 1 0 1
1 1 1 0
Example (continued)
The logic function X  A BC  A BC  AB C
can then be implemented as before
 In some cases it is possible to simplify logic
expressions using the rules of Boolean algebra
Example – see Example 7 in the course text
X  ABC  A BC  AC  A C can be simplified to X  BC  A
hence the following circuits are equivalent
Number Systems and Binary Arithmetic

 Most number systems are order dependent

 Decimal
123410 = (1  103) + (2  102) + (3  101) + (4  100)
 Binary
11012 = (1  23) + (1  22) + (0  21) + (1  20)
 Octal
1238 = (1  83) + (2  82) + (3  81)
 Hexadecimal
12316 = (1  163) + (2  162) + (3  161)
here we need 16 characters – 0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F
 Number conversion
– conversion to decimal
 add up decimal equivalent of individual digits
Example – see Example 8 in the course text
Convert 110102 to decimal
110102 = (1  24) + (1  23) + (0  22) + (1  21) + (0  20)
= 16 + 8 + 0 + 2 + 0
= 2610
 Number conversion
– conversion from decimal
 repeatedly divide by the base and remember the remainder
Example – see Example 9 in the course text
Convert 2610 to binary
Number Remainder
Starting point 26
2 13 0
2 6 1
2 3 0
2 1 1
2 0 1
read number from this
end
=11010
 Binary arithmetic
– much simpler than decimal arithmetic
– can be performed by simple circuits, e.g. half adder
Numeric and Alphabetic Codes
Decimal Binary
 Binary code
0 0
– by far the most common 1 1
way of representing 2 10
3 11
numeric information 4 100
– has advantages of 5 101
6 110
simplicity and efficiency of 7 111
8 1000
storage 9 1001
10 1010
11 1011
12 1100
etc. etc.
Numeric and Alphabetic Codes
Decimal Binary
 Binary-coded decimal code
0 0
– formed by converting each 1 1
digit of a decimal number 2 10
3 11
individually into binary 4 100
– requires more digits than 5 101
6 110
conventional binary 7 111
8 1000
– has advantage of very easy 9 1001
conversion to/from decimal 10 10000
11 10001
– used where input and output 12 10010
are in decimal form etc. etc.