Embedded Systems. Copyright 2000 Ken Arnold 1. Outline. Embedded Hardware. Fluid Flow Analogies. Schematic Conventions. Voltage = Pressure

Size: px
Start display at page:

Download "Embedded Systems. Copyright 2000 Ken Arnold 1. Outline. Embedded Hardware. Fluid Flow Analogies. Schematic Conventions. Voltage = Pressure"

Transcription

1 Embedded Hardware Background: Electronics & Digital Logic Ken Arnold Outline Electronic Schematic Conventions Basic Electronics & Logic Circuit Concepts Fluid Flow Analogies Transistors, Switches Logic Symbols Boolean Algebra Timing Diagram and Notation Copyright 2006 Ken Arnold 1 Copyright Ken Arnold 2 Schematic Conventions Flow is Left to Right: Inputs on Left, Outputs on Right Arrows Show Positive Current Flow As opposed to electron flow Black Dots on Crossing => Connection Fluid Flow Analogies Voltage is like fluid Pressure (Volts) Current is like fluid Flow Rate (Amps) Resistance is like an Aperture (Ohms) Limits Current Flow Power Dissipation (Watts) Copyright Ken Arnold 3 Copyright Ken Arnold 4 Basic Circuit Concepts Voltage = Pressure Voltage, Current, Resistance Ohm s Law: V = I * R Power Dissipation: P = I*V = I 2 *R = V 2 /R Equivalent Fluid Circuit Analogies for: Diode Switch Transistors Copyright Ken Arnold 5 Copyright Ken Arnold 6 Copyright 2000 Ken Arnold 1

2 Resistance = Restriction Complete Circuit Ohm s Law: Note that V and E are both used to represent voltage Copyright Ken Arnold 7 Copyright Ken Arnold 8 Diode Analogy Diode Analogy Copyright Ken Arnold 9 Copyright Ken Arnold 10 Simple Switch Transistor Switch NPN BJT SPST switch Shown Open (Off) Off==Open On==Closed SPST==Single Position Single Throw Copyright Ken Arnold 11 Copyright Ken Arnold 12 Copyright 2000 Ken Arnold 2

3 Circuit Simplification Kirchoff s Laws I Bat =? V Bat = 3.3V I R1 =? R2 I R2 =? R1 + V R1 =? - R3 I R3 =? V=? Sum of Currents Into a Node = 0 Sum of Voltages Around a Loop = 0 Series Rs: Ra, Rb Requiv = Ra + Rb Parallel Rs: Requiv = 1/(1/Ra+1/Rb) IBat=? VBat= 3.3V IR1=? R2 IR2=? R1 + - VR1=? R3 IR3=? V=? Copyright Ken Arnold 13 Copyright Ken Arnold 14 Simplify Combine Parallel R Simplify Combine Series R V Bat = 3.3V R1 R total = R1 + R eq = 3.3K V= (R eq / (R1 + R eq ))*V Bat = (1.1/3.3)*3.3 = 1.1V R eq = R2 R3 = 1/((1/R2)+(1/R3)) = 1.1K Copyright Ken Arnold 15 Copyright Ken Arnold 16 Example Circuit - Solved Transistor Inverter 1->0 I Bat = 1mA V Bat = 3.3V I R1 = 1mA R2 I R2 = 0.5mA R1 + V R1 = 1mA* - = 2.2V R3 V= 1.1V I R3 = 1.1V/ = 0.5mA Copyright Ken Arnold 17 Copyright Ken Arnold 18 Copyright 2000 Ken Arnold 3

4 Transistor Inverter 0->1 NMOS Inverter Copyright Ken Arnold 19 Copyright Ken Arnold 20 CMOS Inverter Common Logic Symbols Copyright Ken Arnold 21 Copyright Ken Arnold 22 Inverted Output Symbols Boolean Algebra Similar to Algebra Identities Associative Commutative Distributive Simplification Notation OR = + = AND = = & NOT = x = -x Some New Rules Copyright Ken Arnold 23 Copyright Ken Arnold 24 Copyright 2000 Ken Arnold 4

5 Simplification Rules - 1 Simplification Rules - 2 a AND 0 = 0 a OR 0 = a a AND 1 = a a OR 1 = 1 Copyright Ken Arnold 25 Copyright Ken Arnold 26 Simplification Rules - 3 Idempotent Rules Simplification Rules - 4 Complementary Rules Copyright Ken Arnold 27 Copyright Ken Arnold 28 Simplification Rules - 5 Commutative Rules Involution Rule Copyright Ken Arnold 29 Copyright Ken Arnold 30 Copyright 2000 Ken Arnold 5

6 Associative Rules Distributive - 1 Copyright Ken Arnold 31 Copyright Ken Arnold 32 Distributive - 2 Simplification Copyright Ken Arnold 33 Copyright Ken Arnold 34 Simplification (cont d) DeMorgan Equivalence Copyright Ken Arnold 35 Copyright Ken Arnold 36 Copyright 2000 Ken Arnold 6

