Lecture 1 Gunjeet kaur Dronacharya group of institutions.

Slides:

Advertisements

Similar presentations

COE 202: Digital Logic Design Combinational Circuits Part 1

Advertisements

1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.

التصميم المنطقي Second Course

Multiplexors Sequential Circuits and Finite State Machines Prof. Sin-Min Lee Department of Computer Science.

DPSD This PPT Credits to : Ms. Elakya - AP / ECE.

ECE 331 – Digital System Design

08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:

Combinational Logic Chapter 4.

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

1 COMP541 Combinational Logic - II Montek Singh Aug 27, 2014.

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

CS 105 Digital Logic Design

Digital Logic Lecture 08 By Amr Al-Awamry. Combinational Logic 1 A combinational circuit consists of an interconnection of logic gates. Combinational.

Digital Computer Design Fundamental

Combinational Logic Design CS341 Digital Logic and Computer Organization F2003.

Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Lecture 12 – Design Procedure.

Combinational Logic Design

Outline Analysis of Combinational Circuits Signed Number Arithmetic

Chapter 5 Memory and Programmable Logic 5.1. Introduction 5.2. Random Access Memory 5.3. Memory Encoding 5.4. Read Only Memory 5.5. Programmable Logic.

Combinational Logic Chapter 4. Digital Circuits Combinational Circuits Logic circuits for digital system Combinational circuits the outputs are.

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.

Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.

Combinational Logic. Digital Circuits Introduction Logic circuits for digital systems may be combinational or sequential. A combinational circuit.

Chap 4. Sequential Circuits

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

CHAPTER 4 Combinational Logic

1 Lecture 22 Sequential Circuits Analysis. 2 Combinational vs. Sequential  Combinational Logic Circuit  Output is a function only of the present inputs.

Logic Gates Logic gates are electronic digital circuit perform logic functions. Commonly expected logic functions are already having the corresponding.

ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.

CS 105 DIGITAL LOGIC DESIGN Chapter 4 Combinational Logic 1.

Chap 2. Combinational Logic Circuits

Lecture 11 Combinational Design Procedure

1 Lecture 12 More about Combinational Analysis and Design Procedures.

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.

CHAPTER 4 Analysis and Design of Combinational Logic (Sections 4.1 – 4.2)

Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.

Combinational Circuits

ECE 301 – Digital Electronics Logic Circuit Design (Lecture #9)

Chapter 0 – Week 2 Combinational Logic Design. What have been discussed Design hierarchy –Top – down –Bottom – up CAD HDL Logic synthesis.

Lecture 07 Digital logic By Amr Al-Awamry. 4 variables K-Map.

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 Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.

ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.

Combinational Logic Design. 2 Combinational Circuits A combinational logic circuit has: ♦ A set of m Boolean inputs, ♦ A set of n Boolean outputs ♦ n.

Combinational Design, Part 2: Procedure. 2 Topics Positive vs. negative logic Design procedure.

CS151 Introduction to Digital Design Chapter 3: Combinational Logic Design 3-4 Verification 1Created by: Ms.Amany AlSaleh.

EGR 2131 Unit 4 Combinational Circuits: Analysis & Design

Chap 3. Combinational Logic Design

Combinational Logic Design&Analysis.

And Decoders Prof. Sin-Min Lee Department of Computer Science

And Decoders 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,

Combinational Circuit Design

Computer Architecture CST 250

Chapter 4 Combinational Logic

Karnaugh Maps (K-Maps)

Ch 4. Combinational logic

DESIGN OF SEQUENTIAL CIRCUITS

Combinational Circuits

Karnaugh Maps (K maps).

Presentation transcript:

Lecture 1 Gunjeet kaur Dronacharya group of institutions

Combinational v.s Sequential Circuits Logic circuits may be combinational or sequential Combinational circuits: Consist of logic gates only. Outputs are determined from the present values of inputs. Operations can be specified by a set of Boolean functions. Sequential circuits: Consist of logic gates and storage elements Outputs are a function of the inputs and the state of the storage elements. Depend not only on present inputs, but also on past values Circuit behavior must be specified by a time sequence of inputs and internal states.

Combinational Circuit A combinational circuit consists of Input variables Logic gates Output variables Block diagram of Combinational Circuit

Combinational Circuit Each input and output variable is a binary signal Represent logic 1 and logic 0. There are 2 n possible binary input combinations for n input variable. Only one possible output value for each possible input combination. Can be specified with a truth table. Can also be described by m Boolean functions, one for each output variable. Each output function is expressed in terms of n input variables.

Analysis Procedure Analysis: determine the function that the circuit implements Often start with a given logic diagram The analysis can be performed by Manually finding Boolean functions Manually finding truth table Using a computer simulation program First step: make sure that circuit is combinational Without feedback paths or memory elements Second step: obtain the output Boolean functions or the truth table

Output Boolean Functions Step 1: Label all gate outputs that are a function of input variables. Determine Boolean functions for each gate output.

Output Boolean Functions Step 2: Label the gates that are a function of input variables and previously labeled gates. Find the Boolean function for these gates

Output Boolean Functions Step 3: Obtain the output Boolean function in term of input variables. By repeated substitution of previously defined functions.

Truth Table To obtain the truth table from the logic diagram: 1. Determine the number of input variables. For n inputs: 2 n possible combinations List the binary numbers from 0 to 2 n-1 in a table 2. Label the outputs of selected gates. 3. Obtain the truth table for the outputs of those gates that are a function of the input variables only. 4. Obtain the truth table for those gates that are a function of previously defined variables at step 3. Repeatedly until all outputs are determined

Design Procedure Design procedure: Input: the specification of the problem Output: the logic circuit diagram (or Boolean functions) Step 1: determine the required number of inputs and outputs from the specification. Step 2: derive the truth table that defines the required relationship between inputs and outputs. Step 3: obtain the simplified Boolean function for each output as a function of the input variables. Step 4: draw the logic diagram and verify the correctness of the design.

Code Conversion Example Convert from BCD code to Excess-3 code. The 6 input combinations not listed are don’t cares. These values have no meaning in BCD. We can arbitrary assign them to 1 or 0.

Maps for Code Converter The six don’t care minterms (10~15) are marked with X.

Maps for Code Converter

Logic Diagram for the Converter There are various possibilities for a logic diagram that implements a circuit. A two-level logic diagram may be obtained directly from the Boolean expressions derived by the maps. The expressions may be manipulated algebraically to use common gates for two or more outputs. Reduce the number of gates used.

Logic Diagram for the Converter