Data manipulation Instructions

Slides:



Advertisements
Similar presentations
MONTEGO BAY HIGH SCHOOL INFORMATION TECHNOLOGY THE EXCEL IF FUNCTION.
Advertisements

02/24/97 1 Rockwell Automation Hands-On Seminar Series.
1 Seoul National University Logic Design. 2 Overview of Logic Design Seoul National University Fundamental Hardware Requirements  Computation  Storage.
Drafting RLL. SLC 500 Processor Operating Cycle Event in Operating Cycle Input Scan Program Scan Output Scan Communications Processor Overhead.
Tutorial 7: Using Advanced Functions and Conditional Formatting
Chapter 10.
Week 10 Recap CSE 115 Spring For-each loop When we have a collection and want to do something to all elements of that collection we use the for-each.
Basic Elements of Programming A VB program is built from statements, statements from expressions, expressions from operators and operands, and operands.
CSCE 212 Quiz 8 – 3/23/11 1.What type of element is the ALU (combinational or state) and what does it mean for an element to be that type? 2.What is the.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 4- 1.
Chapter 4: Control Structures: Selection
Chapter 19 Fundamental PLC Programming
Timers.
Working with Arduino: Lesson #1: Getting Acquainted with the Kit EGN1007.
Computer Science 1000 Spreadsheets II Permission to redistribute these slides is strictly prohibited without permission.
Programmable Logic Controllers
MOV,MOVM,COP,FLL,BSL,BSR, FRD,TOD
EGR 2261 Unit 4 Control Structures I: Selection  Read Malik, Chapter 4.  Homework #4 and Lab #4 due next week.  Quiz next week.
Program Control Instructions:
Counter The CTU CTD instruction counts upward & Down wards over a range Each time the rung goes from false- to-true. We can make an Up-Down counter by.
Chapter 4: Control Structures I (Selection). Objectives In this chapter, you will: – Learn about control structures – Examine relational operators – Discover.
Chapter 4: Control Structures I (Selection). Objectives In this chapter, you will: – Learn about control structures – Examine relational and logical operators.
Memory Layout and SLC500™ System Addresses. Processor Memory Division An SLC 500 processor's memory is divided into two storage areas. Like two drawers.
Application of Data Programming Blocks. Objectives  Understand the use of data programming blocks and their applications  Understand the basic logic.
Senior Project Presentation: Designers: Shreya Prasad & Heather Smith Advisor: Dr. Vinod Prasad May 6th, 2003 Internal Hardware Design of a Microcontroller.
Selection Boolean What is Boolean ? Boolean is a set with only two values : –true –false true and false are standard identifiers in Pascal, called Boolean.
4. Electrons and electronics 4.5 Digital electronics.
Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.
©TheMcGraw-Hill Companies, Inc. Permission required for reproduction or display. Selection Statements Selection Switch Conditional.
Chapter Making Decisions 4. Relational Operators 4.1.
Chapter 4: Control Structures I (Selection). Objectives In this chapter, you will: – Learn about control structures – Examine relational and logical operators.
CSI 3125, Preliminaries, page 1 Data Type, Variables.
Digital System Design using VHDL
Sequencers SQO,SQC,SQL.
Elements of Datapath for the fetch and increment The first element we need: a memory unit to store the instructions of a program and supply instructions.
Mindstorm NXT-G Introduction Towson University Robotics.
Why Repetition? Read 8 real numbers and compute their average REAL X1, X2, X3, X4, X5, X6, X7, X8 REAL SUM, AVG READ *, X1, X2, X3, X4, X5, X6, X7, X8.
An Introduction to Programming with C++ Sixth Edition Chapter 5 The Selection Structure.
4 - Conditional Control Structures CHAPTER 4. Introduction A Program is usually not limited to a linear sequence of instructions. In real life, a programme.
Random Functions Selection Structure Comparison Operators Logical Operator
Chapter 11 & 13 PLC Math Instructions Permission granted to reproduce for educational use only. 11 PLC Compare, Jump, and MCR Instructions.
Chapter 4: Control Structures I (Selection). Objectives In this chapter, you will: – Learn about control structures – Examine relational operators – Discover.
Programmable Logic Controllers Third Edition Frank D. Petruzella McGraw-Hill.
The purpose of a CPU is to process data Custom written software is created for a user to meet exact purpose Off the shelf software is developed by a software.
1 Introduction to PLCs: Programming Counters ELMT Basic Programmable Logic Controllers Chapter 0x_W Source: www Based on Ch 8 of Frank D. Petruzella.
Using Advanced Functions and Conditional Formatting
Basic Computer Organization and Design
CIS3931 – Intro to JAVA Lecture Note Set 2 17-May-05.
Control Unit Lecture 6.
INC 161 , CPE 100 Computer Programming
Chapter 10 © 2011, The McGraw-Hill Companies, Inc.
Seoul National University
The Selection Structure
Introduction of microprocessor
Chapter 6: Conditional Statements and Loops
Chapter 12 © 2011, The McGraw-Hill Companies, Inc.
Making Decisions in a Program
Comparison and Data-handling Instructions
Comparison and Data-Handling Instructions
Chapter 4: Control Structures I (Selection)
Sensors and Logic Switches
Chapter 6 Control Statements: Part 2
Logical Operations In Matlab.
MIPS Assembly.
Fundamentals of visual basic
Low Level Programming Languages
REPETITION Why Repetition?
COMPUTING.
ECE 120 Midterm 1 HKN Review Session.
Presentation transcript:

Data manipulation Instructions EQU, GEQ, GRT, LEQ, LES, LIM, MEQ, NEQ

Equal (EQU): Use the EQU instruction to test whether two values are equal. If source A and Source B are equal, the instruction is logically true. If these values are not equal, the instruction is logically false. Source A must be an address. Source B can either be a program constant of a address. Negative integers are stored in two’s complementary form.

Not Equal (NEQ): Use the NEQ instruction to test whether two values are not equal. If source A and Source B are not equal, the instruction is logically true. If the two values are equal, the instruction is logically false. Source A must be an address. Source B can be either a program constant or an address. Negative integers are stored in two’s complementary form.

Equal to (EQU) Description: Use the EQU instruction to test whether two values are equal. Source A and Source B can either be values or addresses that contain values.

Greater than or Equal to (GEQ) Description: Use the GEQ instruction to test whether one value (Source A) is greater than or equal to another value (Source B). Source A and Source B can be values or addresses that contain values.

Greater Than or Equal (GEQ): Use the GEQ instruction to test whether one value (source A) is greater than or equal to another (source B). If the value at source A is greater than or equal to the value at source B, the instruction is logically true. If the value at source A is less than the value at source B, the instruction is logically false. Source A must be an address. Source B can either be a program constant or an address. Negative integers are stored in two’s complementary form.

Greater than (GRT) Description: Use the GRT instruction to test whether one value (Source A) is greater than another value (Source B). Source A and Source B can either be values or addresses that contain values.

Greater Than (GRT): Use the GRT instruction to test whether one value (source A) is greater than another (source B). If the value at source A is greater than the value at source B, the instruction is logically true. If the value at source A is less than or equal to the value at source B, the instruction is logically false. Source A must be an address. Source B can either be a program constant or an address. Negative integers are stored in two’s complementary form.

Less than or Equal to (LEQ) Description: Use the LEQ instruction to test whether one value (Source A) is less than or equal to another value (Source B). Source A and Source B can either be values or addresses that contain values.

Less Than or Equal (LEQ): Use the LEQ instruction to test whether one value (source A) is less than or equal to another (source B). If the value at source A is less than or equal to the value at source B, the instruction is logically true. If the value at source A is greater than the value at source B, the instruction is logically false. Source A must be an address. Source B can either be a program constant or an address. Negative integers are stored in two’s complementary form.

Less than (LES) Description: Use the LES instruction to test whether one value (Source A) is less than another value (Source B). Source A and Source B can be values or addresses that contain values.

Less Than (LES): Use the LES instruction to test whether one value (source A) is less than another (source B). If source A is less than the value at source B the instruction is logically true. If the value at source A is greater than or equal to the value at source B, the instruction is logically false. Source A must be an address. Source B can either be a program constant or an address. Negative integers are stored in two’s complementary.

Limit Test (LIM) Description: The LIM instruction is an input instruction that tests for values inside of or outside of a specified range. The instruction is false until it detects that the test value is within certain limits. Then the instruction goes true. When the instruction detects that the test value goes outside certain limits, it goes false. You can use the LIM instruction to test if an analog input value is within specified limits.

Entering Parameters: The low limit, test, and high limit values can be word addresses or constants, restricted to the following combinations: If the test parameter is a program constant, both the Low Limit and High Limit parameters must be word addresses. If the test parameter is a word address, the Low Limit and High Limit parameters can be either a program constant or a word address. Limit Test (LIM): Use the LIM instruction to test for values within or outside a specified range, depending on how you set the limits.

Entering Parameters: To program the LIM instruction, you must provide the processor with the following:

Mask Compare Equal to (MEQ) Description: The MEQ instruction is an output instruction that compares a value from a source address with data at a compare address, and allows portions of the data to be masked. If the data at the source address matches the data at the compare address bit-by-bit (less masked bits), the instruction is true. The instruction goes false as soon as it detects a mismatch. You can use the MEQ instruction to extract (for comparison) bit data such as status or control bits from an element that contains bit and word data.

Entering Parameters: To program this instruction, you must provide the processor with the following:

Masked Comparison for Equal (MEQ): Use the MEQ instruction to compare data at a source address with data at a compare address. Use of this instruction allows portions of the data to be masked by a separate word.

Not Equal to (NEQ): Description: Use the NEQ instruction to test whether two values are not equal. Source A and Source B can be values or addresses.