Morgan Kaufmann Publishers

Slides:



Advertisements
Similar presentations
Give qualifications of instructors: DAP
Advertisements

Princess Sumaya University
Combinational Circuits
Functions and Functional Blocks
Decoders. Usage of Decoders Channel Selection: Generates Mutually Exclusive Channel Enabling/Disabling Signals (e.g. Multiplexers) Device Selection: Generates.
Decoders/DeMUXs CS370 – Spring Decoder: single data input, n control inputs, 2 outputs control inputs (called select S) represent Binary index of.
التصميم المنطقي Second Course
Overview Part 2 – Combinational Logic
COE 202: Digital Logic Design Combinational Circuits Part 3 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office: Ahmad Almulhem, KFUPM.
CS 151 Digital Systems Design Lecture 17 Encoders and Decoders
Combinational Logic Building Blocks
OTHER COMBINATIONAL LOGIC CIRCUITS
DIGITAL SYSTEMS TCE OTHER COMBINATIONAL LOGIC CIRCUITS DECODERS ENCODERS.
Digital Logic Design Lecture 19. Announcements Homework 6 due Thursday 11/6 Recitation quiz on Monday, 11/10 – Will cover material from lectures 18,19,20.
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.
CS 105 Digital Logic Design
Combinational Circuits
Combinational Circuits
Combinational Logic Chapter 4.
Top-down modular design
Combinational Circuits Chapter 3 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 2003.
Combinational Logic Design
Overview of Chapter 4 °Design digital circuit from specification °Digital inputs and outputs known Need to determine logic that can transform data °Start.
Combinational and Sequential Logic Circuits.
Decoders.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Combinational Circuit – Arithmetic Circuit
Combinational Circuits
Logic Design A Review. Binary numbers Binary numbers to decimal  Binary 2 decimal  Decimal 2 binary.
CS2100 Computer Organisation MSI Components (AY2015/6 Semester 1)
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
WEEK #9 FUNCTIONS OF COMBINATIONAL LOGIC (DECODERS & MUX EXPANSION)
1 Lecture #7 EGR 277 – Digital Logic Reading Assignment: Chapter 4 in Digital Design, 3 rd Edition by Mano Chapter 4 – Combinational Logic Circuits A)
Logical Circuit Design Week 6,7: Logic Design of Combinational Circuits Mentor Hamiti, MSc Office ,
Kuliah Rangkaian Digital Kuliah 6: Blok Pembangun Logika Kombinasional Teknik Komputer Universitas Gunadarma.
Morgan Kaufmann Publishers
COE 202: Digital Logic Design Combinational Circuits Part 3
Multiplexers. Outline  Larger Multiplexers  Standard MSI Multiplexer  Implementing Functions with Multiplexers  Implementing Functions with Smaller.
CS 105 DIGITAL LOGIC DESIGN Chapter 4 Combinational Logic 1.
Chap 2. Combinational Logic Circuits
Combinational Circuits by Dr. Amin Danial Asham. References  Digital Design 5 th Edition, Morris Mano.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 7 Dr. Shi Dept. of Electrical and Computer Engineering.
Chapter Four Combinational Logic 1. Discrete quantities of information are represented in digital systems by binary codes. A binary code of n bits is.
1 Chapter 4 Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables,
Chapter Four Combinational Logic 1. C OMBINATIONAL C IRCUITS It consists of input variables, logic gates and output variables. Output is function of input.
Chapter 3: Combinational Functions and Circuits 3-5 to 3-7: Decoders
DIGITAL LOGIC DESIGN & COMPUTER ARCHTECTURE
Module 11.  In Module 9, we have been introduced to the concept of combinational logic circuits through the examples of binary adders.  Meanwhile, in.
CS151 Introduction to Digital Design Chapter 3: Combinational Logic Design 3-5 Combinational Functional Blocks 3-6 Rudimentary Logic Functions 3-7 Decoding.
MSI Combinational logic circuits
Digital Design Module 2 Decoder Amit Kumar AP SCSE, GU Greater Noida.
1 DLD Lecture 16 More Multiplexers, Encoders and Decoders.
Decoders Zhijian John Wang. What are they? Overview of a decoder A device that reverses the process of an encoder Convert information from one format.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
UNIT 9 MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES
MSI Circuits.
Combinational Circuits: MSI Components
CS221: Digital Logic Design Combinational Circuits 3
Combinational Functions and Circuits
Lecture 4: Combinational Functions and Circuits
NAND-ONLY LOGIC CIRCUITS
FIGURE 4.1 Block diagram of combinational circuit
COE 202: Digital Logic Design Combinational Circuits Part 3
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
CSC 220: Computer Organization COMBINATIONAL CIRCUITS-2
Logic Circuits I Lecture 3.
Digital System Design Combinational Logic
Presentation transcript:

Morgan Kaufmann Publishers 20 April, 2017 Decoders Chapter 4 — The Processor

Outline Useful MSI circuits Decoders Implementing Functions with Decoders Decoders with Enable Larger Decoders Standard MSI Decoders

Outline Useful MSI circuits Decoders Implementing Functions with Decoders Decoders with Enable Larger Decoders Standard MSI Decoders

Useful MSI circuits Four common and useful MSI circuits are: Decoder Encoder Demultiplexer Multiplexer Block-level outlines of MSI circuits: encoder code entity decoder code entity mux data input select demux data output select

Outline Useful MSI circuits Decoders Implementing Functions with Decoders Decoders with Enable Larger Decoders Standard MSI Decoders

Decoders (1/5) Codes are frequently used to represent entities, e.g. your name is a code to denote yourself (an entity!). These codes can be identified (or decoded) using a decoder. Given a code, identify the entity. Convert binary information from n input lines to (max. of) 2n output lines. Known as n-to-m-line decoder, or simply n:m or nm decoder (m  2n). May be used to generate 2n (or fewer) minterms of n input variables.

Decoders (2/5) Example: if codes 00, 01, 10, 11 are used to identify four light bulbs, we may use a 2-bit decoder: 2x4 Dec 2-bit code X Y F0 F1 F2 F3 Bulb 0 Bulb 1 Bulb 2 Bulb 3 This is a 24 decoder which selects an output line based on the 2-bit code supplied. Truth table:

Decoders (3/5) From truth table, circuit for 24 decoder is: Note: Each output is a 2-variable minterm (X'.Y', X'.Y, X.Y' or X.Y) F0 = X'.Y' F1 = X'.Y F2 = X.Y' F3 = X.Y X Y

Decoders (4/5) Design a 38 decoder. Application? F1 = x'.y'.z x z y F0 = x'.y'.z' F2 = x'.y.z' F3 = x'.y.z F5 = x.y'.z F4 = x.y'.z' F6 = x.y.z' F7 = x.y.z Application? Binary-to-octal conversion.

Decoders (5/5) In general, for an n-bit code, a decoder could select up to 2n lines: : n-bit code n to 2n decoder up to 2n output lines

Outline Useful MSI circuits Decoders Implementing Functions with Decoders Decoders with Enable Larger Decoders Standard MSI Decoders

Decoders: Implementing Functions (1/5) A Boolean function, in sum-of-minterms form a decoder to generate the minterms, and an OR gate to form the sum. Any combinational circuit with n inputs and m outputs can be implemented with an n:2n decoder with m OR gates. Good when circuit has many outputs, and each function is expressed with few minterms.

Decoders: Implementing Functions (2/5) Example: Full adder S(x, y, z) = S m(1,2,4,7) C(x, y, z) = S m(3,5,6,7) 3x8 Dec S2 S1 S0 x y z 1 2 3 4 5 6 7 S C

Decoders: Implementing Functions (3/5) 3x8 Dec S2 S1 S0 x y z 1 2 3 4 5 6 7 S C 1

Decoders: Implementing Functions (4/5) 3x8 Dec S2 S1 S0 x y z 1 2 3 4 5 6 7 S C 1 1 1

Decoders: Implementing Functions (5/5) 3x8 Dec S2 S1 S0 x y z 1 2 3 4 5 6 7 S C 1 1 1

Outline Useful MSI circuits Decoders Implementing Functions with Decoders Decoders with Enable Larger Decoders Standard MSI Decoders

Decoders with Enable (1/2) Decoders often come with an enable signal, so that the device is only activated when the enable, E=1. Truth table: X Y F0 = EX'Y' F1 = EX'Y F2 = EXY' F3 = EXY E Circuit:

Decoders with Enable (2/2) In the previous slide, the decoder has a one-enable signal, that is, the decoder is enabled with E=1. In most MSI decoders, enable signal is zero-enable, usually denoted by E’ (or E). The decoder is enabled when the signal is zero. Decoder with 1-enable Decoder with 0-enable

Outline Useful MSI circuits Decoders Implementing Functions with Decoders Decoders with Enable Larger Decoders Standard MSI Decoders

