Lecture 2: Systems Engineering

Slides:



Advertisements
Similar presentations
Sahar Mosleh PageCalifornia State University San Marcos 1 Introductory Concepts This section of the course introduces the concept of digital circuits and.
Advertisements

Combinational Circuits
Disjunctive Normal Form CS 680: Formal Methods Jeremy Johnson.
Algorithms and Problem Solving
Cosc 2150: Computer Organization Chapter 3: Boolean Algebra and Digital Logic.
CS001 Introduction to Programming Day 3 Sujana Jyothi
Boolean Algebra Lecture 7: Supporting Material Dr Kathryn Merrick Tuesday 24 th March, 2009.
Chapter 9: Boolean Algebra
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.
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
Chapter 1 Program Design
Propositional Calculus Math Foundations of Computer Science.
EMB1006 Boolean Logic Jonathan-Lee Jones.
4 Operations On Data Foundations of Computer Science ã Cengage Learning.
Lecture 8 Topics –Switch –Transistor –CMOS transistor –Logic gates AND, OR, NOT Universal gates: NAND, NOR XOR.
3. DIGITAL ELECTRONICS..
1 Survey of Computer Science CSCI 110, Spring 2011 Lecture 16 Digital Circuits, binary Numbers.
1 CHAPTER 4: PART I ARITHMETIC FOR COMPUTERS. 2 The MIPS ALU We’ll be working with the MIPS instruction set architecture –similar to other architectures.
Systems Architecture I1 Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they.
OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.
Digital Logic Chapter 4 Presented by Prof Tim Johnson
1 The Chinese University of Hong Kong Faculty of Education Diploma in Education (Part-Time) Winter 1997 Educational Communications and Technology Assignment.
1 Inference Rules and Proofs (Z); Program Specification and Verification Inference Rules and Proofs (Z); Program Specification and Verification.
Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.
ENGG1100 Ch5: Introduction To Engineering Design (Digital Logic) Part 1 of digital logic KH WONG ENGG1100. Ch5-Digital Logic (v3e2)1.
CS1Q Computer Systems Lecture 6 Simon Gay. Lecture 6CS1Q Computer Systems - Simon Gay2 Algebraic Notation Writing AND, OR, NOT etc. is long-winded and.
CSC Intro. to Computing Lecture 5: Boolean Logic, Gates, & Circuits.
EE2420 – Digital Logic Summer II 2013 Hassan Salamy Ingram School of Engineering Texas State University Set 4: Other Gates.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 – 7.2 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean.
What is Mechatronics? Mechatronics is the synergistic combination of mechanical engineering, electronics, controls engineering, and computers, all integrated.
September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Computing via boolean logic. COS 116: 3/8/2011 Sanjeev Arora.
CS1Q Computer Systems Lecture 6 Simon Gay. Lecture 6CS1Q Computer Systems - Simon Gay2 Algebraic Notation Writing AND, OR, NOT etc. is long-winded and.
Laws of Boolean Algebra Commutative Law Associative Law Distributive Law Identity Law De Morgan's Theorem.
Boolean Functions and Boolean Algebra Laxmikant Kale.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean Logic.
1 Binary Signals Logic gate circuits are designed to input and output only two types of signals: “high” (1) and “low” (0), as represented by a variable.
Computer Systems Architecture Edited by Original lecture by Ian Sunley Areas: Computer users Basic topics What is a computer?
Chapter I: Introduction to Computer Science. Computer: is a machine that accepts input data, processes the data and creates output data. This is a specific-purpose.
CS231: Computer Architecture I Laxmikant Kale Fall 2002.
Unit 1 Logical operators.
Basics of Logic gates - Part 1
Morgan Kaufmann Publishers
Component 1 Logical operators.
Logic Gates & Boolean Algebra
Department of Preparatory Year, Umm Al Qura University
Computer Science 210 Computer Organization
INTRODUCTION TO PROBLEM SOLVING
Lesson Objectives Aims Be able to define problems using Boolean logic
Thinking Mathematically
CSCI-100 Introduction to Computing
Chapter 2.3 Binary Logic.
Component 1 – 2A, B, C Binary Logic
Jeremy R. Johnson Wed. Sept. 29, 1999
Unit 18: Computational Thinking
DT-Assessment Frame Work Term2
Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan
Fundamentals of Computer Science Part i2
Fundamentals of Computer Systems
Boolean Logic Boolean Logic is considered to be the basic of digital electronics. We know that a computer’s most basic operation is based on digital electronics.
Adders.
Click to add Text Computers & Instructions. Computers are given instructions in the form of computer programs that are created through the development.
Objectives Construct truth tables for the following logic gates:
How electronic systems work using the Systems approach.
CPSC 121: Models of Computation
Introductory Concepts
Copyright © Cengage Learning. All rights reserved.
CPSC 121: Models of Computation
ECE 352 Digital System Fundamentals
Presentation transcript:

Lecture 2: Systems Engineering EEN 112: Introduction to Electrical and Computer Engineering Professor Eric Rozier, 1/23/2013

CROSSING THE RIVER…

