EKT 124 / 3 DIGITAL ELEKTRONIC 1

Slides:



Advertisements
Similar presentations
Exclusive-OR and Exclusive-NOR Gates
Advertisements

Functions of Combinational Logic
Logic Circuits Design presented by Amr Al-Awamry
5.4 Decoders A decoder is a multiple-input, multiple-output logic circuit that converts coded inputs into coded outputs, where the input and output codes.
Digital Logic Design Week 7 Encoders, Decoders, Multiplexers, Demuxes.
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
System Digital Encoder, Decoder, and Contoh Penerapanya.
CHAPTER 2 Digital Combinational Logic/Arithmetic Circuits.
Code Converters, Multiplexers and Demultiplexers
DIGITAL SYSTEMS TCE OTHER COMBINATIONAL LOGIC CIRCUITS WEEK 7 AND WEEK 8 (LECTURE 1 OF 3) COMPARATORS CODE CONVERTERS.
Digital Fundamentals Floyd Chapter 6 Tenth Edition
DIGITAL SYSTEMS TCE OTHER COMBINATIONAL LOGIC CIRCUITS DECODERS ENCODERS.
Chapter 3 Combinational Logic Design
Combinational Logic Design
Digital Fundamentals with PLD Programming Floyd Chapter 8
Boolean Algebra and Logic Simplification
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Decoders.
CS 151: Digital Design Chapter 3 3-8: Encoding. CS 151 Encoding Encoding - the opposite of decoding - the conversion of a maximum of 2 n input code to.
Fundamentals of IT UNIT-I OnlyforIPMCA. DIGITAL SIGNALS & LOGIC GATES Signals and data are classified as analog or digital. Analog refers to something.
Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
Functions of Combinational Logic
Combinational Logic By Taweesak Reungpeerakul
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
Course contents Chapter 1 - section 1.6 Chapter 2 - all sections Chapter – 4.7, and 4.12 Chapter , Chapter 6 - all sections.
Functions of Combinational Logic By Taweesak Reungpeerakul
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
Basic Digital Logic: NAND and NOR Gates Technician Series ©Paul Godin Last Update Dec 2014.
CS151 Introduction to Digital Design
Summary Half-Adder pp302Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry.
EKT 124 / 3 DIGITAL ELEKTRONIC 1
ECE 320 Homework #3 1. Simplify the Boolean function F using the don’t care conditions d, in both S.O.P. and P.O.S. form: a) F=A’B’D’+A’CD+A’BC d=A’BC’D+ACD+AB’D’
1 CS 151: Digital Design Chapter 3: Combinational Logic Design 3-1Design Procedure CS 151: Digital Design.
WEEK #11 FUNCTIONS OF COMBINATIONAL LOGIC (PART 4)
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Binary Numbers For digital systems, the.
Branch : IT Semester : 3 PREPARED BY:- Rajpurohit Shravansingh ( ) Patel Dipesh ( ) Shah Maulin( )
Company LOGO Edit your slogan here DKT 122/3 DIGITAL SYSTEM 1 WEEK #8 FUNCTIONS OF COMBINATIONAL LOGIC (ENCODER & DECODER, MUX & DEMUX)
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
Chapter 33 Basic Logic Gates. Objectives After completing this chapter, you will be able to: –Identify and explain the function of the basic logic gates.
Decoders A decoder is a logic circuit that detects the presence of a specific combination of bits at its input. Two simple decoders that detect the presence.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
Decoder Chapter 12 Subject: Digital System Year: 2009.
CHAPTER 2 Digital Combinational Logic/Arithmetic Circuits.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
DATA REPRESENTATION IN COMPUTER MEMORY.  Describe the coding system:  Sign and magnitude  1’s Complement and 2’s Complement  Binary Coded Decimal.
Chapter # 4: Programmable Logic
Combinational Logic Design&Analysis.
CHAPTER 1 : INTRODUCTION
Combinational Circuits
Logic Gates.
Digital Fundamentals Floyd Chapter 6 Tenth Edition
Basic Digital Logic Basic Gates
University of Gujrat Department of Computer Science
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Decoders.
FUNCTION OF COMBINATIONAL LOGIC CIRCUIT
Advanced Digital design
Chapter 6 Functions of Combinational Logic
Digital Electronics Ms. Deepa Mehta.
Digital Electronics & Logic Design
Digital Logic & Design Lecture 05
January 19 W’05 Yutao He 4532B Boelter Hall CSM51A/EEM16-Sec.1 W’05
Logic Gates.
Homework Reading Tokheim, Section 5-10, 7-4.
Chapter 1 Number System RGGP, Narwana.
13 Digital Logic Circuits.
DIGITAL ELECTRONICS B.SC FY
Table 1.1 Powers of Two.
Digital System Design Combinational Logic
Department of Electronics
Arithmetic Circuits.
Presentation transcript:

EKT 124 / 3 DIGITAL ELEKTRONIC 1 CHAPTER 2 Digital Combinational Logic/Arithmetic Circuits

Converter Comparator Decoder Encoder Code Converter

Comparator(1) Compares two binary strings (or binary words) to determine if they are exactly equal. Truth table for a comparator: A B A>B A=B A<B 1

