Download presentation

Presentation is loading. Please wait.

Published byTracy Woodhull Modified over 2 years ago

1
Fall 2006 1 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering Computer Organization Lecture 2 Expectations/Rumors Prerequisites Syllabus, Policies

2
Fall 2006 2 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering Expectations Respectful, friendly, helpful, fun Fair grading/exams/no surprises Accessible office hours, helpful outside of class Clearly explain material, willing to clarify, lots of relevant examples, challenge/push, engaging

3
Fall 2006 3 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering Rumors Uses powerpoint, boring, waste of time Challenging/confusing/difficult class Tests are hard, final project difficult Not a likable guy, will take us to pain, an animal

4
Fall 2006 4 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering Back to Prerequisites

5
Fall 2006 5 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering Prerequisites Combinational logic –Truth tables, K-maps –SOP, POS Sequential logic –Flip-flops –State diagram, next state decoder MSI devices: MUX, decoder, adder

6
Fall 2006 6 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering What is the next state table? 00 11 1001 Reset Grey code counter Transitions occur only on a clock edge

7
Fall 2006 7 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering What is the next state table? Present StateNext State Q1Q1 Q0Q0 Q1Q1 Q0Q0 0001 0111 1000 1110

8
Fall 2006 8 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering Finite state machine

9
Fall 2006 9 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering Find NSD truth tables? 11 00 01 0 1 Q0Q0 Q1Q1 01 2 3 01 01 01 0 1 Q0Q0 Q1Q1 01 2 3 D 0 =D 1 =

10
Fall 2006 10 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering Find NSD logic?

11
Fall 2006 11 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering It works !! Circuit counts when Reset not asserted

12
Fall 2006 12 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering Syllabus, Policies

13
Fall 2006 13 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering

14
Fall 2006 14 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering What is the next state table? Present StateNext State Q1Q1 Q0Q0 Q1Q1 Q0Q0 0001 0111 1000 1110

15
Fall 2006 15 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering Find NSD truth tables? 11 00 01 0 1 Q0Q0 Q1Q1 01 2 3 01 01 01 0 1 Q0Q0 Q1Q1 01 2 3 D 0 = Q 1 D 1 = Q o

16
Fall 2006 16 EE 333 Lillevik 333f06-l2 University of Portland School of Engineering Find NSD logic?

Similar presentations

OK

Flip_Flops Logic circuits are classified ito two groups 1. The combinational logic circuits,using the basic gates AND,OR and NOT. 2. Sequential.

Flip_Flops Logic circuits are classified ito two groups 1. The combinational logic circuits,using the basic gates AND,OR and NOT. 2. Sequential.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google