Asynchronous Machine Design: Memory & Robot Controller - Prof. Janak H. Patel, Lab Reports of Electrical and Electronics Engineering

Information on asynchronous machine design, specifically for a shift register memory and a robot platform controller. Topics covered include shift register memory components, asynchronous circuits, fundamental mode asynchronous circuits, and critical races. The document also includes state tables, partial state diagrams, and state encoding techniques to prevent races.

Typology: Lab Reports

Pre 2010

Uploaded on 03/10/2009

koofers-user-cbw
koofers-user-cbw 🇺🇸

10 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE385
DIGITAL SYSTEMS LABORATORY
© Janak H. Patel
Department of Electrical and Computer Engineering
University of Illinois at Urbana-Champaign
Experiment 5
Asynchronous Machine
Design
2
Today’s Topics
zRevisit Experiment 4 (due this week)
Shift Register Memory
RAM with error detection
zExperiment 5 (due next week)
zAsynchronous Machine Design
zCritical Race and State Encoding
zExperiment 5 state table
3
A shift-register memory
New Data In
2-to-1
MUX N-bit SHIFT REGISTER
Data Out
Control
Logic
ADRS
Read/Write
SBR
select
LOAD
W-bit wide
W
SAR Storage
Buffer
Register
4
Experiment 5
zAsynchronous Robot Platform Controller
Three control inputs and six outputs
Design using only gates and latches
No flip-flops or clocks permitted in design
You can assume that only one input changes at
one time and the second change will not occur until
the circuit outputs are stabilized
Outputs must be glitch-free
TASKS
Develop a symbolic State Table
Assign Binary Encoding to States to prevent Races
Develop Latch-input equations from the table
5
Fundamental Mode Asynch Ckts
zFundamental Mode Sequential Circuit
Only one input is allowed to change at one time
zStable State for an input combination
It is the state for which the next state is itself for the
given input combination.
zRaces in Asynchronous Circuits
When the next state of a state has an encoding that
has more than one latch output changing, it is called
a Race.
For example, for Present State <0110> and the
Next State <0000>, the transition may go through
intermediate states <0100>, or <0010>. If the
intermediate states lead to an unintended next state,
then we call it a Critical Race.6
Robot Platform Controller
D1 Q1
D2 Q2
D3 Q3
Latches
Next-State Logic Output Logic
LEFT
RIGHT
SPIN
Q1
Q2
Q3
Go Straight
Turn Left
Turn Right
Spin 180
Halt
Stop/Error
Q1
Q2
Q3
(L,R,S) for Mealy Machine
L
R
S
Moore Machine
pf3

Partial preview of the text

Download Asynchronous Machine Design: Memory & Robot Controller - Prof. Janak H. Patel and more Lab Reports Electrical and Electronics Engineering in PDF only on Docsity!

ECE

DIGITAL SYSTEMS LABORATORY

© Janak H. Patel Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign

Experiment 5

Asynchronous Machine

Design

2

Today’s Topics

z Revisit Experiment 4 (due this week)

„ Shift Register Memory

„ RAM with error detection

z Experiment 5 (due next week)

z Asynchronous Machine Design

z Critical Race and State Encoding

z Experiment 5 state table

3

A shift-register memory

New Data In

2-to- MUX

N-bit SHIFT REGISTER

Data Out

Control Logic

ADRS

Read/Write

SBR

select LOAD

W-bit wide

W

SAR (^) Storage Buffer Register

4

Experiment 5

z Asynchronous Robot Platform Controller

„ Three control inputs and six outputs

„ Design using only gates and latches

„ No flip-flops or clocks permitted in design

„ You can assume that only one input changes at

one time and the second change will not occur until

the circuit outputs are stabilized

„ Outputs must be glitch-free

„ TASKS

‹ Develop a symbolic State Table

‹ Assign Binary Encoding to States to prevent Races

‹ Develop Latch-input equations from the table

Fundamental Mode Asynch Ckts

z Fundamental Mode Sequential Circuit

„ Only one input is allowed to change at one time

z Stable State for an input combination

„ It is the state for which the next state is itself for the

given input combination.

z Races in Asynchronous Circuits

‹ When the next state of a state has an encoding that

has more than one latch output changing, it is called

a Race.

‹ For example, for Present State <0110> and the

Next State <0000>, the transition may go through

intermediate states <0100>, or <0010>. If the

intermediate states lead to an unintended next state,

then we call it a Critical Race.

Robot Platform Controller

D1 Q

D2 Q

D3 Q

Next-State Logic Latches Output Logic

LEFT

RIGHT

SPIN

Q

Q

Q

Go Straight

Turn Left

Turn Right

Spin 180

Halt

Stop/Error

Q

Q

Q

(L,R,S) for Mealy Machine

L

R

S

Moore Machine

7

Machine Specification

- All Switches down Halt

All Switches down Spin switch up Turn 180

Left|Right|Spin up (Left or Right)& Spin Stop/Error

Right switch up Left, Right both up Turn Right

Left switch up Left, Right both up Turn Left

All Switches down Right switch up Go Straight

All Switches down Left switch up Go Straight

Previous Input Current Input Output

8

(Moore) Partial State Diagram-

HALT (^) go-strL TurnLeft

Turn Right

Spin 180

L LR

R

RL

S

Not L L

R

Not S Not R

Inputs L: Left R: Right S: Spin

R

go-str

Moore Machine: Output is assigned to the State

  • Output is a function of State Variables only
  • Output does not depend on the Inputs

L

R

9

(Mealy) Partial State Diagram-

Inputs L: Left R: Right S: Spin arc label input/output

Mealy Machine: Output is assigned to the transition Output is a function of State Variables AND Inputs (Expt. 5 can be designed with two latches)

A

B D

C

L/go

R/go LR/left turn

L/go (straight)

R/go

LR/right turn

S/spin

L/go

R/go

10

(Moore) Partial State Diagram-

HALT (^) go-strL TurnLeft

Turn Right

Spin 180

L LR

R

RL

S

Stop/ Error

LRS

RLS

LS or RS

LS

RS

R

go-str

L

error recovery

R

S

Complete State Diagram

HALT (^) go-strL TurnLeft

Turn Right

Spin 180

LRS

Stop/ Error

Error 101 Recovery

R

go-str

A

B

C

D

F

G

E

State Transition Table

Input Combinations L,R,S Present State 000 001 010 100 110 101 011 111 HALT: A A B C D - - - - SPIN: B A B - - - E E - R-go straight: C A - C - F - E - L-go straight: D A - - D G E - - Stop/Error: E - B C D E E E E Turn Right: F - - C D F - - E Turn Left: G - - C D G - - E Next State

Stable States are Circled in the Table valid transitions may only be made from Stable Sates Output for each state is written in words