Digital Technology.

Slides:



Advertisements
Similar presentations
Logic Gates A logic gate is an elementary building block of a digital circuit Most logic gates have two inputs and one output At any given moment, every.
Advertisements

Logic Gates.
Logic Gates.
CT455: Computer Organization Logic gate
L14: Boolean Logic and Basic Gates
Digital Electronics Lecture 2 Logic Gates. Lecture 2 outline Announcement:
Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
Types of Logic Circuits
Universal Gates Sum of Products Products of Sum
Boolean Algebra and Logic Gate
Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.
1 Boolean Algebra & Logic Design. 2 Developed by George Boole in the 1850s Mathematical theory of logic. Shannon was the first to use Boolean Algebra.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
GK-12 Student designed project (AP physics) Digital logic and Boolean algebra exercise. IC logic gates brought from Stevens were used in making simple.
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
Lecture 17: Digital Design Today’s topic –Intro to Boolean functions Reminders –HW 4 due Wednesday 10/8/2014 (extended) –HW 5 due Wednesday 10/15/2014.
Fall 2012: FCM 708 Foundation I Lecture 2 Prof. Shamik Sengupta
Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.
 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.
Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Boolean Algebra & Logic Prepared by Dr P Marais (Modified by D Burford)
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
LOGIC GATES AND CIRCUITS Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND, NOR, EXOR and EXNOR gates.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 2.
CEC 220 Digital Circuit Design Boolean Algebra Friday, January 17 CEC 220 Digital Circuit Design Slide 1 of 22.
5 - Digital Logic with Boolean Algebra
Chapter 4 Fundamentals of Computer Logic 1 Chapter 4: Fundamental of Computer Logic - IE337.
CEC 220 Digital Circuit Design Boolean Algebra II Fri, Sept 4 CEC 220 Digital Circuit Design Slide 1 of 13.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
Hoda Roodaki Boolean Algebra Hoda Roodaki
Logic gates.
Computer Architecture & Operations I
Computer Architecture & Operations I
Homework Reading Machine Projects Labs
Morgan Kaufmann Publishers
Department of Preparatory Year, Umm Al Qura University
Logic Gates and Boolean Algebra
Homework Reading Machine Projects Labs
Logic Gates and Boolean Algebra
CHAPTER 2 Boolean Algebra
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
Digital Logic.
Boolean Algebra.
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Digital Signals Digital Signals have two basic states:
Jeremy R. Johnson Wed. Sept. 29, 1999
Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan
CSE 311 Foundations of Computing I
Boolean Algebra & Logic Circuits
Agenda – 2/12/18 Questions? Readings: CSI 4, P
Elec 2607 Digital Switching Circuits
Logic Gates.
Boolean Algebra.
Logic Gates.
Boolean Algebra.
Logic Gates.
KS4 Electricity – Electronic systems
Logic Gates.
Chapter 4 Gates and Circuits.
Chapter 2 Gates.
Truth tables Mrs. Palmer.
Department of Electronics
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Digital Technology

Outline Week 1: Logic Gates, Boolean Algebra and Intro to HDL Week 2: Multi-level Gate Networks and Combinational Circuits Week 3: Propagation Delays and Hazards Week 4: Flips-Flops and Sequential Circuits Week 5: FSM and Revision Week 6 Test

Some Details First test: First assignment submission: First week after mid-semester First assignment submission: Friday 30 April Lecture notes are available on Moodle

Lecture Outline Logic and Logic Gates Boolean identities Truth tables Algebraic expressions Boolean identities Boolean algebra

Positive and Negative Logic If the signal that activates the circuit (the “1” state) has a voltage level that is more positive than the 0 state, then the logic polarity is considered to be POSITIVE If the signal that activates the circuit (the “1” state) has a voltage level that is more negative than the 0 state, then the logic polarity is considered to be NEGATIVE

Examples of Logic Polarity Positive logic Active signal Compliment TRUE FALSE 1 HIGH: +5 volts LOW: 0 volts Negative logic HIGH: 0 volts LOW: -5 volts

A Simple Circuit A X 1 (input) (output)

NOT Gate (Inverter) A X 1

AND Gate A B X 1

OR Gate A B X 1

NAND Gate A B X 1

NOR Gate A B X 1

XOR Gate (eXclusive OR) B X 1

XNOR Gate A B X 1

Boolean Algebra 1854 George Boole introduced a systematic approach to logic Hence Boolean Algebra 1938 C.E. Shannon introduced a two-valued Boolean algebra called switching algebra Bistable electrical circuits can expressed using this algebra

Null Law (AND) A B X 1

Null Law (OR) A B X 1

Identity Law (AND) A B X 1

Identity Law (OR) A B X 1

Idempotent Law (AND) A B X 1

Idempotent Law (OR) A B X 1

Inverse Law (AND) A B X 1

Inverse Law (OR) A B X 1

Commutative Law

Associative Law (AND) Note: same for the OR form

Distributive Law

Absorption Law

DeMorgan’s Law Change the sign (AND to OR, OR to AND) Invert the individual terms Invert the whole expression (tidy up any multiple inversions)

DeMorgans Law (hints) Use it: when you need to change the logical operation (product-of-sums for example) to get rid of any nasty inversions