Starting from:

$25

EECS101001 - HW5 - Solved

 Logic Design                                                                                                                   
  

  

1.         (15%) A sequential circuit with two D flip-flops A and B, two inputs X and Y, and one output Z is specified by the following input equations:

DA=X’B’+XY’, DB=A’+Y’B, Z=YA’B

(a)        Draw the logic diagram of the circuit.

(b)        Derive the state table.

(c)         Derive the state diagram.

 

2.         (10%) Design a sequential circuit with two D flip-flops A and B and one input X. When X = 1, the state of the circuit remains the same. When X = 0, the circuit goes through the state transitions from 00 to 11 to 01 to 10, back to 00, and then repeats.

 

3.         (20%) For the D-type positive edge-triggered flip-flop and D-type positive level-sensitive (level-triggered) latch with the same clock (clk), asynchronous reset signal (rst, active low), and input (Data) below. Assume the initial state of both the flip-flop and latch are ‘0’, and both devices are with 0 D-to-Q delay. Point out the incorrect parts for Q1 and Q2 in the timing diagram and redraw the correct timing diagram.

 

4.         (10%) A sequential circuit has two flip-flops A and B, one input X, and one output Y. The state diagram is shown in figure below. Design the circuit with D flip-flops.

 

5.         (10%) Draw the state diagram of the sequential circuit specified by the following state table. 

6.         (15%) Design a recognizer that recognizes an input sequence that has at least three 1's. The recognizer has a single input X, and a single output Y, and one asynchronous Reset input signal. The recognizer sets the output Y to 1 if the input signal X was equal to 1 in at least 3 clock cycles after reset. (a) Derive the state diagram. (b) Encode the states to minimize the combinational logic. (c) Draw the logic diagram using D flipflops. 

 

7.         (20%) Reduce the number of states in the following state table and tabulate the reduced state table. 

Show that the same output sequences are obtained for both the state table of the previous problem and the reduced state table from the previous problem. The state-circuit starts from state a, and the input sequence is 10110101001

More products