Transistors and Logic Circuits

Slides:

Advertisements

Similar presentations

Advertisements

Computer Science 210 Computer Organization Introduction to Logic Circuits.

Programmable Logic Controllers.

Combinational Logic Word Problems

Morgan Kaufmann Publishers

ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.

Appendix A Logic Circuits. Logic circuits Operate on binary variables that assume one of two distinct values, usually called 0 and 1 Implement functions.

Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.

Faculty of Computer Science © 2006 CMPUT 229 Digital Logic From Switches to Memories.

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

Combinational Logic Design Process

UNIT-8 LOGIC GATES.

CS 210.  How do we represent data in a computer? ◦ Easy to recognize two conditions:  1. Presence of a voltage – we’ll call this state “1”  2. Absence.

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:

LOGIC GATES Logic generally has only 2 states, ON or OFF, represented by 1 or 0. Logic gates react to inputs in certain ways. Symbol for AND gate INPUT.

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.

Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.

NOCTI Review Lesson 4 Objectives:

Logic Gates. Transistors as Switches ¡EB voltage controls whether the transistor conducts in a common base configuraiton. ¡Logic circuits can be built.

Transistors and Logic Circuits. Transistor control voltage in voltage out control high allows current to flow -- switch is closed (on) control low stops.

Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.

Quiz What are the results of the following 4-bit bitwise logical operations? NOT OR NOR AND

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.

Exclusive OR Gate. Logically, the exclusive OR (XOR) operation can be seen as either of the following operations:exclusive OR (XOR) 1. A AND NOT B OR.

Gates and Logic Dr John Cowell phones off (please)

Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.

NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions

NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions ECE 301 – Digital Electronics.

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,

CMOS Logic Gates. NMOS transistor acts as a switch 2 When gate voltage is 0 V No channel is formed current does not flow easily “open switch” When gate.

AND Gate Inputs Output Input A (Switch) Input B (Switch) Output Y (Lamp) 0 (Open) 0 (OFF) A B Lamp.

ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.

Digital electronics 4–1 Gates and Circuits SANJAYBHAI RAJGURU COLLEGE OF ENGG.

CHAPTER 13 Digital Logic Circuits. Figure Voltage analog of internal combustion engine in-cylinder pressure Figure 13.1.

Appendix C Basics of Logic Design. Appendix C — Logic Basic — 2 Logic Design Basics §4.2 Logic Design Conventions Objective: To understand how to build.

Dr. Ameria Eldosoky Discrete mathematics

Draw input and output characteristic of a transistor in CB mode

Eng. Mai Z. Alyazji October, 2016

Logic Gates and Boolean Algebra

Computer Architecture & Operations I

מבנה מחשב תרגול 3.

Transistors and Logic Circuits

Exclusive OR Gate.

Computer Architecture & Operations I

Digital Signals Digital Signals have two basic states:

Basic Digital Logic Basic Gates

Practice #Digital Logic Mr. Burleson

Computer Science 210 Computer Organization

Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan

Schematics 201 Lecture Topic: Electrical Symbols

Number Systems Decimal (base 10) { }

Digital Logic & Design Lecture 05

Waveforms & Timing Diagrams

JC Technology Logic Gates.

Boolean Algebra.

Week 7: Gates and Circuits: PART II

13 Digital Logic Circuits.

Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y

Digital Logic Experiment

Overview Last lecture Timing; Hazards/glitches

XOR Function Logic Symbol  Description  Truth Table 

FIGURE 5-1 MOS Transistor, Symbols, and Switch Models

Digital Logic Design Basics Combinational Circuits Sequential Circuits.

Presentation transcript:

Transistors and Logic Circuits

Transistor voltage in control high allows current to flow -- switch is closed (on) control low stops current flow switch is open (off) control voltage out

NOT Gate One transistor V (high voltage) 1 1 Out In In = high, switch is closed so current flows to ground Out is low. In = low, switch is open so current flows to Out Out is high.

NOR Gate Two transistors V (high voltage) Out In 1 In 1 = 1, Out = 0 In 2 = 1, Out = 0 In 2 In 1 = 0 In 2 = 0, Out = 1

NAND Gate Two transistors V (high voltage) Out In 1 In 1 = 1, In 2 = 1, Out = 0 In 2 In 1 = 1 In 2 = 0, Out = 1

AND Gate Three transistors V V (high voltage) Out In 1 In 2

Logic Gates In 0 1 Out AND Gate In 0 1 Out OR Gate In 0 1 Out XOR Gate NOT Gate In Out

Logic Circuit -- 4 input Multiplexor 0 1 1 Out 2 3 In Control 1 0

Logic Circuit Puzzle 1 8 bit Comparator Output 1 if A = B Otherwise 0 Input Binary Numbers A, B A1 B1 A2 B2 Out A3 B3 A4 B4 A5 B5 8 bit Comparator Output 1 if A = B Otherwise 0 A6 B6 A7 B7

Logic Circuit Puzzle 2 3 bit Decoder Select Output Line D0 D1 In 2 D2

Programmable Logic Array Any Logic Truth Table can be implemented Uses block of AND gates followed by block of OR gates Programmable once many times Used for implementing different circuits

Truth Table to Normal Form A B C expression 1 1 1 1 1 1 0 1 1 0 1 1 1 0 0 0 0 1 1 1 0 1 0 0 0 0 1 0 0 0 0 0 A and B and C A and B and ~C A and ~B and C ~A and B and C (A and B and C) or (A and B and ~C) or (A and ~B and C) or (~A and B and C)

PLA Input AND Gates Output OR Gates

PLA In 0 In 1 In 2 What is Out 1? Out 0 Out 1

Normal Form to Truth Table A B C expression 1 1 1 1 1 1 0 0 1 0 1 0 1 0 0 1 0 1 1 0 0 1 0 1 0 0 1 1 0 0 0 0 A and B and C Odd Parity A and ~B and ~C ~A and B and ~C ~A and ~B and C (A and B and C) or (A and ~B and ~C) or (~A and B and ~C) or (~A and ~B and C)

PLA, Alternate Representation AND Block uses DeMorgan Equivalence A and B = not (not A or not B) V OR Block uses direct or

PLA, Alternate Representation Unused A B C Outputs 1 2 Unused 3

PLA, Alternate Representation Burned out to disconnect

PLA "Don't Cares" A B C exp A B C exp 1 1 1 1 1 1 X 1 1 1 0 1 1 0 1 1 1 1 1 1 1 1 0 1 1 0 1 1 1 0 0 0 0 1 1 1 0 1 0 0 0 0 1 0 0 0 0 0 A B C exp 1 1 X 1 1 0 1 1 1 0 0 0 0 1 1 1 0 1 0 0 0 0 1 0 0 0 0 0 X = Don't Care

PLA "Don't Cares" Reduce number of PLA lines used for expression A B C