Digital Logic 1 Introductio

Circuits n
DIGITAL LOGIC CIRCUITS

Logic Gates

Boolean Algebra

Map Specification

Combinational Circuits

Flip-Flops

Sequential Circuits

Memory Components

Computer Organization Computer Architectures Lab

Digital Logic 1 Logic
Circuits Gates
BASIC LOGIC BLOCK - GATE -

Binary Binary
Digital Digital
. Gate Outpu
Input
Signal . . t
Signal

Types of Basic Logic Blocks

- Combinational Logic Block

Logic Blocks whose output logic value
depends only on the input logic values

- Sequential Logic Block

Logic Blocks whose output logic value
depends on the input values and the
state (stored information) of the blocks

Functions of Gates can be described by

- Truth Table
- Boolean Function
- Karnaugh Map
Computer Organization Computer Architectures Lab
Digital Logic 1 Logic
Circuits Gates
COMBINATIONAL GATES
Name Symbol Function Truth Table
A B X
A X=A•B 0 0 0
AND B
X or
X = AB
0
1
1
0
0
0
1 1 1
A B X
A 0 0 0
OR X X=A+B 0 1 1
B 1 0 1
1 1 1
A X
I A X X=A 0
1
A1 X
Buffer A X X=A 00
0
A 1B X
1
A 0 0 1
NAND X X = (AB)’ 0
1
1
0
1
1
B 1 1 0
A B X
A 0 0 1
NOR X X = (A + B)’ 0 1 0
B 1 0 0
1 1 0
A X=A ⊕B A B X
XOR X or 0 0 0
Exclusive 0 1 1
OR B X = A’B + AB’ 1 0 1
1 1 0
A B X
A X = (A ⊕ B)’
XNOR X or
0
0
0
1
1
0
Exclusive
NOR B X = A’B’+ AB 1 0 0
or 1 1 1
Equivalence
Computer Organization Computer Architectures Lab
Digital Logic 1
Circuits

Computer Organization Computer Architectures Lab

Digital Logic 1 Boolean Algebra
Circuits
LOGIC CIRCUIT DESIGN
x y z
F
Truth 0 0 0
Table 0
0 0 1
1
0 1 0
0
0 1 1
0
Boolean 1 0 0
F =1x + y’z
Functio
n 1 0 1
1
1 1 0
1
1 1 1
x 1
F
Logic y
Diagram
z

Computer Organization Computer Architectures Lab

Digital Logic 1 Boolean Algebra
Circuits
BASIC IDENTITIES OF BOOLEAN ALGEBRA
[1] x + 0 = x [2] x • 0 = 0
[3] x + 1 = 1 [4] x • 1 = x
[5] x + x = x [6] x • x = x
[7] x + x’ = 1 [8] x • X’ = 0
[9] x + y = y + x [10] xy = yx
[11] x + (y + z) = (x + y) + z [12] x(yz) = (xy)z
[13] x(y + z) = xy +xz [14] x + yz = (x + y)(x + z)
[15] (x + y)’ = x’y’ [16] (xy)’ = x’ + y’
[17] (x’)’ = x
[15] and [16] : De Morgan’s Theorem

Computer Organization Computer Architectures Lab

Digital Logic 1 Boolean Algebra
Circuits
EQUIVALENT CIRCUITS

Many different logic diagrams are possible for a given

Function
F = ABC + ABC’ + A’C .......…… (1)

= AB(C + C’) + A’C [13] ..…. (2)

= AB • 1 + A’C [7]
= AB + A’C
A [4] ...…. (3)
B
(1) C
F

(2) A
B

C F

(3) A
B
F

Computer Organization Computer Architectures Lab

Digital Logic 1 Boolean Algebra
Circuits
COMPLEMENT OF FUNCTIONS

A,B,...,Z,a,b,...,z ⇒ A’,B’,...,Z’,a’,b’,...,z’
(p + q) ⇒ (p + q)’

- Replace all the operators with their respective

complementary operators

AND ⇒ OR
OR ⇒ AND

- Basically, extensive applications of the DeMorgan’s theorem

(x1 + x2 + ... + xn )’ ⇒ x1’x2’... xn’

(x1x2 ... xn)' ⇒ x1' + x2' +...+ xn'

Computer Organization Computer Architectures Lab

Digital Logic 1 Map
Circuits Simplification
SIMPLIFICATION

Truth Boolean
Table Functio
n
Uniqu Many different expressions exist
e
Karnaugh Map(K-map) is a simple procedure for
simplifying Boolean expressions.

Truth
Table
Simplifie
Karnaugh d
Map Boolean
Boolea Function
n
functio
n
Computer Organization Computer Architectures Lab
Digital Logic 1 Combinational Logic
Circuits Circuits
COMBINATIONAL LOGIC CIRCUITS
y y
Half Adder x y c x
0 0 s0 0 0 0 1 c
y
0 x 01 x 1 0
0 1 0 c = xy s = xy’ + s
1 x’y
Full Adder 1 0 0 =x ⊕ y
1 y y
x y cn-1 1cn 1s 1
0 0 0 00 0 0 0 1
0 0 1 c 1 0 c
n-1 n-1
0 0 1 0 x 1 1 x 0 1
1 0 1 1 0
0 1 0 0 cn s
1
0 1 1 1 cn = xy + xcn-1+ ycn-1
0 = xy + (x ⊕ y)cn-1
1 0 0 0 s = x’y’cn-1+x’yc’n-1+xy’c’n-1+xycn-1
1 = x ⊕ y ⊕ cn-1 = (x ⊕ y) ⊕ cn-1
1x 0 1 1
y S
0
1 1 0 1
cn-1
0
1 1 1 1 cn
1
Computer Organization Computer Architectures Lab
Digital Logic 1 Combinational Logic
Circuits Circuits
COMBINATIONAL LOGIC CIRCUITS

Other Combinational Circuits

Multiplexer
Encoder
Decoder
etc

Computer Organization Computer Architectures Lab

Digital Logic 1 Combinational Logic
Circuits Circuits
MULTIPLEXER

4-to-1
Multiplexer Select
S1 Output
S0 Y
0 0 I0
0 1 I1
1 0 I2
1 1 I3

I0

I1
Y
I2

I3

S0
S1

Computer Organization Computer Architectures Lab

Digital Logic 1 Combinational Logic
Circuits Circuits
ENCODER/DECODER

Octal-to-Binary Encoder
D1 A0
D2
D3 A1
D4
D5 A2
D6
D7

2-to-4 Decoder
D0

E A1 A0 D0 D1 D2 D3 A0 D1
0 0 0 0 1 1 1
0 0 1 1 0 1 1 D2
0 1 0 1 1 0 1
0 1 1 1 1 1 0
1 d d 1 1 1 1 A1 D3
E

Computer Organization Computer Architectures Lab

Digital Logic 1 Sequential
Circuits Circuits
SEQUENTIAL CIRCUITS - Registers
A0 A1 A2 A3
Q Q Q Q
D C D C D C D C

Cloc
k I0 I1 I2 I3
Shift Registers
Seria Serial
D D D D Outpu
l Q Q Q Q
Input t
C C C C
Clock
Bidirectional Shift Register with Parallel
Load A0 A1 A2 A3

Q Q Q Q
D C D C D C D C

4x 4x 4x 4x
1 1 1 1
MUX MUX MUX MUX

Cloc S0S1 SeriaI I0 I1 I2 Seria I

3
k Input l
Input
Computer Organization Computer Architectures Lab
Digital Logic 1 Memory
Circuits Components
MEMORY COMPONENTS
0
Logical Organization

words
(byte, or n bytes)

N-1
Random Access Memory

- Each word has a unique address

- Access to a word requires the same time
independent of the location of the word
- Organization
n data input
lines

k address
lines 2k Words
(n
Read bits/word)

Write
n data output
lines
Computer Organization Computer Architectures Lab
Digital Logic 1 Memory
Circuits Components
READ ONLY MEMORY(ROM)
Characteristics
- Perform read operation only, write operation is not possible
- Information stored in a ROM is made permanent
during production, and cannot be changed

Computer Organization Computer Architectures Lab

Digital Logic 1
Circuits
Question

• The following memory units are specified by the

number of words times the number of bits per word.
How many address lines and input-output data lines
are needed in each case?
• (a)2K x 16.
• (b)64M x 8.
• (c)16G x 32.

Computer Organization Computer Architectures Lab

Digital Logic 1
Circuits
Question

• Specify the number of bytes that can be stored in the

memories listed in he following memory units:
• (a)2K x 16.
• (b)64M x 8.
• (c)16G x 32.

Computer Organization Computer Architectures Lab

Digital Logic 1
Circuits
REPRESENTATION OF NUMBERS

Decimal Binary Octal

Hexadecimal
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
Binary, octal, and hexadecimal conversion
1 2 7 5 4 Octal
1 0 1 0 1 1 1 1 0 1 1 0 0 0 1
3 Binary
1 Hexa
Computer Organization Computer Architectures Lab
Digital Logic 1
Circuits
Questions

• Convert the following binary numbers to decimal:

– 10011100
– 00110110

• Convert the following decimal numbers to binary :

– 70
– 160
• Convert the following binary numbers to
Hexadecimal:
– 1100 1010 0011
– 0110 1000 1100 0000

Computer Organization Computer Architectures Lab