7 DeMorgan Equivalence 2 Notation Conventions Bubbles on Gates Mean Inverted Logic Alternative, Inverted Logic: DeMorgan Equivalents AND Inverted I/Os same as OR gate OR Inverted I/Os same as AND gate Copyright Ken Arnold 37 Copyright Ken Arnold 38 Tri-State Logic Timing Diagram Notation Copyright Ken Arnold 39 Copyright Ken Arnold 40 Timing Diagram Notation 2 Buses and Multiplexing Copyright Ken Arnold 41 Copyright Ken Arnold 42 Copyright 2000 Ken Arnold 7

8 Bus Timing Logic Output V vs. I Logic ONE: Logic ZERO: Copyright Ken Arnold 43 Copyright Ken Arnold 44 Summary Circuits & Logic Review Symbols and Notation Basic Circuit Concepts Fluid Flow Analogies Switches and Logic Boolean Algebra For more information: MIT Open Courseware: Circuits and Electronics Computational Structures Maxfield, BeBop to the Boolean Boogie Gonick, The Cartoon Guide to Physics Arnold, Embedded Controller Hardware Design Circuits: on-line references Copyright Ken Arnold 45 Copyright Ken Arnold 46 Copyright 2000 Ken Arnold 8

Variable, Complement, and Literal are terms used in Boolean Algebra.

Variable, Complement, and Literal are terms used in Boolean Algebra. We have met gate logic and combination of gates. Another way of representing gate logic is through Boolean algebra, a way of algebraically representing logic gates. You should have already covered the

More information

Combinational Circuits

Combinational Circuits Combinational Circuits Q. What is a combinational circuit? A. Digital: signals are or. A. No feedback: no loops. analog circuits: signals vary continuously sequential circuits: loops allowed (stay tuned)

More information

6. Combinational Circuits. Building Blocks. Digital Circuits. Wires. Q. What is a digital system? A. Digital: signals are 0 or 1.

6. Combinational Circuits. Building Blocks. Digital Circuits. Wires. Q. What is a digital system? A. Digital: signals are 0 or 1. Digital Circuits 6 Combinational Circuits Q What is a digital system? A Digital: signals are or analog: signals vary continuously Q Why digital systems? A Accurate, reliable, fast, cheap Basic abstractions

More information

Experiment 4 Boolean Functions Implementation

Experiment 4 Boolean Functions Implementation Experiment 4 Boolean Functions Implementation Introduction: Generally you will find that the basic logic functions AND, OR, NAND, NOR, and NOT are not sufficient to implement complex digital logic functions.

More information

Propositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson

Propositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus: Boolean Algebra and Simplification CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Topics Motivation: Simplifying Conditional Expressions

More information

Digital Fundamentals. Integrated Circuit Technologies

Digital Fundamentals. Integrated Circuit Technologies Digital Fundamentals Integrated Circuit Technologies 1 Objectives Determine the noise margin of a device from data sheet parameters Calculate the power dissipation of a device Explain how propagation delay

More information

Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions

Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions 1. Convert the following SOP expression to an equivalent POS expression. 2. Determine the values of A, B, C, and D that make

More information

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University Logic Design First Stage Lecture No.5 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Boolean Operations Laws of Boolean Algebra Rules of Boolean Algebra

More information

6.1 Combinational Circuits. George Boole ( ) Claude Shannon ( )

6.1 Combinational Circuits. George Boole ( ) Claude Shannon ( ) 6. Combinational Circuits George Boole (85 864) Claude Shannon (96 2) Signals and Wires Digital signals Binary (or logical ) values: or, on or off, high or low voltage Wires. Propagate digital signals

More information

Lecture (05) Boolean Algebra and Logic Gates

Lecture (05) Boolean Algebra and Logic Gates Lecture (05) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee ١ Minterms and Maxterms consider two binary variables x and y combined with an AND operation. Since eachv ariable may appear in either

More information

Henry Lin, Department of Electrical and Computer Engineering, California State University, Bakersfield Lecture 7 (Digital Logic) July 24 th, 2012

Henry Lin, Department of Electrical and Computer Engineering, California State University, Bakersfield Lecture 7 (Digital Logic) July 24 th, 2012 Henry Lin, Department of Electrical and Computer Engineering, California State University, Bakersfield Lecture 7 (Digital Logic) July 24 th, 2012 1 Digital vs Analog Digital signals are binary; analog

More information

How Do We Figure Out the Voltages and Currents?

How Do We Figure Out the Voltages and Currents? How Do We Figure Out the Voltages and Currents? Diode Solar Cell Li Bat Volt Conv R In this set of lecture notes we ll develop methods to analyze circuits. M. Horowitz, J. Plummer, R. Howe 2 Useless Box

More information

Objectives: - You need to be able to use the two equations above and the series and parallel circuit rules.

Objectives: - You need to be able to use the two equations above and the series and parallel circuit rules. F: Solve Complete Circuits Level 3 Prerequisite: Solve Ohm s Law and the Power Formula Points To: Solve Complete Circuit with Nontraditional Information Objectives: V = IR P = IV - Given a battery and

More information

CS8803: Advanced Digital Design for Embedded Hardware

CS8803: Advanced Digital Design for Embedded Hardware CS883: Advanced Digital Design for Embedded Hardware Lecture 2: Boolean Algebra, Gate Network, and Combinational Blocks Instructor: Sung Kyu Lim (limsk@ece.gatech.edu) Website: http://users.ece.gatech.edu/limsk/course/cs883

More information

Chap-2 Boolean Algebra

Chap-2 Boolean Algebra Chap-2 Boolean Algebra Contents: My name Outline: My position, contact Basic information theorem and postulate of Boolean Algebra. or project description Boolean Algebra. Canonical and Standard form. Digital

More information

Boolean Algebra. BME208 Logic Circuits Yalçın İŞLER

Boolean Algebra. BME208 Logic Circuits Yalçın İŞLER Boolean Algebra BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com 5 Boolean Algebra /2 A set of elements B There exist at least two elements x, y B s. t. x y Binary operators: +

More information

DIGITAL CIRCUIT LOGIC UNIT 7: MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES

DIGITAL CIRCUIT LOGIC UNIT 7: MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES DIGITAL CIRCUIT LOGIC UNIT 7: MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES 1 iclicker Question 13 Considering the K-Map, f can be simplified as (2 minutes): A) f = b c + a b c B) f = ab d + a b d AB CD

More information

Lecture 3: Binary Subtraction, Switching Algebra, Gates, and Algebraic Expressions

Lecture 3: Binary Subtraction, Switching Algebra, Gates, and Algebraic Expressions EE210: Switching Systems Lecture 3: Binary Subtraction, Switching Algebra, Gates, and Algebraic Expressions Prof. YingLi Tian Feb. 5/7, 2019 Department of Electrical Engineering The City College of New

More information

E40M. Solving Circuits using Nodal Analysis and EveryCircuit TM. M. Horowitz, J. Plummer, R. Howe 1

E40M. Solving Circuits using Nodal Analysis and EveryCircuit TM. M. Horowitz, J. Plummer, R. Howe 1 E40M Solving Circuits using Nodal Analysis and EveryCircuit TM M. Horowitz, J. Plummer, R. Howe 1 How Do We Figure Out the Voltages and Currents? Diode Solar Cell Li Bat Volt Conv R In this set of lecture

More information

Review. EECS Components and Design Techniques for Digital Systems. Lec 05 Boolean Logic 9/4-04. Seq. Circuit Behavior. Outline.

Review. EECS Components and Design Techniques for Digital Systems. Lec 05 Boolean Logic 9/4-04. Seq. Circuit Behavior. Outline. Review EECS 150 - Components and Design Techniques for Digital Systems Lec 05 Boolean Logic 94-04 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley Design flow

More information

Computer Organization and Levels of Abstraction

Computer Organization and Levels of Abstraction Computer Organization and Levels of Abstraction Announcements Today: PS 7 Lab 8: Sound Lab tonight bring machines and headphones! PA 7 Tomorrow: Lab 9 Friday: PS8 Today (Short) Floating point review Boolean

More information

01 Introduction to Digital Logic. ENGR 3410 Computer Architecture Mark L. Chang Fall 2006

01 Introduction to Digital Logic. ENGR 3410 Computer Architecture Mark L. Chang Fall 2006 Introduction to Digital Logic ENGR 34 Computer Architecture Mark L. Chang Fall 26 Acknowledgements Patterson & Hennessy: Book & Lecture Notes Patterson s 997 course notes (U.C. Berkeley CS 52, 997) Tom

More information

ENGIN 112 Intro to Electrical and Computer Engineering

ENGIN 112 Intro to Electrical and Computer Engineering ENGIN 2 Intro to Electrical and Computer Engineering Lecture 5 Boolean Algebra Overview Logic functions with s and s Building digital circuitry Truth tables Logic symbols and waveforms Boolean algebra

More information

Chapter 2. Boolean Expressions:

Chapter 2. Boolean Expressions: Chapter 2 Boolean Expressions: A Boolean expression or a function is an expression which consists of binary variables joined by the Boolean connectives AND and OR along with NOT operation. Any Boolean

More information

Propositional Calculus. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson

Propositional Calculus. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus

More information

UNIT 2 BOOLEAN ALGEBRA

UNIT 2 BOOLEAN ALGEBRA UNIT 2 BOOLEN LGEBR Spring 2 2 Contents Introduction Basic operations Boolean expressions and truth tables Theorems and laws Basic theorems Commutative, associative, and distributive laws Simplification

More information

Boolean Logic CS.352.F12

Boolean Logic CS.352.F12 Boolean Logic CS.352.F12 Boolean Algebra Boolean Algebra Mathematical system used to manipulate logic equations. Boolean: deals with binary values (True/False, yes/no, on/off, 1/0) Algebra: set of operations

More information

Propositional Calculus. Math Foundations of Computer Science

Propositional Calculus. Math Foundations of Computer Science Propositional Calculus Math Foundations of Computer Science Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they can use it to

More information

Gate-Level Minimization. section instructor: Ufuk Çelikcan

