0% found this document useful (0 votes)
6 views26 pages

Control Logic Design in Digital Systems

Uploaded by

bondhonr85
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views26 pages

Control Logic Design in Digital Systems

Uploaded by

bondhonr85
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

Digital Systems Design

Control Logic Design


Introduction
• At any given time, the state of the sequential External
control initiates a prescribed set of Inputs Input Data
microoperations. Initiate
Microoperations
• Depending on status conditions or other inputs, Control Data
Logic Processor
the sequential control goes to the next state to Status conditions
initiate other microoperations.
• Thus the digital circuit that acts as the control Output Data
logic provides a time sequence of signals for
initiating the microoperations in the data-
processor part of the system.
Control Organization
Four methods for control organization:
1. One flip-flop per state method
2. Sequence register and decoder method
3. PLA control
4. Microprogram control
One Flip-Flop per State Method
• A single bit is made to propagate from one
flip-flop to the other under the control of
decision logic.
• Each flip-flop represents a state and is
activated only when the control bit is
transferred to it.
• At any given time interval between two
clock pulses, only one flip-flop is equal to
1; all others are equal to 0.
Sequence Register and Decoder Method
• For n flip-flops in the sequence register, the circuit will have 2 n states and the
decoder will have 2n outputs.
PLA Control
• PLA is an LSI device that can implement any complex combinational circuit.
• It is similar to the sequence register and decoder method except that all
combinational circuits are implemented with a PLA, including the decoder and
decision logic.
• It reduces the number of ICs
and the number of interconnection
wires.
Microprogram Control
• The control variables at any given time can be represented by a string of 1’s and
0’s called a control word.
• Control words can be programmed to initiate the various components in the
system in an organized manner.
• A control unit whose control variables are stored in a memory is called a
microprogrammed control unit.
• Each control word of memory is called a microinstruction.
• A sequence of microinstructions is called a microprogram.
• A control memory, ROM is used for storing the control information permanently.
Microprogram Control
• Some bits of the microinstruction are used to control the generation of the next
microinstruction.
• The next address may also be a function of external input conditions.
• The next address generator circuit computes the next address and transfers it to the
control address register to read the next microinstruction.
Hard-wired Control – Example 1
The design is carried out in five consecutive steps.
1. The problem is stated
2. An initial equipment configuration is assumed
3. An algorithm is formulated
4. The data-processor part is specified
5. The control logic is designed
Hard-wired Control – Example 1
Statement of the Problem
• To implement with hardware the addition and subtraction of two fixed-point
binary numbers represented in sign-magnitude form.
• Complement arithmetic may be used, provided the final result is in sign-
magnitude form.
• Overflow may occur. The circuit must provide a flip-flop for storing a possible
overflow bit.
Hard-wired Control – Example 1
Equipment Configuration
• Two signed binary numbers of n bits, A nd B register of n – 1 bits; two sign bits, As
and Bs.
• ALU for performing the operation.
• 1-bit register E for serving as the
overflow flip-flop.
• Input signals qa and qs specify add
and subtract operations and output
variable x indicates the end of the
operation.
Hard-wired Control – Example 1
Derivation of the Algorithm
Let qa = 1; As A Bs B
Case 1: 0 111 0 101
E As A
1 0 100

As A Bs B
Case 2: 1 111 1 101
E As A
1 1 100
Hard-wired Control – Example 1
Derivation of the Algorithm
Let qa = 1; As A Bs B
Case 3: 0 111 1 101
E As A
1 0 010
E As A
0 0 010
As A Bs B
Case 4: 0 101 1 111
E As A
0 0 110

E As A
0 1 010
Hard-wired Control – Example 1
Derivation of the Algorithm
Let qs = 1; Bs is inverted
and the next procedure is same as the previous.
Hard-wired Control – Example 1
Hard-wired Control – Example 1
Control State Diagram
Let us start by assigning an initial state, T0, to the sequential controller and then
determine the transition to other states T1, T2, T3 and so on.
Hard-wired Control – Example 1
Design of Control Logic
Microprogram Control
Hardware Configuration
• The control memory is an 8-word by 14-bit ROM.
• The first nine bits of a microinstruction word contain the control variables that
initiate the microoperations.
• The last five bits provide information for selecting the next address.
• The control address register (CAR) holds the address for the control memory.
• CAR is essentially a counter with parallel-load capability.
Microprogram Control

ROM
Microinstruction
Address
0 x = 1, if(qs = 1) then (go to 1), if(qa = 1) then (go to 2),
if(qs ˄ qa = 0) then (go to 0)
1 Bs ← Bs’
2 if(S = 1) then (go to 4)
3 A ← A + B, E ← Cout, go to 0
4 A ← A + B’ + 1, E ← Cout
5 if(E = 1) then (go to 0), E ← 0
6 A ← A’
7 A ← A+1, As ← As’, go to 0
Microprogram Control
Hard-wired Control – Example 2
Statement of the Problem
We wish to design an arithmetic circuit that multiplies two fixed-point binary
numbers in sign-magnitude representation.
Let us multiply the two binary numbers 1010 and 111;
10 1010 multiplicand 1010
X 111
7 111 multiplier 1010
01010
1010 1010
1010 +
11110
1010 011110
70 1000110 product 1010
1000110
01000110
Hard-wired Control – Example 2
Equipment Configuration
• The multiplicand is stored in register B, the multiplier is stored in register Q and the
partial product is formed in register A.
• All of the numbers are of n bits.
• Bs, Qs and As are the sign bits of
the respective registers and the
registers contain k = n – 1.
• E holds the output carry and
P is a counter which is initially
set to the number of bits in
multiplier.
Hard-wired Control – Example 2
Derivation of Algorithm
• The process is initiated when qm = 1.
• Bs and Qs are compared.
• Q1 is the rightmost bit in register Q.
• B is added to A is formed when Q1 = 1.
• Shift right operation is performed regardless
of Q1.
A ← shr EAQ, E ← 0
• P is checked whether it reaches 0.
Hard-wired Control – Example 2
Control Specifications
Hard-wired Control – Example 2
Design of Hard-wired Control
Hard-wired Control – Example 2
Design of Hard-wired Control

You might also like