{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

62sequential

# 62sequential - Overview 6.2 Sequential Circuits Last...

This preview shows pages 1–4. Sign up to view the full content.

COS126: General Computer Science http://www.cs.Princeton.EDU/~cos126 6.2: Sequential Circuits Q S R 2 Overview Last lecture: Boolean logic and combinational circuits. ! Basic abstraction = controlled switch. ! In principle, can build TOY computer with a combinational circuit. 255 ! 16 = 4,080 inputs " 2 4080 rows in truth table! no simple pattern each circuit element used at most once This lecture: reuse circuit elements by storing bits in "memory." Next lecture: glue components together to make TOY computer. ALU combinational Memory state 3 Sequential vs. Combinational Circuits Combinational circuits. ! Output determined solely by inputs. ! Can draw solely with left-to-right signal paths. Sequential circuits. ! Output determined by inputs AND previous outputs. ! Feedback loop. Q S R 4 Flip-Flop Flip-flop. ! A small and useful sequential circuit. ! Abstraction that "remembers" one bit. ! Basis of important computer components: memory counter We will consider several flavors.

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

View Full Document
5 SR Flip-Flop What is the value of Q if: ! S = 1 and R = 0 ? " Q S R 1 0 1 Q is surely 1 6 SR Flip-Flop What is the value of Q if: ! S = 1 and R = 0 ? " Q is surely 1. ! S = 0 and R = 1 ? " Q S R 0 1 Q is surely 0 0 0 0 7 Q S R 0 0 Q is possibly 0 0 0 0 SR Flip-Flop What is the value of Q if: ! S = 1 and R = 0 ? " Q is surely 1. ! S = 0 and R = 1 ? " Q is surely 0. ! S = 0 and R = 0 ? " 8 SR Flip-Flop What is the value of Q if: ! S = 1 and R = 0 ? " Q is surely 1. ! S = 0 and R = 1 ? " Q is surely 0. ! S = 0 and R = 0 ? " Q is possibly 0 . . . Q S R 0 0 or possibly 1 ! 1 1 1 1
9 Q S R 0 0 SR Flip-Flop What is the value of Q if: ! S = 1 and R = 0 ? " Q is surely 1. ! S = 0 and R = 1 ? " Q is surely 0. ! S = 0 and R = 0 ? " Q is possibly 0 . . . or possibly 1. While S = R = 0 , Q remembers what it was the last time S or R was 1. old Q 10 SR Flip-Flop SR Flip-Flop. ! S = 1, R = 0 (set) " “Flips” bit on. ! S = 0, R = 1 (reset) " “Flops” bit off. ! S = R = 0 " Status quo. ! S = R = 1 " Not allowed. Interface Implementation S R SR flip flop Q Q S R 11 Truth Table and Timing Diagram Truth table. ! Values vary over time. ! S(t), R(t), Q(t) denote value at time t. Sample timing diagram for SR flip-flop. Q(t+ # ) SR Flip Flop Truth Table S(t) 0 0 1 0 0 0 0 0 R(t) 0 0 1 1 Q(t) 0 1 0 1 1 1 1 1 1 1 0 0 1 1 0 1 0 1 Q R S time 1 0 1 0 1 0 # # 12 Clock Clock.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• 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.

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

• 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.

Dana University of Pennsylvania ‘17, Course Hero Intern

• 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.

Jill Tulane University ‘16, Course Hero Intern