Gate-Level Minimization. section instructor: Ufuk Çelikcan Gate-Level Minimization section instructor: Ufuk Çelikcan Compleity of Digital Circuits Directly related to the compleity of the algebraic epression we use to build the circuit. Truth table may lead to

More information

Gate-Level Minimization. BME208 Logic Circuits Yalçın İŞLER

Gate-Level Minimization. BME208 Logic Circuits Yalçın İŞLER Gate-Level Minimization BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com Complexity of Digital Circuits Directly related to the complexity of the algebraic expression we use to

More information

Chapter 2. Boolean Algebra and Logic Gates

Chapter 2. Boolean Algebra and Logic Gates Chapter 2. Boolean Algebra and Logic Gates Tong In Oh 1 Basic Definitions 2 3 2.3 Axiomatic Definition of Boolean Algebra Boolean algebra: Algebraic structure defined by a set of elements, B, together

More information

6: Combinational Circuits

6: Combinational Circuits Computer Architecture 6: Combinational Circuits Previous two lectures. von Neumann machine. This lectures. Boolean circuits. Later in the course. Putting it all together and building a TOY machine. George

More information

Chapter 3. Boolean Algebra and Digital Logic

Chapter 3. Boolean Algebra and Digital Logic Chapter 3 Boolean Algebra and Digital Logic Chapter 3 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple logic circuits. Understand how

More information

CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012

CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012 CDA 3200 Digital Systems Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012 Outline Data Representation Binary Codes Why 6-3-1-1 and Excess-3? Basic Operations of Boolean Algebra Examples

More information

Incompletely Specified Functions with Don t Cares 2-Level Transformation Review Boolean Cube Karnaugh-Map Representation and Methods Examples

Incompletely Specified Functions with Don t Cares 2-Level Transformation Review Boolean Cube Karnaugh-Map Representation and Methods Examples Lecture B: Logic Minimization Incompletely Specified Functions with Don t Cares 2-Level Transformation Review Boolean Cube Karnaugh-Map Representation and Methods Examples Incompletely specified functions

More information

211: Computer Architecture Summer 2016

211: Computer Architecture Summer 2016 211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Direct - Mapping - Fully Associated - 2-way Associated - Cache Friendly Code Rutgers University Liu

More information

CS 61C: Great Ideas in Computer Architecture Introduction to Hardware: Representations and State

CS 61C: Great Ideas in Computer Architecture Introduction to Hardware: Representations and State CS 61C: Great Ideas in Computer Architecture Introduction to Hardware: Representations and State Instructors: Krste Asanović and Randy H. Katz http://inst.eecs.berkeley.edu/~cs61c/fa17 9/21/17 Fall 2017

More information

01 Introduction to Digital Logic. ENGR 3410 Computer Architecture Mark L. Chang Fall 2008

01 Introduction to Digital Logic. ENGR 3410 Computer Architecture Mark L. Chang Fall 2008 Introduction to Digital Logic ENGR 34 Computer Architecture Mark L. Chang Fall 28 Acknowledgements Patterson & Hennessy: Book & Lecture Notes Patterson s 997 course notes (U.C. Berkeley CS 52, 997) Tom

More information

DIGITAL ELECTRONICS. Vayu Education of India

DIGITAL ELECTRONICS. Vayu Education of India DIGITAL ELECTRONICS ARUN RANA Assistant Professor Department of Electronics & Communication Engineering Doon Valley Institute of Engineering & Technology Karnal, Haryana (An ISO 9001:2008 ) Vayu Education

More information

Combinational Circuits Digital Logic (Materials taken primarily from:

Combinational Circuits Digital Logic (Materials taken primarily from: Combinational Circuits Digital Logic (Materials taken primarily from: http://www.facstaff.bucknell.edu/mastascu/elessonshtml/eeindex.html http://www.cs.princeton.edu/~cos126 ) Digital Systems What is a

More information

Microcomputers. Outline. Number Systems and Digital Logic Review

Microcomputers. Outline. Number Systems and Digital Logic Review Microcomputers Number Systems and Digital Logic Review Lecture 1-1 Outline Number systems and formats Common number systems Base Conversion Integer representation Signed integer representation Binary coded

More information

SYNERGY INSTITUTE OF ENGINEERING & TECHNOLOGY,DHENKANAL LECTURE NOTES ON DIGITAL ELECTRONICS CIRCUIT(SUBJECT CODE:PCEC4202)

SYNERGY INSTITUTE OF ENGINEERING & TECHNOLOGY,DHENKANAL LECTURE NOTES ON DIGITAL ELECTRONICS CIRCUIT(SUBJECT CODE:PCEC4202) Lecture No:5 Boolean Expressions and Definitions Boolean Algebra Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary numbers i.e. 0 and 1. It is also called

More information

Lecture 10: Floating Point, Digital Design

Lecture 10: Floating Point, Digital Design Lecture 10: Floating Point, Digital Design Today s topics: FP arithmetic Intro to Boolean functions 1 Examples Final representation: (-1) S x (1 + Fraction) x 2 (Exponent Bias) Represent -0.75 ten in single

More information

Designing Information Devices and Systems II Spring 2018 J. Roychowdhury and M. Maharbiz Discussion 1A

Designing Information Devices and Systems II Spring 2018 J. Roychowdhury and M. Maharbiz Discussion 1A EEC 16B esigning Information evices and ystems II pring 2018 J. Roychowdhury and M. Maharbiz iscussion 1A 1 igit Bases (N) p is used to indicate that the number N is expressed in base p. For example, (N)

More information

LECTURE 4. Logic Design

LECTURE 4. Logic Design LECTURE 4 Logic Design LOGIC DESIGN The language of the machine is binary that is, sequences of 1 s and 0 s. But why? At the hardware level, computers are streams of signals. These signals only have two

More information

Boolean Algebra. P1. The OR operation is closed for all x, y B x + y B

Boolean Algebra. P1. The OR operation is closed for all x, y B x + y B Boolean Algebra A Boolean Algebra is a mathematical system consisting of a set of elements B, two binary operations OR (+) and AND ( ), a unary operation NOT ('), an equality sign (=) to indicate equivalence

More information

This presentation will..

This presentation will.. Component Identification: Digital Introduction to Logic Gates and Integrated Circuits Digital Electronics 2014 This presentation will.. Introduce transistors, logic gates, integrated circuits (ICs), and

More information

Designing Information Devices and Systems II Fall 2017 Miki Lustig and Michel Maharbiz Discussion 1B

Designing Information Devices and Systems II Fall 2017 Miki Lustig and Michel Maharbiz Discussion 1B EEC 16B esigning Information evices and ystems II Fall 2017 Miki Lustig and Michel Maharbiz iscussion 1B igit Bases (N) p is used to indicate that the number N is expressed in base p. For example, (N)

More information

Following the advice of breaking the longest (uppermost) bar first, I'll begin by breaking the bar covering the entire expression as a first step:

Following the advice of breaking the longest (uppermost) bar first, I'll begin by breaking the bar covering the entire expression as a first step: DeMorgans Theorems A mathematician named DeMorgan developed a pair of important rules regarding group complementation in Boolean algebra. By group complementation, I'm referring to the complement of a

More information

Combinational Devices and Boolean Algebra

Combinational Devices and Boolean Algebra Combinational Devices and Boolean Algebra Silvina Hanono Wachman M.I.T. L02-1 6004.mit.edu Home: Announcements, course staff Course information: Lecture and recitation times and locations Course materials

More information

Digital Techniques. Lecture 1. 1 st Class

Digital Techniques. Lecture 1. 1 st Class Digital Techniques Lecture 1 1 st Class Digital Techniques Digital Computer and Digital System: Digital computer is a part of digital system, it based on binary system. A block diagram of digital computer

More information

ece5745-pla-notes.txt

ece5745-pla-notes.txt ece5745-pla-notes.txt ========================================================================== Follow up on PAL/PROM/PLA Activity ==========================================================================

More information

Combinational Logic & Circuits

Combinational Logic & Circuits Week-I Combinational Logic & Circuits Spring' 232 - Logic Design Page Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other

More information

Embedded Controller Hardware Design

Embedded Controller Hardware Design Embedded Controller Hardware Design Designing Reliable Microcontroller Hardware for Real World Embedded Applications Ken Arnold Copyright 1999 by Ken Arnold All rights reserved Copyright 1999 Ken Arnold

More information

Unit-IV Boolean Algebra

Unit-IV Boolean Algebra Unit-IV Boolean Algebra Boolean Algebra Chapter: 08 Truth table: Truth table is a table, which represents all the possible values of logical variables/statements along with all the possible results of

More information

ericssonz LBI-38616B MAINTENANCE MANUAL FOR MTD TM SERIES AND DATA RADIO LOGIC BOARD 19D902151G3 DESCRIPTION CIRCUIT ANALYSIS TABLE OF CONTENTS

ericssonz LBI-38616B MAINTENANCE MANUAL FOR MTD TM SERIES AND DATA RADIO LOGIC BOARD 19D902151G3 DESCRIPTION CIRCUIT ANALYSIS TABLE OF CONTENTS MAINTENANCE MANUAL FOR MTD TM SERIES AND DATA RADIO LOGIC BOARD 19D902151G3 TABLE OF CONTENTS Page DESCRIPTION............................................. Front Cover CIRCUIT ANALYSIS..........................................

More information

CS470: Computer Architecture. AMD Quad Core

CS470: Computer Architecture. AMD Quad Core CS470: Computer Architecture Yashwant K. Malaiya, Professor malaiya@cs.colostate.edu AMD Quad Core 1 Architecture Layers Building blocks Gates, flip-flops Functional bocks: Combinational, Sequential Instruction

More information

Logic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 3 Additional Gates and Circuits

Logic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 3 Additional Gates and Circuits Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 3 Additional Gates and Circuits Charles Kime & Thomas Kaminski 28 Pearson Education, Inc. (Hyperlinks are active in View

More information

Sketch A Transistor-level Schematic Of A Cmos 3-input Xor Gate

Sketch A Transistor-level Schematic Of A Cmos 3-input Xor Gate Sketch A Transistor-level Schematic Of A Cmos 3-input Xor Gate DE09 DIGITALS ELECTRONICS 3 (For Mod-m Counter, we need N flip-flops (High speeds are possible in ECL because the transistors are used in

More information

Lesson 10 Practice Problems

Lesson 10 Practice Problems Name: Date: Lesson 10 Section 10.1: Roots, Radicals, and Rational Exponents 1. Complete the table below. Each expression should be written in radical notation, written with rational exponents and evaluated

More information

R.M.D. ENGINEERING COLLEGE R.S.M. Nagar, Kavaraipettai

R.M.D. ENGINEERING COLLEGE R.S.M. Nagar, Kavaraipettai L T P C R.M.D. ENGINEERING COLLEGE R.S.M. Nagar, Kavaraipettai- 601206 DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC8392 UNIT - I 3 0 0 3 OBJECTIVES: To present the Digital fundamentals, Boolean

More information

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University Logic Design First Stage Lecture No.6 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Outlines Boolean Operations Laws of Boolean Algebra Rules of

More information

EECS 140 Laboratory Exercise 4 3-to-11 Counter Implementation

EECS 140 Laboratory Exercise 4 3-to-11 Counter Implementation EECS 140 Laboratory Exercise 4 3-to-11 Counter Implementation 1. Objectives A. To apply knowledge of combinatorial design. B. Gain expertise in designing and building a simple combinatorial circuit This

More information

Digital Fundamentals

Digital Fundamentals Digital Fundamentals Tenth Edition Floyd Chapter 3 Modified by Yuttapong Jiraraksopakun Floyd, Digital Fundamentals, th 28 Pearson Education ENE, KMUTT ed 29 The Inverter Summary The inverter performs

More information

Dr. Chuck Cartledge. 10 June 2015

Dr. Chuck Cartledge. 10 June 2015 Miscellanea Exam #1 Break Exam review 2.1 2.2 2.3 2.4 Break 3 4 Conclusion References CSC-205 Computer Organization Lecture #003 Chapter 2, Sections 2.1 through 4 Dr. Chuck Cartledge 10 June 2015 1/30

More information

UNIT 6 CIRCUIT DESIGN

UNIT 6 CIRCUIT DESIGN UNIT 6 CIRCUIT DESIGN 1 2 HIERARCHY DESIGN CMOS LOGIC CIRCUIT DESIGN Learning outcomes FOR HIERARCHY DESIGN Student should be able to: Define hierarchy design. Explain the levels of hierarchical design.

More information

ELCT201: DIGITAL LOGIC DESIGN

ELCT201: DIGITAL LOGIC DESIGN ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 3 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter

More information

6.1 Combinational Circuits. George Boole ( ) Claude Shannon ( )

6.1 Combinational Circuits. George Boole ( ) Claude Shannon ( ) 6. Combinational Circuits George Boole (85 864) Claude Shannon (96 2) Digital signals Binary (or logical ) values: or, on or off, high or low voltage Wires. Propagate logical values from place to place.

More information

Boolean Algebra and Logic Gates

Boolean Algebra and Logic Gates Boolean Algebra and Logic Gates Binary logic is used in all of today's digital computers and devices Cost of the circuits is an important factor Finding simpler and cheaper but equivalent circuits can

More information

CONTENTS CHAPTER 1: NUMBER SYSTEM. Foreword...(vii) Preface... (ix) Acknowledgement... (xi) About the Author...(xxiii)

CONTENTS CHAPTER 1: NUMBER SYSTEM. Foreword...(vii) Preface... (ix) Acknowledgement... (xi) About the Author...(xxiii) CONTENTS Foreword...(vii) Preface... (ix) Acknowledgement... (xi) About the Author...(xxiii) CHAPTER 1: NUMBER SYSTEM 1.1 Digital Electronics... 1 1.1.1 Introduction... 1 1.1.2 Advantages of Digital Systems...

More information

Combinational Logic Worksheet

Combinational Logic Worksheet Combinational Logic Worksheet Concept Inventory: Truth tables sum-of-products equations implementation using NOT/AND/OR Demorgan s Law, implementation using NAND/NOR Simplification, truth tables w/ don

More information

Digital Electronics. CHAPTER THIRTY TWO. Semiconductor Read-Only Memories

Digital Electronics. CHAPTER THIRTY TWO. Semiconductor Read-Only Memories Digital Electronics. CHAPTER THIRTY TWO Semiconductor Read-Only Memories Introduction Diode circuits, BJT circuits, and MOSFET circuits are used to provide memory semiconductor circuits consisting of both

More information

ELCT201: DIGITAL LOGIC DESIGN

ELCT201: DIGITAL LOGIC DESIGN ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 3 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter

More information

LAB #1 BASIC DIGITAL CIRCUIT

LAB #1 BASIC DIGITAL CIRCUIT LAB #1 BASIC DIGITAL CIRCUIT OBJECTIVES 1. To study the operation of basic logic gates. 2. To build a logic circuit from Boolean expressions. 3. To introduce some basic concepts and laboratory techniques

More information

Lecture 20: CAMs, ROMs, PLAs

Lecture 20: CAMs, ROMs, PLAs Lecture 2: CAMs, ROMs, PLAs Outline Content-Addressable Memories Read-Only Memories Programmable Logic Arrays 2: CAMs, ROMs, and PLAs CMOS VLSI Design 4th Ed. 2 CAMs Extension of ordinary memory (e.g.

More information

Connecting LEDs to the ADB I/O

Connecting LEDs to the ADB I/O Application Note AN-2 By Magnus Pettersson September 26 1996 Connecting LEDs to the I/O Introduction The following notes are for those of you who are a bit inexperienced with hardware components. This

More information

International Training Workshop on FPGA Design for Scientific Instrumentation and Computing November 2013

International Training Workshop on FPGA Design for Scientific Instrumentation and Computing November 2013 2499-13 International Training Workshop on FPGA Design for Scientific Instrumentation and Computing 11-22 Digital CMOS Design Combinational and sequential circuits, contd. Pirouz Bazargan-Sabet Department

More information

2.1 Binary Logic and Gates

2.1 Binary Logic and Gates 1 EED2003 Digital Design Presentation 2: Boolean Algebra Asst. Prof.Dr. Ahmet ÖZKURT Asst. Prof.Dr Hakkı T. YALAZAN Based on the Lecture Notes by Jaeyoung Choi choi@comp.ssu.ac.kr Fall 2000 2.1 Binary

More information

END-TERM EXAMINATION

END-TERM EXAMINATION (Please Write your Exam Roll No. immediately) END-TERM EXAMINATION DECEMBER 2006 Exam. Roll No... Exam Series code: 100919DEC06200963 Paper Code: MCA-103 Subject: Digital Electronics Time: 3 Hours Maximum

More information

User s Manual Hub444. Motion Control Network Hub

User s Manual Hub444. Motion Control Network Hub 8/23/02 JK User s Manual Motion Control Network Hub Applied Motion Products, Inc. 404 Westridge Drive Watsonville, CA 95076 Tel (831) 761-6555 (800) 525-1609 Fax (831) 761-6544 motors drives controls -2-

More information

Assembly Language for Intel-Based Computers, 4 th Edition. Chapter 1: Basic Concepts. Chapter Overview. Welcome to Assembly Language

Assembly Language for Intel-Based Computers, 4 th Edition. Chapter 1: Basic Concepts. Chapter Overview. Welcome to Assembly Language Assembly Language for Intel-Based Computers, 4 th Edition Kip R. Irvine Chapter 1: Basic Concepts Slides prepared by Kip R. Irvine Revision date: 09/15/2002 Chapter corrections (Web) Printing a slide show

More information

The mesh-current method

The mesh-current method The mesh-current method Equivalent resistance Voltage / current dividers Source transformations Node voltages Mesh currents Superposition Mirror image of the node-voltage method. Define mesh currents flowing

More information

output devices. connected to the controller. data communications link. relay systems. user program. MECH1500Quiz1ReviewVersion2 Name: Class: Date:

output devices. connected to the controller. data communications link. relay systems. user program. MECH1500Quiz1ReviewVersion2 Name: Class: Date: Class: Date: MECH1500Quiz1ReviewVersion2 True/False Indicate whether the statement is true or false. 1. The number and type of I/Os cannot be changed in a fixed PLC. 2. In a PLC system, there is a physical

More information

Systems Programming. Lecture 2 Review of Computer Architecture I

Systems Programming.   Lecture 2 Review of Computer Architecture I Systems Programming www.atomicrhubarb.com/systems Lecture 2 Review of Computer Architecture I In The Book Patt & Patel Chapter 1,2,3 (review) Outline Binary Bit Numbering Logical operations 2's complement

More information

BMS: Installation Manual v2.x - Documentation

BMS: Installation Manual v2.x - Documentation Page 1 of 7 BMS: Installation Manual v2.x From Documentation This section describes how external peripheral devices are connected and additional functions of the BMS are used. I you have not done so already,

More information

QUICKSWITCH PRODUCTS HIGH-SPEED CMOS QUADRUPLE BUS SWITCH WITH INDIVIDUAL ACTIVE LOW ENABLES

QUICKSWITCH PRODUCTS HIGH-SPEED CMOS QUADRUPLE BUS SWITCH WITH INDIVIDUAL ACTIVE LOW ENABLES QUICKSWITCH PRODUCTS HIGH-SPEED CMOS QUADRUPLE BUS SWITCH WITH INDIVIDUAL ACTIVE LOW ENABLES IDTQS315 FEATURES: Enhanced N channel FET with no inherent diode to Vcc Pin compatible with the 74 15 function

More information

Chapter 9. Input/Output (I/O) Ports and Interfacing. Updated: 3/13/12

Chapter 9. Input/Output (I/O) Ports and Interfacing. Updated: 3/13/12 Chapter 9 Input/Output (I/O) Ports and Interfacing Updated: 3/13/12 Basic Concepts in I/O Interfacing and PIC18 I/O Ports (1 of 2) I/O devices (or peripherals) such as LEDs and keyboards are essential

More information

Lesson 9 - Practice Problems

Lesson 9 - Practice Problems Lesson 9 - Practice Problems Section 9.1: Operations on Radical Expressions 1. Perform the indicated operations and simplify your answers a) 3 + 3 = b) 5 13 9 13 = c) 6 5 = d) 5 8 7 = e) 4 + 7 + 9 = f)

More information

Major Components Parts Power System Power supplies Ground Reset System Clocks and Timing Inputs and Outputs

Major Components Parts Power System Power supplies Ground Reset System Clocks and Timing Inputs and Outputs Troubleshooting and Debugging Pieces Hardware Software Drawings and source code Hardware Major Components Parts Power System Power supplies Ground Reset System Clocks and Timing Inputs and Outputs Parts

More information

Lecture 10: Floating Point, Digital Design

Lecture 10: Floating Point, Digital Design Lecture 10: Floating Point, Digital Design Today s topics: FP arithmetic Intro to Boolean functions 1 Examples Final representation: (-1) S x (1 + Fraction) x 2 (Exponent Bias) Represent -0.75 ten in single

More information

Chapter 3. Gate-Level Minimization. Outlines

Chapter 3. Gate-Level Minimization. Outlines Chapter 3 Gate-Level Minimization Introduction The Map Method Four-Variable Map Five-Variable Map Outlines Product of Sums Simplification Don t-care Conditions NAND and NOR Implementation Other Two-Level

More information

Circuit analysis summary

Circuit analysis summary Boolean Algebra Circuit analysis summary After finding the circuit inputs and outputs, you can come up with either an expression or a truth table to describe what the circuit does. You can easily convert

More information

Ultrasonic proximity sensors UNDK 20. Sd = 200 mm. internal and external Teach-in small sonic beam angle PNP NPN. general data.

Ultrasonic proximity sensors UNDK 20. Sd = 200 mm. internal and external Teach-in small sonic beam angle PNP NPN. general data. Ultrasonic proximity sensors UNDK Sd = mm small sonic beam angle 1... mm scanning range far limit Sde 3... mm hysteresis typ. 4% Sde

More information

LSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology

LSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology LSN 4 Boolean Algebra & Logic Simplification Department of Engineering Technology LSN 4 Key Terms Variable: a symbol used to represent a logic quantity Compliment: the inverse of a variable Literal: a

More information

RESISTANCE/CURRENT METER Model 863/6487

RESISTANCE/CURRENT METER Model 863/6487 RESISTANCE/CURRENT METER Model 863/6487 BASIC OPERATING INSTRUCTIONS 6/08 TABLE OF CONTENTS 1.0 GENERAL. 3 2.0 CONNECTIONS.. 4 3.0 OPERATION 7 4.0 REPROGRAMMING.. 9 4.1 Test Voltages.. 9 4.2 Sampling Rate.10

More information

CSE A215 Assembly Language Programming for Engineers

CSE A215 Assembly Language Programming for Engineers CSE A215 Assembly Language Programming for Engineers Lecture 4 & 5 Logic Design Review (Chapter 3 And Appendices C&D in COD CDROM) September 20, 2012 Sam Siewert ALU Quick Review Conceptual ALU Operation

More information

Presented By :- Alok Kumar Lecturer in ECE C.R.Polytechnic, Rohtak

Presented By :- Alok Kumar Lecturer in ECE C.R.Polytechnic, Rohtak Presented By :- Alok Kumar Lecturer in ECE C.R.Polytechnic, Rohtak Content - Introduction -2 Feature -3 Feature of BJT -4 TTL -5 MOS -6 CMOS -7 K- Map - Introduction Logic IC ASIC: Application Specific

More information

MADR TR. SPDT PIN Diode Driver Rev. V3. Features. Functional Block Diagram. Description. Pin Configuration. Ordering Information

MADR TR. SPDT PIN Diode Driver Rev. V3. Features. Functional Block Diagram. Description. Pin Configuration. Ordering Information Features Moderate Speed, CMOS Technology (25 ns) Complementary Outputs High Drive Current Capability (± 50 ) Low Current Consumption Plastic SOIC Body for SMT Applications Tape and Reel Packaging Available

More information

HyperLink Brand Weatherproof PTZ Camera Lightning and Surge Protector Model: AL-VDP Series

HyperLink Brand Weatherproof PTZ Camera Lightning and Surge Protector Model: AL-VDP Series HyperLink Brand Weatherproof PTZ Camera Lightning and Surge Protector Model: AL-VDP Series Applications Pan-Tilt-Zoom (PTZ) analog video cameras Features Individual protection circuits for analog video

More information

Plug & Play MCL488 FEATURES PRODUCT OVERVIEW MULTI-CHANNEL LOADS. Front Panel, Analog IEEE 488, or RS232 Control

Plug & Play MCL488 FEATURES PRODUCT OVERVIEW MULTI-CHANNEL LOADS. Front Panel, Analog IEEE 488, or RS232 Control MCL88 MULTI- LOADS Plug & Play FEATURES Front Panel, Analog IEEE 88, or RS232 Control 0 Amp, 350 Watt Modules 30 Amp, 75 Watt Modules Channels in 50V, 00V, 00V, or 00V Configurations Paralleling Channels

More information