L8_handouts_2up - ECE 3140/CS 3420 Computer Organization Spring S i 2009 Combinational Digital Logic g g ECE3140/CS3420 Announcements Homework 2

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
1 ECE 3140/CS 3420 Computer Organization Spring 2009 Combinational Digital Logic ECE3140/CS3420 Announcements • Homework 2 – Due Tue, Feb 17 at 10:00pm – Note Prob 6 correction with=>withou Note Prob 6 correction ( with >without ) • Project 2 – Due Tue, Feb 21 at 10:00pm ECE3140/CS3420 2
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Consulting/TA/Office Hours ECE3140/CS3420 3 • Consulting Hours in Phillips 314 • Sun 3:00-5:00pm, Mon 8:00-10:00pm, • Wed 7:30-9:30pm, Thu 7:00-9:00pm Hennessy and Patterson • Read Chapter 1 – 1.1-1.9 • Read Chapter 2 Read Chapter 2 – 2.1 through 2.14, – B.1-B.6, B.10 – MIPS Calling Convention Document (website) – Notes on Programming in C (website) • Read Chapter 3 – 3.1 through 3.2 ECE3140/CS3420 • Read Appendix C – C.1-C.6 (for TODAY) – C.7-C.10 (for Thursday) 4
Background image of page 2
3 Today’s Topics • Digital Logic – Combinational • Basic Building Blocks – Adder – Multiplexor • Verilog ECE3140/CS3420 5 Combinational Logic • The output of a combinational circuit depends only on current inputs • Multiple levels of representation: – Logic equations – Truth tables – Gate diagrams – Switching circuits • Boolean algebra : tool to manipulate logic equations ECE3140/CS3420 – An algebra on a set of two elements: {0; 1} – Operations: AND, OR, NOT 6
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 Logic Elements • AND: b a out = a b out 0 0 0 0 1 0 •OR : b a out b a out = = b a out b a out = + = 1 0 0 1 1 1 a b out 0 0 0 0 1 1 1 0 1 1 1 1 ECE3140/CS3420 7 •NO T : in' out in out in out = = ¬ = in out 0 1 1 0 1 1 Logic Equations • Fun with identities: 1 a a = + 0 a a = b a b a a ac ab c) a(b a a a 1 1 a a 0 a + = + + = + = = + = + a b a b a c) a )( b a ( bc a a a a a 1 a 0 0 a = + + + = + = + = = ECE3140/CS3420 8 • Check by writing truth tables, or by manipulating logic equations.
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/11/2009 for the course ECE 3140 taught by Professor Mckee/long during the Spring '07 term at Cornell University (Engineering School).

Page1 / 15

L8_handouts_2up - ECE 3140/CS 3420 Computer Organization Spring S i 2009 Combinational Digital Logic g g ECE3140/CS3420 Announcements Homework 2

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online