Comparator (2) X0 X0 Y0 Y0 X0 X0 Y0 Y0 Notice that the output is HIGH whenever A and B are at the same level. Thus, XNOR gate can be used as a basic comparator

Comparator – Basic Operation Example – to compare 2 bit binary number Compare the 2 LSB (G1) and 2 MSB (G2) of the two number

Comparator – 4-bit comparator Logic symbol for a 4-bit comparator with inequality indication. Inequality checking If A3 = 1 and B3=0, A > B If A3 = 0 and B3=1, A < B If A3 = B3, examine lower bit Starting with highest bit order, MSB bit Highest order indication must take precedence. To design a comparator to evaluate two 4 bit number We need 4 X-NORs and one 4- input AND gates

Comparator – 8 bit comparator For 8 bit magnitude comparator We use two 4 bit ICs comparator.

Decoder - Intro Digital circuit that detect the presence of specific combination of bits (code) in the input, and indicate the presence of that code in its output. In digital electronics, a decoder can take the form of a multiple-input, multiple-output logic circuit that converts coded inputs into coded outputs, where the input and output codes are different. e.g. n-to-2n BCD decoders.

Decoder- Intro A decoder is a circuit that creates an output based on the binary states of a given input or it detect the presence of specific combination code

Decoder – Basic operation Let say we want to determine the presence of code bit 1001 We can use AND gate so that it can produce HIGH output by inverting all the 0s inputs If we use NAND gate – a LOW output will indicate the presence of the code 1001 What is the logic required to decode 1011 by producing HIGH output?

Decoder – 4 line to 16 line decoder with active-LOW outputs Bubble indicates active-LOW Dec Input Outputs A3A2A1A0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111

Decoder Example 3 – 8 Binary decoder with active-HIGH outputs

Decoder – logic circuit design Notice: active-HIGH outputs

Example - 7 segment decode BCD-to-7 segment decoder Input Output Example: 7 Segment Decoder A 7 segment decoder has 4-bit BCD input and the seven segment display code as its output. In minimizing the circuits for the segment outputs all non-decimal input combinations (1010, 1011, 1100,1101, 1110, 1111) are taken as don’t-cares (X) /Bl D C B A a b c d e f g 0 x x x x 0 0 0 0 0 0 0 1 0 0 0 0 1 1 1 1 1 1 0 1 0 0 0 1 0 1 1 0 0 0 0 1 0 0 1 0 1 1 0 1 1 0 1 1 0 0 1 1 1 1 1 1 0 0 1 1 0 1 0 0 0 1 1 0 0 1 1 1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1 0 1 1 1 1 1 1 0 1 1 1 1 1 1 0 0 0 0 1 1 0 0 0 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 0 1 1 1 1 0 1 0 0 0 0 1 1 0 1 1 1 0 1 1 0 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 0 1 1 1 1 1 0 1 1 0 0 1 0 1 1 1 1 1 1 0 0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 -- don’t care inputs --

Decoder – Example Application

Encoder Process of converting familiar symbols or number to a coded format Encoder converts information such as decimal number or an alphabetical character into some binary coded form. Encoder is usually used for: data representation data security data compression

Encoder: 8 TO 3 Binary encoder Compare with Floyd’s 10th ed Table 6 and Figure 38 pg 329 active-HIGH input Example: 8-to-3 Binary Encoder

Encoder Exercise Design a Decimal-to-BCD Encoder: Comes out with a truth table (input/output) From a truth table, get the equation for each output Draw a circuit for basic decimal-to-BCD encoder based on output equation. Note : Do not forgot to label LSB & MSB

Encoder – Decimal to BCD It has 10 inputs 0 – 9, it is 10 input and 4 output decoder Dec Digit A3 A2 A1 A0 1 2 3 4 5 6 7 8 9 Logic symbol for a decimal-to-BCD encoder.

Encoder – Decimal to BCD Bit A3 always high for decimal 8 and 9 Bit A2 always high for decimal 4,5,6 and 7 Bit A1 always high for decimal 2,3,6 and 7 Bit A0 always high for decimal 1,3,5,7 and 9 The circuit diagram for Dec to BCD

Code Converter Device that converts one type of binary representation to another. Example : BCD to binary and binary to Gray code. Binary code vs. Gray Code. To convert binary to Gray code or Gray code to binary, we use X-OR gates. How???

Example 1 – BCD to binary conversion Basic conversion The value or weight of each bit of BCD number representation for example 87 in BCD is 1000 0111 (87) BCD Bit BCD Weight MSB (64) 32 16 8 4 2 1 A0 A1 A2 A3 B0 10 B1 20 B2 40 B3 80

Example BCD representation Write binary representation of BCD decimal number 00100111 (27) 80 40 20 10 8 4 2 1 0 0 1 0 0 1 1 1 0000001 0000010 0000100 0010100 0011011 binary

Binary to Gray code and Gray code to binary Exclusive OR gate can be used for gray – binary conversion Gray code is numerical code used in computing in which consecutive integers are represented by binary numbers differing in only one digit.

Example Gray code to binary and binary to Gray code conversion