Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 09 MULTIPLEXERS

Similar documents
EXPERIMENT #8: BINARY ARITHMETIC OPERATIONS

COMBINATIONAL LOGIC CIRCUITS

Overview. Multiplexor. cs281: Introduction to Computer Systems Lab02 Basic Combinational Circuits: The Mux and the Adder

1. Boolean algebra. [6] 2. Constructing a circuit. [4] 3. Number representation [4] 4. Adders [4] 5. ALU [2] 6. Software [4]

A3 A2 A1 A0 Sum4 Sum3 Sum2 Sum1 Sum

Chapter 4. Combinational Logic

Experiment 7 Arithmetic Circuits Design and Implementation


Content beyond Syllabus. Parity checker and generator

A B A+B

DIGITAL CIRCUIT LOGIC UNIT 9: MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES

LAB #3: ADDERS and COMPARATORS using 3 types of Verilog Modeling

BUILDING BLOCKS OF A BASIC MICROPROCESSOR. Part 1 PowerPoint Format of Lecture 3 of Book

UNIT 6 CIRCUIT DESIGN

ECE 152A LABORATORY 2

structure syntax different levels of abstraction

Here is a list of lecture objectives. They are provided for you to reflect on what you are supposed to learn, rather than an introduction to this

QUESTION BANK FOR TEST

Experiment 9: Binary Arithmetic Circuits. In-Lab Procedure and Report (30 points)

Area Efficient, Low Power Array Multiplier for Signed and Unsigned Number. Chapter 3

Lecture #21 March 31, 2004 Introduction to Gates and Circuits

Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 04. Boolean Expression Simplification and Implementation

CS140 Lecture 03: The Machinery of Computation: Combinational Logic

DLD VIDYA SAGAR P. potharajuvidyasagar.wordpress.com. Vignana Bharathi Institute of Technology UNIT 3 DLD P VIDYA SAGAR

A3 A2 A1 A0 Sum4 Sum3 Sum2 Sum1 Sum

Laboratory Exercise 1

Experiment 8 Introduction to VHDL

Boolean Logic CS.352.F12

EECS150, Fall 2004, Midterm 1, Prof. Culler. Problem 1 (15 points) 1.a. Circle the gate-level circuits that DO NOT implement a Boolean AND function.

CENG 241 Digital Design 1

CSE303 Logic Design II Laboratory 01

R10. II B. Tech I Semester, Supplementary Examinations, May

Combinational Logic. Prof. Wangrok Oh. Dept. of Information Communications Eng. Chungnam National University. Prof. Wangrok Oh(CNU) 1 / 93

4. Write a sum-of-products representation of the following circuit. Y = (A + B + C) (A + B + C)

Department of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic

Lecture 21: Combinational Circuits. Integrated Circuits. Integrated Circuits, cont. Integrated Circuits Combinational Circuits

cs281: Introduction to Computer Systems Lab03 K-Map Simplification for an LED-based Circuit Decimal Input LED Result LED3 LED2 LED1 LED3 LED2 1, 2

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-II COMBINATIONAL CIRCUITS

EMT1250 LABORATORY EXPERIMENT. EXPERIMENT # 10: Implementing Binary Adders. Name: Date:

UNIT- V COMBINATIONAL LOGIC DESIGN

CARLETON UNIVERSITY. Laboratory 2.0

LAB #1 BASIC DIGITAL CIRCUIT

60-265: Winter ANSWERS Exercise 4 Combinational Circuit Design

Combinational Logic Circuits

Microcontroller Systems. ELET 3232 Topic 11: General Memory Interfacing

PART 1. Simplification Using Boolean Algebra

CHAPTER 9 MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES

Digital Logic Design Exercises. Assignment 1

NAND. Grade (10) Instructor. Logic Design 1 / 13

IA Digital Electronics - Supervision I

Chapter 4: Combinational Logic

CSC 101: Lab #5 Boolean Logic Practice Due Date: 5:00pm, day after lab session

10EC33: DIGITAL ELECTRONICS QUESTION BANK

Computer Organization and Levels of Abstraction

Henry Lin, Department of Electrical and Computer Engineering, California State University, Bakersfield Lecture 7 (Digital Logic) July 24 th, 2012

Fundamentals of Computer Systems

Combinational Logic II

Chapter 2 Basic Logic Circuits and VHDL Description

