Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

EE2A > Asynchronous > Flashcards

Asynchronous Flashcards

1
Q

What is activity controled by?

A

The input variables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What changes the internal state?

A

a change in the input

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

When is a state unstable?

A

If it has no sling

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What indicates a stable state in a flow table?

A

circle round it, shows it can be detected by oscilloscope

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Why do problems arise with the logic in feedback paths?

A

different time delays within different parts of the logic. Cause a glitch which will make the machine jump to another stable but unwanted state

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Do all the bits change at the same time?

A
  • Nope, it is very unlikely that all three bits will change at the same time
  • during the transition period, other codes will be formed which will correspond to other, unexpected states.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is a zero-hot code?

A

000000

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is a one-hot code?

A

000001

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is a two-hot code?

A

000011

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Why would you reduce the number of implicants?

A

Most devices have a limited number of OR gates

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What happens if all the inputs change at the same time?

A

The machine will fail

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What are the three race hazards?

A

1) Static
2) Dynamic
3) Essential

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is a static race hazard?

A
  • Caused when the signal and its complement are combined together
  • results n the machine jumping to an unexpected state
  • SOLUTION is to include all prime implicants
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is a dynamic race hazard?

A
  • Caused by and interaction between gates.
  • result in multiple transitions when only one was intended
  • SOLUTION don’t use more than two levels of gating
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is an essential race hazard?

A
  • Caused when an input has two transitions and one is less than the total feedback propagation
  • Result means the sorter input will probably be ignored
  • SOLUTION extending the input signal duration, delay lines
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What are the steps in asynchronous (and synchronous) FSM design stages?

A

1) Moore model state diagram
2) flow table
3) iterate round the previous stages
4) determine number of required states
5) code assignment
6) redraw state diagram
7) Inert dummy states if needed
8) Transition table
9) extraction of conical transition equations
10) extraction of prime implication (minimises race hazards)
11) implement

17
Q

What is the golden rule?

A
  • Inputs appear on transitions

- output appear with states

18
Q

If there are N inputs, how many equivalent transitions are there leaving every state?

A

2^N

19
Q

Can you have 2 of the same transitions leaving the state?

A

No, only 1

20
Q

Why is it unlikely to have the same condition looping around states?

A

Would lead to rapid oscillation between states

21
Q

What are truth tables good/bad for?

A
  • good for basic gates

- bad for multi-input multi-output systems

22
Q

What is Sum of products?

A
  • When all the terms use all logical values
  • Canonical form
  • Minterms
23
Q

What is product of sums?

A
  • would use deMoragn

- there are 2^N maxterms

24
Q

What is the difference between a state table and a flow table?

A

STATE TABLE
-used to represent every transition in a synchronous finite state machine
-Transitions are implied on clock edges.
-same number of rows as states and the number of destination columns is two to the power of the number of inputs.
FLOW TABLE
-used to represent every transition in an asynchronous finite state machine
-transitions occur on input signal levels so the state is always ‘flowing’ from source-to-destination

25
Q

What is demorgans for f = A.B.C

A

f(bar) = A(bar) + B(bar) + C(bar)

26
Q

What are the AND rules?

A 
A.A(bar) = 0
A.1 = 0
A.0 = 0
A.A = A
A.(A+B) = A
27
Q

What are the OR rules?

A 
A + A(bar) = 1
A + 1 = 1
A + 0 = A
A + A = A
A + (A.B) = A
28
Q

What kind of implicant is a prime implicant?

A
  • It is not an implicant of the function

- It is often the outer or largest group on the k map

29
Q

What is na essential prime implicant?

A

-Name of a group which includes at least ‘1’ not covered by any other group

30
Q

What is the minimal sum?

A

-Smallest number of prime implicants requires to describe the function

31
Q

What does the minimal sum =?

A

minimal sum = essential prime implicant + some prime implicants

32
Q

Why do asynchronous FSMs only used AND, OR and INVERTERS?

A

Flip-flops require a clock signal and gates can change instantaneously without a clock signal

33
Q

YooHoo

A

Boobies

EE2A (3 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions