AUTOMATION (IENG3006)

Course Team: Prof. Chanan S. Syan y Gerard Pounder Krystal Ramoutar 24 Hours (24 x 1-hour sessions) Thursdays 08:00am 09:00am Thursdays 11.00am 12.00noon Around week 7 Lab. Based work and project around week 6. Hand-in 4 weeks from date of assignment assignment.
IENG3006 Automation Lecture 1 1

LECTURES: Times: In Course In-Course Exam: Project (C/W):

Thursday, 6 September 2007

AUTOMATION (IENG3006)
Aims and Objectives:
To provide an appreciation and understanding of the role of automation in manufacturing and process control; To provide an insight into the technology of automation; To provide analytic tools for the design and analysis of industrial automation systems for process and manufacturing industries. g
Thursday, 6 September 2007 IENG3006 Automation Lecture 1 2

AUTOMATION (IENG3006) Syllabus (i)

Disciplines of Automation Number Systems, Boolean Arithmetic, Algebra, Logic Gates G t Huntington Postulates, De Morgans Theorem. Switching Functions. Truth Tables, C F ti T th T bl Canonicall F i Forms Combinational Logic: Application of Boolean algebra to Design. Simplification of Switching Functions. Algebraic manipulation, Karnaugh Maps VLSI logic, Devices
Thursday, 6 September 2007 IENG3006 Automation Lecture 1 3

AUTOMATION (IENG3006) Syllabus (ii)

Sequential Circuits: State Diagrams & State Transition Tables, Flip-flops, and State Machines, Design of Sequential Circuits, Hazards & Race Conditions, State Assignment & Minimisation Microprocessor & Microcomputer Process Automation Programmable Logic Controllers and Ladder Logic Introduction Implementation of Combinational Logic on PLCsImplementation of Sequential Circuits on PLCs Tutorials
Thursday, 6 September 2007 IENG3006 Automation Lecture 1 4

GENERAL OUTLINE
AUTOMATION & CONTROL SYSTEMS LOGICAL AUTOMATION
COMBINATIONAL (No Memory)

PROCESS CONTROL
Feedback Stability, Set Point (Error) Control [Linear & Non-linear], Steady State Performance y

SEQUENTIAL (Memory Incorporated) ASYNCHRONOUS

SCADA SYSTEMS
Industrial measurement & control system consisting of a central master & other remote units. Referred to in industry as Distributed Control Systems.
5

SYNCHRONOUS

STOCHASTIC
Thursday, 6 September 2007

DETERMINISTIC
IENG3006 Automation Lecture 1

