Definition Of The Used Data Types; Basic Data Types; Unsigned Integer; Signed Integer - Kollmorgen S300 Manual
Canopen can-bus fieldbus interface
Hide thumbs
Also See for S300:
- Interface manual (136 pages) ,
- Original manual (54 pages) ,
- Translation of the original manual (54 pages)
Table of Contents
Advertisement
4.3 Definition of the used data types
This chapter defines the data types that are used. Each data type can be described by bit-
sequences. These bit-sequences are grouped into "Octets" (bytes). The so-called "Little – Endian"
format (also known as "Intel format") is used for numerical data types (see also: DS301 Applic-
ation Layer "General Description of Data Types and Encoding Rules").
4.3.1 Basic data types
4.3.1.1 Unsigned Integer
Data in the basic data type UNSIGNEDn define exclusively positive integers.
The value range is from 0 ... 2
UNSIGNEDn(b) = b
Example: the value 266 = 10Ah is transmitted in the data type UNSIGNED16, in the form of two
octets (1st octet = 0Ah, 2nd octet = 01h).
Transmission syntax for the data type UNSIGNEDn
Octet number
UNSIGNED8
UNSIGNED16 b
UNSIGNED24 b
UNSIGNED32 b
UNSIGNED40 b
UNSIGNED48 b
UNSIGNED56 b
UNSIGNED64 b
4.3.1.2 Signed Integer
Data in the basic data type INTEGERn define both positive and negative integers.
The value range is from -2
INTEGERn(b) = b
Negative numbers are represented as 2's complement, which means:
INTEGERn(b) = - INTEGERn(b) - 1 with b
Example: the value -266 = FEF6h is transmitted in the data type INTEGER16, in the form of two
octets (1st octet = F6h, 2nd octet = FEh).
Transmission syntax for the data type INTEGERn
Octet number
INTEGER8
INTEGER16
INTEGER24
INTEGER32
INTEGER40
INTEGER48
INTEGER56
INTEGER64
4.3.2 Mixed data types
Mixed data types combine basic data types (INTEGERn, UNSIGNEDn, REAL). Two types of
mixed data are distinguished:
STRUCT
This data type is composed of elements with different data types.
ARRAY
This data type is composed of elements of the same data type.
S300-S700 CANopen | 4 CANopen Communciation Profile
n
-1. The bit sequence b = b0 ... b
n-1
1
2
+ ... + b
2
+ b
2
n-1
1
0
1.
2.
3.
b
..b
7
0
..b
b
..b
7
0
15
8
..b
b
..b
b
..b
7
0
15
8
23
16
..b
b
..b
b
..b
7
0
15
8
23
16
..b
b
..b
b
..b
7
0
15
8
23
16
..b
b
..b
b
..b
7
0
15
8
23
16
..b
b
..b
b
..b
7
0
15
8
23
16
..b
b
..b
b
..b
7
0
15
8
23
16
n-1
n-1
-1 ... 2
-1. The bit sequence b = b
n-2
1
0
2
+ ... + b
2
+ b
2
with b
n-2
1
0
= 1
n-1
1.
2.
3.
b
..b
7
0
b
..b
b
..b
7
0
15
8
b
..b
b
..b
b
..b
7
0
15
8
23
16
b
..b
b
..b
b
..b
7
0
15
8
23
16
b
..b
b
..b
b
..b
7
0
15
8
23
16
b
..b
b
..b
b
..b
7
0
15
8
23
16
b
..b
b
..b
b
..b
7
0
15
8
23
16
b
..b
b
..b
b
..b
7
0
15
8
23
16
Kollmorgen | kdn.kollmorgen.com | December 2019
defines the value
n-1
0
4.
5.
6.
b
..b
31
24
b
..b
b
..b
31
24
39
32
b
..b
b
..b
b
..b
31
24
39
32
47
b
..b
b
..b
b
..b
31
24
39
32
47
b
..b
b
..b
b
..b
31
24
39
32
47
..b
defines the value
0
n-1
= 0
n-1
4.
5.
6.
b
..b
31
24
b
..b
b
..b
31
24
39
32
b
..b
b
..b
b
..b
31
24
39
32
47
b
..b
b
..b
b
..b
31
24
39
32
47
b
..b
b
..b
b
..b
31
24
39
32
47
7.
8.
40
b
..b
40
55
48
b
..b
b
..b
40
55
48
63
56
7.
8.
40
b
..b
40
55
48
b
..b
b
..b
40
55
48
63
56
17
Advertisement
Table of Contents
