BS ISO/IEC 14543-3-10:2012:2019 Edition
$167.15
Information technology. Home electronic system (HES) architecture – Wireless short-packet (WSP) protocol optimised for energy harvesting. Architecture and lower layer protocols
Published By | Publication Date | Number of Pages |
BSI | 2019 | 38 |
PDF Catalog
PDF Pages | PDF Title |
---|---|
2 | undefined |
4 | CONTENTS |
6 | FOREWORD |
8 | INTRODUCTION |
9 | 1 Scope 2 Normative references |
10 | 3 Terms, definitions and abbreviations 3.1 Terms and definitions |
14 | 3.2 Abbreviations 4 Conformance 5 Architecture 5.1 Generic protocol description 5.1.1 Overview |
15 | 5.1.2 Physical layer 5.1.3 Data link layer 5.1.4 Network layer Tables Table 1 ā WSP protocol stack structure (OSI) |
16 | 5.1.5 Transport layer 5.1.6 Session layer 5.1.7 Presentation layer 5.1.8 Application layer 5.2 Data unit description Figures Figure 1 ā Structure of a subtelegram |
17 | 6 Layer 1 ā Physical layer 6.1 Overview 6.2 General description |
18 | Figure 2 ā Illustration of an ASK envelope and various physical parameters |
20 | 6.3 Requirements for the 315 MHz WSP protocol Table 2 ā Transmitter requirements for the 315 MHz WSP protocol |
21 | Table 3 ā Receiver requirements for the 315 MHz WSP protocol Table 4 ā Minimum required link budget for the 315 MHz WSP protocol Table 5 ā Maximum RX power for the 315 MHz WSP protocol |
22 | 6.4 Requirements for the 868,3 MHz WSP protocol Table 6 ā Transmitter requirements for the 868,3 MHz WSP protocol |
23 | Table 7 ā Receiver requirements for the 868,3 MHz WSP protocol Table 8 ā Minimum required link budget for the 868,3 MHz WSP protocol Table 9 ā Maximum RX power for the 868,3 MHz WSP protocol |
24 | 6.5 Frame Structure Figure 3 ā Complete frame structure for the 868,3 MHz WSP protocol Figure 4 ā Encoded subframe |
25 | 7 Layer 2 ā Data link layer 7.1 Overview 7.2 Subtelegram timing Table 10 ā Frame definition for the 315 MHz WSP protocol Table 11 ā Frame definition for the 868,3 MHz WSP protocol |
26 | Figure 5 ā TX maturity time divided into four 10 ms time ranges Table 12 ā Maturity time parameters Table 13 ā Allocation of time slots to the different subtelegrams |
27 | 7.3 Data integrity 7.3.1 General 7.3.2 4 bit summation hash function algorithm 7.3.3 8 bit summation hash function algorithm Table 14 ā Identification of the hash function used in the telegram |
28 | 7.3.4 8 bit Cyclic Redundancy Check (CRC) hash function algorithm 7.4 Listen before talk 8 Layer 3 ā Network layer 8.1 Overview |
29 | 8.2 Switch telegram Table 15 ā Conversion of the telegram type and STATUS fieldsfrom a switch telegram to a telegram |
30 | 8.3 Repeater 8.3.1 General 8.3.2 Time response for collision avoidance 8.3.3 Bits of a repeater level in the STATUS byte Figure 6 ā Conversion of a switch telegram to a normal telegram |
31 | 8.4 Addressing 8.4.1 General 8.4.2 Encapsulation Table 16 ā STATUS byte with repeater level bits Table 17 ā Repeating bits in STATUS byte |
32 | Figure 7 ā Example of an encapsulation |
33 | Annex A (informative) Examples of how to evaluate the hash values Figure A.1 ā Example of a C code program of the 4 bit long summation hash value Figure A.2 ā Example of a C code program of the 8 bit long summation hash value |
34 | Figure A.3 ā Efficient C code program for the evaluationof an 8 bit long CRC type hash value |
35 | Bibliography |