Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.

Slides:



Advertisements
Similar presentations
Digital Circuits.
Advertisements

Cs 1110 Ch 4-1 Combinational Logic. ° Introduction Logic circuits for digital systems may be: °2°2 combinational sequential OR A combinational circuit.
Combinational Circuits
Combinational Circuits. Analysis Diagram Designing Combinational Circuits In general we have to do following steps: 1. Problem description 2. Input/output.
التصميم المنطقي Second Course
DPSD This PPT Credits to : Ms. Elakya - AP / ECE.
The Map Method Boolean expressions may be simplified by algebraic means as discussed in Previous lecture However, this procedure of minimization is awkward.
CSE-221 Digital Logic Design (DLD)
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
CHAPTER 3 Digital Logic Structures
Design of Arithmetic Circuits – Adders, Subtractors, BCD adders
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
 Arithmetic circuit  Addition  Subtraction  Division  Multiplication.
CS 105 Digital Logic Design
XOR, XNOR, and Binary Adders
Digital Logic Lecture 08 By Amr Al-Awamry. Combinational Logic 1 A combinational circuit consists of an interconnection of logic gates. Combinational.
Introduction to Digital Logic Design Appendix A of CO&A Dr. Farag
Combinational Logic Design
Combinational Logic Chapter 4. Digital Circuits Combinational Circuits Logic circuits for digital system Combinational circuits the outputs are.
1 Fundamentals of Computer Science Propositional Logic (Boolean Algebra)
Binary Addition CSC 103 September 17, 2007.
Chap 4. Sequential Circuits
Chap 3. Chap 3. Combinational Logic Design. Chap Combinational Circuits l logic circuits for digital systems: combinational vs sequential l Combinational.
Dr. Ahmed El-Bialy, Dr. Sahar Fawzy Combinational Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
SUPLEMENTARY CHAPTER 1: An Introduction to Digital Logic The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
ADDERS Half Adders Recall that the basic rules of binary addition are as indicated below in Table 2-9. A circuit known as the half-adder carries out these.
Chapter 10 (Part 2): Boolean Algebra  Logic Gates (10.3) (cont.)  Minimization of Circuits (10.4)
Combinational Logic. Digital Circuits Introduction Logic circuits for digital systems may be combinational or sequential. A combinational circuit.
Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
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.
Half Adder & Full Adder Patrick Marshall. Intro Adding binary digits Half adder Full adder Parallel adder (ripple carry) Arithmetic overflow.
EE2174: Digital Logic and Lab Professor Shiyan Hu Department of Electrical and Computer Engineering Michigan Technological University CHAPTER 8 Arithmetic.
Universal college of engineering & technology. .By Harsh Patel)
Digital Logic Design (CSNB163)
CS 105 DIGITAL LOGIC DESIGN Chapter 4 Combinational Logic 1.
Computer Architecture
1 Chapter 4 Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables,
Karnaugh Maps (K-Maps)
Karnaugh Map and Circuit Design.
Combinational Circuits
Module 11.  In Module 9, we have been introduced to the concept of combinational logic circuits through the examples of binary adders.  Meanwhile, in.
ECE DIGITAL LOGIC LECTURE 15: COMBINATIONAL CIRCUITS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 10/20/2015.
Simple ALU  Half adder  Full adder  Constructing 4 bits adder  ALU does several operations  General ALU structure  Timing diagram of adder  Overflow.
4–1. BSCS 5 th Semester Introduction Logic diagram: a graphical representation of a circuit –Each type of gate is represented by a specific graphical.
C OMBINATIONAL L OGIC D ESIGN 1 Eng.Maha AlGubali.
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.
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.
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.
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,
Combinational Circuit Design
Combinational Circuits
Computer Architecture CST 250
Karnaugh Maps (K-Maps)
Digital Circuits.
Week 7: Gates and Circuits: PART II
Logic Gates.
Combinational Circuits
Chapter-4 Combinational Logic
XOR Function Logic Symbol  Description  Truth Table 
Digital Circuits.
Digital Circuits.
Presentation transcript:

