0 Up votes0 Down votes

8 views38 pagesFeb 22, 2012

© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

Attribution Non-Commercial (BY-NC)

8 views

Attribution Non-Commercial (BY-NC)

- linear integrated circuits lab manual for flip flops and logic gates
- Counter_design
- CM305
- Study Material
- Counter - Wikipedia, The Free Encyclopedia
- Software System Modelling
- spartan3e_scm
- Lab08 Async Counters
- new
- flip flop
- 21 FSM Examples
- ECE449_lecture4
- Clocked SR FF
- ASIC Verification_ State Machine
- 20 Basic Finite State Machines
- msm
- Flip Flop Implementation01
- Manual de Laboratorio Electronica III
- Altium FPGA Generic Library Guide
- Asubar - Part 20_computer

You are on page 1of 38

All circuits can be represented by Boolean equations and vice versa Sequential circuits, in which the outputs are fed back into the inputs have variables that appear on both the right and left hand side of the variables: eg Q = (RP)' and P = (SQ)' For one case R=S=1 there is no unique solution

DOC112: Computer Hardware Lecture 09 Slide 2

For sequential circuits an interpretation of the Boolean equations cannot be made without some model of time. A simple time delay model gives us the correct interpretation of the R-S flip flop. However, wed like not to worry about time if possible.

Slide 3

We can avoid worrying about time by using synchronous digital circuits In a synchronous circuit a bank of D-type flip flops acts as a barrier between the inputs and the outputs. The flip flops are all triggered at the same time using a common clock.

Slide 4

The equation pair:

R = AB + P

is taken to mean

P = (A+B)'

Pt = (At-1+Bt-1)'

Slide 5

If we use synchronous design the only question that we need worry about is how fast the clock can go. This will depend on how well we can minimise spikes in the combinational logic circuits.

Slide 6

In general any synchronous circuit can be modelled by a finite state machine, and vice versa. A finite state machine in its most general form can be represented by a pair of equations: S(t+1) = f(S(t), I(t)) O(t+1) = g(S(t), I(t)) Where S(t) is the state at time t and I(t) the input at time t, and O(t) is the output at time t.

Slide 7

States S(t)

S(t) can be one of a finite number of states We noted that the flip-flop has only two states defined by Q=0 and Q=1 In a digital circuit state changes are caused by a clock pulse given to the D-Q flip flop(s)

Slide 8

One form of finite state machine is called the Mealey machine, and is represented thus:

I S DQ g O

Slide 9

The Moore machine (seen last lecture) is similar but does not have a connection between the inputs and the output logic

D-Q

Slide 10

f is a combinational circuit which is called the state sequencing (or input) logic g is a combinational circuit which is called the output (or decode) logic The D-Q may be one or many flip flops, and their outputs represent the state

I S O

D-Q

Slide 11

The finite state machines give us a way specifying exactly what a circuit should do. Having designed the finite state machine we can apply a design methodology to create the actual circuit. FSMs play a crucial role in computer science as a modelling tool.

Slide 12

1. Determine the number of states required 2. Determine the state transitions 3. Choose the way in which the states will be represented 4. Express the state sequencing logic as Boolean equations and minimise using Karnaugh Maps 5. Express the output logic as Boolean Equations and minimise

DOC112: Computer Hardware Lecture 09 Slide 13

A design problem

Sequential Counter

0 1 2 3 4 5 6

Slide 14

We will consider the simple case where the counter counts from 0 to 5 before returning to 0. (as might be found in a digital clock) Clearly we will need six states being: "0" displayed "1" dispalyed etc

DOC112: Computer Hardware Lecture 09 Slide 15

We can give the states names, and specify what output we want from the circuit:

State 0 1 etc Description 0 displayed 1 displayed Output A ={1,1,1,0,1,1,1} B ={1,0,0,0,0,0,1}

Slide 16

As we are designing a Moore machine, we write both the name and the outputs in the state circles:

4 E 5 F

Output Vectors

0 A 3 D 1 B

Slide 17

2 C

DOC112: Computer Hardware Lecture 09

If the input is 0, stay in the same state. If the input is 1, go on to the next state.

Slide 18

State representation

We now have to decide how we are to represent each state: One flip flop per state would be an expensive possibility. Three flip flops can be though of as a three bit memory, and therefore could represent eight states. The values Q2,Q1 and Q0 define the state.

DOC112: Computer Hardware Lecture 09 Slide 19

Three flip flops can represent eight binary numbers, but we must now choose which six of the eight possibilities we use to represent our states. We might choose:

Flip Flop Outputs 000 001 010 011 100 101 110 111

DOC112: Computer Hardware Lecture 09

Slide 20

Problem Break

If we wanted our counter to count from 0 to 9 rather than from 0 to 6 how many states would it need? What would the finite state machine look like? How many flip flops would we need to represent the states?

Slide 21

Problem Break

0 1

6 G 7 H

0 0 1

8 I

10 States

0

5 F

1

9 J

4 flip flops

1 0

4 E

1 1

