Chapter 3 Combinational Design Digital Logic Design III

Slides:



Advertisements
Similar presentations
Combinational Circuits
Advertisements

التصميم المنطقي Second Course
CS2100 Computer Organisation Combinational Circuits (AY2014/5 Semester 2)
Chapter 1 Digital Systems and Numbers System
DPSD This PPT Credits to : Ms. Elakya - AP / ECE.
Combinational Logic Chapter 4. Digital Circuits Introduction Logic circuits for digital systems may be combinational or sequential. A combinational.
Design of Arithmetic Circuits – Adders, Subtractors, BCD adders
Combinational Logic Chapter 4.
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Chapter 3 Combinational Logic Design
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
CS1104: Computer Organisation Lecture 6: Combinational Circuits Design Methods/Arithmetic 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
Mantıksal Tasarım – BBM231 M. Önder Efe
Combinational Circuits
Combinational Circuits
Chapter 3 Decoder and Encoder Digital Logic Design III
Morgan Kaufmann Publishers
Combinational Logic Design
Combinational Logic Chapter 4.
Outline Analysis of Combinational Circuits Signed Number Arithmetic
Combinational Logic Chapter 4. Digital Circuits Combinational Circuits Logic circuits for digital system Combinational circuits the outputs are.
1 COMBINATIONAL LOGIC One or more digital signal inputs One or more digital signal outputs Outputs are only functions of current input values (ideal) plus.
Chap 3. Chap 3. Combinational Logic Design. Chap Combinational Circuits l logic circuits for digital systems: combinational vs sequential l Combinational.
Combinational Circuits
Combinational Logic. Outline 4.1 Introduction 4.2 Combinational Circuits 4.3 Analysis Procedure 4.4 Design Procedure 4.5 Binary Adder- Subtractor 4.6.
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.
F = ∑m(1,4,5,6,7) F = A’B’C+ (AB’C’+AB’C) + (ABC’+ABC) Use X’ + X = 1.
1 Adders & Subtractors Adders –An adder is a combinational logic circuit that performs the addition of 2 binary numbers (A & B) to generate the sum (S)
Combinational Logic. Digital Circuits Introduction Logic circuits for digital systems may be combinational or sequential. A combinational circuit.
Digital System Ch4-1 Chapter 4 Combinational Logic Ping-Liang Lai ( 賴秉樑 ) Digital System 數位系統.
D IGITAL L OGIC D ESIGN I G ATE -L EVEL M INIMIZATION.
Boolean Algebra and Logic Gates 1 Computer Engineering (Logic Circuits) Lec. # 8 (Combinational Logic Circuit) Dr. Tamer Samy Gaafar Dept. of Computer.
CHAPTER 4 Combinational Logic
Unit 2 Combinational Circuits. Introduction Logic circuits for digital systems may be either combinational or sequential. A combinational circuit consists.
Logic Gates Logic gates are electronic digital circuit perform logic functions. Commonly expected logic functions are already having the corresponding.
COE 202: Digital Logic Design Combinational Circuits Part 2 KFUPM Courtesy of Dr. Ahmad Almulhem.
Computer Engineering (Logic Circuits) (Karnaugh Map)
Universal college of engineering & technology. .By Harsh Patel)
Sneha.  A combinational circuit that performs the addition of two bits is called a half adder.  It has two inputs.  It has two outputs.
Chapter Four Combinational Logic 1. C OMBINATIONAL C IRCUITS It consists of input variables, logic gates and output variables. Output is function of input.
CS 105 DIGITAL LOGIC DESIGN Chapter 4 Combinational Logic 1.
Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
1 Chapter 4 Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables,
1 CS 151: Digital Design Chapter 3: Combinational Logic Design 3-1Design Procedure CS 151: Digital Design.
CS151 Introduction to Digital Design Chapter 3: Combinational Logic Design 3-1 Design Procedure 1Created by: Ms.Amany AlSaleh.
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
Combinational Circuits
CHAPTER 2 Digital Combinational Logic/Arithmetic Circuits
Chapter Four Combinational Logic 1. C OMBINATIONAL C IRCUITS It consists of input variables, logic gates and output variables. Output is function of input.
1 Combinational Logic EE 208 – Logic Design Chapter 4 Sohaib Majzoub.
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.
UNIT 8 COMBINATIONAL CIRCUIT DESIGN AND SIMULATION USING GATES
Chapter 4 Combinational Logic. 4.1 Introduction   Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists.
Gunjeet Kaur Dronacharya Group of Institutions. Binary Adder-Subtractor A combinational circuit that performs the addition of two bits is called a half.
Presented by A. Maleki Fall Semester, 2010
Combinational Circuits
Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,
Computer Architecture CST 250
Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.
FIGURE 4.1 Block diagram of combinational circuit
Ch 4. Combinational logic
Adders and Subtractors
Digital System Design Combinational Logic
Chapter-4 Combinational Logic
XOR Function Logic Symbol  Description  Truth Table 
Unit IV Adders Subtractors Flip Flops Counters Multiplexes and De multiplexes. Integrated circuits-Op. amp – Characteristics Inverting amplifier - Non-inverting.
Presentation transcript:

