Decoders and Multiplexers Prof. Sin-Min Lee Department of Computer Science San Jose State University.

Slides:



Advertisements
Similar presentations
Digital Design: Combinational Logic Blocks
Advertisements

Logical Design.
Functions and Functional Blocks
111 Basic Circuit Elements n Standard TTL Small-Scale Integration: 1 chip = 2-8 gates n Requires numerous chips to build interesting circuits n Alternative:
Decoders/DeMUXs CS370 – Spring Decoder: single data input, n control inputs, 2 outputs control inputs (called select S) represent Binary index of.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 1 Combinational Circuit – MSI Circuit ENCODER With the aid of K-map (don’t care situation), we can get D 0 =
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
OTHER COMBINATIONAL LOGIC CIRCUITS
EE2174: Digital Logic and Lab
ECE 301 – Digital Electronics Multiplexers and Demultiplexers (Lecture #12)
Multiplexer MUX. 2 Multiplexer Multiplexer (Selector)  2 n data inputs,  n control inputs,  1 output  Used to connect 2 n points to a single point.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Combinational Circuits Chapter 3 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 2003.
Outline Analysis of Combinational Circuits Signed Number Arithmetic
Combinational and Sequential Logic Circuits.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Combinational Circuit – Arithmetic Circuit
ECE 3130 – Digital Electronics and Design
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
The Digital Logic Level
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
ROM & PLA Digital Logic And Computer Design
1 Lecture 9 Demultiplexers Programmable Logic Devices  Programmable logic array (PLA)  Programmable array logic (PAL)
Digital Logic Problems (II) Prof. Sin-Min Lee Department of Mathematics and Computer Science.
Digital Electronics Lecture 6 Combinational Logic Circuit Design.
Digital Electronics and Computer Interfacing
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
Computer Science 101 Circuit Design - Examples. Sum of Products Algorithm Identify each row of the output that has a 1. Identify each row of the output.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
T,JK-flip-flop, Midterm 1 Revision Decoders and Multiplexers Prof. Sin-Min Lee Department of Computer Science San Jose State University.
1 CSE370, Lecture 10 Lecture 10 u Logistics n HW3 due Friday (cover materials up to this lecture) n Lab3 going on this week n Midterm 1: a week from today.
Hamming Code,Decoders and D,T-flip flops Prof. Sin-Min Lee Department of Computer Science.
Magnitude Comparator A magnitude comparator is a combinational circuit that compares two numbers, A and B, and then determines their relative magnitudes.
Chapter # 4: Programmable Logic
Multiplexors Decoders  Decoders are used for forming separate signals for different combination of input signals.  The multiplexer circuit is a digital.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Multiplexers.
Digital Design Module 2 Decoder Amit Kumar AP SCSE, GU Greater Noida.
1 DLD Lecture 16 More Multiplexers, Encoders and Decoders.
Multiplexers & Decoders By: Jason Pitts CS 147 Spring 2010.
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Chapter 36 Combinational Logic Circuits. Objectives After completing this chapter, you will be able to: –Describe the functions of encoders, decoders,
Lecture No. 18 Combinational Functional Devices. Recap Decoder Decoder –3-to-8 Decoder –Cascading of Decoders 4-to-16 decoder –Implementing SOP & POS.
MSI Circuits.
ECE 3130 Digital Electronics and Design
ECE 3130 Digital Electronics and Design
Prof. Sin-Min Lee Department of Computer Science
CS221: Digital Logic Design Combinational Circuits 3
Combinational Functions and Circuits
Combinational Circuit Design
Lecture 9 Logistics Last lecture Today HW3 due Wednesday
Combinational Logic Circuits
Lecture 4: Combinational Functions and Circuits
Magnitude Comparator A magnitude comparator is a combinational circuit that compares two numbers, A and B, and then determines their relative magnitudes.
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
Lecture 8 Logistics Last lecture Last last lecture Today
Programmable Configurations
COE 202: Digital Logic Design Combinational Circuits Part 3
Lecture 10 Logistics Last lecture Today
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
Digital Logic.
Overview Last lecture Timing; Hazards/glitches
XOR Function Logic Symbol  Description  Truth Table 
Digital System Design Combinational Logic
Presentation transcript:

Decoders and Multiplexers Prof. Sin-Min Lee Department of Computer Science San Jose State University

Decoders A combinational circuit that converts binary info from n inputs into a max. of 2 n unique objects. N - to - m decoders: given n inputs, it outputs m <= 2 n minterms. Note the ``3'' with a slash, which signifies a three bit input. This notation represents three (1-bit) wires. A decoder with n input bits, produces 2^n output bits.

Combinational circuit implementation using Decoders We can use decoders to express Boolean functions. Any Boolean function can be expressed as a sum of products(minterms). So, we can use decoders to produce the minterms and OR gates to produce their logical sum.

Design a digital circuit which compares the magnitude of two 2-bit numbers and. It has one output f 1 such that f 1 =1 if and only if X > Y. Step 1: Derive the truth table that describes the relation between f 1 and the inputs x 1, x 2, y 1, and y 2, where x 1 and y 1 each denotes the most significant bit of X and Y respectively. Comparator

Example: expressing full adder with decoder We have 3 inputs. So, we use the 3-to-8 decoder to generate the minterms. Then we OR 1, 2, 4, 7 and 3,5,6,7 according to the Boolean equations: –S(X,Y,Z) = Sm(1,2,4,7) –C(X,Y,Z) = Sm(3,5,6,7)

Step 2: Now use the 4-variable K-map to derive the minimal sum of product (SOP) expression for f 1.

Implementation using MUXs: Now we implement the output f 1 using an 8x1MUX. Selection inputs to the MUX are x 2 y 1 y 2 (that is, if x 2 y 1 y 2 =001, input I 1 of the MUX is selected). The implementation table is tabulated as

Implementation using decoders: Now we implement the output f 1 using an decoder and 3-input OR gates.

Decoders A B C O7 O6 O5 O4 O3 O2 O1 O A B C O0 O1 O2 O3 O4 O5 O6 O7 Inputs Outputs

Multiplexers 2**n data inputs, n control input, one data output Data inputs selected by control are gated are gated to output Each AND gate gets 3 control and one data input, selects input based on control OR gate adds all selected inputs

Majority Function using a Multiplxer Each input wired to 1 or 0 If 0 in table ground Else connect to Vcc. Check if it works!

Other Users of Multiplexers Parallel to Serial Conversion Put 8 bit data in input lines Step through 000 to 111 in control lines to select inputs serially Used in serializing device inputs such as key board inputs over telephone lines Inverse operation: Demultiplexing routes single serial input into multiple outputs depending on value of control lines

Decoders Selects one of 2**n inputs Each AND gate implements one Boolean expression ABC etc.

Comparators 4 address words, A, B compared. Output (A =B) Users XOR gates: 1 iff both inputs are same

Programmable Logic Arrays (PLA) Used to form Sums of products Select inputs by burning out fuses Example has 12 inputs, 6 outputs, PWR and GND

PGA Computing Majority function Can burn appropriate fuses to fabricate Majority function from a PGA. Choose –3 inputs, 4 AND gates and 1 OR gate –Burn appropriate fuses Which one is best for Majority: –SSI with 4 gates –1 MSI multiplexer –PLA: more efficient