Professional Documents
Culture Documents
Session 6 State - Assignment 1
Session 6 State - Assignment 1
STATE ASSIGNMENT
Session - 6
INSTRUCTIONAL OBJECTIVES
LEARNING OUTCOMES
Rule 1: States having the same next state for a given input condition should have assignments that can be
grouped into logically adjacent cells in a K-map.
Rule 2: States that are the next states of a single state should have assignments that can be grouped into
logically adjacent cells in a K-map.
State-assigned Table for a Serial Adder Circuit for the Adder FSM
The state-assignment problem of finite-state machines (FSMs) is addressed. State assignment is a mapping
from the set of states (symbolic names) of an FSM to the set of binary codes with the objective of
minimising the area of the combinational circuit required to realise the FSM.
1. A shift register that will accept a parallel input or a bidirectional serial load and internal shift features
is called as?
(a) …Tristate
(c) …Universal
(d) …Conversion
2. …. The group of bits 11001 is serially shifted (right-most bit first) into a 5-bit parallel output shift
register with an initial state 01110. After three clock pulses, the register contains ________
(a) …01110
(b) …00001
(c) …00101
(d) …00110
A sequential circuit with two D Flip-Flops, A and B; two inputs, x and y; and one
Reference Books:
1. 1. Bob Zeidman, “Designing with FPGAs and CPLDs”, CMP Books, ISBN: 1-57820-112-8.
2. Stephen Brown and Zvonko Vranesic “Fundamentals of Digital Logic with Verilog Design”
McGraw-Hill.
3. Pak K. Chan, Samiha Mourad, “Digital Design Using Field Programmable Gate Array”,
Pearson Education – 2009
Sites and Web links:
1. https://youtu.be/YgtJlUXdCjI