AUTOMATION (IENG3006)
Recommended Texts Fundamentals of Programmable Logic Controllers, Sensors and Communications (Prentice Hall, 3rd Edition) Jon Stenerson Hall Di it l Design F d Digital D i Fundamentals (P ti H ll 2 d t l (Prentice Hall, 2nd Edition) Kenneth J. Breeding
Thursday, 6 September 2007 IENG3006 Automation Lecture 1 6

NUMBER SYSTEMS
Decimal Systems Units 0
E.g. i.e.

HTU.TH (123.15)10 2 1 0 -1 1 -2 2 (1 x 10 ) + (2 x 10 ) + (3 x 10 ) + (1 x 10 ) + (5 x 10 )

Bi Binary S Systems U i 0 Units

(Most Significant Bit) MSB

1
LSB (Least Significant Bit)

11 E.g. (1101.1011) 2 (13 16 )10 3 2 1 0 -1 -2 i.e. (1 x 2 ) + (1 x 2 ) + (0 x 2 ) + (1 x 2 ) + (1 x 2 ) + (0 x 2 ) + ( ( ( ( ( ( -3 -4 (1 x 2 ) + (1 x 2 )

Thursday, 6 September 2007 IENG3006 Automation Lecture 1 7

CONVERTING DECIMAL TO BINARY

Convert 13 to binary
10

Quotient

Remainder

2 13 2 6 2 3 2 1 0

1 0 1 1

13 as a binar # is 1101 binary

M decimall number f a 4 bit system Max d i b for t Max decimal number for an 8 bit system
Thursday, 6 September 2007 IENG3006 Automation Lecture 1

15 255
8

CONVERTING DECIMAL TO BINARY

Contd

Convert (7.8425) to binary Integer

10

Fraction
(Multiplicand)

Multiplier 2 2 2 2 2 2 2 2 2 2

Quotient Remainder

2 2 2

7 3 1 0

1 1 1

1 1 0 1 0 1 1 1 1

0.8425 0 8425 0.6850 0.3700 0.7400 0.4800 0 4800 0.9600 0.9200 0.8400 0.6800 0.3600

7.8425 as a binary # is 111.110101111 (Note - non-exact conversion)

Thursday, 6 September 2007 IENG3006 Automation Lecture 1 9

OCTAL & HEXADECIMAL SYSTEMS

Normally computations within computer are carried out in binary, principally because the most reliable digital circuits are two state devices. Binary to decimal conversion & vice-versa, as illustrated above, easier than conversions between decimal and higher bases. However working with binary numbers cumbersome even small decimal equivalents require large numbers of bits bits.
e.g. (132)10 = (10000100) 2

For this reason OCTAL or HEX (Hexadecimal) commonly used t represent bi d to t binary numbers b
Thursday, 6 September 2007 IENG3006 Automation Lecture 1 10

OCTAL & HEXADECIMAL SYSTEMS

Decimal
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Binary y
0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111 10000

Contd 00 01 02 03 04 05 06 07 10 11 12 13 14 15 16 17 20

Octal

Hexadecimal
0 1 2 3 4 5 6 7 8 9 A B C D E F 10

Thursday, 6 September 2007

IENG3006 Automation Lecture 1

11

OCTAL & HEXADECIMAL SYSTEMS

Contd

Convert (132)10 to Binary Convert (10000100)2 to Octal

(010 000 100)2 ( 2 0 4 )8

(10000100)2

Convert (10000100)2 to Hexadecimal

(1000 0100)2 ( 8 4 )16

Thursday, 6 September 2007

IENG3006 Automation Lecture 1

12

 Addition

BINARY (BOOLEAN) ARITHMETIC

(186)10 + (55)10 (10111010)2 + (110111)2 ( ) ( ) ( ) ( )

11111 10111010 110111 11110001

Carry In
0 0 0 0 1 1 1 1
Thursday, 6 September 2007

Carries from preceding bit position

B
0 1 0 1 0 1 0 1
i

(241)10
i

Additi T bl (i l di carries) Addition Table (including i )

A
0 0 1 1 0 0 1 1
i

Sum
0 1 1 0 1 0 0 1

Carry out
0 0 0 1 0 1 1 1
13

IENG3006 Automation Lecture 1

BINARY (BOOLEAN) ARITHMETIC

Contd

Multiplication
(44)10 X (11)10 (101100)2 + (1011)2

101100 1011 101100 101100 000000 101100 . 111100100

Thursday, 6 September 2007

multiplicand p multiplier

(484)10
14

IENG3006 Automation Lecture 1

BINARY (BOOLEAN) ARITHMETIC

Subtraction
10000 1 1 10 1 00 101 1011
1 1 1 1

Contd

(16)10 - (5)10 (10000)2 - (101)2

(11)10

Subtraction Table 00=0 10=1 11=0 0 1 = 1 with a borrow from the next higher bit position
Thursday, 6 September 2007 IENG3006 Automation Lecture 1

15

BINARY (BOOLEAN) ARITHMETIC

Contd

Division
(37)10 / (5)10 (100101)2 / (101)2

111 101 100101 101 01000 101 000111 101 10

Thursday, 6 September 2007

quotient

(7)10

remainder

(2)10
16

IENG3006 Automation Lecture 1

COMPLEMENT ARITHMETIC
The advantage of complement arithmetic derives g piece of hardware ( (an from the fact that a single p adder) can be used to perform all arithmetic p y p , operations: binary multiplication involves addition, whereas binary division involves subtraction. Subtraction with 2s complement is realized by 2s adding the 2s complement of the subtrahend to the number number.
Thursday, 6 September 2007 IENG3006 Automation Lecture 1 17

COMPLEMENT ARITHMETIC Contd

The 2 Th 2s complement of a number is f l t f b i formed b adding a (1)2 t the d by ddi to th 1s complement of the same number. The 1s complement is formed by changing the 1s to 0s and the 0s to 1s in a binary number E.g Number: 1s Complement 2s Complement
Thursday, 6 September 2007

0010110 1101001
(1 s (1s complement)
IENG3006 Automation Lecture 1

1101001 + 1

= 1101010
18

COMPLEMENT ARITHMETIC Contd

Standard Subtraction 1011011 - 0010110 1000101 10011 - 10111 1 11100 Subtraction using g 2s complement 0000001 1011011 + 1101001 1 1000101 Positive 00001 10011 + 01000 11100

1s Complement

Plus 1

Negative (magnitude = 00100 i.e. 2s complement of result)

19

Thursday, 6 September 2007

IENG3006 Automation Lecture 1

COMPLEMENT ARITHMETIC Contd

Signed Binary Representations

Decimal system sign precedes # - e.g. +149 or ( g g p y g positive value) ) 3765 (missing sign implying p Similar approach in binary systems, where MSB is a 1 value is negative (bits following sign represent 2s complement of magnitude) and positive where MSB is 0 (bits following sign represent values magnitude).
Thursday, 6 September 2007 IENG3006 Automation Lecture 1 20

COMPLEMENT ARITHMETIC Contd Cont d

Signed Binary Representations
Contd

Signed 2s complement 00111010 11100101 10000001 01111111

= = = =

Sign-magnitude +0111010 -0011011 -1111111 +1111111

= = = =

Decimal +58 -27 -127 +127

Thursday, 6 September 2007

IENG3006 Automation Lecture 1

21

CODING
Many reasons exist for coding information. Keyboard interface uses ASCII code, which converts alphanumeric and control characters to a binary pattern recognisable by computer. Information may enter computers from external sensors (e.g. thermometers, strain gauges, etc.), from switches, shaft position indicators and other devices. All of this information must be converted in some way to binary for proper handling by the computer. In some applications, it may be convenient to handle numbers internally as pp , y y decimal digits, which have been suitably encoded in some binary form. E.g Hand-held calculators or other devices where information must be continually entered manually and returned in numerical (decimal) form.
Thursday, 6 September 2007 IENG3006 Automation Lecture 1 22

BINARY CODED DECIMAL

Decimal BCD
0 1 2 3 4 5 6 7 8 9 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 e.g. (253)10 + (314)10 = (567)10 In BCD this becomes: 0010 0011 0101 0101 0001 0110 0011 0100 0111 = (567)10

Thursday, 6 September 2007

IENG3006 Automation Lecture 1

23

BINARY CODED DECIMAL Contd

Suppose we were to add 7,694 & 3,585 = (11,279)10
0111 0011 0101 0110 1 0000 1 1 0001 0110 0101 1011 0110 1 0001 1 0010 1001 1000 1 0001 0110 1 0111 0111 0100 0101 1001 1001 1001

add in the 6s add in the carries

Thursday, 6 September 2007

IENG3006 Automation Lecture 1

24

TUTORIAL
Decimal 9 27 189 1125 17244 33769 -33768
Thursday, 6 September 2007

Binary

BCD

Hexadecimal

IENG3006 Automation Lecture 1

25