Chapter 3 Combinational Design Digital Logic Design III وزارة التعليم العالي والبحث العلمي جامعة الكوفة - كلية التربية – قسم علوم الحاسوب Digital Logic Design III Chapter 3 Combinational Design Dr. Wissam Hasan Mahdi Alagele e-mail:wisam.alageeli@uokufa.edu.iq http://edu-clg.kufauniv.com/staff/Mr.Wesam

Combinational Circuits Princess Sumaya University Combinational Circuits 4241 - Digital Logic Design Output is function of input only i.e. no feedback When input changes, output may change (after a delay) Combinational Circuits • n inputs m outputs  Dr. Bassam Kahhaleh

Combinational Circuits Princess Sumaya University 4241 - Digital Logic Design Combinational Circuits Analysis Given a circuit, find out its function Function may be expressed as: Boolean function Truth table Design Given a desired function, determine its circuit ? ? Dr. Bassam Kahhaleh

Princess Sumaya University 4241 - Digital Logic Design Analysis Procedure Boolean Expression Approach T2=ABC T1=A+B+C F2=AB+AC+BC F’2=(A’+B’)(A’+C’)(B’+C’) T3=AB'C'+A'BC'+A'B'C F1=AB'C'+A'BC'+A'B'C+ABC F2=AB+AC+BC Dr. Bassam Kahhaleh

Princess Sumaya University Analysis Procedure 4241 - Digital Logic Design Truth Table Approach A B C F1 F2 0 0 0 = 0 0 0 1 Dr. Bassam Kahhaleh

Princess Sumaya University 4241 - Digital Logic Design Analysis Procedure Truth Table Approach A B C F1 F2 0 0 0 0 0 1 = 0 = 1 1 1 1 0 1 1 Dr. Bassam Kahhaleh

Princess Sumaya University 4241 - Digital Logic Design Analysis Procedure Truth Table Approach A B C F1 F2 0 0 0 0 0 1 1 0 1 0 = 0 = 1 1 1 1 1 0 1 Dr. Bassam Kahhaleh

Princess Sumaya University 4241 - Digital Logic Design Analysis Procedure Truth Table Approach A B C F1 F2 0 0 0 0 0 1 1 0 1 0 0 1 1 = 0 = 1 1 0 1 1 Dr. Bassam Kahhaleh

Princess Sumaya University Analysis Procedure 4241 - Digital Logic Design Truth Table Approach A B C F1 F2 0 0 0 0 0 1 1 0 1 0 0 1 1 1 0 0 = 1 = 0 1 1 1 1 1 0 Dr. Bassam Kahhaleh

Princess Sumaya University 4241 - Digital Logic Design Analysis Procedure Truth Table Approach A B C F1 F2 0 0 0 0 0 1 1 0 1 0 0 1 1 1 0 0 1 0 1 = 1 = 0 1 0 1 1 Dr. Bassam Kahhaleh

Princess Sumaya University Analysis Procedure 4241 - Digital Logic Design Truth Table Approach = 1 = 0 A B C F1 F2 0 0 0 0 0 1 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 0 1 Dr. Bassam Kahhaleh

Princess Sumaya University 4241 - Digital Logic Design Analysis Procedure Truth Table Approach A B C F1 F2 0 0 0 0 0 1 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 = 1 1 1 1 1 1 B 1 A C B 1 A C F1=AB'C'+A'BC'+A'B'C+ABC F2=AB+AC+BC Dr. Bassam Kahhaleh

Princess Sumaya University 4241 - Digital Logic Design Design Procedure Given a problem statement: Determine the number of inputs and outputs Derive the truth table Simplify the Boolean expression for each output Produce the required circuit Example: Design a circuit to convert a “BCD” code to “Excess 3” code 4-bits 0-9 values Value+3 ? Dr. Bassam Kahhaleh

