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

Similar documents
COMBINATIONAL LOGIC FUNCTIONS

Experiment 7: Magnitude comparators

DE58/DC58 LOGIC DESIGN DEC 2014

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

ENGIN 112 Intro to Electrical and Computer Engineering

CprE 281: Digital Logic

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

Combinational Logic. By : Ali Mustafa

ELCT201: DIGITAL LOGIC DESIGN

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

Looking at a two binary digit sum shows what we need to extend addition to multiple binary digits.

COMBINATIONAL LOGIC CIRCUITS. Dr. Mudathir A. Fagiri

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

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

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

Computer Science Final Examination Friday December 14 th 2001

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

Systems I: Computer Organization and Architecture

Z = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table

Unit 3 Session - 9 Data-Processing Circuits

5 Binary to Gray and Gray to Binary converters:

Lecture 2 Review on Digital Logic (Part 1)

CprE 281: Digital Logic

Chapter 3 Ctd: Combinational Functions and Circuits

Chapter 3 Combinational Logic Design

Combinational Digital Design. Laboratory Manual. Experiment #6. Simplification using Karnaugh Map

Mealy & Moore Machines

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

ENGIN 112 Intro to Electrical and Computer Engineering

211: Computer Architecture Summer 2016

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

Digital Logic Design ENEE x. Lecture 14

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

MODULAR CIRCUITS CHAPTER 7

ECE 2300 Digital Logic & Computer Organization

COMBINATIONAL CIRCUITS

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

Part 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...

Experiment 4 Decoder Encoder Design using VHDL

CMSC 313 Lecture 19 Homework 4 Questions Combinational Logic Components Programmable Logic Arrays Introduction to Circuit Simplification

Week No. 06: Numbering Systems

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

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

Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University

CSCI 220: Computer Architecture-I Instructor: Pranava K. Jha. BCD Codes

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

Logic Design Combinational Circuits. Digital Computer Design

Function of Combinational Logic ENT263

Sample Test Paper - I

Final Exam. ECE 25, Spring 2008 Thursday, June 12, Problem Points Score Total 90

Reg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering

Acknowledgment. DLD Lab. This set of slides on VHDL are due to Brown and Vranesic.

15.1 Elimination of Redundant States

Philadelphia University Student Name: Student Number:

DEPARTMENT OF ECE Faculty of Engineering and Technology, SRM University 15EC203J DIGITAL SYSTEMS LAB

Fundamentals of Computer Systems

A B OUT_0 OUT_1 OUT_2 OUT_

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

Chapter 3 Combinational Logic Design

CHAPTER VI COMBINATIONAL LOGIC BUILDING BLOCKS

We are here. Assembly Language. Processors Arithmetic Logic Units. Finite State Machines. Circuits Gates. Transistors

Digital Electronics Circuits 2017

CHAPTER 7. Exercises 17/ / /2 2 0

CHAPTER 7. Solutions for Exercises

Slides for Lecture 19

University of Toronto Faculty of Applied Science and Engineering Final Examination

3. Combinational Circuit Design

Floating Point Representation and Digital Logic. Lecture 11 CS301

ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES

CIRCUITS AND ELECTRONICS. The Digital Abstraction

CprE 281: Digital Logic

Combinational Logic Design Combinational Functions and Circuits

Fundamentals of Digital Design

Section 1A. Introduction & Basic Principles. Engineering Areas

Chapter 4 (Lect 4) Encoders Multiplexers Three-State Gates More Verilog

CHAPTER1: Digital Logic Circuits Combination Circuits

CprE 281: Digital Logic

UNIT II COMBINATIONAL CIRCUITS:

University of Florida EEL 3701 Fall 2014 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Wednesday, 15 October 2014

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

Signals and Systems Digital Logic System

Numbers & Arithmetic. Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University. See: P&H Chapter , 3.2, C.5 C.

1 Boolean Algebra Simplification

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

EGC221: Digital Logic Lab

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

Logic Simplification. Boolean Simplification Example. Applying Boolean Identities F = A B C + A B C + A BC + ABC. Karnaugh Maps 2/10/2009 COMP370 1

CMSC 313 Lecture 19 Combinational Logic Components Programmable Logic Arrays Karnaugh Maps

Minimization techniques

CARLETON UNIVERSITY. Deparment of Electronics ELEC 2607 Switching Circuits January 19, Overview;

Binary addition example worked out

XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

Karnaugh Map & Boolean Expression Simplification

Philadelphia University Student Name: Student Number:

CSEE 3827: Fundamentals of Computer Systems. Combinational Circuits

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

EECE 202 (Network I) & EECE 208 (Lab)

COSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)

Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS

CPE100: Digital Logic Design I

Transcription:

DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS AIM To design and implement encoders and decoders using logic gates. COMPONENTS REQUIRED S.No Components Specification Quantity 1. Digital IC Trainer Kit - 1 2. 3 I/P AND Gate IC 7411 3 3. OR Gate IC 7432 3 4. NOT Gate IC 7404 1 5. AND Gate IC 7408 2 6. Connecting Wires - As required THEORY Encoder An Encoder is a digital circuit which has 2 n inputs and n output lines. In encoder the output lines generate the binary code corresponding to the input value. In octal to Binary encoder, it has eight inputs, one for each octal digit and three output that generate the corresponding binary code. In encoder, it is assumed that only one input has a value of one at a given time otherwise the circuit is meaningless. It has an ambiguity that when all inputs are zero the outputs are zero. The zero outputs can also be generated when = 1. Decoder A decoder is a kind of combinational circuit that has multiple inputs and multiple output s, and used for conversion of coded inputs into the coded outputs. The bits in the input code are generally less than the bits that are present in the output code. A decoder basically decodes an input code. For example, if a binary code of n bits is provided to the decoder, then the decoder may tell that which code is this from the possible 2 n codes. PROCEDURE: Connections are given as per the circuit diagram. Logical inputs are given as per the truth table. Observe the outputs and verify the truth table. JJCET/EEE-LDIC LAB 4. 1

4:2 PRIORITY ENCODER A 4 to 2 priority encoder has four inputs,, & two outputs Y1 & Y0. Here, the input, has the highest priority, whereas the input, has the lowest priority. In this case, even if more than one input is 1 at the same time, the output will be the (binary) code corresponding to the input, which is having higher priority. We considered one more output, V in order to know, whether the code available at outputs is valid or not. If at least one input of the encoder is 1, then the code available at outputs is a valid one. In this case, the output, V will be equal to 1. If all the inputs of encoder are 0, then the code available at outputs is not a valid one. In this case, the output, V will be equal to 0. Block Diagram of 4:2 Priority Encoder Y0 Data 4:2 ENCODER Y1 Data Truth Table D 3 D 2 D 1 D 0 Y 1 Y 0 V 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 X 0 1 1 0 1 X X 1 0 1 0 X X X 1 1 1 Circuit Diagram JJCET/EEE-LDIC LAB 4. 2

8:3 PRIORITY ENCODER (OCTAL TO BINARY ENCODER) An octal to binary encoder consists of eight input lines and three output lines. Each input line corresponds to each octal digit and three outputs generate corresponding binary code. In encoders, it is to be assumed that only one input is active or has a value 1 at any given time otherwise the circuit has no meaning. From the truth table, the output Y2 becomes 1 if any of the digits D4 or D5 or D6 or D7 is one. Thus, we can write its expression as Y2 = D4 + D5 + D6 + D7 Similarly, Y1 = + + D6 + D7 Y0 = + + D5 + D7 Also it is to be observed that does not exist in any of the expressions so it is considered as don t care. From the above expressions, we can implement the octal to binary encoder using set of OR gates. Block Diagram of 8:3 Encoder B0 INPUTS D4 8:3 ENCODER B1 OUTPUT S D5 D6 B2 D7 JJCET/EEE-LDIC LAB 4. 3

Truth Table D4 D5 D6 D7 B0 B1 B2 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 0 0 0 1 1 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 1 0 1 0 1 0 0 0 0 0 0 1 1 0 1 0 0 0 0 0 0 0 1 1 1 Circuit Diagram JJCET/EEE-LDIC LAB 4. 4

2:4 BINARY DECODER In a 2-to-4 binary decoder, two inputs are decoded into four outputs hence it consists of two input lines and 4 output lines. Only one output is active at any time while the other outputs are maintained at logic 0 and the output which is held active or high is determined the two binary inputs A and B. Block Diagram of 2:4 Decoder A INPUTS 2:4 DECODER OUTPUTS B Truth Table A B D 0 D 1 D 2 D 3 0 0 0 0 0 0 0 1 0 1 0 0 1 0 0 0 1 0 1 1 0 0 0 1 Circuit Diagram JJCET/EEE-LDIC LAB 4. 5

3:8 DECODER In a 3-to-8 decoder, three inputs are decoded into eight outputs. It has three inputs as A, B, and C and eight output from through D7. Based on the combinations of the three inputs, only one of the eight outputs is selected. Block Diagram of 3:8 Decoder A INPUTS B 3:8 DECODER OUTPUTS D4 C D5 D6 D7 Truth Table A B C D4 D5 D6 D7 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 JJCET/EEE-LDIC LAB 4. 6

Circuit Diagram Result Thus the Encoders and Decoders were implemented using logic gates and their truth tables were verified. JJCET/EEE-LDIC LAB 4. 7