Multiplexers. Functional Description and Symbols.

Slides:

Advertisements

Similar presentations

Advertisements

Documentation Standards

Decoders. Usage of Decoders Channel Selection: Generates Mutually Exclusive Channel Enabling/Disabling Signals (e.g. Multiplexers) Device Selection: Generates.

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

AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.

CS 140 Lecture 11 Professor CK Cheng 5/09/02. Part III - Standard Modules Decoder, Encoder, Mux, DeMux, Shifter, Adder, Multiplexer Interconnect: Decoder,

EECC341 - Shaaban #1 Lec # 10 Winter Implementing n-variable Functions Using 2 n -to-1 Multiplexers Any n-variable logic function, in canonical.

CS 140 Lecture 13 Combinational Standard Modules Professor CK Cheng CSE Dept. UC San Diego 1.

CS 140 Lecture 12 Professor CK Cheng 11/07/02. Part III - Standard Modules Decoder, Encoder, Mux, DeMux, Shifter, Adder, Multiplexer Interconnect: Decoder,

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

Multiplexer as a Universal Function Generator

Lecture 1: Introduction to Digital Logic Design CK Cheng Tuesday 4/1/02.

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

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

1 times table 2 times table 3 times table 4 times table 5 times table

XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.

ADDERS Half Adders Recall that the basic rules of binary addition are as indicated below in Table 2-9. A circuit known as the half-adder carries out these.

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

Digital Electronics Lecture 6 Combinational Logic Circuit Design.

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

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.

Boolean Algebra & Logic Prepared by Dr P Marais (Modified by D Burford)

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

Multiplexers. Outline  Larger Multiplexers  Standard MSI Multiplexer  Implementing Functions with Multiplexers  Implementing Functions with Smaller.

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

Multiplexers and Demultiplexers

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

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

IB Computer Science – Logic

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.

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.

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

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

Instructor: Alexander Stoytchev CprE 281: Digital Logic.

09 MUX Page 1 ECEn/CS 224 Multiplexers Decoders ROMs (LUTs)

ECE/CS 352 Digital System Fundamentals© T. Kaminski & C. Kime 1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 3 -Part 2 Tom Kaminski & Charles.

SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 4 -Part 1.

Tables Learning Support

Computer Organization CSC 405 Decoders and Multiplexers.

3.13 How many output lines will a five-input decoder have?

CSE 140 Lecture 13 Combinational Standard Modules Professor CK Cheng CSE Dept. UC San Diego 1.

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

Gunjeet kaur Dronacharya Group of Institutions. Demultiplexers.

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.

FIGURE 3.1 Two-variable K-map

ECE 3130 Digital Electronics and Design

Instructor: Alexander Stoytchev

Logic Gates Benchmark Companies Inc PO Box Aurora CO

Biconditional - 2 CS-708.

Multiplexers and Demultiplexers,

Computer Organization and Design Transistors & Logic - II

Digital Logic Design 1st Exam Solution

Boolean Expressions Lecture No. 10.

Circuits & Boolean Expressions

Methods for Evaluating Validity

EEL 3705 / 3705L Digital Logic Design

Reading: ‘Washington, DC’

3 times tables.

6 times tables.

2-2 Logic Part 2 Truth Tables.

Circuits & Boolean Expressions

SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.

Presentation transcript:

Multiplexers

Functional Description and Symbols

Where, N = {1, 2, 3, ….., ∞}

Where, N = {1, 2, 3, ….., ∞}

Where, N = {1, 2, 3, ….., ∞}

Where, n = 2 (m+1) – 1 m = {0,1, 2, 3, ….., ∞}

Operation of a 2-to-1 line Mux

Operation of a 4-to-1 line Mux

Operation of a Multiplexer Tree

Implementing Functions Using Multiplexers

Multiplexer Universality for Logic Realization f(a, b, c) = a’b’c + ab Implementation directly from truth tables

Multiplexer Universality for Logic Realization f(a, b, c) = a’b’c + abfor ( a, b ) = ( 0, 0 )  f = c for ( a, b ) = ( 0, 1 )  f = 0 for ( a, b ) = ( 1, 0 )  f = 0 for ( a, b ) = ( 1, 1 )  f = 1 Implementation directly from truth tables

Multiplexer Universality for Logic Realization f(a, b, c) = a’b’c + abfor a == 0  f = b’. c for a == 1  f = ( b. c’ ) + ( b. c ) = b Implementation directly from truth tables