ECE - 1551 DIGITAL LOGIC LECTURE 15: COMBINATIONAL CIRCUITS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 10/20/2015.

Slides:



Advertisements
Similar presentations
Combinational Circuits
Advertisements

Combinational Circuits. Analysis Diagram Designing Combinational Circuits In general we have to do following steps: 1. Problem description 2. Input/output.
EET 1131 Unit 7 Arithmetic Operations and Circuits
Comparator.
التصميم المنطقي Second Course
Lab 10 : Arithmetic Systems : Adder System Layout: Slide #2 Slide #3 Slide #4 Slide #5 Arithmetic Overflow: 2’s Complement Conversions: 8 Bit Adder/Subtractor.
Arithmetic Functions and Circuits
DPSD This PPT Credits to : Ms. Elakya - AP / ECE.
Arithmetic Operations and Circuits
The Map Method Boolean expressions may be simplified by algebraic means as discussed in Previous lecture However, this procedure of minimization is awkward.
Parallel Adder Recap To add two n-bit numbers together, n full-adders should be cascaded. Each full-adder represents a column in the long addition. The.
Henry Hexmoor1 Chapter 5 Arithmetic Functions Arithmetic functions –Operate on binary vectors –Use the same subfunction in each bit position Can design.
ECE 331 – Digital System Design
CSE-221 Digital Logic Design (DLD)
King Fahd University of Petroleum and Minerals
Design of Arithmetic Circuits – Adders, Subtractors, BCD adders
ECE 301 – Digital Electronics
Chapter 7 Arithmetic Operations and Circuits Hexadecimal Arithmetic 4 binary bits represent a single hexadecimal digit Addition –Add the digits.
Arithmetic Operations and Circuits
©2008 The McGraw-Hill Companies, Inc. All rights reserved. Digital Electronics Principles & Applications Seventh Edition Chapter 10 Arithmetic Circuits.
CS 105 Digital Logic Design
Outline Analysis of Combinational Circuits Signed Number Arithmetic
Chapter 6 Digital Arithmetic: Operations and Circuits ECE 221 Intro
3-1 Chapter 3 - Arithmetic Principles of Computer Architecture by M. Murdocca and V. Heuring © 1999 M. Murdocca and V. Heuring Principles of Computer Architecture.
Logical Circuit Design Week 8: Arithmetic Circuits Mentor Hamiti, MSc Office ,
Basic Arithmetic (adding and subtracting)
+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.
Digital Arithmetic and Arithmetic Circuits
Introduction to Chapter 6  Digital circuits are frequently used for arithmetic operations  Fundamental arithmetic operations on binary numbers and digital.
IKI a-Combinatorial Components Bobby Nazief Semester-I The materials on these slides are adopted from those in CS231’s Lecture Notes.
Chapter 6-1 ALU, Adder and Subtractor
Week #5 Arithmetic Circuits
Basic Arithmetic (adding and subtracting)
1 © 2015 B. Wilkinson Modification date: January 1, 2015 Designing combinational circuits Logic circuits whose outputs are dependent upon the values placed.
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
CHAPTER 4 Combinational Logic
Logic Gates Logic gates are electronic digital circuit perform logic functions. Commonly expected logic functions are already having the corresponding.
1 Arithmetic Logic Unit ALU. 2 The Bus Concept 3 CPU Building Blocks  Registers (IR, PC, ACC)  Control Unit (CU)  Arithmetic Logic Unit (ALU)
EE2174: Digital Logic and Lab Professor Shiyan Hu Department of Electrical and Computer Engineering Michigan Technological University CHAPTER 8 Arithmetic.
Combinational Circuits
CS 105 DIGITAL LOGIC DESIGN Chapter 4 Combinational Logic 1.
Fuw-Yi Yang1 數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi.
Topics covered: Arithmetic CSE243: Introduction to Computer Architecture and Hardware/Software Interface.
Outline Binary Addition 2’s complement Binary Subtraction Half Adder
1 Chapter 4 Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables,
CSC 331: DIGITAL LOGIC DESIGN COURSE LECTURER: E. Y. BAAGYERE. CONTACT: LECTURE TIME: 15:40 – 17:45 hrs. VENUE: SP-LAB.
Addition and multiplication Arithmetic is the most basic thing you can do with a computer, but it’s not as easy as you might expect! These next few lectures.
1 Lecture 14 Binary Adders and Subtractors. 2 Overview °Addition and subtraction of binary data is fundamental Need to determine hardware implementation.
ECE DIGITAL LOGIC LECTURE 3: DIGITAL COMPUTER AND NUMBER SYSTEMS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 01/19/2016.
Number Representation (Part 2) Computer Architecture (Fall 2006)
ECE DIGITAL LOGIC LECTURE 4: BINARY CODES Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 01/26/2016.
CS151 Introduction to Digital Design Chapter 4: Arithmetic Functions and HDLs 4-1: Iterative Combinational Circuits 4-2: Binary Adders 1Created by: Ms.Amany.
President UniversityErwin SitompulDigital Systems 7/1 Lecture 7 Digital Systems Dr.-Ing. Erwin Sitompul President University
Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.
Fuw-Yi Yang1 數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi.
ETE 204 – Digital Electronics Combinational Logic Design Single-bit and Multiple-bit Adder Circuits [Lecture: 9] Instructor: Sajib Roy Lecturer, ETE,ULAB.
©2010 Cengage Learning SLIDES FOR CHAPTER 4 APPLICATIONS OF BOOLEAN ALGEBRA MINTERM AND MAXTERM EXPANSIONS Click the mouse to move to the next page. Use.
UNIT 4 APPLICATIONS OF BOOLEAN ALGEBRA MINTERM AND MAXTERM EXPANSIONS Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.
Number Systems. The position of each digit in a weighted number system is assigned a weight based on the base or radix of the system. The radix of decimal.
Addition and multiplication1 Arithmetic is the most basic thing you can do with a computer, but it’s not as easy as you might expect! These next few lectures.
Chapter 6. Digital Arithmetic: Operations and Circuits
Gunjeet Kaur Dronacharya Group of Institutions. Binary Adder-Subtractor A combinational circuit that performs the addition of two bits is called a half.
Prof. Sin-Min Lee Department of Computer Science
Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,
ECE 331 – Digital System Design
King Fahd University of Petroleum and Minerals
Ch 4. Combinational logic
Digital System Design Combinational Logic
Overview Part 1 – Design Procedure Part 2 – Combinational Logic
Presentation transcript:

ECE DIGITAL LOGIC LECTURE 15: COMBINATIONAL CIRCUITS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 10/20/2015

Recap  Design Modeling using VHDL  DataFlow Modeling  Structural Modeling  Behavioral Modeling.  Introduction to Arithmetic Circuits.  Half Adder  Full Adder

Binary Adder  A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers of more than 1 bit, f.g. addition of 2 four bit numbers.  A simple binary adder (Full Adder) is shown in the figure below.  Binary adder can be constructed by cascading full adders, with the output carry from each full adder connected to the input of next full adder in the chain.  Thus the addition on n-bit numbers requires a chain of n full adders.  Or a chain of one half adder and n-1 full adders.

Binary Ripple Carry Adder  The interconnection of four full adders circuits in a chain creates a four-bit Binary Ripple Carry Adder.  The augend bits of A and the addend bits of B are designated by subscript numbers from right to left, with subscript 0 denoting the least significant.  The S outputs generate the required sum, and the carries are connected in a chain trough the full adders. The input carry to the adder is C0, and it ripples trough the full adders to the output carry C4.

Binary Ripple Carry Adder contd.  To demonstrate with a specific example, consider the two binary numbers A = 1011and B = Their sum S = 1110 is formed with the four-bit adder as follows:  The bits are added with full adders, starting from the least significant position (subscript 0), to form the sum bit and carry bit.  It is important to note that the design of this circuit by the classical method would require a truth table with 2^9 = 512 entries, since there are nine inputs to the circuit.

Carry Propagation  The addition of two binary numbers in parallel implies that all the bits of the augend and the addend are available for computation at the same time.  The total propagation time is equal to the propagation delay of a typical gate, time the number of gate levels in the circuit. The longest propagation delay time in an adder is the time it takes the carry to propagate trough the full adders.  The carry propagation time is an important attribute of the adder because it limits the speed with which two numbers are added.  One solution for reducing the carry propagation delay time is to employ faster gates with reduced delays. However, physical circuits have a limit to their capability.  Another solution is to increase the complexity of the circuit in such a way that the carry delay time is reduced.  There are several techniques for reducing the carry propagation time in a parallel adder. The most widely used is called a Carry Lookahead Logic.

Carry Propagation  If we define two new binary variables G and P. (Carry Generate and Carry Propagate)  the output sum and carry can respectively be expressed as

Carry Propagation Boolean functions for the carry outputs of each stage and substitute the value of each Ci from the previous equations:

Carry Lookahead Adder Logic Diagram of Carry Lookahead Generator Four-bit adder with carry lookahead

