ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.

Slides:

Advertisements

Similar presentations

Digital Circuits.

Advertisements

Documentation Standards

COE 202: Digital Logic Design Combinational Circuits Part 1

1 Homework Reading –Tokheim, Section 5-10, 7-4 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.

1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.

ENGIN112 L13: Combinational Design Procedure October 1, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 13 Combinational Design Procedure.

CS 151 Digital Systems Design Lecture 13 Combinational Design Procedure.

Design Of Combinational Logic Circuits

Chapter 3 Combinational Logic Design

Week 3- slide 1 EE 231 Digital Electronics Fall 01 Gate Logic: Two-Level Simplification K-Map Method Examples F = A asserted, unchanged B varies G = B’,

Logic Function Optimization. Combinational Logic Circuit Regular SOP and POS designs Do not care expressions Digital logic circuit applications Karnaugh.

ABCDNumber = Off 1 = On Binary Coded Decimal (BCD)

طراحی مدارهای منطقی نیمسال دوم دانشگاه آزاد اسلامی واحد پرند.

Combinational Design ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.

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.

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)

D IGITAL L OGIC D ESIGN I G ATE -L EVEL M INIMIZATION.

Digital Systems I EEC 180A Lecture 4 Bevan M. Baas.

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

ROM & PLA Digital Logic And Computer Design

Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.

Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.

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

Chap 2. Combinational Logic Circuits

Lecture 11 Combinational Design Procedure

1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.

ECE 320 Homework #3 1. Simplify the Boolean function F using the don’t care conditions d, in both S.O.P. and P.O.S. form: a) F=A’B’D’+A’CD+A’BC d=A’BC’D+ACD+AB’D’

"Digital Systems"1 7-segment Numeric display b a d g e c f.

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.

Designing Combinational Logic Circuits

Karnaugh Maps (K-Maps)

Announcements Project components starting to arrive No assignment due this week – assignment 7 will be posted on Thursday. Final exam date. Let’s leave.

CEC 220 Digital Circuit Design

Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.

1 3- De-Morgan’s Theorems 1.The complement of a product of variables is equal to the sum of the complements of the variables. 2. The complement of a sum.

ECE 301 – Digital Electronics Minimizing Boolean Expressions using K-maps, The Minimal Cover, and Incompletely Specified Boolean Functions (Lecture #6)

CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.

Combinational Logic Analysis. Basic Combinational Logic Circuits AND-OR logic AND-OR logic AND-OR logic produces an SOP expression. AND-OR logic produces.

1 EENG 2710 Chapter 3 Simplification of Switching Functions.

Decoders A decoder is a logic circuit that detects the presence of a specific combination of bits at its input. Two simple decoders that detect the presence.

Digital Logic Design. Truth Table  Logic Circuit 1. Start with truth table 2. When your output is a 1, figure out the combination of inputs, ANDs, and.

Lecture 1 Gunjeet kaur Dronacharya group of institutions.

Homework Reading Machine Projects Labs

DeMorgan’s Theorem DeMorgan’s 2nd Theorem

Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,

Boolean Algebra.

Circuits & Boolean Expressions

Lecture 5 Dr. Nermin Hamza.

CSE 140 : Components and Design Techniques for Digital Systems

Digital Design Fundamentals

Digital Logic and Design

Karnaugh Maps (K-Maps)

ECE 331 – Digital System Design

Optimization Algorithm

Homework Reading Tokheim, Section 5-10, 7-4.

Chapter 3 Gate-level Minimization.

Boolean Algebra.

ECB2212-Digital Electronics K-Map

Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y

Lecture 9 Logistics Last lecture Last last lecture Today

Overview Part 2 – Circuit Optimization

3-Variable K-map AB/C AB/C A’B’ A’B AB AB’

Table 1.1 Powers of Two.

Principles & Applications

ACOE101: Freshman Computer Engineering Fall 2018

Circuits & Boolean Expressions

ECE 331 – Digital System Design

Presentation transcript:

ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits

ACOE161Digital Circuit Design2 Design of combinational digital circuits Steps to design a combinational digital circuit: –From the problem statement derive the truth table –From the truth table derive the unsimplified logic expression –Simplify the logic expression –From the simplified expression draw the logic circuit Example: Design a 3-input (A,B,C) digital circuit that will give at its output (X) a logic 1 only if the binary number formed at the input has more ones than zeros.

ACOE161Digital Circuit Design3 Design of combinational digital circuits (Cont.) Example: Design a 4-input (A,B,C,D) digital circuit that will give at its output (X) a logic 1 only if the binary number formed at the input is between 2 and 9 (including).

ACOE161Digital Circuit Design4 Design of combinational digital circuits (Cont.) Example: Design a 4-input (A,B,C,D) digital circuit that will give at its output (X) a logic 1 only if the binary number formed by the inputs (AB) is greater or equal to the binary number formed by the inputs (CD).

ACOE161Digital Circuit Design5 Tutorial: Design a 4-input (A,B,C,D) digital circuit that will give at its output a binary number equal to the sum of the binary numbers formed by the inputs (AB) and (CD).

ACOE161Digital Circuit Design6

ACOE161Digital Circuit Design7 Tutorial: Design a 4-input (A,B,C,D) digital circuit that will give at the output: –X a logic 1 if the binary number formed by the inputs (AB) is greater than (CD). –Y a logic 1 if the binary number formed by the inputs (AB) is less than (CD). –Z a logic 1 if the binary number formed by the inputs (AB) is equal to (CD).

ACOE161Digital Circuit Design8

ACOE161Digital Circuit Design9 Homework: Design a 4-input (A,B,C,D) digital circuit that will give at the output: –X a logic 1 if in the binary number formed at the inputs there are more zeros than ones. –Y a logic 1 if in the binary number formed at the inputs there are less zeros than ones. –Z a logic 1 if in the binary number formed at the inputs there equal zeros and ones.

ACOE161Digital Circuit Design10

ACOE161Digital Circuit Design11 Homework: Design a 4-input (A,B,C,D) digital circuit that will give at its output a binary number equal to the product of the binary numbers formed by the inputs (AB) and (CD).

ACOE161Digital Circuit Design12

ACOE161Digital Circuit Design13 Don’t Care Conditions In many application it is known in advance that some of the input combinations will never occur. These combinations are marked as “Don’t Care Conditions” and are used as either zero’s or one’s so that the application is implemented with the most simplified circuit. Example: Simplify the logic expression X(A,B,C,D) with the don’t care conditions d(A,B,C,D).

ACOE161Digital Circuit Design14 Don’t Care Conditions: Examples

ACOE161Digital Circuit Design15 Homework: Design a digital circuit that has as input a 1-digit Binary Coded Decimal (BCD) number. The circuit must give at its output a binary number equal to the absolute value of (2M – 5), where M is the number formed at the input.

ACOE161Digital Circuit Design16

ACOE161Digital Circuit Design17

ACOE161Digital Circuit Design18