This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CPSC 121 Lecture 16 February 11, 2009 Menu February 11, 2009 Topics: Combinational Circuits (Recap) Sequential Circuits (Introduction) Reading: Today: Epp 12.2 (pages 745–747), Designing a Finite Automaton (pages 752–754, skipping part b of the examples) Reminders: Online Quiz 8 deadline 9:00pm February 12 Look for Online Quiz 9 (Review) Marked Assignment 1 available in tutorials Assignment 2 due Friday, February 13 (by 17:00) Midterm exam Tuesday, February 24 (evening) Combinational Circuits (Recap) In order to set the stage for the introduction of sequential circuits, let’s briefly review the assumptions associated with combinational circuits. Combinational Circuits: Summary A circuit element is a combinational device if: 1. it has one or more digital inputs 2. it has one or more digital outputs 3. there is a functional specification that gives the value of each output for every possible combination of valid input values 4. there is a timing specification that gives an upper bound on the required time for the device to compute the specified output values from an arbitrary set of stable, valid input values Combinational Circuits: Summary A set of interconnected elements is a combinational device if: 1. each circuit element is a combinational device 2. every input is connected to exactly one output or to some vast supply of 0s and 1s 3. the circuit contains no directed cycles3....
View
Full
Document
This note was uploaded on 01/09/2010 for the course CPSC 121 taught by Professor Belleville during the Spring '08 term at UBC.
 Spring '08
 BELLEVILLE

Click to edit the document details