3 D

0 A

1 0

1

2 C

1 B

Slide 22

Lets make the obvious choice and allocate flip flop outputs to the states as follows:

Flip Flop Outputs 000 001 010 011 100 101 110 111

DOC112: Computer Hardware Lecture 09

Slide 23

Each state can now be represented by a Boolean Equation. The variable Si is 1 when the circuit is in state i, otherwise it is 0. S0 = Q2'Q1'Q0' S1 = Q2'Q1'Q0 S2 = Q2'Q1Q0' &c.

Slide 24

Output Logic

Our output logic is now completely specified, for example we want the segment 1 to be lit when displaying 0,2,3,5 but not 1 or 4, so: O1 = S0 + S2 + S3 + S5 O1 = Q2'Q1'Q0' + Q2'Q1'Q0 + Q2'Q1Q0 + Q2Q1'Q0

1 Sequential Counter 0 1 2 3 4 5 6

Slide 25

We obtain the specification of the state sequencing logic from the finite state machine representation. Notation N0 is read as "The next state is S0" So we can write for each state an equation of the form: N0 = S5I + S0I' N1 = S0I + S1I'

DOC112: Computer Hardware Lecture 09 Slide 26

The next state must be form the D inputs of the three flip flops, so that it is transferred to the Q outputs on the next clock pulse. We can find Boolean equations for the D inputs by looking at the state allocation table.

DOC112: Computer Hardware Lecture 09

State 0 1 2 3 4 5

Slide 27

D1 = N2 + N3 = S1I + S2I' + S2I + S3I' Substitute for the Si variables D1 = Q2'Q1'Q0I + Q2'Q1Q0'I' + Q2'Q1Q0'I + Q2'Q1Q0I' This is the boolean equation for D1, and D2 and D0 can be found similarly

Slide 28

Unused States

The unused states were designated don't care states. To get the minimum representation we will need to include them as don't cares in our Karnaugh maps. This can cause problems since we will allocate the dont cares real values in the final design.

Slide 29

0 4 1 0 1 5 1 0 3 1 2 0

Slide 30

6 0 1

0,1

7 0,1

1 1 0

If we use don't cares in our design (and we should do so as a first try) we must check what happens to the unused states. If they form an isolated machine, we can either: See if a simple modification will fix the problem without increasing the size too much Explicitly include the unused states in our finite state machine, and re-do the design

Slide 31

0 4 1 0 1 5 1 0 3 1 2 0 1 1 1 0 0,1 6

0 0,1 7

Slide 32

If the number of states is small, then we can try all possible allocations The number of ways we could allocate the eight possibilities to the six states is 56 Fortunately we can eliminate many of these

Slide 33

Isomorphic Assignments

