Digital Circuits.

Slides:



Advertisements
Similar presentations
Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.
Advertisements

CDA 3100 Recitation Week 10.
Digital Circuits.
ECE 238L Computer Logic Design Spring 2010
Boolean Algebra and Reduction Techniques
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
Lecture 14 Today we will Learn how to implement mathematical logical functions using logic gate circuitry, using Sum-of-products formulation NAND-NAND.
CK Cheng Tuesday 10/2/02 CS 140 Lecture 2. Part I. Combinational Logic I) Specification –a. Language –b. Truth Table –c. Boolean Algebra –d. Incompletely.
4/11/03 Minute Paper How does MS window work? Like how do we have the screen on the computer. Is it just a bunch of Binary #’s representing colors? When.
Propositional Calculus Math Foundations of Computer Science.
Boolean Algebra and Logic Simplification
Logic Function Optimization. Combinational Logic Circuit Regular SOP and POS designs Do not care expressions Digital logic circuit applications Karnaugh.
Systems Architecture I1 Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they.
1 Fundamentals of Computer Science Propositional Logic (Boolean Algebra)
Chapter 3.5 Logic Circuits. How does Boolean algebra relate to computer circuits? Data is stored and manipulated in a computer as a binary number. Individual.
Boolean Algebra and Digital Circuits
F = ∑m(1,4,5,6,7) F = A’B’C+ (AB’C’+AB’C) + (ABC’+ABC) Use X’ + X = 1.
Chapter 10 (Part 2): Boolean Algebra  Logic Gates (10.3) (cont.)  Minimization of Circuits (10.4)
1 Digital Logic Design Week 5 Simplifying logic expressions.
Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
Digital Electronics Lecture 6 Combinational Logic Circuit Design.
Chapter 3: Digital Logic Dr Mohamed Menacer Taibah University
Digital Logic. 2 Abstractions in CS (gates) Basic Gate: Inverter IO IO GNDI O Vcc Resister (limits conductivity) Truth Table.
The Karnaugh Map.
Computer Systems 1 Fundamentals of Computing Simplifying Boolean Expressions.
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
The Karnaugh Map. K-map rules Draw the K-map. Remember to make sure that the adjacent rows/columns differ by only one bit. According to the truth table,
Karnaugh Maps (K-Maps)
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
THE K-MAP.
C.S.Choy39 TERMINOLOGY Minterm –product term containing all input variables of a function in either true or complementary form Maxterm – sum term containing.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
Karnaugh Map. Simplifying Digital Circuits Reconsider the 1-bit full adder. The carry bit is But we can implement the function with a much simpler circuit:
K-maps and Decoders Prof. Sin-Min Lee Department of Computer Science.
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.
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Digital Logic.
CHAPTER 3 Simplification of Boolean Functions
Department of Preparatory Year, Umm Al Qura University
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
CHAPTER 1 : INTRODUCTION
Boolean Expressions Lecture No. 10.
Computer Architecture CST 250
Digital Logic and Design
Karnaugh Maps (K-Maps)
Instructor: Alexander Stoytchev
Digital Circuits.
BASIC & COMBINATIONAL LOGIC CIRCUIT
Instructor: Alexander Stoytchev
Karnaugh Maps Topics covered in this presentation: Karnaugh Maps
Week 7: Gates and Circuits: PART II
Digital Logic.
Reading: Hambley Ch. 7 through 7.5
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
ECB2212-Digital Electronics K-Map
Digital Logic.
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Instructor: Alexander Stoytchev
Special Gates Combinational Logic Gates
XOR Function Logic Symbol  Description  Truth Table 
Digital Circuits.
Laws & Rules of Boolean Algebra
Chapter 2 Digital Design and Computer Architecture, 2nd Edition
Chapter 11 (Part 2): Boolean Algebra
Carryout bit? Carryout bit is ‘1’ also on four cases. When a, b and carryin are 110, 101, 011, 111. Does it mean that we need a similar circuit as sum?
Digital Logic Design.
Computer Architecture
Digital Circuits.
Reading: Hambley Ch. 7 through 7.5
Presentation transcript:

Digital Circuits

Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every input combination, figure out what an output bit should be, and write them down in a table.

Review – From the truth table to circuits Any truth table can be translated into a circuits consisting of several and gates followed by one or gate. It means that any function can be implemented in this way Call a row in the truth table in which the output is `1’ a ``true row’’ and the input combination in this row a ``true input combination’’ or just a ``true combination.’’ Each and gate corresponds to one ``true row’’ in the truth table. The and gate should output a `1’ if and only if the input combination is the same as this row. If all other cases, the output of this and gate is `0.’ So, whenever the input combination is the same as one of the ``true combinations,’’ one of the and gates outputs ``1’’, so the output of the or gate is 1. If the input combination is not the same as any of the ``true combinations,’’ none of the and gates will output a ``1’’, so the output of the or gate is 0.

6/16/2019 Logic Functions Drawing circuits is … Usually we express logic functions using logic equations which are more succinct and carry the same information The OR operator is written as +, as in A + B. The AND operator is written as ·, as A · B. The unary operator NOT is written as or A’. Remember: This is NOT the binary field. Here 0+0=0, 0+1=1+0=1, 1+1=1. CDA3100 week08-5.ppt

Logic functions For example, the sum in the one-bit full adder is From a logic function you can immediately know what the circuit looks like. Truth table == Circuits == Logic function, equivalent. So we are going to get familiar with getting the logic functions from the truth table

Problems Ex 1. Assume that X consists of 3 bits, x2 x1 x0. Write a logic function that is true if and only if X contains only one 0

EX 1 X2 X1 X0 output 1

EX 1 X2 X1 X0 output 1

Ex 1 Output = x2x1x0’ + x2x1’x0 + x2’x1x0

Ex 2 Assume that X consists of 3 bits, x2 x1 x0. Write a logic functions that is true if and only if X contains an even number of 0s.

EX 2 X2 X1 X0 output 1

EX 2 X2 X1 X0 output 1

Ex 2 Output = x2x1’x0’ + x2’x1’x0 + x2’x1x0’+ x2x1x0

Ex 3 Assume that X consists of 3 bits, x2 x1 x0. Write a logic functions that is true if and only if X when interpreted as an unsigned binary number is no less than 5.

Ex 3 X2 X1 X0 output 1

Ex 3 X2 X1 X0 output 1

Ex 3 Output = x2x1’x0 + x2x1x0’+ x2x1x0

In class exercises 1 Assume that X consists of 3 bits, x2 x1 x0. Write a logic functions that is true if and only if X when interpreted as an unsigned binary number is less than 4.

In class exercises 2 Implement a circuit with three inputs (X2, X1, X0), and one output O. O should be 1 only when X2, X1, X0 are representing an odd binary number.

The Karnaugh Map

K-map rules Draw the K-map. Remember to make sure that the adjacent rows/columns differ by only one bit. According to the truth table, write 1 in the boxes. Draw a circle around a rectangle with all 1s. The rectangle must have size 1,2,4,8,16…Then, reduce the terms by writing down the variables whose values do not change. For example, if there is a rectangle with two 1s representing ab’c’ and ab’c, you write a term as ab’. Note that A term may be covered in multiple circles! The rectangle can wrap-around! Simplify to the simplest circuits possible: Try to get a circle as large as possible. Try to get the minimum number of circles.

Simplifying Digital Circuits Reconsider the 1-bit full adder. The carry bit is But we can implement the function with a much simpler circuit: How to get there?

K-map for CO K-map CO = ab + ac + bc ab c 00 01 11 10 1 1

K-map for exercise 1 K-map Y = X2’ x2x1 x0 00 01 11 10 1 1

K-map for exercise 2 K-map Y = X0 x2x1 x0 00 01 11 10 1 1

Simplifying digital circuit There are many methods. Using boolean algebra Using K-map By just being really smart…

6/16/2019 Boolean Algebra Laws A+A=A, A*A=A CDA3100 week09-1.ppt

Boolean Algebra To use Boolean algebra, note that CO= abc’+ab’c+a’bc+abc Now, abc’+abc=ab(c’+c)=ab. ab’c+abc=ac(b’+b)=ac a’bc+abc=bc(a’+a)=bc We used term abc three times because abc=abc+abc+abc!

K-map It is actually more convenient to use K-map to simplify digital circuits. K-map is a very mechanical procedure. Nothing fancy. It basically uses two rules: A+A=A, and AB+AB’=A.

K-map F=a’bc’+a’bc+a’b’c+ab’c ab c 00 01 11 10 1 1

K-map F=a’bc’+a’bc+a’b’c+ab’c F=a’b+b’c ab c 00 01 11 10 1 1

K-map F=a’bc’+a’bc+abc’+abc+a’b’c ab c 00 01 11 10 1 1

K-map F=a’bc’+a’bc+abc’+abc+a’b’c F=b+a’c ab c 00 01 11 10 1 1

K-map F=a’bc’d+a’bcd+abc’d+abcd+a’b’c’d+abcd’ ab cd 00 01 11 10 00 1

K-map F=a’bc’d+a’bcd+abc’d+abcd+a’b’c’d+abcd’ F=bd+a’c’d+abc ab cd 00 01 11 10 00 1 01 11 10