Chapter Two
Number System and Logic Gates
By: Abay G.
1
Chapter Contents
1. Number System 5. Coding systems
6. Logic gates
2. Conversation
7. Boolean Algebra
3. Arithmetic Operation
8. Combinational Circuits
4. Complements 9. Decoder, Encoder & Multiplexer
2
1. Number System
3
Number System
○ Decimal
○ Binary
○ Octal
○ Hexa-Decimal
4
Conversation
5
Decimal Binary Octal Hexadecimal Conversation
00 0000 00 0
01 0001 01 1
02 0010 02 2
03 0011 03 3
04 0100 04 4
05 0101 05 5
06 0110 06 6
07 0111 07 7
08 1000 10 8
09 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
6
Logic gates
7
Logic Gates
● AND
● OR
● INVENTER
● BUFFER
● NAND
● NOR
● XOR
● EXOR
● Exclusive NOR or Equivalent
8
… Cont
9
… cont.
10
… cont.
11
Boolean Algebra
12
Boolean Algebra
• Boolean algebra is an algebra that deals with binary variables and logic operations
• The variables are designated by letters such as A, B, x, and y.
• The three basic logic operations are AND, OR, and complement.
• A Boolean function can be expressed algebraically with binary variables, the logic operation
symbols, parentheses, and equal sign.
• For a given value of the variables, the Boolean function can be either lora.
• Consider, for example, the Boolean function F = x + y'z,
• Generally Boolean algebra can be expressed by Boolean/Algebraic Function, Truth Table and
Logic Diagram
13
Exercise
F = YX+Y’Z
Draw Logic Diagram
And
Truth Table
14
Combinational Circuits
15
Combinational Circuits
● A combinational circuit is a connected arrangement of logic gates
with a set of inputs and outputs.
● At any given time, the binary values of the outputs are a function
of the binary combination of the inputs.
Block Diagram of Combinational Circuit
16
… cont
● The design of combinational circuits starts from the verbal outline of the
problem and ends in a logic circuit diagram.
1. The problem is stated.
2. The input and output variables are assigned letter symbols.
3. The truth table that defines the relationship between inputs and
outputs is derived.
4. The simplified Boolean functions for each output are obtained.
5. The logic diagram is drawn.
17
… cont
● To demonstrate the design of combinational circuits, we present two
examples of simple arithmetic circuits.
● These circuits serve as basic building blocks for the construction of more
complicated arithmetic circuits.
○ Half- Adder
○ Full- Adder
18
Half- Adder
● The most basic digital arithmetic circuit is the addition of two binary digits.
● A combinational circuit that performs the arithmetic addition of two bits is
called a half-adder
Boolean Function Truth Table Logic Diagram
19
Full- Adder
● A full-adder is a combinational circuit that forms the arithmetic sum of
three input bits.
20
… cont
● Next Class …
21
Thank You!
22