Since flip-flops always have complementary outputs (Q and Q') The same circuit will result from complementing each column of our assignment

State 0 1 2 3 4 5 Assignment 000 001 010 011 100 101 Isomorphs 100 010 110 101 011 111 110 000 100 111 001 101 000 110 010 001 111 011

These isomorphs are created by: Invert Column 1 Invert Column 2 Invert Columns 1 and 2

Slide 34

1 0

0 A

1 A

0

0 B

0 1

11 F

0 1

1 B

Slide 35

This circuit has now 12 states and we will need to use 4 flip flops to represent them. The number of possible state assignments goes up to 1820, so exhaustive search is not a possibility.

Slide 36

There are two rules that should give good Karnaugh map minimisations for the sequencing logic. First, all those states that have the same next state for the same input should be given adjacent state assignments

1 1 C 1 4 C

DOC112: Computer Hardware Lecture 09

2 A

011

3 B

010

000

Slide 37

Second, the next states of a state produced by applying adjacent input conditions should be given adjacent state assignments.

0 4 E 1 0 1 5 F

1 0 A 1 1 B

110

3 D 1

0

111 011

2 C 0

Slide 38

- linear integrated circuits lab manual for flip flops and logic gatesUploaded byTimoth Dev
- Counter_designUploaded byapi-3756871
- CM305Uploaded byapi-3853441
- Study MaterialUploaded byPuneet Chugh
- Counter - Wikipedia, The Free EncyclopediaUploaded bydeepakk_alpine
- Software System ModellingUploaded bymdhuq1
- spartan3e_scmUploaded byUday Kiran
- Lab08 Async CountersUploaded byAlasnuyo
- newUploaded byPranav Gangwar
- flip flopUploaded byGauri Priya Rohith
- 21 FSM ExamplesUploaded byJatin Nagpal
- ECE449_lecture4Uploaded byAvinash Kumar
- Clocked SR FFUploaded byPravesh Upadhyay
- ASIC Verification_ State MachineUploaded byprodip7
- 20 Basic Finite State MachinesUploaded byAshish Kumar
- msmUploaded byhumnaharoon
- Flip Flop Implementation01Uploaded byP_lee
- Manual de Laboratorio Electronica IIIUploaded byEugenio Pérez
- Altium FPGA Generic Library GuideUploaded byApoorva Bhatt
- Asubar - Part 20_computerUploaded byEmmanuel Rapada
- 4.docxUploaded bybudiutomo
- Microsoft Word - Spring_Modern_Digital Traffic Light ControllerUploaded bygoodrezi
- lec3,4 seq logic.pdfUploaded byMichael Sohanlall
- Exper-9 Sr Flip FlopUploaded byMohammed Dyhia Ali
- lec24.pdfUploaded byAshIsBurning
- No9_DesignOfSynchronousCounterUploaded byasadmehmoodsatti786
- 7400Uploaded byIsaac Lara Vasquez
- l5 adcUploaded byKadal Chaitra
- Case1 ObservationUploaded bysenthilkumar
- User ManualDLDUploaded byYogi Tolia

- ERD database modeling.Uploaded byTaqi Shah
- Software Testing TechniquesUploaded byTaqi Shah
- Software Testing StrategiesUploaded byTaqi Shah
- Analysis ModelingUploaded byTaqi Shah
- Software Cost and Effort Estimation in Software Engineering ProcessUploaded byTaqi Shah
- Well Meadows Hospital NormalizationUploaded byTaqi Shah
- Software Cost and Effort EstimationUploaded byTaqi Shah
- Lect 5 Team OrgnizationUploaded bySheikh Waqas Iqbal
- Tutorial Week 7 - Class and Entity-Relationship DiagramsUploaded bySab707
- Cmmi Uaar Seminar 2012Uploaded byTaqi Shah
- Lect 4 Cost EstimationUploaded byTaqi Shah
- Lect 3 Project ManagementUploaded byTaqi Shah
- Ch03Uploaded byTaqi Shah
- Lect 4 Req Engin ProcessUploaded byTaqi Shah
- Software Engineering 1- Lec 5 Software Project ManagmentUploaded byTaqi Shah
- Normalization Exercise AnswerUploaded bymanisgurlz
- ch05Uploaded byTaqi Shah
- HW1_solUploaded byTaqi Shah
- Normalization NotesUploaded byShenna Kim Casinillo
- ERD To Relational Model ExampleUploaded byTaqi Shah
- S.E chap ModelsUploaded byTaqi Shah
- English Solution2 - Class 10 EnglishUploaded byTaqi Shah
- entity relationship diagramsUploaded bybunty142001
- Lesson 3: An Introduction to Data ModelingUploaded byabhi1banerjeee
- Conceptual Data ModelingUploaded byTaqi Shah
- Ch01Uploaded byTaqi Shah
- Ch02Uploaded byTaqi Shah
- S.E Lec 2Uploaded byTaqi Shah
- English Solution - Class 10 EnglishUploaded byTaqi Shah
- Hardware Tutorial Solution 09Uploaded byTaqi Shah

- Image Steganography using 1 Bit LSB MethodUploaded byInternational Journal for Scientific Research and Development - IJSRD
- Pre-Deploy Smoke Test - Smoketest-qa - TestRailUploaded bykugi
- Lectures-15 Input Capture, SONARUploaded bymitjakua
- L3 Block Diagram & Schematics XT1025 V1.0 (3).pdfUploaded byCarlos Henrique
- CCN1030 English for Academic StudiesUploaded byKitty Wong
- Pc ControlUploaded byLalo De Gante
- module2.3Data movement instructionsUploaded byapi-3811113
- Optoma GT1080 Projector ManualUploaded byIvor Houlker
- atmel-42422-mcu-getting-started-with-atmega168pb-at12615_application-note.pdfUploaded bydarwinstons
- Configuring the RouterUploaded bytest
- ICA Priority Packet TaggingUploaded byArchitekkt
- odida[1]. cv-#(1)Uploaded byMaurice O Odida
- The Top 10 Strategic Technol 260410Uploaded byrajekri
- SONVPLDX240.pdfUploaded byDewa Ode Barell
- Operating Systems 1Uploaded byMilan Antony
- Data SheetUploaded byRuxandra Trandafir
- download managers in UbuntuUploaded byChandan Prasad Gupta
- The Future Was Here - The Commodore AmigaUploaded bymimanolis
- 200 125 IT Libraries Q&AUploaded byinfo vista
- The Use of Firewalls in anUploaded bySachin Goyal
- Guide to Network ProgrammingUploaded byshafiqshaheen
- tcp-ip.pptUploaded byVenu Karunanithi
- Cradle Point MBR1200 UserManual-Version 1.1Uploaded byJuan C Bolaños
- Different Flavours of SRVCC (Single Radio VoiceUploaded byLisa Riley
- Internet in Venezuela: low speed and censorshipUploaded byopinionynoticias
- InstruccionesUploaded byJavier Jose Yara Lindado
- QOS_QOE in IOT & 5GUploaded byHazem Gatri
- CAN & MCP2515Uploaded byOvidiu Ciobanu
- 8051 Microcontroller ArchitechtureUploaded byDeep Chatterjee
- introduction to IT and Com systems.docUploaded byAbdullah Holif

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.