Larger Decoders (1/6) 3x8 Dec S2 S1 S0 w x y 1 : 7 F0 = w'x'y' F1 = w'x'y F7 = wxy Larger decoders can be constructed from smaller ones. For example, a 3-to-8 decoder can be constructed from two 2-to-4 decoders (with one-enable), as follows: 2x4 Dec S1 S0 1 2 3 F0 = w'x'y' F1 = w'x'y F2 = w'xy' F3 = w'xy E F4 = wx'y' F5 = wx'y F6 = wxy' F7 = wxy w x y

Larger Decoders (2/6) 1 1 = enabled 0 = disabled 3x8 Dec S2 S1 S0 w x y 1 : 7 F0 = w'x'y' F1 = w'x'y F7 = wxy 2x4 Dec S1 S0 1 2 3 F0 = w'x'y' F1 = w'x'y F2 = w'xy' F3 = w'xy E F4 = wx'y' F5 = wx'y F6 = wxy' F7 = wxy w x y 1 0 = disabled 1 = enabled

Larger Decoders (3/6) 1 1 1 = enabled 0 = disabled 3x8 Dec S2 S1 S0 w y 1 : 7 F0 = w'x'y' F1 = w'x'y F7 = wxy 2x4 Dec S1 S0 1 2 3 F0 = w'x'y' F1 = w'x'y F2 = w'xy' F3 = w'xy E F4 = wx'y' F5 = wx'y F6 = wxy' F7 = wxy w x y 1 1 0 = disabled 1 = enabled

Larger Decoders (4/6) 1 0 = disabled 1 1 = enabled 3x8 Dec S2 S1 S0 w y 1 : 7 F0 = w'x'y' F1 = w'x'y F7 = wxy 2x4 Dec S1 S0 1 2 3 F0 = w'x'y' F1 = w'x'y F2 = w'xy' F3 = w'xy E F4 = wx'y' F5 = wx'y F6 = wxy' F7 = wxy w x y 1 1 = enabled 0 = disabled 1

Larger Decoders (5/6) 4x16 Dec S3 S2 S1 S0 w x y z 1 : 15 F0 F1 F15 Construct a 4x16 decoder from two 3x8 decoders with 1-enable. 3x8 Dec S2 S1 S0 1 : 7 F0 F1 F7 E F8 F9 F15 w x y z

Larger Decoders (6/6) Note: The input, w and its complement, w', is used to select either one of the two smaller decoders. Decoders may also have zero-enable and/or negated outputs. (Normal outputs = active high; negated outputs = active low.) Exercise: What modifications must be made to provide an ENABLE input for the 3x8 decoder (2 slides ago) and the 4x16 decoder (previous slide) created? How to construct a 4x16 decoder using five 2x4 decoders with enable?

Outline Useful MSI circuits Decoders Implementing Functions with Decoders Decoders with Enable Larger Decoders Standard MSI Decoders

Standard MSI Decoders (1/2) 74138 (3-to-8 decoder) 74138 decoder module. (a) Logic circuit. (b) Package pin configuration.

Standard MSI Decoders (2/2) Negated outputs 74138 decoder module. (c) Function table. 74138 decoder module. (d) Generic symbol. (e) IEEE standard logic symbol. Source: The Data Book Volume 2, Texas Instruments Inc.,1985

Outline Useful MSI circuits Decoders Implementing Functions with Decoders Decoders with Enable Larger Decoders Standard MSI Decoders

Decoders: Implementing Functions Revisit (1/2) Example: Implement the following logic function using decoders and logic gates f(Q,X,P) =  m(0,1,4,6,7) =  M(2,3,5) We may implement the function in several ways: (a) Use a decoder (with active-high outputs) with an OR gate: f(Q,X,P) = m0 + m1 + m4 + m6 + m7 (b) Use a decoder (with active-low outputs) with a NAND gate: f(Q,X,P) = ( m0' . m1' . m4' . m6' . m7' )' (c) Use a decoder (with active-high outputs) with a NOR gate: f(Q,X,P) = ( m2 + m3 + m5 )' [ = M2.M3.M5] (d) Use a decoder (with active-low outputs) with an AND gate: f(Q,X,P) = m2' . m3' . m5'

Decoders: Implementing Functions Revisit (2/2) f(Q,X,P) =  m(0,1,4,6,7) 3x8 Dec A B C Q X P 1 2 3 4 5 6 7 f(Q,X,P) 3x8 Dec A B C Q X P 1 2 3 4 5 6 7 f(Q,X,P) (a) Active-high decoder with OR gate. (b) Active-low decoder with NAND gate. 3x8 Dec A B C Q X P 1 2 3 4 5 6 7 f(Q,X,P) 3x8 Dec A B C Q X P 1 2 3 4 5 6 7 f(Q,X,P) (c) Active-high decoder with NOR gate. (d) Active-low decoder with AND gate.