COMBINATIONAL LOGIC CIRCUITS. Dr. Mudathir A. Fagiri

Similar documents
ENGIN 112 Intro to Electrical and Computer Engineering

Chapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.

ELCT201: DIGITAL LOGIC DESIGN

CSE 140 Lecture 11 Standard Combinational Modules. CK Cheng and Diba Mirza CSE Dept. UC San Diego

Chapter 4: Combinational Logic Solutions to Problems: [1, 5, 9, 12, 19, 23, 30, 33]

COMBINATIONAL LOGIC FUNCTIONS

Logic. Combinational. inputs. outputs. the result. system can

Combinational Logic. By : Ali Mustafa

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

Systems I: Computer Organization and Architecture

Digital Logic Design ENEE x. Lecture 14

Combinational Logic. Jee-Hwan Ryu. School of Mechanical Engineering Korea University of Technology and Education

MODULAR CIRCUITS CHAPTER 7

Digital System Design Combinational Logic. Assoc. Prof. Pradondet Nilagupta

Chapter 3 Combinational Logic Design

CHAPTER1: Digital Logic Circuits Combination Circuits

ECE 545 Digital System Design with VHDL Lecture 1A. Digital Logic Refresher Part A Combinational Logic Building Blocks

DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS. To design and implement encoders and decoders using logic gates.

Function of Combinational Logic ENT263

Combinational Logic. Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C.

Combinational Logic. Mantıksal Tasarım BBM231. section instructor: Ufuk Çelikcan

Chapter 3 Ctd: Combinational Functions and Circuits

PG - TRB UNIT-X- DIGITAL ELECTRONICS. POLYTECHNIC-TRB MATERIALS

CSEE 3827: Fundamentals of Computer Systems. Combinational Circuits

ECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks

Chapter 2 (Lect 2) Canonical and Standard Forms. Standard Form. Other Logic Operators Logic Gates. Sum of Minterms Product of Maxterms

211: Computer Architecture Summer 2016

Combinational Logic. Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C.

Combinational Logic Design Combinational Functions and Circuits

UNIT III Design of Combinational Logic Circuits. Department of Computer Science SRM UNIVERSITY

ECE 2300 Digital Logic & Computer Organization

Fundamentals of Digital Design

COMBINATIONAL CIRCUITS

3. Combinational Circuit Design

CHAPTER VI COMBINATIONAL LOGIC BUILDING BLOCKS

Section 3: Combinational Logic Design. Department of Electrical Engineering, University of Waterloo. Combinational Logic

IT T35 Digital system desigm y - ii /s - iii

Sample Test Paper - I

Slides for Lecture 19

Class Website:

ว ตถ ประสงค ของบทเร ยน

Review for Test 1 : Ch1 5

Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS

Chapter 4: Designing Combinational Systems Uchechukwu Ofoegbu

A B OUT_0 OUT_1 OUT_2 OUT_

Logic and Computer Design Fundamentals. Chapter 8 Sequencing and Control

Computer Science. 19. Combinational Circuits. Computer Science COMPUTER SCIENCE. Section 6.1.

UNIT II COMBINATIONAL CIRCUITS:

CMSC 313 Lecture 18 Midterm Exam returned Assign Homework 3 Circuits for Addition Digital Logic Components Programmable Logic Arrays

Boolean Algebra, Gates and Circuits

Combina-onal Logic Chapter 4. Topics. Combina-on Circuit 10/13/10. EECE 256 Dr. Sidney Fels Steven Oldridge

COE 202: Digital Logic Design Combinational Circuits Part 4. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:

CHAPTER VI COMBINATIONAL LOGIC BUILDING BLOCKS

Experiment 4 Decoder Encoder Design using VHDL

DIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute

CSE140: Components and Design Techniques for Digital Systems. Decoders, adders, comparators, multipliers and other ALU elements. Tajana Simunic Rosing

Digital Electronics Circuits 2017

Why digital? Overview. Number Systems. Binary to Decimal conversion

Appendix B. Review of Digital Logic. Baback Izadi Division of Engineering Programs

UNIVERSITI TENAGA NASIONAL. College of Information Technology

SIR C.R.REDDY COLLEGE OF ENGINEERING ELURU DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER

Review: Additional Boolean operations

CSC9R6 Computer Design. Practical Digital Logic

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

MODEL ANSWER SUMMER 17 EXAMINATION Subject Title: Principles of Digital Techniques

Unit 3 Session - 9 Data-Processing Circuits

9/29/2016. Task: Checking for a Lower-Case Letter. ECE 120: Introduction to Computing. Change C 5 to C 5 to Obtain L(C) from U(C)

Software Engineering 2DA4. Slides 8: Multiplexors and More

DIGITAL LOGIC CIRCUITS

CprE 281: Digital Logic

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3

LOGIC CIRCUITS. Basic Experiment and Design of Electronics

University of Toronto Faculty of Applied Science and Engineering Final Examination

Lecture 2 Review on Digital Logic (Part 1)

of Digital Electronics

KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE


Digital Logic Design. Midterm #2

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

BOOLEAN ALGEBRA. Introduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra

Combinatorial Logic Design Principles

ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES

Save from: cs. Logic design 1 st Class أستاذ المادة: د. عماد

Week No. 06: Numbering Systems

CSE 140L Spring 2010 Lab 1 Assignment Due beginning of the class on 14 th April

ECE 341. Lecture # 3

UNIT 4 MINTERM AND MAXTERM EXPANSIONS

DE58/DC58 LOGIC DESIGN DEC 2014

Chapter 3 Combinational Logic Design

Every time has a value associated with it, not just some times. A variable can take on any value within a range

Combinational Logic. Course Instructor Mohammed Abdul kader

Cs302 Quiz for MID TERM Exam Solved

LOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.

XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

Total Time = 90 Minutes, Total Marks = 100. Total /10 /25 /20 /10 /15 /20

Computer Science Final Examination Friday December 14 th 2001

SAU1A FUNDAMENTALS OF DIGITAL COMPUTERS

( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function

CprE 281: Digital Logic

CHAPTER 7. Exercises 17/ / /2 2 0

Transcription:

COMBINATIONAL LOGIC CIRCUITS Dr. Mudathir A. Fagiri

Standard Combinational Modules Decoder: Decode address Encoder: Encode address Multiplexer (Mux): Select data by address Demultiplexier (DeMux): Direct data by address Shifter: Shift bit location Adder: Add two binary numbers Multiplier: Multiply two binary numbers

DECODERS & ENCODERS

Overview Binary Decoders Converts an n-bit code to a single active output Can be developed using AND/OR gates Can be used to implement logic circuits. Binary Encoders Converts one of 2n inputs to an n-bit output Useful for compressing data Can be developed using AND/OR gates Both encoders and decoders are extensively used in digital systems

Binary Decoder A decoder is a logic circuit that accepts a set of inputs that represents a binary number and activates only the output that corresponds to the input number. In other words, a decoder circuit looks at its inputs, determines which binary number is present there, and activates the one output that corresponds to that number ; all other outputs remain inactive

Binary Decoder In its general form, a decoder has N input lines to handle N bits and form one to 2 N output lines to indicate the presence of one or more N-bit combinations. The basic binary function An AND gate can be used as the basic decoding element because it produces a HIGH output only when all inputs are HIGH

Binary Decoder Black box with n input lines and 2 n output lines Only one output is a 1 for any given input n inputs Binary Decoder 2 n outputs

2-to-4 Binary Decoder Truth Table: X Y F 0 F 1 F 2 F 3 0 0 1 0 0 0 0 1 0 1 0 0 1 0 0 0 1 0 1 1 0 0 0 1 From truth table, circuit for 2x4 decoder is: Note: Each output is a 2-variable minterm (X'Y', X'Y, XY' or XY) F 0 = X'Y' F 1 = X'Y F 2 = XY' F 3 = XY X Y 2-to-4 Decoder F0 F1 F2 F3 X Y

3-to-8 Binary Decoder Truth Table: x y z F 0 F 1 F 2 F 3 F 4 F 5 F 6 F 7 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 1 0 0 1 1 0 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 0 0 1 F 0 = x'y'z' F 1 = x'y'z F 2 = x'yz' F 3 = x'yz F 4 = xy'z' F 5 = xy'z F0 F 6 = xyz' X Y Z 3-to-8 Decoder F1 F2 F3 F4 F5 F 7 = xyz F6 F7 x y z

Implementing Functions Using Decoders Any n-variable logic function can be implemented using a single n-to-2 n decoder to generate the minterms OR gate forms the sum. The output lines of the decoder corresponding to the minterms of the function are used as inputs to the OR gate. Any combinational circuit with n inputs and m outputs can be implemented with an n-to-2 n decoder with m OR gates. Suitable when a circuit has many outputs, and each output function is expressed with few minterms.

Implementing Functions Using Decoders Example: Full adder S(x, y, z) = S (1,2,4,7) C(x, y, z) = S (3,5,6,7) x y z C S 0 0 0 0 0 0 0 1 0 1 0 1 0 0 1 0 1 1 1 0 1 0 0 0 1 1 0 1 1 0 1 1 0 1 0 1 1 1 1 1 x 3-to-8 Decoder S 2 0 1 2 3 S y z S 1 S 0 4 5 6 7 C

Standard MSI Binary Decoders Example 74138 (3-to-8 decoder) (a) Logic circuit. (b) Package pin configuration. (c) Function table.

Building a Binary Decoder with NAND Gates Start with a 2-bit decoder Add an enable signal (E) Note: use of NANDs if E = 0 only one 0 active!

Use two 3 to 8 decoders to make 4 to 16 decoder Enable can also be active high In this example, only one decoder can be active at a time. x, y, z effectively select output line for w

Binary Encoder An encoder is a combinational logic circuit that essentially performs a reverse of decoder functions. An encoder accepts an active level on one of its inputs, representing digit, such as a decimal or octal digits, and converts it to a coded output such as BCD or binary. Encoders can also be devised to encode various symbols and alphabetic characters. The process of converting from familiar symbols or numbers to a coded format is called encoding.

Binary Encoder Most decoders accept an input code and produce a HIGH ( or a LOW) at one and only one output line. In other worlds, a decoder identifies, recognizes, or detects a particular code. The opposite of this decoding process is called encoding and is performed by a logic circuit called an encoder. An encoder has a number of input lines, only one of which input is activated at a given time and produces an N-bit output code,depending on which input is activated.

Encoders If the a decoder's output code has fewer bits than the input code, the device is usually called an encoder. e.g. 2 n -to-n The simplest encoder is a 2 n -to-n binary encoder One of 2 n inputs = 1 Output is an n-bit binary number 2 n inputs... Binary encoder... n outputs

8-to-3 Binary Encoder At any one time, only one input line has a value of 1. I 0 I 1 Inputs Outputs I 0 I 1 I 2 I 3 I 4 I 5 I 6 I 7 y 2 y 1 y 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 1 1 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 1 0 1 0 0 0 0 0 0 1 0 1 1 0 0 0 0 0 0 0 0 1 1 1 1 y 2 = I 4 + I 5 + I 6 + I 7 I 2 I 3 y 1 = I 2 + I 3 + I 6 + I 7 I 4 I 5 I 6 I 7 y 0 = I 1 + I 3 + I 5 + I 7

8-to-3 Priority Encoder What if more than one input line has a value of 1? Ignore lower priority inputs. Idle indicates that no input is a 1. Note that polarity of Idle is opposite from Table 4-8 in Mano Inputs Outputs I 0 I 1 I 2 I 3 I 4 I 5 I 6 I 7 y 2 y 1 y 0 Idle 0 0 0 0 0 0 0 0 x x x 1 1 0 0 0 0 0 0 0 0 0 0 0 X 1 0 0 0 0 0 0 0 0 1 0 X X 1 0 0 0 0 0 0 1 0 0 X X X 1 0 0 0 0 0 1 1 0 X X X X 1 0 0 0 1 0 0 0 X X X X X 1 0 0 1 0 1 0 X X X X X X 1 0 1 1 0 0 X X X X X X X 1 1 1 1 0

Priority Encoder (8 to 3 encoder) Assign priorities to the inputs When more than one input are asserted, the output generates the code of the input with the highest priority Priority Encoder : H7=I7 (Highest Priority) H6=I6.I7 H5=I5.I6.I7 H4=I4.I5.I6.I7 H3=I3.I4.I5.I6.I7 H2=I2.I3.I4.I5.I6.I7 I0 H1=I1. I2.I3.I4.I5.I6.I7 H0=I0.I1. I2.I3.I4.I5.I6.I7 I1 IDLE= I0.I1. I2.I3.I4.I5.I6.I7 Encoder Y0 = I1 + I3 + I5 + I7 Y1 = I2 + I3 + I6 + I7 Y2 = I4 + I5 + I6 + I7 I2 I3 I4 I5 I6 I7 Priority Circuit I0 I1 I2 I3 I4 I5 I6 I7 H0 H1 H2 H3 H4 H5 H6 H7 IDLE Priority encoder Binary encoder I0 I1 I2 I3 I4 I5 I6 I7 Y0 Y1 Y2 Y0 Y1 Y2 IDLE

Encoder Application (Monitoring Unit) Encoder identifies the requester and encodes the value Controller accepts digital inputs. Alarm Signal Contoller Response Machine 1 Machine 2 Encoder Machine Code Controller Action Machine n

Summary Decoder allows for generation of a single binary output from an input binary code For an n-input binary decoder there are 2 n outputs Decoders are widely used in storage devices (e.g. memories) Encoders all for data compression Priority encoders rank inputs and encode the highest priority input