1 / 33

CS 231 Fall 2005 Review Session

CS 231 Fall 2005 Review Session. Friday, Oct 21 by Celal Ziftci. Today’s topics. How to distinguish between different kinds of circuits? (Combinatorial, Latch, Flip-flop) How to find the timing diagram of a given circuit (with gate delays)?

ophrah
Download Presentation

CS 231 Fall 2005 Review Session

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. CS 231Fall 2005Review Session Friday, Oct 21 by Celal Ziftci

  2. Today’s topics • How to distinguish between different kinds of circuits? (Combinatorial, Latch, Flip-flop) • How to find the timing diagram of a given circuit (with gate delays)? • How to design a sequential circuit, for a given problem definition?

  3. 1. There is a combinatorial circuit, a flip-flop and a latch with control. Which is which?

  4. 2. Given the following circuit and initial input values…Gate delay = 1 ns

  5. 2. Sequential Circuit Design • Problem definition: Implement a circuit which outputs 1 only if the # 1’s in the input string is a multiple of 4. • Ex:Input 0 1 0 0 1 1 1 0 0 1 Output  1 0 0 0 0 0 1 1 1 0

  6. Observation:We can rewrite the problem as follows:Output 1 when: (X % 4) = 0 (X is the number of 1’s so far). • So we don’t need to remember the whole string. We only need to remember (X % 4). • We have 4 possibilities: 0, 1, 2, 3

  7. Using the state diagram, we can construct our state table…

  8. After this point, we can draw K-maps for J1, K1, J0, K0 and output, and we are done!

  9. All for today. • If you have any questions, come to any TA office hours.

More Related