Princess Sumaya University 4241 - Digital Logic Design Design Procedure BCD-to-Excess 3 Converter C 1 B A x D C 1 B A x D A B C D w x y z 0 0 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 x x x x 1 1 0 1 1 1 1 0 1 1 1 1 w = A+BC+BD x = B’C+B’D+BC’D’ C 1 B A x D C 1 B A x D y = C’D’+CD z = D’ Dr. Bassam Kahhaleh

Princess Sumaya University 4241 - Digital Logic Design Design Procedure BCD-to-Excess 3 Converter A B C D w x y z 0 0 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 x x x x 1 1 0 1 1 1 1 0 1 1 1 1 w = A + B(C+D) y = (C+D)’ + CD x = B’(C+D) + B(C+D)’ z = D’ Dr. Bassam Kahhaleh

Seven-Segment Decoder Princess Sumaya University Seven-Segment Decoder 4241 - Digital Logic Design f e g d a b c ? w x y z a b c d e f g BCD code w x y z a b c d e f g 0 0 0 0 1 1 1 1 1 1 0 0 0 0 1 0 1 1 0 0 0 0 0 0 1 0 1 1 0 1 1 0 1 0 0 1 1 1 1 1 1 0 0 1 0 1 0 0 0 1 1 0 0 1 1 0 1 0 1 1 0 1 1 0 1 1 0 1 1 0 1 0 1 1 1 1 1 0 1 1 1 1 1 1 0 0 0 0 1 0 0 0 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 0 1 1 1 0 1 0 x x x x x x x 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 1 x a = w + y + xz + x’z’ e = x’z’+yz’ b = x’+yz+y’z’ c = x+y’+z f = w+x+y’z’ d = x’z’+yz’+x’y+xy’z g = w+x’y+xy’+x’y+xz’ Dr. Bassam Kahhaleh

Problem Design a circuit which displays the letters A through J on a seven-segment indicator. The circuit has four inputs W, X, Y, Z which represent the last 4 bits of the ASCII code for the letter to be displayed. For example, if WXYZ = 0001, “A” will be displayed. The letters should be displayed in the following form: Design your circuit using only two-, three-, and four-input NOR gates and inverters. Any solution with 22 or fewer gates and inverters (not counting the four inverters for the inputs) is acceptable.

Princess Sumaya University Binary Adder 4241 - Digital Logic Design Half Adder Adds 1-bit plus 1-bit Produces Sum and Carry HA x y S C x + y ─── C S x y C S 0 0 0 0 0 1 0 1 1 0 1 1 1 0 x y S C Dr. Bassam Kahhaleh

Princess Sumaya University 4241 - Digital Logic Design Binary Adder Full Adder Adds 1-bit plus 1-bit plus 1-bit Produces Sum and Carry FA x y z S C x + y + z ─── C S y 1 x z x y z C S 0 0 0 0 0 0 0 1 0 1 0 1 0 0 1 1 1 0 1 0 0 1 0 1 1 1 0 1 1 1 1 1 S = xy'z'+x'yz'+x'y'z+xyz = z’(xy’+x’y)+z(x’y’+xy) =z’(x  y) + z(x  y)’ = x  y  z y 1 x z C = xy + xz + yz Dr. Bassam Kahhaleh

Princess Sumaya University 4241 - Digital Logic Design Binary Adder Full Adder S = xy'z'+x'yz'+x'y'z+xyz=x  y  z C = xy + xz + yz x y z S C x y z S C Dr. Bassam Kahhaleh

Princess Sumaya University Binary Adder 4241 - Digital Logic Design Full Adder HA x y z S C x y z S C Dr. Bassam Kahhaleh

QUIZ ? Q#1- This combinational logic circuit is described as a(n) ___. Q#2- What are the sum and carry out outputs of this full-adder circuit? Q#3- What are the sum and carry out outputs of this full-adder circuit? Q#4- What are the sum and carry out outputs of this full-adder circuit? Q#5- What are the sum and carry out outputs of this full-adder circuit? Q#6- What are the sum and carry out outputs of this full-adder circuit? ANS: full-adder ANS: Sum=0, Carry out=0 ANS: Sum=1, Carry out=0 ANS: Sum=0, Carry out=1 ANS: Sum=1, Carry out=1 ANS: Sum=0, Carry out=1 Cin = 0 A = 0 B = 0 Cin = 0 A = 0 B = 1 Cin = 1 A = 0 B = 1 Cin = 1 A = 1 B = 1 ? Cin = 0 A = 1 B = 1