Binary Subtraction  Binary subtraction using complements.  subtraction A - B can be done by taking the 2’s complement of B and adding it to A.  The 2’s complement can be obtained by taking the 1’s complement and adding 1 to the least significant pair of bits.  The 1’s complement can be implemented with inverters, and a 1 can be added to the sum through the input carry.

Overflow for Signed and Unsigned numbers  The detection of an overflow after the addition of two binary numbers depends on whether the numbers are considered to be signed or unsigned.  In the case of signed numbers, two details are important: the leftmost bit always represents the sign and negative numbers are in 2’s complement form.  When two signed numbers are added, the sign bit is treated as part of the number and the end carry does not indicate an overflow.  To see how this can happen, consider the following example: Two signed binary numbers, +70 and +80, are stored in two eight-bit registers. The range of numbers that each register can accommodate is from binary +127 to binary Since the sum of the two numbers is +150, it exceeds the capacity of an eight- bit register. This is also true for -70 and -80. The two additions in binary are shown next, together with the last two carries:

Overflow contd.  An Overflow condition can be detected by observing the carry into the sign bit position and the carry put of the sign bit position. If these two carries are not equal, an overflow has occurred.  If the two binary numbers are considered to be unsinged, then the C bit detects a carry after addition or a borrow after subtraction. If the numbers are considered to be signed, the V bit detects an overflow. Four-bit adder – subtractor with overflow detection

Decimal Adder  For binary addition, it is sufficient to consider a pair of significant bit together with a previous carry.  A decimal adder requires a minimum of nine inputs and five outputs, since four bit are required to code each decimal digit and the circuit must have an input and output carry.  There is a wide variety of possible decimal adder circuits, depending upon the code used to represent the decimal digits.  We will cover a decimal adder for the BCD code.

BCD Adder  Consider the arithmetic addition of two decimal digits in BCD together with an input carry from a previous stage.  Since each input digit does not exceed 9, the output sum cannot be greater than: = 19. The 1 being an input carry.  Suppose we apply two BCD digits to a four-bit binary adder. The adder will form the sum in binary and produce a result that ranges from 0 through 19. These binary numbers are listed and are labeled by symbols K, Z 8, Z 4, Z 2, and Z 1. K is the carry, and the subscripts under the letter Z represent the weights 8, 4, 2, and 1. The columns under the binary sum list the binary value that appears in the outputs of the four-bit binary adder. The output sum of two decimal digits must be represented in BCD and should appear in the form listed in the columns under “BCD Sum.” The problem is to find a rule by which the binary sum is converted to the correct BCD digit representation of the number in the BCD sum.

BCD Adder  Looking at the table, it becomes apparent that when the binary sum is equal to or less than 1001, the corresponding BCD number is identical, and therefore no conversion is needed.  When the binary sum is greater than 1001, we obtain an invalid BCD representation. The addition of binary 6 (0110) to the binary sum coverts it to the correct BCD representation and also produces an output carry as required.

BCD Adder  It is obvious that a correction is needed when the binary sum has an output carry K = 1.  The other six combinations from 1010 through 1111 that need a correction have a 1 in position Z 8. To distinguish them from binary 1000 and 1001, which also have a 1 in position Z 8, we specify further that either Z 4 or Z 2 must have a 1. The Boolean function for the correction can be expressed as: C = K + Z 8 Z 4 + Z 8 Z 2. When C = 1, it is necessary to add 0110 to the binary sum and provide an output carry for the next stage.

BCD Adder  A BCD adder that adds two BCD digits and produces a sum digit in BCD is shown in the figure below.  The two digits, together with the input carry, are first added in the top four-bit adder to produce the binary sum. When the output carry is equal to 0, nothing is added to the binary sum.  When it is equal to 1, binary 0110 is added to the binary sum through the bottom four-bit adder.  The output carry generated from the bottom adder an be ignored, since is supplies information already available at the output carry terminal.

Binary Multiplier  Multiplication of binary numbers is performed in the same way as multiplication of decimal numbers.  consider the multiplication of two 2-bit numbers.  For J multiplier bits and K multiplicand bits, we need (J * K) AND gates and (J – 1) K - bit adders to produce a product of (J + K) bits. Multiplier Multiplicand 1 two bit adder

Four bit by three bit  Example:  Consider a multiplier circuit that multiplies a binary number represented by four bits by a number represented by three bits.  Multiplicand be represented by B3B2B1B0 and  Multiplier by A2A1A0.  We need two Adders each of four bits