ITEC 352 Lecture 3 Low level components(2). Low-level components Review Electricity Transistors Gates Really simple circuit.

Slides:

Advertisements

Similar presentations

DAT2343 Basic Logic Gates © Alan T. Pinck / Algonquin College; 2003.

Advertisements

CT455: Computer Organization Logic gate

Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.

Digital Circuits.

ITEC 352 Lecture 4 Boolean logic / Karnaugh Maps.

ECE2030 Introduction to Computer Engineering Lecture 9: Combinational Logic, Mixed Logic Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering.

ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.

Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.

ECE 301 – Digital Electronics Multiplexers and Demultiplexers (Lecture #12)

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

In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.

OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.

Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.

Introduction to Computer Science David Goldschmidt, Ph.D. Computer Science The College of Saint Rose CIS September 6, 2007.

CS 352 : Computer Organization and Design University of Wisconsin-Eau Claire Dan Ernst Elementary Digital Logic Apps O/S Arch  Arch Logic Digital Analog.

ECE 3130 – Digital Electronics and Design

Logic Gates How Boolean logic is implemented. Transistors used as switches to implement Boolean logic: ANDOR Logic with Transistors.

Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.

 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.

Digital Logic Structures MOS transistors logic gates functional units of a computer.

Digital Electronics Lecture 6 Combinational Logic Circuit Design.

Multiplexers. Functional Description and Symbols.

Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.

Week 6: Gates and Circuits: PART I READING: Chapter 4.

Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.

BASIC LOGIC GATES. In studying digital in integrated circuits, one must start with the simples group of circuits, the SSIs or Small Scale Integrated Circuits.

A-Level Computing#BristolMet Session Objectives#6 MUST understand and produce simple logic diagrams using the operations NOT, AND and OR SHOULD explain.

ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.

CEC 220 Digital Circuit Design Timing Diagrams, MUXs, and Buffers Mon, Oct 5 CEC 220 Digital Circuit Design Slide 1 of 20.

CEC 220 Digital Circuit Design Timing Diagrams, MUXs, and Buffers Friday, February 14 CEC 220 Digital Circuit Design Slide 1 of 18.

CEC 220 Digital Circuit Design Timing Diagrams, MUXs, and Buffers

CEC 220 Digital Circuit Design Boolean Algebra I Wed, Sept 2 CEC 220 Digital Circuit Design Slide 1 of 13.

Boolean and Sequential Logic Last week – Basic Gates AND OR NOT NOR XOR NAND.

Karnaugh Maps (K-Maps)

Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.

Module 7.  In Module 3 we have learned about NAND gate – it is a combination of AND operation followed by NOT operation  Symbol A. B = Y  Logic Gate.

Chapter 3 Digital Logic Structures

Computer Organization CSC 405 Decoders and Multiplexers.

Multiplexers & Decoders By: Jason Pitts CS 147 Spring 2010.

Combinational Logic Analysis. Basic Combinational Logic Circuits AND-OR logic AND-OR logic AND-OR logic produces an SOP expression. AND-OR logic produces.

Logic Gates and Boolean Algebra Introduction to Logic II.

Digital Logic Design. Truth Table  Logic Circuit 1. Start with truth table 2. When your output is a 1, figure out the combination of inputs, ANDs, and.

Activity 1 5 minutes Grab a whiteboard and pen, come to the front and work out the Truth Table for the following circuit: R A B C Q.

Creating logic gates with Minecraft

Logic Gates and Boolean Algebra

Logic Gates Practical Objective: to develop an understanding of logic circuits and truth tables.

Boolean Expressions Lecture No. 10.

Jeremy R. Johnson Wed. Sept. 29, 1999

Circuits & Boolean Expressions

Karnaugh Maps (K-Maps)

How Boolean logic is implemented

Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan

Elec 2607 Digital Switching Circuits

Digital Circuits.

Lecture 20: Combinatorial Circuits I

Digital Logic Experiment

Electronics for Physicists

Digital Circuits.

Digital Logic Design Basics Combinational Circuits Sequential Circuits.

Circuits & Boolean Expressions

Agenda Lecture Content: Combinatorial Circuits Boolean Algebras

Digital Circuits.

Presentation transcript:

ITEC 352 Lecture 3 Low level components(2)

Low-level components Review Electricity Transistors Gates Really simple circuit

Low-level components Review What are

Low-level components Review #2 What does this turn into?

Low-level components Review 3 What does this do?

Low-level components Truth tables… Draw the truth tables for the following functions: F = A’B’C + A’B’C (here the ‘ stands for bar). F = A’B + B’A

Low-level components Digital Circuits. Consider the following digital circuit. Express it as a Boolean algebra expression. –i.e., F = …? (in terms of A, B, C) –G = …?

Low-level components More Find the boolean expression Can you optimize it?

Low-level components Combination al Logic Circuits formed using gates. –Key issue: no memory is used in building these circuits.

Low-level components Logic Unit Translates a set of inputs into a set of outputs The outputs of a CLU are strictly functions of the inputs, and the outputs are updated immediately after the inputs change. –NO MEMORY. AS SOON AS INPUT IS GIVEN (after a brief delay due to the propagational delay) THE OUTPUT SHOWS UP.

Low-level components Example circuit Multiplexer: Determines which input will reach output

Low-level components Uses of a MUX Routers, Switches Etc… To implement different other functions. Multiplexers can be joined together easily. –E.g., Join two 4 X 1 mux’s to get one 8 X 1 mux. Example: –Implement the majority function using a Multiplexer

Low-level components Summary Boolean algebra Truth tables Mux