Logic Gates Combinational Circuits

Slides:



Advertisements
Similar presentations
Functions of Combinational Logic
Advertisements

Logical Design.
Combinational Circuits
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
Number Bases Informatics INFO I101 February 9, 2004 John C. Paolillo, Instructor.
Design of Arithmetic Circuits – Adders, Subtractors, BCD adders
Digital Fundamentals Floyd Chapter 6 Tenth Edition
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.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Digital Fundamentals with PLD Programming Floyd Chapter 8
Adders, subtractors, ALUs
©2008 The McGraw-Hill Companies, Inc. All rights reserved. Digital Electronics Principles & Applications Seventh Edition Chapter 10 Arithmetic Circuits.
CS 105 Digital Logic Design
Chapter 4 Gates and Circuits.
Combinational Logic Design
Logical Circuit Design Week 8: Arithmetic Circuits Mentor Hamiti, MSc Office ,
Chap 3. Chap 3. Combinational Logic Design. Chap Combinational Circuits l logic circuits for digital systems: combinational vs sequential l Combinational.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Combinational Circuit – Arithmetic Circuit
+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.
Digital Arithmetic and Arithmetic Circuits
MSI Devices M. Mano & C. Kime: Logic and Computer Design Fundamentals (Chapter 5) Dr. Costas Kyriacou and Dr. Konstantinos Tatas ACOE161 - Digital Logic.
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
Functions of Combinational Logic
Fall 2004EE 3563 Digital Systems Design EE 3563 Comparators  Comparators determine if two binary inputs are equal  Some will signal greater than/less.
Documentation Standards Circuit specification. –Description of what the system is supposed to do, including a description of all inputs and outputs and.
Combinational Logic By Taweesak Reungpeerakul
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Adders, subtractors, ALUs.
Digital Logic Design Week 3
Combinational Design, Part 3: Functional Blocks
CHAPTER 4 Combinational Logic
Logic Gates Logic gates are electronic digital circuit perform logic functions. Commonly expected logic functions are already having the corresponding.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
ES 244: Digital Logic Design Chapter 4 Chapter 4: Combinational Logic Uchechukwu Ofoegbu Temple University.
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
CS 105 DIGITAL LOGIC DESIGN Chapter 4 Combinational Logic 1.
Logic Gates Informatics INFO I101 February 3, 2003 John C. Paolillo, Instructor.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
1 Chapter 4 Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables,
Logic Gates. A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment,
CHAPTER 2 Digital Combinational Logic/Arithmetic Circuits
Complex Combinational Circuits Binary Adders Key to enterprise: Addition table also a truth table S i = C i 'A i B i ' + C i 'A i 'B i + C i A i 'B i '+
MSI Combinational logic circuits
1 Ethics of Computing MONT 113G, Spring 2012 Session 4 Binary Addition.
ECE DIGITAL LOGIC LECTURE 15: COMBINATIONAL CIRCUITS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 10/20/2015.
ECE 3110: Introduction to Digital Systems Chapter 5 Combinational Logic Design Practices Adders,subtractors, ALUs.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
WORKING PRINCIPLE OF DIGITAL LOGIC
Explain Half Adder and Full Adder with Truth Table.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.
ACOE161 (Spring2007)MSI Devices1 Revision on MSI Devices M. Mano & C. Kime: Logic and Computer Design Fundamentals (Chapter 5)
Chap 3. Combinational Logic Design
Combinational Circuit Design
Combinational Logic Circuits
Digital Fundamentals Floyd Chapter 6 Tenth Edition
Principles & Applications
FUNCTION OF COMBINATIONAL LOGIC CIRCUIT
Chapter 6 Functions of Combinational Logic
HALF ADDER FULL ADDER Half Subtractor.
Chapter-4 Combinational Logic
Electronics for Physicists
XOR Function Logic Symbol  Description  Truth Table 
LOGIC Circuits.
Adder and Subtractors Discussion D4.1. Adder and Subtractor Circuits Objective: (i) To construct half and full adder circuit and verify its working (ii)
Arithmetic Circuits.
Half & Full Subtractor Half Subtractor Full Subtractor.
Half & Full Subtractor Half Subtractor Full Subtractor.
Unit IV Adders Subtractors Flip Flops Counters Multiplexes and De multiplexes. Integrated circuits-Op. amp – Characteristics Inverting amplifier - Non-inverting.
Presentation transcript:

Logic Gates Combinational Circuits

Logic Gates A logic gate is an elementary building block of a digital circuit. Most logic gates have two input and one output. At any given moment, every terminal is in one of the two binary conditions low (0) or high (1), represented by different voltage levels. There are seven basic logic gates: AND, OR, XOR, NOT, NAND, NOR, and XNOR. 0 is called "false" and 1 is called "true,”

AND Gate The output is "true" when both inputs are "true." Otherwise, the output is "false."   Input 1 Input 2 Output 0   0 1

OR Gate The OR gate gets its name from the fact that it behaves after the fashion of the logical inclusive "or." The output is "true" if either or both of the inputs are "true." If both inputs are "false," then the output is "false.“ Input 1 Input 2 Output  0 0  1

XOR Gate The XOR ( exclusive-OR ) gate acts in the same way as the logical "either/or." The output is "true" if either, but not both, of the inputs are "true." The output is "false" if both inputs are "false" or if both inputs are "true." Input 1 Input 2 Output  0 0  1

NOT Gate logical inverter , sometimes called a NOT gate to differentiate it from other types of electronic inverter devices, has only one input. It reverses the logic state. Input Output 1  0

NAND Gate The NAND gate operates as an AND gate followed by a NOT gate. It acts in the manner of the logical operation "and" followed by negation. The output is "false" if both inputs are "true." Otherwise, the output is "true." Input 1 Input 2 Output  0 1 0 

NOR Gate The NOR gate is a combination OR gate followed by an inverter. Its output is "true" if both inputs are "false." Otherwise, the output is "false." Input 1 Input 2 Output  0 0  1

XNOR Gate The XNOR (exclusive-NOR) gate is a combination XOR gate followed by an inverter. Its output is "true" if the inputs are the same, and"false" if the inputs are different Input 1 Input 2 Output  0 0  1

Combinational Circuits Combinational circuit is circuit in which we combine the different gates in the circuit for example encoder, decoder, multiplexer and demultiplexer. Some of the characteristics of combinational circuits are following. The output of combinational circuit at any instant of time, depends only on the levels present at input terminals. The combinational circuit do not use any memory. The previous state of input does not have any effect on the present state of the circuit. A combinational circuit can have a n number of inputs and m number of outputs.

Using combinations of logic gates, complex operations can be performed Using combinations of logic gates, complex operations can be performed. In theory, there is no limit to the number of gates that can be arrayed together in a single device. But in practice, there is a limit to the number of gates that can be packed into a given physical space. Arrays of logic gates are found in digital integrated circuits (ICs). As IC technology advances, the required physical volume for each individual logic gate decreases and digital devices of the same or smaller size become capable of performing ever-more-complicated operations at ever-increasing speeds.

Block Diagram

Half Adder Half adder is a combinational logic circuit with two input and two output. The half adder circuit is designed to add two single bit binary number A and B. It is the basic building block for addition of two single bit numbers. This circuit has two outputs carry and sum.

Half Adder

Full adder is developed to overcome the drawback of Half Adder circuit Full adder is developed to overcome the drawback of Half Adder circuit. It can add two one-bit numbers A and B, and carry c. The full adder is a three input and two output combinational circuit.

Full Adder

N-Bit Parallel Adder The Full Adder is capable of adding only two single digit binary number along with a carry input. But in practical we need to add binary numbers which are much longer than just one bit. To add two n-bit binary numbers we need to use the n-bit parallel adder. It uses a number of full adders in cascade. The carry output of the previous full adder is connected to carry input of the next full adder.

4 Bit Parallel Adder In the block diagram, A0 and B0 represent the LSB of the four bit words A and B. Hence Full Adder-0 is the lowest stage. Hence its Cin has been permanently made 0. The rest of the connections are exactly same as those of n-bit parallel adder is shown in fig. The four bit parallel adder is a very common logic circuit.

Half Subtractors Half subtractor is a combination circuit with two inputs and two outputs (difference and borrow). It produces the difference between the two binary bits at the input and also produces a output (Borrow) to indicate if a 1 has been borrowed. In the subtraction (A-B), A is called as Minuend bit and B is called as Subtrahend bit. Corrections to be done in images

Full Subtractors The full subtractor is a combinational circuit with three inputs A,B,C and two output D and C'. A is the minuend, B is subtrahend, C is the borrow produced by the previous stage, D is the difference output and C' is the borrow output. The disadvantage of half subtractor about not considering the borrow of previous stage is overcome by full subtractor.

Full Subtractors

N-Bit Parallel Subtractor The subtraction can be carried out by taking the 1's or 2's complement of the number to be subtracted. For example we can perform the subtraction (A-B) by adding either 1's or 2's complement of B to A. That means we can use a binary adder to perform the binary subtraction.

4 Bit Parallel Subtractor The number to be subtracted (B) is first passed through inverters to obtain its 1's complement The 4-bit adder then adds A and 2's complement of B to produce the subtraction. S3 S2 S1 S0 represent the result of binary subtraction (A-B) and carry output Cout represents the polarity of the result. If A > B then Cout =0 and the result is in the binary form (A-B) AND if A<B then Cout = 1 and the result is in the 2's complement form.

4 Bit Parallel SUBTRACTOR

Multiplexers It has n-data inputs, one output and m select inputs with 2m = n & is called n:1 multiplexer It is a digital circuit which selects one of the n data inputs and routes it to the output. Depending on the digital code applied at the selected inputs, one out of n data sources is selected and transmitted to the single output Y. E is called the strobe or enable input which is useful for the cascading and will perform the required operation only when it is low. For 10 data inputs to be multiplexed no. of select lines and type of multiplexer required will be……..

Multiplexers A 2:1 multiplexer block diagram and realization

Demultiplexers A demultiplexer performs the reverse operation of a multiplexer i.e. it receives one input and distributes it over one of the outputs. It has only one input, n outputs, m select input. At a time only one output line is selected by the select lines and the input is transmitted to the selected output line. Always 2m>n for a 1:n demultiplexer

Demultiplexers A 2:1 demultiplexer block diagram and truth table

Decoder A decoder is a combinational circuit having n input and to a maximum m = 2n outputs. i.e m (output count) > n (input count) Decoder is identical to a demultiplexer without any data input where select lines behave as a n inputs. It performs operations which are exactly opposite to those of an encoder.

2 to 4 Line Decoder A and B are the two inputs where D through D are the four outputs. From Truth table it appears that each output is 1 for only a specific combination of inputs & all other outputs being zero

2 to 4 Line Decoder Logic circuit

Encoder It performs the inverse operation of the decoder An encoder has n number of input lines and m number of output lines. ( An encoder produces an m bit binary code corresponding to the digital input number. The encoder accepts an n input digital word and converts it into an m bit another digital word Examples of Encoders are following. Priority encoders Decimal to BCD encoder Octal to binary encoder Hexadecimal to binary encoder

Priority Encoder Here priority is given to the input lines. If two or more input lines are 1 at the same time, then the input line with highest priority will be considered. There are four input D0, D1, D2, D3 and two output Y0, Y1. Out of the four input D3 has the highest priority and D0 has the lowest priority. That means if D3 = 1 then Y1 Y0 = 11 irrespective of the other inputs. Similarly if D3 = 0 and D2= 1 then Y1 Y0 = 10 irrespective of the other inputs.

Priority Encoder

Priority Encoder Y1= D3 + D2 Y0 = D3 + D1 ! D2