Digital Logic Design Basics Combinational Circuits Sequential Circuits.

Slides:



Advertisements
Similar presentations
Switching circuits Composed of switching elements called “gates” that implement logical blocks or switching expressions Positive logic convention (active.
Advertisements

Basics Combinational Circuits Sequential Circuits
Logic Gates.
Logic Gates.
CT455: Computer Organization Logic gate
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
Boolean Algebra and Logic Gate
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
by Prof. Dr. Ali S. Hennache
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
Chapter 2: Fundamentals of Digital Electronics Dr Mohamed Menacer Taibah University
Digital Logic Basics Chapter 2 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 
1 Boolean Algebra & Logic Gates. 2 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /05/2013 Lecture 4: Basics of Logic Design Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER.
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.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Gates and Logic Dr John Cowell phones off (please)
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
Chapter-3: BOOLEAN ALGEBRA & LOGIC GATES Analysis and logical design.
Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals.
Logic Gates Ghader Kurdi Adapted from the slides prepared by DEPARTMENT OF PREPARATORY YEAR.
CHAPTER 5 Combinational Logic Analysis
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
Logic Gates and Boolean Algebra Introduction to Logic II.
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.
Computer Architecture & Operations I
Computer Architecture & Operations I
Boolean Algebra & Logic Gates
Dr. Ameria Eldosoky Discrete mathematics
Chapter 5 Combinational Logic 组合逻辑
Digital Logic.
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Morgan Kaufmann Publishers
Logic Gates and Boolean Algebra
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
EI205 Lecture 5 Dianguang Ma Fall 2008.
CSCI-100 Introduction to Computing
Exclusive OR Gate.
Basic Logical Operations (Fascinating)
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Digital Signals Digital Signals have two basic states:
Basic Digital Logic Basic Gates
Principles & Applications
Dr. Clincy Professor of CS
Basics Combinational Circuits Sequential Circuits
Basics Combinational Circuits Sequential Circuits Ahmad Jawdat
Karnaugh Maps (K-Maps)
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan
Dr. Clincy Professor of CS
Schematics 201 Lecture Topic: Electrical Symbols
Week 7: Gates and Circuits: PART II
CS Chapter 3 (3A and ) Part 3 of 8
Logic Gates.
CSC 220: Computer Organization Logic Gates and Functions
Logic Gates.
KS4 Electricity – Electronic systems
CS Chapter 3 (3A and ) – Part 2 of 5
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Chapter 4 Gates and Circuits.
Chapter 2 Gates.
Logic Gates By: Asst Lec. Besma Nazar Nadhem
What are Logic Gates?.
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Digital Logic Design Basics Combinational Circuits Sequential Circuits

Introduction to Digital Logic Basics Hardware consists of a few simple building blocks. These are called logic gates: AND, OR, NOT, NAND, NOR, XOR, … Logic gates are built using transistors. NOT gate can be implemented by a single transistor. AND gate requires 3 transistors

Transistors are the fundamental devices Pentium consists of 3 million transistors Compaq Alpha consists of 9 million transistors Now we can build chips with more than 100 million transistors

Basic Concepts AND gate symbol and truth table

OR gate symbol and truth table

NOT gate symbol and truth table

Basic Concepts (cont.) Additional useful gates : NAND, NOR, XOR NAND = AND + NOT

Basic Concepts (cont.) NOR = OR + NOT

Basic Concepts (cont.) XOR implements exclusive-OR function

Basic Concepts (cont.) Proving NAND gate is universal

Basic Concepts (cont.) Proving NOR gate is universal

Logic Functions Logical functions can be expressed in several ways: -Truth table. -Logical expressions. -Graphical form.

Logic Functions (cont.) Example: Majority function -The Output is one whenever majority of inputs is 1. -We use 3-input majority function

Logical Equivalence

Logical Equivalence (cont.) Proving logical equivalence of two circuits -Derive the logical expression for the output of each circuit. -Show that these two expressions are equivalent. -Two ways:

Logical Equivalence (cont.) 1- You can use the truth table method. -For every combination of inputs, if both expressions yield the same output, they are equivalent -Good for logical expressions with small number of variables. 2- You can also use algebraic manipulation -Need Boolean identities

Logical Equivalence (cont.) Derivation of logical expression from a circuit -Trace from the input to output -Ex: Write down intermediate logical expressions along the path

Logical Equivalence (cont.)