Chapter 10.3 and 10.4: Combinatorial Circuits

Slides:

Advertisements

Similar presentations

Discrete Mathematical Structures: Theory and Applications

Advertisements

Combinational Logic Circuits Chapter 2 Mano and Kime.

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

Appendix B Digital Logic. Irvine, Kip R. Assembly Language for Intel-Based Computers, NOT AND OR XOR NAND NOR Truth Tables Boolean Operators.

Chapter 11_1 (chap 10 ed 8) Digital Logic. Irvine, Kip R. Assembly Language for Intel-Based Computers, NOT AND OR XOR NAND NOR Truth Tables Boolean.

1 Tutorial: ITI1100 Dewan Tanvir Ahmed SITE, UofO.

Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.

Chapter 4 Gates and Circuits.

Section 10.3 Logic Gates.

Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.

Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.

XOR, XNOR, and Binary Adders

Chapter 4 Gates and Circuits. 4–2 Chapter Goals Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors.

Chapter 4 Gates and Circuits.

Chapter 10_1 Digital Logic. Irvine, Kip R. Assembly Language for Intel-Based Computers, NOT AND OR XOR NAND NOR Truth Tables Boolean Operators.

Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.

Chapter 10 (Part 2): Boolean Algebra  Logic Gates (10.3) (cont.)  Minimization of Circuits (10.4)

1 Boolean Algebra & Logic Gates. 2 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple.

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

Week 6: Gates and Circuits: PART I READING: Chapter 4.

4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.

Universal college of engineering & technology. .By Harsh Patel)

1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.

Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.

BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.

Lecture 21: Combinatorial Circuits II Discrete Mathematical Structures: Theory and Applications.

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.

LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.

Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 

Logic Gates Learning Objectives Learn that there is a one-to-one relationship between logic gates and Boolean expressions Learn how logic gates are combined.

Chapter 12. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads)

Dr.Ahmed Bayoumi Dr.Shady Elmashad

CHAPTER 3 Simplification of Boolean Functions

ECE 3130 Digital Electronics and Design

Logic Gates and Boolean Algebra

Minimization of Circuits

ECE 2110: Introduction to Digital Systems

Lecture #6 EGR 277 – Digital Logic

Boolean algebra and Logic Circuits Chapter 5

Combinational Circuits

Computer Architecture CST 250

Fundamentals & Ethics of Information Systems IS 201

XOR, XNOR, and Binary Adders

Reading: Hambley Chapters

Chapter 4 Gates and Circuits.

Karnaugh Maps (K-Maps)

CS105 Introduction to Computer Concepts GATES and CIRCUITS

Computer Science 210 Computer Organization

Logic Gates L Al-zaid Math110.

Schematics 201 Lecture Topic: Electrical Symbols

FIGURE 4.1 Block diagram of combinational circuit

XOR, XNOR, & Binary Adders

Week 7: Gates and Circuits: PART II

Reading: Hambley Ch. 7 through 7.5

Lecture 20: Combinatorial Circuits I

13 Digital Logic Circuits.

ECB2212-Digital Electronics K-Map

DISCRETE COMPUTATIONAL STRUCTURES

DIGITAL ELECTRONICS B.SC FY

Logic Gates Dr.Halimah Alshehri.

XOR, XNOR, and Binary Adders

XOR Function Logic Symbol  Description  Truth Table 

Adder Circuits By: Asst Lec. Basma Nazar

XOR, XNOR, and Binary Adders

Chapter 11 (Part 2): Boolean Algebra

Logic Gates By: Asst Lec. Besma Nazar Nadhem

Presentation transcript:

Chapter 10.3 and 10.4: Combinatorial Circuits Discrete Mathematical Structures: Theory and Applications

Learning Objectives Explore the application of Boolean algebra in the design of electronic circuits Learn the application of Boolean algebra in switching circuits Discrete Mathematical Structures: Theory and Applications

Logical Gates and Combinatorial Circuits Discrete Mathematical Structures: Theory and Applications

Logical Gates and Combinatorial Circuits Discrete Mathematical Structures: Theory and Applications

Logical Gates and Combinatorial Circuits Discrete Mathematical Structures: Theory and Applications

Logical Gates and Combinatorial Circuits In circuitry theory, NOT, AND, and OR gates are the basic gates. Any circuit can be designed using these gates. The circuits designed depend only on the inputs, not on the output. In other words, these circuits have no memory. Also these circuits are called combinatorial circuits. The symbols NOT gate, AND gate, and OR gate are also considered as basic circuit symbols, which are used to build general circuits. The word circuit instead of symbol is also used. Discrete Mathematical Structures: Theory and Applications

Logical Gates and Combinatorial Circuits Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Examples 2 and 3, p. 714 Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Logical Gates and Combinatorial Circuits The diagram in Figure 12.32 represents a circuit with more than one output. Discrete Mathematical Structures: Theory and Applications

A half adder is a circuit that accepts as input two binary digits x and y, and produces as output the sum bit s and the carry bit c. Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Logical Gates and Combinatorial Circuits A NOT gate can be implemented using a NAND gate (see Figure 12.36(a)). An AND gate can be implemented using NAND gates (see Figure 12.36(b)). An OR gate can be implemented using NAND gates (see Figure12.36(c)). Discrete Mathematical Structures: Theory and Applications

Logical Gates and Combinatorial Circuits Any circuit which is designed by using NOT, AND, and OR gates can also be designed using only NAND gates. Any circuit which is designed by using NOT, AND, and OR gates can also be designed using only NOR gates. Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Logical Gates and Combinatorial Circuits The Karnaugh map, or K-map for short, can be used to minimize a sum-of-product Boolean expression. Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications

Logical Gates and Combinatorial Circuits First mark the 1s that cannot be paired with any other 1. Put a circle around them. Next, from the remaining 1s, find the 1s that can be combined into two square blocks, i.e., 1 x 2 or 2 x 1 blocks, and in only one way. Next, from the remaining 1s, find the 1s that can be combined into four square blocks, i.e., 2 x 2, 1 x 4, or 4 x 1 blocks, and in only one way. Next, from the remaining 1s, find the 1s that can be combined into eight square blocks, i.e., 2 x 4 or 4 x 2 blocks, and in only one way. Next, from the remaining 1s, find the 1s that can be combined into 16 square blocks, i.e., a 4 x 4 block. (Note that this could happen only for Boolean expressions involving four variables.) Finally, look at the remaining 1s, i.e., the 1s that have not been grouped with any other 1. Find the largest blocks that include them. Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications