This document discusses sequential circuits and their analysis and design. It begins by defining sequential circuits and their basic components like latches and flip-flops. It then covers analyzing synchronous sequential circuits using their output functions, state equations, and state tables. The document concludes by outlining the steps for designing a synchronous sequential circuit from its specification.
These slides have full understanding about Equivalent Moore Mealy... Having Moore to Mealy conversion and Mealy to Moore conversion...
These slides also describing the concept of Transducers as models of sequential circuits (both w.r.t Moore and Mealy)...
All these concepts are explained with easy examples...
The Reason Why we use master slave JK flip flop instead of simple level triggered flip flop is Racing condition which can be successfully avoided using two SR latches fed with inverted clocks.
These slides have full understanding about Equivalent Moore Mealy... Having Moore to Mealy conversion and Mealy to Moore conversion...
These slides also describing the concept of Transducers as models of sequential circuits (both w.r.t Moore and Mealy)...
All these concepts are explained with easy examples...
The Reason Why we use master slave JK flip flop instead of simple level triggered flip flop is Racing condition which can be successfully avoided using two SR latches fed with inverted clocks.
Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circuits Electronics Digital circ
The document explains about the concepts of sequential circuits in Digital electronics.
This will be helpful for the beginners in VLSI and electronics students.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
COLLEGE BUS MANAGEMENT SYSTEM PROJECT REPORT.pdfKamal Acharya
The College Bus Management system is completely developed by Visual Basic .NET Version. The application is connect with most secured database language MS SQL Server. The application is develop by using best combination of front-end and back-end languages. The application is totally design like flat user interface. This flat user interface is more attractive user interface in 2017. The application is gives more important to the system functionality. The application is to manage the student’s details, driver’s details, bus details, bus route details, bus fees details and more. The application has only one unit for admin. The admin can manage the entire application. The admin can login into the application by using username and password of the admin. The application is develop for big and small colleges. It is more user friendly for non-computer person. Even they can easily learn how to manage the application within hours. The application is more secure by the admin. The system will give an effective output for the VB.Net and SQL Server given as input to the system. The compiled java program given as input to the system, after scanning the program will generate different reports. The application generates the report for users. The admin can view and download the report of the data. The application deliver the excel format reports. Because, excel formatted reports is very easy to understand the income and expense of the college bus. This application is mainly develop for windows operating system users. In 2017, 73% of people enterprises are using windows operating system. So the application will easily install for all the windows operating system users. The application-developed size is very low. The application consumes very low space in disk. Therefore, the user can allocate very minimum local disk space for this application.
Courier management system project report.pdfKamal Acharya
It is now-a-days very important for the people to send or receive articles like imported furniture, electronic items, gifts, business goods and the like. People depend vastly on different transport systems which mostly use the manual way of receiving and delivering the articles. There is no way to track the articles till they are received and there is no way to let the customer know what happened in transit, once he booked some articles. In such a situation, we need a system which completely computerizes the cargo activities including time to time tracking of the articles sent. This need is fulfilled by Courier Management System software which is online software for the cargo management people that enables them to receive the goods from a source and send them to a required destination and track their status from time to time.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Event Management System Vb Net Project Report.pdfKamal Acharya
In present era, the scopes of information technology growing with a very fast .We do not see any are untouched from this industry. The scope of information technology has become wider includes: Business and industry. Household Business, Communication, Education, Entertainment, Science, Medicine, Engineering, Distance Learning, Weather Forecasting. Carrier Searching and so on.
My project named “Event Management System” is software that store and maintained all events coordinated in college. It also helpful to print related reports. My project will help to record the events coordinated by faculties with their Name, Event subject, date & details in an efficient & effective ways.
In my system we have to make a system by which a user can record all events coordinated by a particular faculty. In our proposed system some more featured are added which differs it from the existing system such as security.
1. SEQUENTIAL CIRCUITS I
i1
in
o1
om
Combinational
Circuit
I1
Ik
O1
Ok
State of circuit = content of k memory cells.
One bit (0 or 1) per cell → 2k possible states
Actual state is I1, . . . , Ik
Next state is O1, . . . , Ok
oi = f(i1, . . . , in, I1, . . . , Ik), 1 ≤ i ≤ m
Oj = f(i1, . . . , in, I1, . . . , Ik), 1 ≤ j ≤ k
A sequential circuit is in a stable state when Ij = Oj for
j = 1, . . . , k
1
2. Asynchronous Sequential Circuits
Responds to a change in one of the inputs
Input signals change one at a time and only when the
circuit is in a stable state
Memory elements = Latches: Two-state circuit
that stores one bit
SR latch: 2 inputs (S)et, (R)eset, and 2 outputs Q, Q̄
Its equations are:
Q = R + p = R̄p̄
P = S + q = S̄q̄
where p, q are the actual states and Q, P are the next
states (with P = Q̄)
2
3. Stable States of SR Latch
To find the stable states
• Obtain truth table of SR latch according to Q =
f(q, p, R, S) = R̄p̄
P = f(q, p, R, S) = S̄q̄
• Build a K-map with values of Q,P as entries
• Circle entries where Q,P = q,p
q p R S Q P
0 0 0 0 1 1
0 0 0 1 1 0
0 0 1 0 0 1
0 0 1 1 0 0
0 1 0 0 0 1
0 1 0 1 0 0
0 1 1 0 0 1
0 1 1 1 0 0
1 0 0 0 1 0
1 0 0 1 1 0
1 0 1 0 0 0
1 0 1 1 0 0
1 1 0 0 0 0
1 1 0 1 0 0
1 1 1 0 0 0
1 1 1 1 0 0
7→
00 01 11 10
00 11 10 00 01
01 01 00 00 01
11 00 00 00 00
10 10 10 00 00
3
4. Functionality of SR Latch
(continued)
S,R = 1,1 7→ stable state Q,Q̄ = 0,0 → Q = Q̄
→ undefined state. We must avoid inputs
S,R = 1,1 simultaneously
Q,Q̄ = 0,0 7→ indeterminate next state when S,R
becomes 0,0 simultaneously.
00 01 11 10
00 11 10 00 01
01 01 00 00 01
11 00 00 00 00
10 10 10 00 00
S,R = 1,0 7→ set state Q,Q̄ = 1,0
S,R = 0,1 7→ reset state Q,Q̄ = 0,1
S,R = 0,0 7→ next state = actual state of Q,Q̄
4
6. SR Latch
(equivalent representation)
S
R
Q
q
Its equation is Q = SR̄ + qR̄
Truth table and transition table below
q R S Q
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0
7→
00 01 11 10
0 0 1 X 0
0 1 1 X 0
⇒ if SR = 0 (S,R 6= 1,1) then
minimal → Q = S + R̄q
6
7. S̄R̄ Latch
Uses NAND gates
⇓
When S̄R̄ = 0, that is S,R 6= 0,0 then its
equation is
Q = S̄ + Rq
7
8. Synchronous Sequential Circuits
Responds to a clock pulse
State transitions occurs only at fixed time intervals dic-
tated by the clock pulses.
Time is discrete: the next state can be described at
time t + 1 with respect to the actual state at time t
More complex design but more reliable than asynchronous
circuits.
Memory elements = Flip-flops: Two-state circuit that
stores one bit
8
9. SR Flip-Flop
S
C
R
Q
Q’
→
Qt S R Qt+1
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 ?
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 ?
Working conditions: SR = 0. Pulse triggered flip-flop
Characteristic equation: (after simplification)
Qt+1 = S + R̄Qt
Characteristic table
S R Qt+1 Operation
0 0 Qt No change
0 1 0 Reset
1 0 1 Set
1 1 ? Undefined
Excitation table
Qt Qt+1 S R
0 0 0 X
0 1 1 0
1 0 0 1
1 1 X 0
9
10. D Flip-Flop
C
Q
Q’
D
→
Qt D Qt+1
0 0 0
0 1 1
1 0 0
1 1 1
Working conditions: No undefined state. Edge
triggered flip-flop
Characteristic equation: (after simplification)
Qt+1 = D
Characteristic table
D Qt+1 Operation
0 0 Reset
1 1 Set
Excitation table
Qt Qt+1 D
0 0 0
0 1 1
1 0 0
1 1 1
10
11. JK Flip-Flop
K
C
J
Q
Q’
→
Qt J K Qt+1
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 0
Working conditions: No undefined state. Pulse or edge
triggered flip-flop
Characteristic equation: (after simplification)
Qt+1 = JQ̄ + K̄Q
Characteristic table
J K Qt+1 Operation
0 0 Qt No change
0 1 0 Reset
1 0 1 Set
1 1 Q̄t Complement
Excitation table
Qt Qt+1 J K
0 0 0 X
0 1 1 X
1 0 X 1
1 1 X 0
11
12. T Flip-Flop
Q
Q’
C
T →
Qt T Qt+1
0 0 0
0 1 1
1 0 1
1 1 0
Working conditions: No undefined state. Pulse or edge
triggered flip-flop
Characteristic equation: (after simplification)
Qt+1 = TQ̄ + T̄Q
Characteristic table
T Qt+1 Operation
0 Qt Reset
1 Q̄t Set
Excitation table
Qt Qt+1 T
0 0 0
0 1 1
1 0 1
1 1 0
12
14. Synchronous Sequential Circuit Analysis
Given a synchronous sequential circuit, example
We can express its behavior in three ways: by
1. Circuit output functions and flip-flops input
functions
2. Circuit output functions and state equations
3. State table and state diagram
14
15. Synchronous Sequential Circuit Analysis
(Circuit output and flip-flops input functions)
Question: What are the values of Y , DA and DB ?
Use the information contained in the combinational cir-
cuit to obtain the circuit’s outputs and the flip-flops’
inputs. That is
• Y = X̄(At + Bt)
• DA = X(At + Bt)
• DB = XĀt
Thus we can represent the states changes and the out-
puts. However, this representation is quite useless;
we still do not know what the circuit truly does (par-
ticularly when we do not know the types of flip-flops
used). The following two representations are better.
15
16. Synchronous Sequential Circuit Analysis
(Circuit output functions and state equations)
Question: Values of Y , At+1 and Bt+1 ?
For circuit’s output functions: use the information con-
tained in the combinational circuit. That is
• Y = X̄(At + Bt)
For flip-flops’ state equations: either
• Make a truth table and minimize to obtain the
state equations. Or,
• Substitute the flip-flops’ input functions into the
flip-flops’ characteristic equations to obtain the
state equations
The characteristic equation of D flip-flop is
Qt+1 = D, therefore
• At+1 = DA = X(At + Bt)
• Bt+1 = DB = XĀt
16
17. Synchronous Sequential Circuit Analysis
(State table and state diagram)
Question: What are the ouputs and next states given
the inputs and current states?
State table: Enumerates the functional relationships be-
tween inputs, outputs, and states flip-flops states of
a sequential circuit
State diagram: Graphical representation of a state ta-
ble
For each possible (actual) state of the circuit and for
each possible combination of values of input vari-
ables:
1. Use the flip-flops’ input functions and their char-
acteristic tables to determine the next state of the
circuit (A,B in example)
2. Use the circuit’s output functions to determine
the output values (Y in example)
17
18. Synchronous Sequential Circuit Analysis
(State table and state diagram)
(continued)
State Table
Present state Next state Output
X = 0 X = 1 X = 0 X = 1
A B A B A B Y Y
0 0 0 0 0 1 0 0
0 1 0 0 1 1 1 0
1 0 0 0 1 0 1 0
1 1 0 0 1 0 1 0
State Diagram
18
19. Synchronous Sequential Circuit Design
1. Obtain state table from circuit specification (state
diagram, state equations or timing diagram)
2. If necessary, assign binary codes to each state of
state table
3. Determine the number and type of flip-flops needed
and assign a letter to each
4. From the state table, derive the circuit excitation
and output tables
5. Using K-maps, derive the circuit output functions
and the flip-flops input functions
6. Draw the synchronous sequential logic circuit
19
20. Synchronous Sequential Circuit Design
(Example)
Given the
State diagram
or the
State equations
Y = AtBt + X
At+1 = AtB̄t + BtX̄
Bt+1 = AtBtX̄ + Ātx + B̄tX
of a synchronous sequential circuit specification
Then . . .
. . . use the following design method . . .
20
21. Synchronous Sequential Circuit Design
(continued)
Step 1:
Present state Next state Output
X = 0 X = 1 X = 0 X = 1
A B A B A B Y Y
0 0 0 0 0 1 0 0
0 1 1 0 0 1 0 1
1 0 1 0 1 1 0 1
1 1 1 1 0 0 1 1
Step 2: Not necessary in our example
Step 3:
Type of flip-flop is usually given. If not, then select
cheapest: in general JK flip-flop
Number of flip-flops depends on number of states
and the encoding used. In our case we need 2 flip-
flops since there are 4 states (2 = log2 4), each
coded by two variables. The flip-flops are:
JAKA flip-flop and JBKB flip-flop and
21
22. Synchronous Sequential Circuit Design
(continued)
Step 4: Reorganize the state table in the following way
Inputs of CC Inputs of FF
Ps Input Ns Output Excitations
AB X AB Y JA KA JB KB
00 0 00 0 0 X 0 X
00 1 01 1 0 X 1 X
01 0 10 0 1 X X 1
01 1 01 1 0 X X 0
10 0 10 0 X 0 0 X
10 1 11 1 X 0 1 X
11 0 11 1 X 0 X 0
11 1 00 1 X 1 X 1
⇑
Excitation table
Qt Qt+1 J K
0 0 0 X
0 1 1 X
1 0 X 1
1 1 X 0
Excitation table: what are the values of J and K needed
to go from Qt to Qt+1?
22
23. Synchronous Sequential Circuit Design
(continued)
Step 5: Simplify the by K-maps the circuit’s output Y ,
and the flip-flops’ inputs JA, KA, JB and KB. After
simplification, we obtain:
• Y = AB + X
• JA = BX̄
• KA = BX
• JB = X
• KB = ĀX̄ + AX = A ¯ X
23
24. Synchronous Sequential Circuit Design
(continued)
Step 6:
Use the standard graphics symbols for flip-flops
Clearly identify the inputs and outputs of the flip-flops,
the clock input, as well as the external inputs and
outputs of the circuit
Try to minimize crossings (difficult problem)
Clearly show the intersections
24
25. Synchronous Sequential Circuit Design
(continued)
Designing With Unused States: If a state is not used
(state 11 below), then put an X for the flip-flops’
inputs and the circuit’s output. The final expressions
will be much simpler
The table below shows only the part of the excitation
table (obtained in step 4) that deals with the state 11
Inputs of CC Inputs of FF
Ps Input Ns Output Excitations
AB X AB Y JA KA JB KB
00 0
00 1
01 0
01 1
10 0
10 1
11 0 XX X X X X X
11 1 XX X X X X X
25