Farmer, Wolf, Goat, Cabbage A farmer needs to transport a wolf, a goat, and a cabbage across the river. F G Boat has two seats Farmer must drive… If left alone… The wolf will eat the goat. The goat will eat the cabbage. W C

Farmer, Wolf, Goat, Cabbage As a group, formulate a solution to transport everything across the river, without anything being eaten. F G W C

What do we learn from this exercise? Sometimes we have to move backwards to move forwards. Even simple systems need thought to formulate a plan for accomplishing their goals. We call this plan, an algorithm.

ALGORITHMS

Algorithms al-Khwarizmi Persian mathematician, astronomer, and geographer born 780 A.D. Invented a few things… Decimal system Algebra Trigonometry

Algorithms al-Khwarizmi also introduced the idea of solving problems using step-by-step procedures for calculations. Algorithms – A method of solving a problem or accomplishing a task expressed as a finite list of well defined instructions. Starting from an initial state and an initial input, the instructions describe a computation that, when executed will proceed through a finite number of well defined successive states, eventually producing output, and terminating at a final ending state.

States, Inputs, and Outputs States are a way of measuring the condition of a system, and it’s environment. Inputs are a way of getting information to a system. Outputs are a way of getting information from a system.

Algorithms Algorithms let us define, formally, what we want machines and automated systems to do. Algorithms are written to have precise meanings, and to be generally applicable.

Systems Engineering and Cyberphysical Systems We build systems to do jobs, solve problems, and accomplish tasks. Often these systems are cyberphysical systems, i.e. they combine computational components with the real world. An algorithm is a way of telling the components how to do their job, and how to work together.

Example System: Thermostat What is the goal? What problem does it solve? How would we characterize the state? What would the inputs and outputs be?

Example System: Thermostat What is the goal? What problem does it solve? How would we characterize the state? What would the inputs and outputs be? Break into groups Define the problem Define what the thermostat needs to do

Example System: Thermostat Regulate temperature Specification Must be able to sense temperature Based on the temperature must be able to signal cooling or warming the room, or to do nothing. State: temperature, heating state, cooling state

Example System: Thermostat Pseudocode algorithm tempLow = L tempHigh = H loop() Test temperature, store the value in T If (T < L) send a heating signal If (T > H) send a cooling signal

Example System: Thermostat Signal: Heat Signal: Cool Heater Air Conditioner Sensor

Some important points… Thermostat Signal: Heat Signal: Cool Heater Air Conditioner Sensor Some important points… Four systems here, each with their implementations… Need to communicate with each other…

Networking and Communication Systems communicate via signals, over wires, or wirelessly via electromagnetic radiation. In our thermostat system, the heater and cooler can be switched on or off by a pure signal on the wire. I.e., if electrons are flowing, turn on, if not, turn off!

Networking and Communication But how do we get information from the sensor? It needs to send a number… how do we do that?

Networking and Communication What if we encode the signal into pulses? Detect if the value is above or below some threshold, and decide it represents a 1, or a 0. Strings of 1’s and 0’s can be interpreted as a number.

Some simple things we can represent with 1’s and 0’s True or false… 1 – true 0 – false We already were doing this with pure signals.

Some simple things we can represent with 1’s and 0’s Integers Examples 00000000 – 0 - 00000010 - 2 00000001 – 1 - 00001010 – 10 00000011 – 3 - 10010011 – 147 7 6 5 4 3 2 1 128 64 32 16 8

Negative numbers and real numbers are more complex… We will cover those later…

Boolean Algebra Using true/false values in complicated ways Thermostat system Let’s make a change to the basic system Add a switch with values “Heat” and “Cool” Cool the room if T > H and Switch is set to “Heat” Heat the room if T < L and Switch is set to “Cool”

Boolean Algebra Gets back to gators and grades… Represent truth as 1, and false as 0 We can operate on values using the following basic operators: AND OR NOT

AND X AND Y X=0 X=1 Y=0 Y=1 1

OR X OR Y X=0 X=1 Y=0 1 Y=1

NOT NOT X X=0 X=1 1

Abbreviations ^ - And v – Or ! – Not !X ^ Y X=0 X=1 Y=0 Y=1 1

Commutative laws X ^ Y = Y ^ X X v Y = Y v X

Associative laws X ^ (Y ^ Z) = (X ^ Y) ^ Z X v (Y v Z) = (X v Y) v Z

Distributive laws X ^ (Y v Z) = (X ^ Y) v (X ^ Z) X v (Y ^ Z) = (X v Y) ^ (X v Z)

Some exercises !x ^ !y !(x ^ y) !x ^ x (x v y) ^ !(x ^ y)

Realization as electronic components AND OR NOT

Realization as electronic components AND OR NOT

Derived operators X XOR Y X  Y X = Y (x v y) ^ !(x ^ y) Exclusive Or Implication X = Y (!X XOR Y)

De Morgan’s Laws The negation of a conjunction, is the disjunction of the negations !(X ^ Y) <-> (!X) v (!Y) !(X v Y) <-> (!X) ^ (!Y)

Homework Prove the equivalence of the expressions in De Morgan’s Laws with truth tables (show they are the same!)