Module 9

 Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates whose outputs at any time are determined from the present combination of inputs. It can perform an operation that can be specified logically by a set of Boolean functions. (The subsequent modules are based on combinational logic circuit) Sequential logic circuit It employs storage elements in addition to logic gates. Their outputs are a function of the inputs and the state of the storage elements. (the last module on flip-flops & latches is on sequential logic circuits)

 Combinational logic circuits can be constructed based on the following steps: 1.Derive the Truth Table (to perform the given function) 2.Derive the Karnaugh Map (from the truth table) 3.Derive the simplified Boolean expression(s) (from the K-map(s)) 4.Draw the circuit diagram(s) (to implement the simplified Boolean expression(s))

 Binary adder performs the addition of two or more binary digits.  Two types of binary adder: Half adder The input is two binary variables (a, b) The output is two binary variables (sum, c out being the output carry) Full adder The input is three binary variables (a, b, c in being the input carry) The output is two binary variables (sum, c out being the output carry)

 This circuit needs: 2 inputs; augend (a) and addend (b) 2 outputs; sum (sum) and output carry (c out ).  Truth table: absumc out sum = a’b + ab’ c out = ab

 Circuit diagram: sum = a’b + ab’ c out = ab

 This circuit needs: 3 inputs; augend (a),addend (b) and input carry (c in ) 2 outputs; sum (sum) and output carry (c out ).  Truth table: abc in sumc out sum = a’b’c in + a’bc in ’ + ab’c in ’ + abc in c out = a’bc in + ab’c in + abc in ’ + abc in

 Sum of minterms (derived from Truth Table)  Karnaugh map: sumc out  Simplified Boolean expressions: sum = a’b’c in + a’bc in ’ + ab’c in ’ + abc in c out = a’bc in + ab’c in + abc in ’ + abc in bc in a sum = a’b’c in + a’bc in ’ + ab’c in ’ + abc in bc in a c out = bc in + ac in + ab Group1: bc in Group2: ac in Group3: ab

 Circuit diagram: sum = a’b’c in + a’bc in ’ + ab’c in ’ + abc in c out = bc in + ac in + ab

 A full adder can also be implemented by using two half adders and an OR gate.  Recaps half adder consists of AND and XOR operation:  Thus, in order to construct a full adder using half adders, we need to represent the Boolean expressions of a full adder using AND and XOR operations. sum = a’b + ab’ c out = ab

 Sum Boolean expression of a full adder:  C out Boolean expression of a full adder: sum = a’b’c in + a’bc in ’ + ab’c in ’ + abc in sum = c in (a’b’ + ab) + c in ’ (a’b + ab’) sum = c in (a  b)’ + c in ’ (a  b) sum = (a  b)  c bc in a Group 1:abGroup 3:ab’c in Group 2:a’bc in c out = a’bc in + ab’c in + abc in ’ + abc in c out = ab + a’bc in + ab’c in c out = ab + c in (a’b + ab’) c out = ab + c in (a  b)

 Circuit diagram of a full adder (which is made up of 2 half adders and 1 OR gate): sum = (a  b)  c Or gate Half adder c out = ab + c in (a  b) Half adder

 An n-bits binary adder is capable of performing addition of binary digits up to n bits.  An n-bits binary adder requires for n full adders setup in a cascaded manner.  E.g. 4-bits binary adder with 4 full adders:

 A 4-bits cascaded binary adder is capable of performing 4 bits binary operation as follows: i43210 Input Carry (c i )-1100 Augend (a i )-1110 Addend (b i )-1011 Sum (sum)-1001 Output carry (c i+1 ) E.g. Augend = 1110 E.g. Addend = 1011 Sum = 1001 with output carry c 4 = 1

 Properties: The bits are added with full adder, starting from the least significant position to form the sum bit and carry bit then proceeds to the higher significant bits. The innitial input carry c 0 must be 0. The output carry c i+1 is transferred into the input carry c i of the full adder that adds the higher significant bits. The sum bits are generated starting from the least significant bit and are available as soon as the corresponding previous carry bit is generated. Thus, all the carries must be generated for the correct sum bits to appear at the outputs. If each full adder has a delay of t delay ; Total delay = n × t delay

End of Module 9