Multiplexer as a Universal Function Generator Lecture L6.7 Section 6.2.

Slides:

Advertisements

Similar presentations

Basic Logic Gates Discussion D5.1 Section Sections 13-3, 13-4.

Advertisements

Combinational Logic Word Problems

Figure 4.1. The function f (x1, x2, x3) =  m(0, 2, 4, 5, 6).

Morgan Kaufmann Publishers

Decoders/DeMUXs CS370 – Spring Decoder: single data input, n control inputs, 2 outputs control inputs (called select S) represent Binary index of.

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.

Universal Gates Sum of Products Products of Sum

A Programmable Logic Device Lecture 4.3. A Programmable Logic Device Multiple-input Gates A 2-Input, 1-Output PLD.

Multiplexers Lecture L6.4 Section 6.4.

Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.

Revision Mid 2 Prof. Sin-Min Lee Department of Computer Science.

Multiplexers Module M6.1 Section 6.4. Multiplexers A 4-to-1 MUX TTL Multiplexer A 2-to-1 MUX.

Multiplexer as a Universal Function Generator

4-to-1 Multiplexer: Module Instantiation Discussion D7.2 Example 5.

CS 140L Lecture 9 Professor CK Cheng 6/03/02. transistors modules sequential machine system 1.Adders, Muxes 2.F-Fs and counters 3.Finite State Machine.

Introduction to Computer Engineering by Richard E. Haskell Basic Logic Gates Module M1.1 Section 3.1.

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

Combinational Logic Design Process

Quad 2-to-1 Multiplexer Discussion D7.4 Example 7.

Generalized De Morgan’s Theorem Lecture L5.4 Section 5.1.

Example of a Combinatorial Circuit: A Multiplexer (MUX)

Digital Logic Gates. Sum of Products (Review) Procedure: 1.Form a minterm for each combination of the variables that produces a 1 2.OR all the minterms.

Combinational Logic Chapter 4.

Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:

Quiz What are the results of the following 4-bit bitwise logical operations? NOT OR NOR AND

Digital Electronics Lecture 6 Combinational Logic Circuit Design.

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

1 CS151: Digital Design Chapters 4, 5 Review. CS Question 1 Design a combinational circuit for a Roller-Coaster ride in an amusement park. The design.

Multiplexers. Functional Description and Symbols.

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

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

Exclusive OR Gate. Logically, the exclusive OR (XOR) operation can be seen as either of the following operations:exclusive OR (XOR) 1. A AND NOT B OR.

Basic logic gates  AND gate:The truth table is given by A.BBA

Computer Organization and Design Transistors & Logic - II Montek Singh Wed, Oct 16, 2013 Lecture 10.

Digital Electronics Digital Electronics G.S.UTHAYAKUMAR ST.JOSEPH’S COLLEGE OF ENGINEERING,CHENNAI-119.

Computer Organization and Design Transistors & Logic - II Montek Singh Oct {21,28}, 2015 Lecture 10.

ECE 331 – Digital System Design Multiplexers and Demultiplexers (Lecture #13)

Multiplexers and Demultiplexers

CS 151  What does the full truth table look like? InputsOutputs D3D3 D2D2 D1D1 D0D0 A1A1 A0A0 V 0000XX

Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.

Logic Gates. AND gate Produces an output only if both inputs are on Input AInput BOutput (Q) Q=

1 CS 151: Digital Design Chapter 3: Combinational Logic Design 3-1Design Procedure CS 151: Digital Design.

Appendix B: Digital Logic

NAND, NOR, and EXOR (more primitive logical gates) CS Computer Architecture David Mayer.

Logic Gates and Boolean Algebra Introduction to Logic II.

Lecture No. 18 Combinational Functional Devices. Recap Decoder Decoder –3-to-8 Decoder –Cascading of Decoders 4-to-16 decoder –Implementing SOP & POS.

Basic Gates and ICs 74LS00 Quad 2-Input NAND gate 74LS02 Quad 2-Input NOR gate 74LS04 Quad 2-Input NOT gate 74LS08 Quad 2-Input AND gate 74LS32 Quad 2-Input.

Chapter 5 Combinational Logic 组合逻辑

ECE 3130 Digital Electronics and Design

Eng. Mai Z. Alyazji October, 2016

ECE 3130 Digital Electronics and Design

EI205 Lecture 5 Dianguang Ma Fall 2008.

Exclusive OR Gate.

Computer Organization and Design Transistors & Logic - II

Overview Register Transfer Language Register Transfer

Basic Logical Operations (Fascinating)

Schematics 201 Lecture Topic: Electrical Symbols

13 Digital Logic Circuits.

Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y

Digital Logic Design Basics Combinational Circuits Sequential Circuits.

Basic Logic Operations

Agenda Lecture Content: Combinatorial Circuits Boolean Algebras

Example of a Combinatorial Circuit: A Multiplexer (MUX)

Presentation transcript:

Multiplexer as a Universal Function Generator Lecture L6.7 Section 6.2

Multiplexers Y 4 x 1 MUX s0s1 C0 C1 C2 C3 Y s1s0 0 0 C0 0 1 C1 1 0 C2 1 1 C3

Multiplexers Y 4 x 1 MUX s0s1 C0 C1 C2 C3 Y s1s0 0 0 C0 0 1 C1 1 0 C2 1 1 C =XOR

Multiplexers Y 4 x 1 MUX s0s1 C0 C1 C2 C3 Y s1s0 0 0 C0 0 1 C1 1 0 C2 1 1 C =AND

Multiplexers Y 4 x 1 MUX s0s1 C0 C1 C2 C3 Y s1s0 0 0 C0 0 1 C1 1 0 C2 1 1 C =OR

Multiplexers Y 4 x 1 MUX s0s1 C0 C1 C2 C3 Y s1s0 0 0 C0 0 1 C1 1 0 C2 1 1 C =NAND

Multiplexers Y 4 x 1 MUX s0s1 C0 C1 C2 C3 Y s1s0 0 0 C0 0 1 C1 1 0 C2 1 1 C =NOR Can you implement a logic circuit with THREE inputs using a 4 x 1 MUX?

2 x 1 MUX is a universal element

Step 1 Gout = x & !y # x & Gin # !y & Gin A = !y & Gin B = !y # Gin # !y & Gin x = 0 x = 1 Implement the following logic equation using 2 x 1 MUXs

Step 2 A = !y & Gin B = !y # Gin # !y & Gin y = 0 0-input = Gin y = 1 1-input = 0 y = 0 0-input = 1 y = 1 1-input = Gin

4 x 1 MUX The variable Gout is 1 if x > y or if x = y and Gin = 1.

Majority Circuit Y 4 x 1 MUX s1s2 C0 C1 C2 C3 0 s0 1