C OMBINATIONAL L OGIC D ESIGN 1 Eng.Maha AlGubali.

Slides:



Advertisements
Similar presentations
ADDER, HALF ADDER & FULL ADDER
Advertisements

Give qualifications of instructors: DAP
Combinational Circuits
COE 202: Digital Logic Design Combinational Circuits Part 1
1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.
التصميم المنطقي Second Course
Binary Addition. Binary Addition (1) Binary Addition (2)
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 1 –
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
COE 202: Digital Logic Design Combinational Circuits Part 1
Chapter 3 Combinational Logic Design
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 1 –
Combinational Logic Design
Overview Part 1 – Design Procedure 3-1 Design Procedure
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
CS 105 Digital Logic Design
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Building Functions.
Digital Logic Lecture 08 By Amr Al-Awamry. Combinational Logic 1 A combinational circuit consists of an interconnection of logic gates. Combinational.
Combinational Logic Chapter 4.
Combinational Logic Design CS341 Digital Logic and Computer Organization F2003.
Combinational Logic Design
Outline Analysis of Combinational Circuits Signed Number Arithmetic
Sahar Mosleh PageCalifornia State University San Marcos 1 Multiplexer, Decoder and Circuit Designing.
Dr. Ahmed El-Bialy, Dr. Sahar Fawzy Combinational Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.
Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
Digital Components and Combinational Circuits Sachin Kharady.
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.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
1 Combinational Logic Design Digital Computer Logic Kashif Bashir
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
CHAPTER 4 Combinational Logic
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.
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.
Combinational Circuits
1 Fundamentals of Computer Science 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.
Combinational Logic Design. 2 Combinational Circuits A combinational logic circuit has: ♦ A set of m Boolean inputs, ♦ A set of n Boolean outputs ♦ n.
Chapter 3 Digital Logic Structures
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.
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.
Programming for GCSE Topic 9.2: Circuits for Adding T eaching L ondon C omputing William Marsh School of Electronic Engineering and Computer Science Queen.
Combinational Logic Design. 2 Combinational Circuits A combinational logic circuit has: ♦ A set of m Boolean inputs, ♦ A set of n Boolean outputs ♦ n.
L OGIC G ATES Computer Organization – week 3. W HAT ’ S ALU? 1. ALU stands for: Arithmetic Logic Unit 2. ALU is a digital circuit that performs Arithmetic.
Combinational Design, Part 2: Procedure. 2 Topics Positive vs. negative logic Design procedure.
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
ECE 3130 Digital Electronics and Design
Combinational Circuits
Combinational Functions and Circuits
Combinational Circuit Design
Combinational Circuits
Computer Architecture CST 250
FIGURE 4.1 Block diagram of combinational circuit
Week 7: Gates and Circuits: PART II
Chapter 3 – Combinational Logic Design
Logic Gates.
DIGITAL ELECTRONICS B.SC FY
Combinational Circuits
Chapter-4 Combinational Logic
XOR Function Logic Symbol  Description  Truth Table 
Arithmetic Circuits.
Unit IV Adders Subtractors Flip Flops Counters Multiplexes and De multiplexes. Integrated circuits-Op. amp – Characteristics Inverting amplifier - Non-inverting.
Presentation transcript:

C OMBINATIONAL L OGIC D ESIGN 1 Eng.Maha AlGubali

C OMPUTER C OMPONENTS Computer components are made from both:  combinational.  sequential logic circuits. First we will look at Combinational Logic Circuit 2 Eng.Maha AlGubali

C OMBINATIONAL C IRCUITS Combinational Circuits – Consist of logic gates whose outputs at any time are determined from the present combination of inputs. input variables, logic gates, and output variables – The logic gates accept signals from the inputs and generate signals to the output 3 Eng.Maha AlGubali

D ESIGN P ROCEDURE Similar to software 1. Specification – problem description Write a specification for the circuit 2. Formulation – as truth table, Boolean function, or ( Verilog ) define the required relationships between inputs and outputs 3. Optimization – used to be manual, now CAD tool Draw a logic diagram or provide a netlist for the resulting circuit (AND, OR, INVERTORS) 4. Mapping – to the implementation technology Transform the diagram to a new diagram using the available implementation technology 5. Verification – used to be manual, now simulation Verify correctness of design 4 Eng.Maha AlGubali

E XAMPLE 1 Specification: 3 binary inputs; Output is 1 when input < Formulation Optimization Eng.Maha AlGubali

6

1 BIT HALF ADDER Bit Addition Unit (Half Adder) The truth table summaries the outputs of the 1 bit addition based on values of x and y The two outputs are sum and carry As we see, the sum can be found using the “XOR” operation and the carry using the “AND” operation This circuit is known as half adder Does half the job – does not account for carry-in input 7 Eng.Maha AlGubali

1 B IT A DDITION U NIT (F ULL A DDER ) 8  The full adder becomes necessary when a carry input must be added to the two binary digits to obtain the correct sum. A half adder has no input for carries from previous circuits. Eng.Maha AlGubali

MULTIPLEXER A combinational circuit that selects binary information from one of many input lines and directs it to a single output line – Normally, there are 2n input lines and n selection lines whose bit combinations determine which input is selected – also called a data selector 9 Eng.Maha AlGubali. 2 n input line. …. n Selected line output

MULTIPLEXER ( CONT ) The truth table for a 2-to-1 multiplexer is:. 10 Eng.Maha AlGubali

DECODERS A combinational circuit that converts binary information from n input lines to a maximum of 2n unique output lines. n-to-m-line decoders: generate m (=2 n or fewer) minters of n input variables 11 Eng.Maha AlGubali n-to-m Line Decoder. n input line. m output line

3 TO 8 LINE DECODER 12 Eng.Maha AlGubali 3-to-8 Line Decoder Block diagram Logic diagram

ENCODER An encoder has 2 n (or fewer) input lines and n output lines, which generate the binary code corresponding to the input value. 13 Eng.Maha AlGubali 2 n -to-n Line Decoder. 2 n input line. n output line