Conversion of state transition graph to a 00 00 s s 1

Info icon This preview shows pages 10–26. Sign up to view the full content.

View Full Document Right Arrow Icon
Conversion of State transition graph to a circuit 1/0 1/1 0/0 0/0 S 0 S 1 Memory (FFs) y z Next State logic Output logic x CC-2 CC-1 Y clk 3 blocks need to be designed Example-1
Image of page 10

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Conversion of State transition graph to a circuit 1/0 1/1 0/0 0/0 S 0 S 1 Memory (FFs) y z Next State logic Output logic x CC-2 CC-1 Y clk 1. How many FFs do we need? 3 blocks need to be designed Example-1
Image of page 11
Conversion of State transition graph to a circuit 1/0 1/1 0/0 0/0 S 0 S 1 Memory (FFs) y z Next State logic Output logic x CC-2 CC-1 Y clk 1. How many FFs do we need? N FFS can represent 2 N states so Minimum is 1 3 blocks need to be designed Example-1
Image of page 12

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Conversion of State transition graph to a circuit 1/0 1/1 0/0 0/0 S 0 S 1 Memory (FFs) y z Next State logic Output logic x CC-2 CC-1 Y clk 1. How many FFs do we need? N FFS can represent 2 N states so Minimum is 1 2. Which FF do we choose? 3 blocks need to be designed Example-1
Image of page 13
Conversion of State transition graph to a circuit 1/0 1/1 0/0 0/0 S 0 S 1 Memory (FFs) y z Next State logic Output logic x CC-2 CC-1 Y clk 1. How many FFs do we need? N FFS can represent 2 N states so Minimum is 1 2. Which FF do we choose? Say D FF 3 blocks need to be designed Example-1
Image of page 14

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Conversion of State transition graph to a circuit 1/0 1/1 0/0 0/0 S 0 S 1 Memory (FFs) y z Next State logic Output logic x CC-2 CC-1 Y clk 1. How many FFs do we need? N FFS can represent 2 N states so Minimum is 1 2. Which FF do we choose? Say D FF 3. How are the states encoded? 3 blocks need to be designed Example-1
Image of page 15
Conversion of State transition graph to a circuit 1/0 1/1 0/0 0/0 S 0 S 1 Memory (FFs) y z Next State logic Output logic x CC-2 CC-1 Y clk 1. How many FFs do we need? N FFS can represent 2 N states so Minimum is 1 2. Which FF do we choose? Say D FF 3. How are the states encoded? Say FF output Q=0 represents S 0 and Q=1 represents S 1 state 3 blocks need to be designed Example-1
Image of page 16

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
1/0 1/1 0/0 0/0 S 0 S 1
Image of page 17
1/0 1/1 0/0 0/0 S 0 S 1 Next State logic CC-2 D Q clk z CC-1 Output logic x
Image of page 18

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
1/0 1/1 0/0 0/0 S 0 S 1 Next State logic CC-2 D Q clk z CC-1 Output logic x Present State Input Next State x 0 1 State Transition Table Q(t+1) Q(t) 1 1 z Output D 0 1 0 0 0 1 1 0 0 0 0 1
Image of page 19
Excitation Table Inputs 0 0 0 1 1 0 1 1 Q(t+1) Q(t) T What inputs are required to effect a particular state change 0 0 1 1
Image of page 20

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Excitation Table Q clk J K
Image of page 21
Excitation Table Q clk J K J K Q(t+1) Q(t) 0 0 0 1 1 0 1 1 Q(t) 0 1
Image of page 22

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Excitation Table Q clk J K J K Q(t+1) Q(t) 0 0 0 1 1 0 1 1 Q(t) 0 1 Inputs 0 0 0 1 1 0 1 1 Q(t+1) Q(t) X 0 J K 0 X 1 X X 1
Image of page 23
Excitation Table Q clk J K J K Q(t+1) Q(t) 0 0 0 1 1 0 1 1 Q(t) 0 1 Inputs 0 0 0 1 1 0 1 1 Q(t+1) Q(t) X 0 J K 0 X 1 X X 1 Q D clk
Image of page 24

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Excitation Table Q clk J K J K Q(t+1) Q(t) 0 0 0 1 1 0 1 1 Q(t) 0 1 Inputs 0 0 0 1 1 0 1 1 Q(t+1) Q(t) X 0 J K 0 X 1 X X 1 Q D clk Q(t+1) D 0 0 1 1
Image of page 25
Image of page 26
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern