Simple Sequence Detector - Components and Techniques for Digital Systems - Quiz, Exercises of Computer Science

These are the Quiz of Components and Techniques for Digital Systems which includes Invert Gates, Timing Diagram, Circuits with Feedback, Binary Quantity, Time Dependent Behavior, Oscillating Output, Implement Functions, Multiplexer for Function etc. Key important points are: Simple Sequence Detector, Moore Machine, Mealy Machine Description, Timing Diagrams, Input Stream, Serial Palindrome, State Transition Table, Implication Chart Method, Boolean Functions

Typology: Exercises

2012/2013

Uploaded on 03/22/2013

dhimant
dhimant 🇮🇳

4.3

(8)

128 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Department of Electrical Engineering and Computer Science
EECS 150
Fall 2000
Problem Set # 7 (Assigned 19 October, Due 27 October)
1. In lecture 06-SeqImpl, slides 34-35, we presented a Moore Machine and Mealy Machine description
for a simple sequence detector that would output a 1 whenever the bit sequence 01 or 10 has been seen
in the input bit stream. Assume positive edge-triggered state flipflops and that the input changes on the
falling edge of the clock.
(a) Draw timing diagrams for how these two state machines behave for the input stream 001011010.
(b) If the Mealy Machine is implemented as a SYNCHRONOUS MEALY MACHINE, draw the
timing diagram for this sequence.
(c) If the timing behaviors are different for the MOORE, MEALY, and SYNCHRONOUS MEALY
machines, explain the reason why.
2. Design a MEALY MACHINE sequence detector state machine that outputs a 1 whenever its input
stream is a 4-bit bit serial palindrome, i.e., the last two bits are mirror images of the first two bits in the
4-bit sequence. An example of the machine’s correct behavior is shown below:
Input: 0000 0110 1010 0011 1001 …
Output: 0001 0001 0000 0000 0001 …
3. Given the following MOORE MACHINE State Transition Table, use the Implication Chart method to
minimize the number of states. Draw the resulting minimized state diagram.
4. Given the following MEALY MACHINE State Transition Table, perform three different state
assignments and develop the minimized Next State and Output Boolean functions according the
following specifications:
(a) Assign states sequentially: A=00, B=01, C=10, D=11
(b) Assign states using 1 Hot Encoding: A=1000, B=0100, C=0010, D=0001 (6 Variable K-maps!)
(c) Assign states using the heuristics presented in 06-SeqImpl, Slide #69
(d) Which yields the best implementation and why?
Output
Next State
Current State
0
1
2
3
4
5
00
1
0
5
5
0
5
01
2
2
2
1
2
4
10
0
3
4
0
5
0
11
5
1
3
2
1
2
0
1
1
0
1
0
Output
Next State
Current State
A
B
C
D
00
A
B
A
A
01
B
A
D
B
10
D
B
D
B
11
C
C
C
C
00
0
0
0
0
01
1
0
0
0
10
0
0
0
0
11
1
1
1
1
Docsity.com

Partial preview of the text

Download Simple Sequence Detector - Components and Techniques for Digital Systems - Quiz and more Exercises Computer Science in PDF only on Docsity!

Department of Electrical Engineering and Computer Science

EECS 150

Fall 2000

Problem Set # 7 (Assigned 19 October, Due 27 October)

  1. In lecture 06-SeqImpl, slides 34-35, we presented a Moore Machine and Mealy Machine description for a simple sequence detector that would output a 1 whenever the bit sequence 01 or 10 has been seen in the input bit stream. Assume positive edge-triggered state flipflops and that the input changes on the falling edge of the clock. (a) Draw timing diagrams for how these two state machines behave for the input stream 001011010. (b) If the Mealy Machine is implemented as a SYNCHRONOUS MEALY MACHINE, draw the timing diagram for this sequence. (c) If the timing behaviors are different for the MOORE, MEALY, and SYNCHRONOUS MEALY machines, explain the reason why.
  2. Design a MEALY MACHINE sequence detector state machine that outputs a 1 whenever its input stream is a 4-bit bit serial palindrome, i.e., the last two bits are mirror images of the first two bits in the 4-bit sequence. An example of the machine’s correct behavior is shown below: Input: 0000 0110 1010 0011 1001 … Output: 0001 0001 0000 0000 0001 …
  3. Given the following MOORE MACHINE State Transition Table, use the Implication Chart method to minimize the number of states. Draw the resulting minimized state diagram.
  4. Given the following MEALY MACHINE State Transition Table, perform three different state assignments and develop the minimized Next State and Output Boolean functions according the following specifications: (a) Assign states sequentially: A=00, B=01, C=10, D= (b) Assign states using 1 Hot Encoding: A=1000, B=0100, C=0010, D=0001 (6 Variable K-maps!) (c) Assign states using the heuristics presented in 06-SeqImpl, Slide # (d) Which yields the best implementation and why?

Current State Next State Output

0 1 2 3 4 5

Current State Next State Output

A B C D

A

B

A

A

B

A

D

B

D

B

D

B

C

C

C

C

Docsity.com