TTL Voltage Levels LOW HIGH Power Supply Range

Slides:

Advertisements

Similar presentations

Basic Logic Gates Discussion D5.1 Section Sections 13-3, 13-4.

Advertisements

Chapter 3 Logic Gates and Boolean Algebra – Part 1

Chap. 3 Logic Gates and Boolean Algebra

L14: Boolean Logic and Basic Gates

Types of Logic Circuits

CSE 20 Lecture 9 Boolean Algebra: Theorems and Proofs CK Cheng April 26, 2011 Lecture notes 1.

CSIS 3510 Computer Organization and Architecture Topics covered in this lecture: –Review of De’Morgan’s Theorem –Using De’Morgan’s Theorem –Building a.

Morgan Kaufmann Publishers

Logical Systems Synthesis.

Introduction Digital Electronics Logic Gates De Morgan’s Theorem

Boolean Algebra and Reduction Techniques

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.

3.1 Logic Signals and Gates Logic Signals ReturnNext  Logic Value: Many physical quantities can be represented two possible numbers or logic values —

Boolean Algebra. Introduction 1854: Logical algebra was published by George Boole  known today as “Boolean Algebra” 1854: Logical algebra was published.

Logic Gates Circuits to manipulate 0’s and 1’s. 0’s and 1’s used for numbers Also to make decisions within the computer. In that context, 1 corresponds.

Digital Logic Design ESGD2201

Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.

Digital Systems Presented by Prof Tim Johnson

CHAPTER 2 Boolean Algebra

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.

CS1502 Formal Methods in Computer Science

Digital Systems: Boolean Algebra and Logic Gates

Module 4.  Boolean Algebra is used to simplify the design of digital logic circuits.  The design simplification are based on: Postulates of Boolean.

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.

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.

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

Laws (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose.

CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC

Brief Introduction to Boolean Algebra We can use transistors to build AND, OR, NAND, NOR, and Invertors Manufacturing is simplified with NAND/NOR NAND/NOR.

Boolean Algebra and Reduction Techniques

Boolean Algebra and Logic Gates

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,

CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.

CEC 220 Digital Circuit Design Boolean Algebra II Fri, Sept 4 CEC 220 Digital Circuit Design Slide 1 of 13.

Boolean Algebra ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.

Chapter 5 Boolean Algebra and Reduction Techniques 1.

CSE 461. Binary Logic Binary logic consists of binary variables and logical operations. Variables are designated by letters such as A, B, C, x, y, z etc.

LOGIC GATE TIMING DIAGRAM.

Eng. Mai Z. Alyazji October, 2016

Digital Technology.

14:332:231 DIGITAL LOGIC DESIGN Boolean Algebra

Boolean Algebra & De Morgan's Theorems

Logic Gates and Boolean Algebra

CHAPTER 2 Boolean Algebra

CHAPTER 1 : INTRODUCTION

CHAPTER 2 Boolean Algebra This chapter in the book includes:

Boolean Algebra.

FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA

CHAPTER 2 Boolean Algebra

Boolean Algebra & Logic Circuits

Boolean Algebra.

CSE 370 – Winter Combinational Logic - 1

Number Systems Decimal (base 10) { }

Boolean Algebra.

Simplifying Algebraic Expressions

Boolean Algebra.

Chapter 2 Introduction to Logic Circuits

Discussion D5.1 Section Sections 13-3, 13-4

Chapter 2 Gates.

Design of Digital Circuits Lab 1 Supplement: Drawing Basic Circuits

Department of Electronics

Agenda Lecture Content: Combinatorial Circuits Boolean Algebras

Boolean Algebra S.SADHISH PRABHU.

Presentation transcript:

TTL Voltage Levels LOW HIGH 0 0.8 2 2.4 5 8 Power Supply Range 0 0.8 2 2.4 5 8 Typical choice Power Supply Range Ideal: LOW = 0V and HIGH = Power Supply A non-ideal input will not degrade the output.

The Simplest “Gates” useless BUF NOT (INV) A Q In = A Out = Q T F Q = F In = A Out = Q T F Q = A BUF NOT (INV) In = A Out = Q T F Q = opposite of A In = A Out = Q T F Q = T

Multiple Gates: Known Inputs 1

Multiple Gates: Known Inputs B C D E 1 Z

Multiple Gates: Expressions Q C B A

Multiple Gates: Expressions Q C B A

Green are just like number algebra Boolean Algebra Rules Green are just like number algebra Rules with Constants Idempotent Complementary Involution Commutative Associative “distribute &” “factor &” “distribute |” “factor |” Distributive & FOIL | FOIL

Not at all like numbers… Boolean Algebra Rules Not at all like numbers… extra & extra OR extra NOT in OR extra NOT in & DeMorgan’s Theorems

DeMorgan Relationships

DeMorgan Relationships

Calling All NANDs B A C A B C A B C

Calling All NANDs B A C B A C B A C

Calling All NORs? Sometimes all NORs is better, sometimes all NANDs is better