ECE 349 Homework Assignment Solutions for Sequential Circuits - Prof. James F. Frenzel, Assignments of Electrical and Electronics Engineering

Solutions to homework assignment #8 for the ece 349 course on sequential circuits. It includes the design of counters using d, j-k, and t flip-flops, as well as problem-solving based on textbook questions. Students are encouraged to draw circuit diagrams and design equations where necessary.

Typology: Assignments

Pre 2010

Uploaded on 08/19/2009

koofers-user-mir
koofers-user-mir 🇺🇸

10 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE 349 Homework Assignment #8 Solutions
Show your work! You will not receive full credit for the answer alone.
1. Design a counter that counts in the sequence: 101, 100, 011, 010, 001, 000, 101, ...
Use clocked D flip-flops. Draw the circuit diagram. What will happen if your counter
starts in an invalid state?
A B C A+ B+ C+ Da Db Dc
000 101 101
001 000 000
010 001 001
011 010 010
100 011 011
101 100 100
110 XXX XXX
111 XXX XXX
Design Equations: Da =AC +A0B0C0,Db =AC 0+BC ,Dc =C0
If in state 110, NS is 011. If in state 111, NS is 110.
2. Repeat problem (1) using J-K flip-flops. You do not need to draw the circuit diagram.
A B C A+ B+ C+ Ja Ka Jb Kb Jc Kc
000 101 1X 0X 1X
001 000 0X 0X X1
010 001 0X X1 1X
011 010 0X X0 X1
100 011 X1 1X 1X
101 100 X0 0X X1
110 XXX XX XX XX
111 XXX XX XX XX
Design Equations: Ja =B0C0,K a =C0,J b =AC0,K b =C0,J c = 1, Kc = 1
If in state 110, NS is 001. If in state 111, NS is 111. It would be wise to redesign this
state machine so state 111 leads to some valid state.
pf3
pf4

Partial preview of the text

Download ECE 349 Homework Assignment Solutions for Sequential Circuits - Prof. James F. Frenzel and more Assignments Electrical and Electronics Engineering in PDF only on Docsity!

ECE 349 Homework Assignment #8 Solutions

Show your work! You will not receive full credit for the answer alone.

  1. Design a counter that counts in the sequence: 101, 100, 011, 010, 001, 000, 101, ... Use clocked D flip-flops. Draw the circuit diagram. What will happen if your counter starts in an invalid state?

A B C A+ B+ C+ Da Db Dc 000 101 101 001 000 000 010 001 001 011 010 010 100 011 011 101 100 100 110 XXX XXX 111 XXX XXX Design Equations: Da = AC + A′B′C′, Db = AC′^ + BC, Dc = C′ If in state 110, NS is 011. If in state 111, NS is 110.

  1. Repeat problem (1) using J-K flip-flops. You do not need to draw the circuit diagram.

A B C A+ B+ C+ Ja Ka Jb Kb Jc Kc 000 101 1X 0X 1X 001 000 0X 0X X 010 001 0X X1 1X 011 010 0X X0 X 100 011 X1 1X 1X 101 100 X0 0X X 110 XXX XX XX XX 111 XXX XX XX XX Design Equations: Ja = B′C′, Ka = C′, Jb = AC′, Kb = C′, Jc = 1, Kc = 1 If in state 110, NS is 001. If in state 111, NS is 111. It would be wise to redesign this state machine so state 111 leads to some valid state.

  1. Design a counter that counts in the sequence: 000, 010, 001, 100, 011, 110, 000, ... Use clocked T flip-flops. Design your counter to go to state 000 from all invalid states. There is no need to draw a circuit diagram.

A B C A+ B+ C+ Ta Tb Tc 000 010 010 001 100 101 010 001 011 011 110 101 100 011 111 101 000 101 110 000 110 111 000 111 Design Equations: T a = A + C, T b = C′^ + AB, T c = C + A′B + AB′

  1. Do problem 14.4 on page 380 of your text.

S0 S2 S3 S

S1 S4 S5 S

S4: 1 & 0

0 0 0 0

0 0 0 1

1 1 1 1

1 1 1

0

0 0 0

0 0 0

0,

S0: nothing

S5: 1 & 0 & 0

S3: 00

S2: 0

S1: 1

S6: 000 S7: 1 & 0 & 0 & 0

  1. Do problem 14.7 on page 380 of your text. See solutions in your book for a state table. A 4-state state diagram is shown below.

S 0

1

S 0

S3: 00 or 10 : Z = 1

1

01,

01,

00

00,

00,

00,

11

S

S

01,

11

01

S0: 00 or 11 : Z = 0 S1: 01 or 10 : Z = 0 S2: 01 or 11 : Z = 1

9. (6 points) Design a clocked Mealy sequential network that investigates an input se-

quence X and that will produce an output Z = 1 if the total number of 1s received is even (consider zero 1s to be an even number of 1s) and the sequence 00 has occurred at least once. The total number of 1s received includes those received before and after A minimum of six states is required. Design your network using NAND gates, NOR 0 1 0 1 0 0 0 0 0 0 0 1

  • X = 00. Example:
  • Z = - 1/ gates, and three J-K flip-flops. Assign 000 to the start state. - 0/ - 0/ - 1/ - 0/ - 0/ - 0/ - 1/ - 0/ - 1/ - 1/ - 1/
    • PS X=0 X=1 X= - X= Jc = B’C’X’, Kc = A’B’X, Z = A’CX’ + ACX
      • 001: S1 - even # 1s, and NS Z
      • 000: S0 - even # 1s, no
      • 010: S2 - odd # 1s, no
      • 011: S3 - even # 1s and
      • 100: S4 - odd # 1s, and
      • 101: S5 - odd # 1s and
    • S
    • S
    • S
    • S
    • S
    • S - S1 S - S3 S - S4 S - S3 S - S5 S - S5 S - S - S - S - S - S - S