To design a 4-bit ALU To experimentally check the operation of the ALU

Experiment # 5 Debugging via Simulation using epd

1 Discussion. 2 Pre-Lab

ECE 2030D Computer Engineering Spring problems, 5 pages Exam Two 8 March 2012

Experiment 3: Logic Simplification

One and a half hours. Section A is COMPULSORY UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE

UNIT-III REGISTER TRANSFER LANGUAGE AND DESIGN OF CONTROL UNIT

Design of Digital Circuits ( L) ETH Zürich, Spring 2017

Student Number: UTORid: Question 0. [1 mark] Read and follow all instructions on this page, and fill in all fields.

EX4 DIGITAL ELECTRONICS After completing the task and studying Unit 1.6, students will be able to: (check all that apply):

Digital Circuits. Page 1 of 5. I. Before coming to lab. II. Learning Objectives. III. Materials

Chapter 6 Combinational-Circuit Building Blocks

ENEE245 Digital Circuits and Systems Lab Manual

DE Solution Set QP Code : 00904

VLSI for Multi-Technology Systems (Spring 2003)

CSE370 TUTORIAL 3 - INTRODUCTION TO USING VERILOG IN ACTIVE-HDL

EECS 150 Homework 7 Solutions Fall (a) 4.3 The functions for the 7 segment display decoder given in Section 4.3 are:

CS 261 Fall Mike Lam, Professor. Combinational Circuits

ENEE245 Digital Circuits and Systems Lab Manual

GC03 Boolean Algebra

CMPE 413/ CMSC 711. Project Specification: 16 bit 2 s complement Adder and 8 bit 2 s complement multiplier. GND. Input bus. Latches I[8]-I[15]

EKT 422/4 COMPUTER ARCHITECTURE. MINI PROJECT : Design of an Arithmetic Logic Unit

Programmable Logic Devices (PLDs)

Digital Fundamentals. Lab 6 2 s Complement / Digital Calculator

Jan Rabaey Homework # 7 Solutions EECS141

Chapter 4. Combinational Logic. Dr. Abu-Arqoub

Chap-2 Boolean Algebra

University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering

Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates. Invitation to Computer Science, C++ Version, Third Edition

Digital Design with FPGAs. By Neeraj Kulkarni

Lab 16: Data Busses, Tri-State Outputs and Memory

This podcast will demonstrate a logical approach as to how a computer adds through logical gates.

CPLD Experiment 4. XOR and XNOR Gates with Applications

Finite State Machine Lab

Propositional Calculus. Math Foundations of Computer Science

FPGA for Complex System Implementation. National Chiao Tung University Chun-Jen Tsai 04/14/2011

Combinational Circuits

Introduction to Computer Engineering (E114)

Logic Gates and Boolean Algebra ENT263

Combinational Digital Design. Laboratory Manual. Experiment #3. Boolean Algebra Continued

UC Berkeley College of Engineering, EECS Department CS61C: Combinational Logic Blocks

UC Berkeley College of Engineering, EECS Department CS61C: Combinational Logic Blocks

Transcription:

Name: Instructor: Engr. Date Performed: Marks Obtained: /10 Group Members (ID):. Checked By: Date: Experiment # 09 MULTIPLEXERS OBJECTIVES: To experimentally verify the proper operation of a multiplexer. To use multiplexer for the implementation of logic functions. To understand the benefits of using multiplexer for logic realizations Required Components and Equipment: 74151 A. data selector/multiplexer Digital Electronics Trainer Bread Board Connecting Wires Multiplexer: A multiplexer (MUX) is a device that allows digital information from several sources to be routed onto a single line for a transmission over that line to common destination. The basic multiplexer has several input data lines and a single output line. It also has "data select inputs" which permit digital data on any one of the inputs to be switched to the output line. Multiplexer are also called Data selectors. The figure below shows a 2 X 1 Multiplexer and a 4 X 1 Multiplexer. Depending on whether S is zero or one, a 2 X 1 Multiplexer chooses A as the output or B as the output respectively. Similarly, depending on the combined value on S1 and S0, the 4 X 1 multiplexer chooses which among the inputs A, B, C, and D is chosen to be passed to the output.

