Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Complex Combinational Logic Blocks ECE/CS 252, Fall 2010 Prof.

Slides:

Advertisements

Similar presentations

Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.

Advertisements

Chapter 3 Digital Logic Structures. 3-2 Transistor: Building Block of Computers Microprocessors contain millions of transistors Intel Pentium 4 (2000):

Chapter 3 Continued Logic Gates Logic Chips Combinational Logic Timing Sequential Logic Flip Flops Registers Memory State Machines.

Computer Arithmetic, Multiplexers Prof. Sin-Min Lee Department of Computer Science.

11/16/2004EE 42 fall 2004 lecture 331 Lecture #33: Some example circuits Last lecture: –Edge triggers –Registers This lecture: –Example circuits –shift.

Combinatorial Logic Design Process. Example: Three 1s pattern detector Detect whether a pattern of at least three adjacent 1s occurs anywhere in an 8-bit.

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.

Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.

Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.

Computer Science 210 s1 Computer Systems Semester 1 Lecture Notes James Goodman (revised by Robert Sheehan) Credits: Slides prepared by Gregory.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 2 Image Slides.

Chapter 8 Traffic-Analysis Techniques. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 8-1.

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Building Functions.

9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexers.

Combinational Circuits Chapter 3 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 2003.

Introduction to Computing Systems from bits & gates to C & beyond Chapter 3 Digital Logic Structures Transistors Logic gates & Boolean logic Combinational.

Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.

Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.

Binary Addition Section 4.5. Binary Addition Example.

ECE 3130 – Digital Electronics and Design

+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.

Introduction to Computing Systems from bits & gates to C & beyond Chapter 3 Digital Logic Structures Transistors Logic gates & Boolean logic Combinational.

Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms.

Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.

Computer Organization & Programming Chapter4 Combinatorial Components.

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Basic Logic Gates.

Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.

Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.

ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Adders, subtractors, ALUs.

Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP

Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.

Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.

The George Washington University School of Engineering and Applied Science Department of Electrical and Computer Engineering ECE122 – Lab 6 Multiplexers,

Digital Logic. 2 Abstractions in CS (gates) Basic Gate: Inverter IO IO GNDI O Vcc Resister (limits conductivity) Truth Table.

Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.

ES 244: Digital Logic Design Chapter 4 Chapter 4: Combinational Logic Uchechukwu Ofoegbu Temple University.

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Complete Example.

Chapter 3 Digital Logic Structures

PART 3 Digital Logic 1.Logic Gates 2.Logic Circuits 3.Memory 4.Sequential Circuits 5.LC-3 Data Path.

Lecture 18: Hardware for Arithmetic Today’s topic –Intro to Boolean functions (Continued) –Designing an ALU 1.

Universal college of engineering & technology. .By Harsh Patel)

Introduction to Computer Engineering CS/ECE 252, Spring 2012 Prof. Karu Sankaralingam Computer Sciences Department University of Wisconsin – Madison.

Instructor：Po-Yu Kuo 教師：郭柏佑

Introduction to Computer Engineering CS/ECE 252, Fall 2007 Prof. David A. Wood Computer Sciences Department University of Wisconsin – Madison.

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.

Appendix C Basics of Digital Logic Part I. Florida A & M University - Department of Computer and Information Sciences Modern Computer Digital electronics.

Computing Machinery Chapter 3: Combinational Circuits.

Instructor ： Po-Yu Kuo 教師：郭柏佑 Ch. 3 Digital Logic Structures EL 1009 計算機概論 ( 電子一 B) Introduction to Computer Science.

Introduction to Computing Systems and Programming Digital Logic Structures.

Chapter 3 Digital Logic Structures

Gates AND, OR, NOT NAND, NOR Combinational logic No memory A set of inputs uniquely and unambiguously specifies.

Latches, Flip Flops, and Memory ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin – Madison.

Chapter 13 Transportation Demand Analysis. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display

Discrete Systems I Lecture 10 Adder and ALU Profs. Koike and Yukita.

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.

Full Adders Vector Notation Multiplexers and Decoders Ellen Spertus MCS 111 September 6, 2001.

LC-3 Datapath ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin – Madison.

Combinational Circuits

ECE 3130 Digital Electronics and Design

ECE 3130 Digital Electronics and Design

Computer Science 210 Computer Organization

Instructor：Po-Yu Kuo 教師：郭柏佑

Combinational Functions and Circuits

Lecture 4: Combinational Functions and Circuits

Instructor：Po-Yu Kuo 教師：郭柏佑

COMS 361 Computer Organization

Combinational Circuits

Presentation transcript:

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Complex Combinational Logic Blocks ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin – Madison

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Building Functions from Logic Gates We've already seen how to implement truth tables using AND, OR, and NOT -- an example of combinational logic. Combinational Logic Circuit output depends only on the current inputs Stateless Quick review + example Then examples of some useful combinational circuits

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-3 Review: Building AND/OR/NOT Logic Circuit Can implement ANY truth table with AND, OR, NOT. ABCD AND combinations that yield a "1" in the truth table. 2. OR the results of the AND gates.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-4 Decoder n inputs, 2 n outputs exactly one output is 1 for each possible input pattern 2-bit decoder

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Example: 7-Segment Display Decoder 3-5 ABCDs1s2s3s4s5s6s s2 s5 s1 s3 s6 s7 s4 4:16 Decoder A B C D s5

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-6 Full Adder Add two bits and carry-in, produce one-bit sum and carry-out. ABC in SC out

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-7 Four-bit Ripple-Carry Adder

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-8 Multiplexer (MUX) n-bit selector and 2 n inputs, one output output equals one of the inputs, depending on selector 4-to-1 MUX

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. LC-3 Arithmetic/Logic Unit (ALU) bit Adder16-bit AND16-bit NOT Left OperandRight Operand Result Mux ctrl: 00 – Add 01 – AND 10 – NOT 11 – N/A

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Summary Building AND/OR/NOT Logic Functions Useful Complex Logic Blocks Decoder Full Adder Ripple-carry Adder Multiplexer LC-3 Arithmetic-Logic Unit (ALU)