Princess Sumaya University 4241 - Digital Logic Design Binary Adder c3 c2 c1 . + x3 x2 x1 x0 + y3 y2 y1 y0 ──────── Cy S3 S2 S1 S0 FA x3 x2 x1 x0 y3 y2 y1 y0 S3 S2 S1 S0 C4 C3 C2 C1 Binary Adder x3x2x1x0 y3y2y1y0 S3S2S1S0 C0 Cy Carry Propagate Addition Dr. Bassam Kahhaleh

74x283 4-bit adder Uses carry look-ahead internally

Princess Sumaya University Binary Adder 4241 - Digital Logic Design Carry Propagate Adder c3 c2 c1 . x3 x2 x1 x0 y3 y2 y1 y0 ──────── Cy S3 S2 S1 S0 c7 c6 c5 Cy . + x7 x6 x5 x4 + y7 y6 y5 y4 Cy S7 S6 S5 S4 CPA A3 A2 A1 A0 B3 B2 B1 B0 S3 S2 S1 S0 C0 Cy x3 x2 x1 x0 y3 y2 y1 y0 x7 x6 x5 x4 y7 y6 y5 y4 S3 S2 S1 S0 S7 S6 S5 S4 Dr. Bassam Kahhaleh

Subtractors Half Subtractor Full Subtractor Adder/Subtractor - 1

Half Subtractor Input Output Logic Symbol: Logic Diagram: A Di B Bo Bo Di (difference) B0 (borrow out) B Bo A B Di 0 0 0 0 0 1 1 1 1 0 1 0 1 1 0 0 A B Di Bo -1 1 2 Logic Diagram:

QUIZ ? Q#1- What is the difference and borrow outputs from This half-subtractor circuit? Q#2- What is the difference and borrow outputs from this half-subtractor circuit? Q#3- What is the difference and borrow outputs from this half-subtractor circuit? Q#4- What is the difference and borrow outputs from this half-subtractor circuit? ANS: Di= 0, Bo= 0 ANS: Di= 1, Bo= 0 ANS: Di= 0, Bo= 0 ANS: Di= 1, Bo= 1 (A – B) A = 0 B = 0 (A – B) A = 1 B = 0 (A – B) A = 1 B = 1 (A – B) A = 0 B = 1 ?

Full Subtractor Input Output Logic Symbol: Logic Diagram: Full Di (difference) B0 (borrow out) Full Subtractor Input Output Bin A B Di B0 H. S. Bin Logic Diagram: half subtractor Bo

Full Subtractor Di Di Same as S in full adder Bo 1 1 Ci A B 00 01 11 10 Di 0 0 0 0 0 0 0 1 1 1 0 1 0 1 0 0 1 1 0 0 1 0 0 1 1 1 0 1 0 1 1 1 0 0 0 1 1 1 1 1 Ci A B Di Bo Di Same as S in full adder Bo 00 01 11 10 1 1

HINT: truth table from textbook (Fig. 10-10) is helpful QUIZ Q#1- What are the Difference and Borrow out output from this full-subtractor circuit? Q#2- What are the Difference and Borrow out output from this full-subtractor circuit? Q#3- What are the Difference and Borrow out output from this full-subtractor circuit? Q#4- What are the Difference and Borrow out output from this full-subtractor circuit? Q#5- What are the Difference and Borrow out output from this full-subtractor circuit? Q#6- What are the Difference and Borrow out output from this full-subtractor circuit? HINT: truth table from textbook (Fig. 10-10) is helpful ANSWER: Di = 0, Bo = 0 ANSWER: Di = 1, Bo = 1 ANSWER: Di = 1, Bo = 1 ANSWER: Di = 0, Bo = 1 ANSWER: Di = 1, Bo = 0 ANSWER: Di = 0, Bo = 0 (A – B - Bin) Bin = 0 A = 0 B = 0 (A – B - Bin) Bin = 1 A = 0 B = 0 ? (A – B - Bin) Bin = 1 A = 1 B = 1 (A – B - Bin) Bin = 1 A = 0 B = 1 (A – B - Bin) Bin = 0 A = 1 B = 0 (A – B - Bin) Bin = 0 A = 1 B = 1

Adder/Subtractor - 1 E = 0: Half adder E = 1: Half subtractor Di Bo A B S C Half adder Half subtractor i E = 0: Half adder E = 1: Half subtractor o

Adder/Subtractor-1 E = 0: Full adder E = 1: Full subtractor C A B Bo E Di C Bo i E E = 0: Full adder E = 1: Full subtractor

Adder/Subtractor-2 E = 0: 4-bit adder E = 1: 4-bit subtractor