2 X 1 Multiplexer 4 X 1 Multiplexer 74LS151 is an 8 line-to-1 line multiplexer. It has the schematic representation as shown below. Selection lines S2, S1 and S0 select the particular input to be multiplexed and applied to the output. Strobe S acts as an enable signal. If strobe =1, the chip 74151 is disabled and output y = 0. If strobe = 0 then the chip 74151 is enabled and functions as a multiplexer. The multiplex function of 74151 in terms of select lines is shown in the table below. Functioning of a multiplexer is illustrated in Fig. 9.1 using its block diagram and a graphic representation of the conceptual interpretation of what the outputs of a multiplexer, in effect, correspond to. The multiplexer shown in Fig. 9.1 would be called an 8 to 1 multiplexer as it, in effect, connects its single output pin ( Y ) with one of the eight input pins (Do D7). Which input pin gets connected with the output pin is decided by the logic values combination on the select pins (So, S1, S2). Multiplexers are so designed that if the binary number formed by the combination of values at the select pins is e.g., n, then the input pin Dn gets connected to the output pin, making (Y=Dn) 9.1 Block Diagram of a Multiplexer with explanation of its Functioning

74LS151 is an 8 line-to-1 line multiplexer. It has the schematic representation as shown below. Selection lines S2, S1 and S0 select the particular input to be multiplexed and applied to the output. Strobe S acts as an enable signal. If strobe =1, the chip 74151 is disabled and output y = 0. If strobe = 0 then the chip 74151 is enabled and functions as a multiplexer. The multiplex function of 74151 in terms of select lines is shown in the table below. PROCEDURE: Make all the connections for 74LS151 Verify its operation as a multiplexer by applying all input combinations. Record the results in table. Mention the output in terms of input line, not the level. Truth Table Inputs Outputs S2 S1 S0 Z Z 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1

COMBINATIONAL LOGIC DESIGN WITH MULTIPLEXERS: The function of multiplexer as explained using Fig. 9.1 provides a simple alternative method of implementing any logic function using a multiplexer with as many data pins as the number of rows in the truth table of the function to be implemented. As illustrated in Fig. 9.2; Strobe Select Lines Output S S2 S1 S0 Y 1 X X X 0 0 0 0 0 D0 0 0 0 1 D1 0 0 1 0 D2 0 0 1 1 D3 0 1 0 0 D4 0 1 0 1 D5 0 1 1 0 D6 0 1 1 1 D7 All we need to do is to connect all the entries of the output column of the logic function s truth table to all the data pins of the multiplexer in the same order as the truth-table. Then, since the input variables represent the row number (in binary number system counting from zero from the top row), connecting these variables at the select pins of the multiplexer would always select the data pin connected to the output of the same row of the truth table, in which that input combination lie; hence completely implementing the logic function. Multiplexers, however provide an even smarter alternative using which a truth-table with 2n+1 rows, (i.e., an n+1 variables function) can implemented using a multiplexer with n data pins (i.e., an n-bit multiplexer). The only extra requirement in this case is the inverted value of some input variables. Any function can then be implemented as illustrated in Fig9.3. The same function of Fig. 9.2 has been implemented by using only two input variables A & B as select inputs while the third C, 0 and 1 as data inputs. Fig. 9.2: Implementation of a Boolean Logic Fig. 9.3: Smart Implementation of a Boolean Logic Function using Multiplexer Fig. 9.4

This becomes possible because, as illustrated in the truth table of the Figure 9.3, because any truth table can be simplified so as to contain lesser number of rows by becoming a lesser input columns truth-table, if the output column is expressed in terms of some input variable(s). Thus, e.g., an 8 row truth table, half of whose output vales being the same as the corresponding values of one input variable, say B and the other half values being the same as another input variable, say C, can be simplified into a truth table with only two rows with output entries B and C corresponding to the 0 and 1 value of the third input variable A. Student Exercise: A. Design a 4x1 multiplexer using logic gates. Write down the logic equation of the output. Draw the logic diagram using select lines S and data lines A-D. Implement the circuit on digital trainer. Fill in the results in table. Truth Table Logic Equation S1 S0 Output 0 0 0 1 1 0 1 1 Logic Diagram: B. Use the truth table of a full-adder to implement the sum and carry outputs with 8 X 1 multiplexers. How many 8 X 1 multiplexer ICs (74LS151) are required for this realization? Compare the count with that of the standard AND-OR-XOR realization. C. Implement 8 X 1 MUX in Verilog.