PDU packaging method, PDU analysis method, PDU packaging device, PDU analysis device and medium

Abstract

The invention relates to a PDU packaging method, a PDU analysis method, a PDU analysis device and a medium, and the PDU packaging method comprises the steps: obtaining to-be-packaged PDU information, the PDU information at least comprising a receiving node for receiving a target PDU; based on the PDU information, performing packaging processing on an SDU in an SDU queue corresponding to the receiving node to obtain the target PDU; wherein the target PDU comprises a header field and a load field, the header field comprises a receiving node indication area, a sending sequence number indication area and a length indication area, and the load field is used for bearing the corresponding SDU in the SDU queue. Therefore, the technical problems that excessive overhead is introduced and the actual data transmission efficiency is reduced in the related technology can be solved.

Description

Technical Field

[0001] The present disclosure relates to the field of communication technology, and in particular to a PDU encapsulation method, a PDU parsing method, a device and a medium. Background Art

[0002] At present, the Protocol Data Unit (PDU) constructed in the existing 4G (4th-Generation, 4G) and 5G (5th-Generation, 5G) protocol stacks, such as the PDU in the Packet Data Convergence Protocol (PDCP) layer, the Radio Link Control (RLC) layer, and the Medium Access Control (MAC) layer, etc. There are some problems in applying the existing PDU structure to the data transmission process of wireless ad hoc networks. For example, the existing PDU includes at most 2 SDUs, and each PDCP PDU needs to add an RLC header field and a MAC header field, which will introduce too much overhead and reduce the efficiency of actual data transmission. Summary of the invention

[0003] In order to overcome the problems existing in the related art, the present disclosure provides a PDU encapsulation method, a PDU parsing method, a device and a medium to solve the technical problems of introducing too much overhead and reducing the efficiency of actual data transmission in the above-mentioned related art.

[0004] According to a first aspect of an embodiment of the present disclosure, a PDU encapsulation method is provided, which is applied to a sending node, and the method includes: Acquire PDU information to be encapsulated, where the PDU information at least includes a receiving node for receiving a target PDU; Based on the PDU information, encapsulate the SDU in the SDU queue corresponding to the receiving node to obtain the target PDU; The target PDU includes a header field and a load field, the header field includes a receiving node indication area, a sending sequence number indication area and a length indication area, and the load field is used to carry the corresponding SDU in the SDU queue.

[0005] In some embodiments, encapsulating the SDU in the SDU queue corresponding to the receiving node based on the PDU information includes: Calculate the current resolvable length of the target SDU according to the length of the target SDU and the current resolvable position, wherein the current resolvable position is used to reflect the position of the target SDU when PDU resolvable is currently performed, and the current resolvable length is used to reflect the length currently supported when resolvable is performed on the target SDU; Performing encapsulation processing based on the current resolvable length of the target SDU; The target SDU is any SDU in the SDU queue.

[0006] In some embodiments, the PDU information further includes the number of decomposable bytes of the target PDU, where the number of decomposable bytes is used to reflect the decomposition length supported by the target PDU, and the encapsulation processing based on the current decomposable length of the target SDU includes: When the current re-decomposable length of the target SDU is greater than the number of re-decomposable bytes of the target PDU, copy the content of the number of re-decomposable bytes after the current re-decomposition position in the target SDU to the target PDU; or, When the current decomposable length of the target SDU is less than or equal to the number of decomposable bytes of the target PDU, the target SDU is copied to the target PDU.

[0007] In some embodiments, after the content of the number of decomposable bytes after the current decomposable position in the target SDU is copied to the target PDU, the method further includes: Based on the number of decomposable bytes of the target PDU, updating the payload length of the target PDU and / or the current decomposition position of the target SDU; and / or, Assign the payload length of the target PDU to the length indication area of ​​the target PDU.

[0008] In some embodiments, after the target SDU is copied to the target PDU, the method further includes: Deleting the target SDU in the SDU queue; and / or, Based on the current decomposable length of the target SDU, the number of decomposable bytes of the target PDU and / or the payload length of the target PDU are updated.

[0009] In some embodiments, the PDU information further includes a sending sequence number corresponding to the target PDU, and the method further includes: The PDU information is assigned to the header field of the target PDU accordingly.

[0010] In some embodiments, the method further comprises: When the sending sequence number of the target PDU is greater than the preset PDU sequence number, a modulo operation is performed based on the preset PDU sequence number and the sending sequence number of the target PDU, so that the sending sequence number of the target PDU is less than or equal to the preset PDU sequence number.

[0011] In some embodiments, The receiving node indication area is used to indicate the receiving node corresponding to the target PDU; The sending sequence number indication area is used to indicate the sending sequence number corresponding to the target PDU; The length indication area is used to indicate the sum of the lengths of each SDU in the target PDU.

[0012] According to a second aspect of an embodiment of the present disclosure, a PDU parsing method is provided, which is applied to a receiving node, and the method includes: Obtain a target PDU to be parsed, wherein the target PDU includes a header field and a payload field, wherein the header field includes a receiving node indication area, a sending sequence number indication area, and a length indication area, and the payload field is used to carry a corresponding SDU; Perform field parsing on the target PDU.

[0013] In some embodiments, The receiving node indication area is used to indicate the receiving node corresponding to the target PDU; The sending sequence number indication area is used to indicate the sending sequence number corresponding to the target PDU; The length indication area is used to indicate the sum of the lengths of each SDU in the target PDU, that is, the length indication area is used to indicate the length of the target PDU.

[0014] In some embodiments, the performing field parsing on the target PDU includes: When the state information of the target PDU includes an asynchronous state, obtaining a synchronization code position in the target PDU; When the synchronization code position is an unprocessed synchronization code position, entering the synchronization state of the target PDU, and performing field parsing on the target PDU; When the synchronization code position is not an unprocessed synchronization code position, the target PDU is deleted.

[0015] In some embodiments, the performing field parsing on the target PDU further comprises: Based on the synchronization code position in the target PDU, determining whether SDU information corresponding to the synchronization code position is successfully acquired, the SDU information at least including the target SDU; When the SDU information is successfully obtained, performing integrity and legality judgment on the SDU information; When the SDU information is legal, determining whether the target SDU corresponding to the SDU information is successfully acquired, and obtaining a corresponding parsing result; The parsing result is used to indicate whether the target SDU is successfully acquired.

[0016] In some embodiments, the method further comprises: When the parsing result indicates that the target SDU is successfully acquired, sending the target SDU to a transport layer; or, When the parsing result is used to indicate that the target SDU was not successfully acquired or when the SDU information was not successfully acquired, if the failure reason includes that the sending sequence number of the target PDU is discontinuous, then all PDUs before the discontinuous sending sequence number are deleted, and all PDUs include at least the target PDU.

[0017] In some embodiments, the method further comprises: When the target PDU also includes other SDUs except the target SDU, updating the synchronization code position in the target PDU based on the length of the target PDU; or, When the target PDU does not include other SDUs except the target SDU, the target SDU is deleted.

[0018] In some embodiments, the SDU information includes at least a header field of the target SDU, and the performing integrity and legality judgment on the SDU information includes: Perform integrity protection calculation based on the header field of the target SDU to obtain corresponding data to be checked; Matching the data to be verified with verification data carried by the integrity protection area in the target SDU; Determining whether the SDU information is legal based on a matching result corresponding to the matching; If the matching result is used to indicate that the matching is successful, then the SDU information is determined to be legal; or if the matching result is used to indicate that the matching is unsuccessful, then the SDU information is determined to be illegal.

[0019] In some embodiments, the method further comprises: When the SDU information is illegal, the target PDU enters an asynchronous state.

[0020] According to a third aspect of an embodiment of the present disclosure, a PDU encapsulation device is provided, which is applied to a sending node, including: An acquisition module is configured to acquire PDU information to be encapsulated, wherein the PDU information at least includes a receiving node for receiving a target PDU; A processing module is configured to encapsulate the SDU in the SDU queue corresponding to the receiving node based on the PDU information to obtain the target PDU; The target PDU includes a header field and a load field, the header field includes a receiving node indication area, a sending sequence number indication area and a length indication area, and the load field is used to carry the corresponding SDU in the SDU queue.

[0021] For the contents not introduced in the embodiments of the present invention, please refer to the relevant introduction in the embodiments of the aforementioned PDU encapsulation method, which will not be repeated here.

[0022] According to a fourth aspect of an embodiment of the present disclosure, a PDU parsing device is provided, which is applied to a receiving node, including: An acquisition module is configured to acquire a target PDU to be parsed, wherein the target PDU includes a header field and a payload field, wherein the header field includes a receiving node indication area, a sending sequence number indication area, and a length indication area, and the payload field is used to carry a corresponding SDU; The processing module is configured to perform field parsing on the target PDU.

[0023] For the contents not introduced in the embodiments of the present invention, please refer to the relevant introduction in the embodiments of the aforementioned PDU parsing method, which will not be repeated here.

[0024] According to the fifth aspect of an embodiment of the present disclosure, a communication device is provided, comprising: a processor; a memory for storing processor executable instructions; wherein the processor is configured to execute the executable instructions to implement the steps of the above-mentioned PDU encapsulation method or the above-mentioned PDU parsing method.

[0025] According to a sixth aspect of an embodiment of the present disclosure, a computer-readable storage medium is provided, on which computer program instructions are stored. When the program instructions are executed by a processor, the steps of the above-mentioned PDU encapsulation method or the above-mentioned PDU parsing method are implemented.

[0026] According to a seventh aspect of an embodiment of the present disclosure, a chip is provided, including: a processor and an interface; the processor is used to read instructions to execute the steps of the above-mentioned PDU encapsulation method or the above-mentioned PDU parsing method.

[0027] The technical solution provided by the embodiments of the present disclosure may include the following beneficial effects: the sending node obtains the PDU information to be encapsulated, and the PDU information at least includes the receiving node that receives the target PDU; based on the PDU information, the SDU in the SDU queue corresponding to the receiving node is encapsulated to obtain the target PDU; wherein the target PDU includes a header field and a load field, and the header field includes a receiving node indication area, a sending sequence number indication area and a length indication area, and the load field is used to carry the corresponding SDU in the SDU queue, such as several SDUs. It can be seen that the header field of the PDU no longer indicates the number of spliced ​​SDUs and their corresponding lengths. Therefore, in the PDU parsing process, it is not necessary to calculate the header overhead first and then determine the number of SDUs that can be multiplexed. It is only necessary to connect the SDUs one by one in the load field, thereby simplifying the complexity of the construction. At the same time, it also solves the technical problems of introducing too much overhead, reducing the efficiency of actual data transmission and the flexibility of business processing in the related technology.

[0028] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the present disclosure.

[0030] Figure 1 The figure is a schematic diagram showing a flattening process of a protocol stack according to an exemplary embodiment.

[0031] Figure 2A The figure is a schematic diagram of a transmission format of a PDU according to an exemplary embodiment.

[0032] Figure 2B The figure is a schematic diagram of a transmission format of an SDU according to an exemplary embodiment.

[0033] Figure 3 The figure is a flow chart of a PDU encapsulation method according to an exemplary embodiment.

[0034] Figure 4 The figure is a flowchart of a packaging process according to an exemplary embodiment.

[0035] Figure 5 The figure is a flowchart of another packaging process according to an exemplary embodiment.

[0036] Figure 6 The figure is a flowchart of another packaging process according to an exemplary embodiment.

[0037] Figure 7 The figure is a schematic diagram of a PDU encapsulation process according to an exemplary embodiment.

[0038] Figure 8 The figure is a flowchart of a PDU parsing method according to an exemplary embodiment.

[0039] Fig. 9 The figure is a flowchart of a field parsing according to an exemplary embodiment.

[0040] Fig.10 The figure is a flowchart of another field parsing according to an exemplary embodiment.

[0041] Fig.11 The figure is a flowchart of a integrity legality judgment according to an exemplary embodiment.

[0042] Fig.12 The figure is a flowchart of a PDU parsing according to an exemplary embodiment.

[0043] Fig.13 The figure is a schematic diagram of the structure of a PDU packaging device according to an exemplary embodiment.

[0044] Fig.14 The figure is a schematic diagram of the structure of a PDU parsing device according to an exemplary embodiment.

[0045] Fig.15 It is a schematic diagram showing the structure of a communication device according to an exemplary embodiment.

[0046] Fig.16 The figure is a schematic diagram showing the structure of a chip according to an exemplary embodiment. DETAILED DESCRIPTION

[0047] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. Instead, they are merely examples of devices and methods consistent with some aspects of the present disclosure as detailed in the appended claims.

[0048] It should be noted that all actions of acquiring signals, information or data in the present disclosure are performed with the authorization given by the owner of the corresponding device.

[0049] If the PDU structure in PDCP, RLC and MAC in the existing 4G / 5G protocol stack is applied to wireless ad hoc networks, the following problems will occur: (1) Although the PDCP_PDU structure is simple, it has no length indication area, requiring the RLC to add a length indication across layers.

[0050] (2) The number of SDUs (i.e., PDCP PDUs) included in the 4G_RLC_PDU is uncertain, and a variable-length header field is required to indicate the number of SDU encapsulations and their lengths, thereby increasing the complexity of subsequent PDU multiplexing and demultiplexing.

[0051] (3) 5G_RLC_PDU solves the complexity of 4G_RLC_PDU processing by fixing the overhead of the header field. However, a PDU includes at most 2 SDUs, and each 5G_RLC_PDU needs to add a MAC header (MAC subheader) to be mapped into a 5G_MAC_PDU, which introduces too much overhead and reduces the efficiency of actual data transmission.

[0052] To solve the above problems, the present disclosure provides a PDU transmission format, a PDU encapsulation method, a PDU parsing method, a device, a medium and a chip. Some embodiments applicable to the present disclosure are first introduced below.

[0053] See also Figure 1 FIG. 1 is a schematic diagram showing a flattening process of a protocol stack according to an exemplary embodiment. Figure 1 As shown, the protocol stack involved in the wireless ad hoc network is similar to the top-down layered protocol stack architecture of 4G (LTE) / 5G users, and is flattened, which retains the transport layer, data link layer and physical layer. Among them, the transport layer is mainly responsible for constructing the raw data into a data service unit (SDU) that can be recognized by all nodes. The data link layer is mainly responsible for splicing the SDU into a protocol data unit (PDU) that can be recognized by neighboring nodes, where one PDU can include at least one SDU or part of the SDU, and this disclosure does not make too many restrictions and details. The physical layer (Physical Layer, PHY) is mainly responsible for providing a specific size of transport block (TB) to carry one or more complete PDUs, where one TB includes at least one PDU, and this disclosure does not make too many restrictions and details. Under the premise of ensuring transmission reliability, it is necessary to more simply and effectively implement SDU parsing, PDU multiplexing and demultiplexing (ie, PDU encapsulation and parsing), and mutual mapping between PDU and TB (ie, PDU to TB mapping, TB to PDU parsing). Based on this architecture, the user plane layered protocol architecture can be flattened while ensuring the stability of data service transmission and improving the effectiveness of data transmission.

[0054] See also Figure 2A FIG. 1 is a schematic diagram showing a transmission format of a PDU according to an exemplary embodiment. Figure 2A The PDU shown may include a header field 101 and a payload field 102. Among them: The above-mentioned header field 101 may refer to a header field with clear field content and fixed length. The above-mentioned header field 101 may include a receiving node indication area 1011, a sending sequence number indication area 1012 and a length indication area 1013. The above-mentioned receiving node indication area 1011 is used to indicate the receiving node corresponding to the PDU, that is, to indicate which receiving node can demultiplex the PDU. The above-mentioned sending sequence number indication area 1012 is used to indicate the sending sequence number corresponding to the PDU, that is, to indicate which PDU it is, so that it can quickly assist the state of PDU demultiplexing and adjust to improve the synchronization detection efficiency of SDU under abnormal reception. Each receiving node maintains a separate sending sequence number (PDU_SN). The sending sequence number PDU_SN can be updated to (PDU_SN+1)%PDU_SN_MAX after each use, where PDU_SN_MAX refers to a preset PDU sequence number, such as the maximum sending sequence number of the PDU, which usually depends on the number of valid bits in the sending sequence number indication area. The above-mentioned length indication area 1013 is used to indicate the length of the load in the PDU, that is, the length of all or each SDU.

[0055] The above-mentioned load field 102 can be used to carry the corresponding SDU. Usually, a PDU may include one or more SDUs, which are not limited or detailed in this disclosure. The transmission format of the SDU in this disclosure needs to be as follows: Figure 2B The transmission format of the new SDU is shown.

[0056] See also Figure 2B FIG. 1 is a schematic diagram showing a transmission format of an SDU according to an exemplary embodiment. Figure 2B The SDU shown may include a header field 201 and a payload field 202, and may optionally include an extension field 203. The header field 201 may refer to a header field with clear field content and fixed length. The SDU receiving buffer of the transport layer may receive corresponding data packets (e.g., Ethernet data packets) according to the length of the header field as an offset, so as to reduce the number of data copies, improve data transmission performance, and facilitate the subsequent multiplexing and demultiplexing process between PDU and SDU to become simpler and faster.

[0057] The above-mentioned header field 201 may include a synchronization indication area 2011, an extension indication area 2012, a length indication area 2013 and an integrity protection area 2014. The above-mentioned synchronization indication area 2011 is used to indicate the synchronization code position of the SDU. That is, based on the synchronization indication area 2011, the synchronization code position can be found from the encapsulated corresponding PDU to determine the position of the SDU. The present disclosure does not limit the size and representation of the above-mentioned synchronization indication area 2011, for example, 1 byte content is usually represented by 0x55, etc. The above-mentioned extension indication area 2012 is used to indicate whether the SDU includes the above-mentioned extension field 203, and usually the extension field 203 is located in the tail area of ​​the SDU. The present disclosure does not limit the size of the above-mentioned extension indication area 2012, for example, it can usually occupy 8 bits, and a bit mapping method can be used to determine whether to include 8 different transmission status indications. For example, the first bit indicates the transmission sequence number of the SDU, and the second bit indicates the priority of the SDU in the wireless ad hoc network. The present disclosure does not limit the representation of the above-mentioned extended indication area. For example, when the value of the above-mentioned extended indication area is 0x00, it is used to indicate that there is no extended content; when the value of the above-mentioned extended indication area is 0x01, it is used to indicate the transmission sequence number of the SDU; when the value of the above-mentioned extended indication area is 0x02, it is used to indicate the priority of the SDU; when the value of the above-mentioned extended indication area is 0x03, it is used to indicate that the transmission sequence number and priority of the SDU can be included at the same time. The above-mentioned length indication area 2013 is used to indicate the length of the entire SDU, and its purpose can be to quickly synchronize the next SDU. The present disclosure does not limit the size and representation of the above-mentioned length indication area 2013. For example, it can occupy 12 bits and can indicate 2048 bytes, which is larger than the traditional Ethernet data packet length (the Ethernet data packet length is usually less than 1600 bytes). The above-mentioned integrity protection area 2014 is used to make integrity and legal judgments on the SDU. The present disclosure does not limit the size and representation of the above-mentioned integrity protection area 2014. For example, it can occupy 1 byte. The present disclosure does not limit the specific implementation of the above-mentioned integrity legal judgment. For example, the present disclosure can use a preset algorithm (such as the checksum algorithm of the Internet Protocol (IP)) to calculate the result of 2 bytes by taking the above-mentioned synchronization indication area 2011, the above-mentioned extension indication area 2012, the above-mentioned length indication area 2013 and the partial data packet as the load (such as the first dozens of bytes in the Ethernet data packet) as input, extract the data content of the last byte and match it with the check data carried in the above-mentioned integrity protection area 2014. If the match is successful, the result of the above-mentioned integrity legal judgment is legal; otherwise, the result of the above-mentioned integrity legal judgment is illegal.

[0058] The payload field 202 is used to carry a complete data packet, such as an Ethernet data packet.

[0059] The above-mentioned extension field 203 refers to an expandable field that can be located at the end of the SDU, which is mainly used to indicate the sending status of the transmission service in the protocol. For example, it may include but is not limited to any one or more of the following combinations: the sending sequence number, priority, delay parameter or other custom information of the SDU. The above-mentioned sending sequence number refers to the sending sequence number of the SDU, such as the sending number, etc. The above-mentioned priority refers to the priority of the SDU, which is convenient for the subsequent processing of the SDU according to the priority, such as forwarding the SDU according to the corresponding priority, etc. The above-mentioned delay parameter may refer to the minimum delay guarantee parameter required by the SDU, which is used to reflect the transmission delay of the SDU, such as the minimum transmission delay, etc. The length of each field or area involved in the above-mentioned SDU can be an integer number of bytes, and the length of the entire SDU can also be an integer number of bytes. The content settings of the above-mentioned fields can be customized in advance by the system or the user according to the actual situation, and this disclosure does not make too many restrictions and details on this.

[0060] The sending node involved in the present disclosure may also be referred to as a sending end or a sending device, which is an entity for receiving or transmitting signals, such as a terminal device or a network device. The terminal device may also be referred to as a terminal device (terminal), a user equipment (UE), a mobile station (MS), a mobile terminal device (MT), etc. The terminal device may be a car with communication function, a smart car, a mobile phone (Mobile Phone), a wearable device, a tablet computer (Pad), a computer with wireless transceiver function, a virtual reality (Virtual Reality, VR) terminal device, an augmented reality (Augmented Reality, AR) terminal device, a wireless terminal device in industrial control (Industrial Control), a wireless terminal device in self-driving, a wireless terminal device in remote medical surgery, a wireless terminal device in smart grid (Smart Grid), a wireless terminal device in transportation safety (Transportation Safety), a wireless terminal device in smart city (Smart City), a wireless terminal device in smart home (Smart Home), etc. The network device is described in detail below and will not be elaborated here. The embodiments of the present disclosure do not limit the specific technology and specific device form adopted by the sending node.

[0061] The receiving node involved in the present disclosure may also be referred to as a receiving end or a receiving device, which is an entity for receiving signals, such as a network device or a terminal device. For the introduction of the terminal device, reference may be made to the relevant introduction of the aforementioned content. The network device may be an evolved NodeB (eNB), a transmission point (TRP), a next generation NodeB (gNB) in an NR system, a base station in other future mobile communication systems, or an access node in a wireless fidelity (WiFi) system. The embodiments of the present disclosure do not limit the specific technology and specific device form adopted by the receiving node. When the above-mentioned receiving node is a network device, the network device may be composed of a centralized unit (CU) and a distributed unit (DU), wherein the CU may also be referred to as a control unit (Control Unit). The CU-DU structure may be used to split the protocol layer of a network device, such as a base station, and the functions of some protocol layers are placed in the CU for centralized control, and the functions of the remaining part or all of the protocol layers are distributed in the DU, and the DU is centrally controlled by the CU. The embodiments of the present disclosure do not limit the specific technology and specific device form adopted by the receiving node.

[0062] See also Figure 3 FIG. 1 is a flow chart of a PDU encapsulation method according to an exemplary embodiment. Figure 3 The method shown can be applied to a sending node, and the method may include the following implementation steps: S301. Obtain PDU information to be encapsulated, where the PDU information at least includes a receiving node that receives a corresponding PDU.

[0063] In the present disclosure, the above-mentioned PDU information may refer to information used to describe the target PDU to be encapsulated, for example, it may include but is not limited to any one or more combinations of the following: the receiving node (rID) corresponding to the target PDU, the sending sequence number (PDU_SN) corresponding to the target PDU, the number of resolvable bytes of the target PDU (PDU_B), or other custom PDU related information, etc. Among them, the number of resolvable bytes PDU_B of the above-mentioned target PDU can be used to reflect the number of resolvable bytes supported by the target PDU, and it can be set to the remaining transmission block size in a transmission block TB supported by the sending node during initialization. The reason for using the remaining transmission block size of TB is that one TB in the present disclosure can carry different PDUs of multiple receiving nodes. For example, when one TB block can carry two PDUs sent to receiving nodes 1 and 2, first, the number of decomposable bytes of PDU1 is the TB transmission block size. After PDU1 is decompressed, PDU1_B+PDU1_HB (PDU fixed header length) is less than the TB transmission block size. Then the remaining transmission block size in TB = TB transmission block size - PDU1_B - PDU1_HB can be used as the number of decomposable bytes of PDU2.

[0064] The present disclosure does not limit the implementation method for obtaining the above-mentioned PDU information. For example, the receiving node corresponding to the above-mentioned target PDU, the sending sequence number corresponding to the above-mentioned target PDU, etc. can be determined according to actual communication needs. The number of decomposable bytes of the above-mentioned target PDU can be updated and determined according to the header field length of the above-mentioned target PDU. For example, the number of decomposable bytes of the above-mentioned target PDU (PDU_B) can be equal to the difference between itself and the header field length of the above-mentioned target PDU; that is, the number of decomposable bytes of the above-mentioned target PDU can be the difference between the value of the number of decomposable bytes of the above-mentioned target PDU when it is initialized and the header field length of the above-mentioned target PDU.

[0065] S302. Based on the PDU information, encapsulate the SDU in the SDU queue corresponding to the receiving node to obtain the corresponding target PDU; wherein the target PDU includes a header field and a load field, the header field includes a receiving node indication area, a sending sequence number indication area and a length indication area, and the load field is used to carry the corresponding SDU.

[0066] It is understandable that a receiving node corresponds to a corresponding SDU queue, and the SDU queue includes a number of SDUs to be encapsulated. The present disclosure can traverse each SDU in the above SDU queue to perform corresponding encapsulation processing. The present disclosure does not limit the specific implementation of the above encapsulation processing, and takes the target node as an example to illustrate the relevant content, but it does not constitute a limitation. The target node is any SDU in the above SDU queue. Please refer to Figure 4FIG. 1 is a schematic diagram of a packaging process according to an exemplary embodiment. Figure 4 The process shown may include the following implementation steps: S401. Calculate the current resolvable length of the target SDU according to the length of the target SDU and the current resolvable position, wherein the current resolvable position is used to reflect the position of the target SDU when PDU encapsulation and resolvable are currently performed, and the current resolvable length is used to reflect the length currently supported when resolvable the target SDU.

[0067] In the present disclosure, the current demultiplexing position (SDU_MPos) of the above-mentioned target SDU may refer to the position where the target SDU is currently encapsulated / demultiplexed, which is used to reflect the position when the target SDU is currently encapsulated / demultiplexed for PDU. During initialization, the above-mentioned current demultiplexing position may usually be 0. The current demultiplexable length of the above-mentioned target SDU may refer to the length currently supported for encapsulating / demultiplexing the target PDU, and accordingly it is also used to reflect the length currently supported for encapsulating / demultiplexing the target PDU. The length of the above-mentioned target PDU (PDU_TB) refers to the total length of the target PDU, which may include the header field length (PDU_H) of the target PDU and the payload field length (PDU_PB) of the target PDU.

[0068] The present disclosure does not limit the calculation implementation method of the above-mentioned current re-decomposable length. For example, the length of the above-mentioned target SDU and the current re-decomposition position of the target SDU can be calculated by using a preset first rule. The above-mentioned preset first rule is a calculation rule customized by the system or the user according to actual conditions. For example, the above-mentioned preset first rule can be a calculation formula shown in the following formula (1): Formula (1) Among them, SDU_B represents the current re-decomposable length of the above-mentioned target SDU, SDU_TB represents the length of the above-mentioned target SDU, and SDU_MPos represents the current re-decomposition position of the above-mentioned target SDU.

[0069] S402: Perform encapsulation processing based on the current resolvable length of the target SDU.

[0070] The present disclosure does not limit the specific implementation of the above packaging process. For example, in one implementation, see Figure 5 FIG. 1 is a flow chart of another packaging process according to an exemplary embodiment. Figure 5 The process shown may include the following implementation steps: S501. When the current decomposable length of the target SDU is greater than the number of decomposable bytes of the target PDU, copy the content of the number of decomposable bytes after the current decomposition position in the target SDU to the target PDU.

[0071] In the present disclosure, the number of decomposable bytes of the target PDU may be predetermined, for example, as described above. Figure 3 In the embodiment, the number of decomposable bytes of the target PDU may be the difference between the value of the number of decomposable bytes of the target PDU when it is initialized and the length of the header field of the target PDU, etc. This disclosure does not make too many restrictions or details on this.

[0072] After calculating and obtaining the current resolvable length (SDU_B) of the target SDU, the present disclosure can determine whether the current resolvable length (SDU_B) of the target SDU is greater than the number of resolvable bytes (PDU_B) of the target PDU. If the current resolvable length (SDU_B) of the target SDU is greater than the number of resolvable bytes (PDU_B) of the target PDU, the present disclosure can copy the content that needs to be reconnected after the current resolvable position in the target SDU to the corresponding position of the target PDU.

[0073] In some optional embodiments, Figure 5 It may also include one or more combinations of the following implementation steps, which may be determined according to actual conditions, and the present disclosure does not constitute a limitation thereto.

[0074] S502: Based on the number of decomposable bytes of the target PDU, update the payload length of the target PDU and / or the current decomposition position of the target PDU.

[0075] The present disclosure can update the load length (PDU_PB) of the above-mentioned target PDU and / or the current re-resolving position (SDU_MPos) of the above-mentioned target SDU according to the number of re-resolving bytes (PDU_B) of the above-mentioned target PDU. The present disclosure does not limit the specific implementation method of the above-mentioned update. For example, it can adopt the corresponding preset second rule to update the load length (PDU_PB) of the above-mentioned target PDU and / or the current re-resolving position (SDU_MPos) of the above-mentioned target SDU according to the number of re-resolving bytes (PDU_B) of the above-mentioned target PDU. The above-mentioned preset second rule is a calculation rule customized by the system or user according to actual conditions. For example, the above-mentioned preset second rule can be a calculation formula shown in the following formula (2): Formula (2) Among them, PDU_B represents the number of decomposable bytes of the above-mentioned target PDU, PDU_PB represents the payload length of the above-mentioned target PDU, and SDU_MPos represents the current decomposition position of the above-mentioned target SDU.

[0076] S503: Assign the payload length of the target PDU to the length indication area of ​​the target PDU.

[0077] The present disclosure may assign the updated payload length (PDU_PB) of the target PDU to the length indication area of ​​the header field in the target PDU to indicate or specify the lengths of all SDUs in the target PDU, that is, the total length of the target PDU.

[0078] In yet another embodiment, see Figure 6 FIG. 1 is a flow chart of another packaging process according to an exemplary embodiment. Figure 6 The process shown may include the following implementation steps: S601: When the current decomposable length of the target SDU is less than or equal to the number of decomposable bytes of the target PDU, copy the target SDU to the target PDU.

[0079] After calculating and obtaining the current resolvable length (SDU_B) of the target SDU, the present disclosure can determine whether the current resolvable length (SDU_B) of the target SDU is greater than the number of resolvable bytes (PDU_B) of the target PDU. If the current resolvable length (SDU_B) of the target SDU is less than or equal to the number of resolvable bytes (PDU_B) of the target PDU, the present disclosure can copy the entire target SDU to the corresponding position in the target PDU. In some optional embodiments, Figure 6 It may also include one or more combinations of the following implementation steps, which may be determined according to actual conditions, and the present disclosure does not constitute a limitation thereto.

[0080] S602: Delete the target SDU in the SDU queue.

[0081] The present disclosure may delete the target SDU from the SDU queue corresponding to the receiving node.

[0082] S603: Based on the current decomposable length of the target SDU, update the number of decomposable bytes of the target PDU and / or the payload length of the target PDU.

[0083] The present disclosure can update the number of decomposable bytes (PDU_B) of the above-mentioned target PDU and / or the load length (PDU_PB) of the above-mentioned target PDU according to the current decomposable length (SDU_B) of the above-mentioned target SDU. The present disclosure does not limit the specific implementation method of the above-mentioned update. For example, it can adopt the corresponding preset third rule to update the number of decomposable bytes (PDU_B) of the above-mentioned target PDU and / or the load length (PDU_PB) of the above-mentioned target PDU according to the current decomposable length (SDU_B) of the above-mentioned target SDU. The above-mentioned preset third rule is a calculation rule customized by the system or user according to actual conditions. For example, the above-mentioned preset third rule can be a calculation formula shown in the following formula (3): Formula (3) Among them, PDU_B represents the number of decomposable bytes of the above-mentioned target PDU, SDU_B represents the current decomposable length of the above-mentioned target SDU, and PDU_PB represents the payload length of the above-mentioned target PDU.

[0084] It should be noted that the present disclosure can refer to the aforementioned Figures 4 to 6 The encapsulation principle in the embodiment is to perform PDU encapsulation on all SDUs in the SDU queue, so as to obtain the target PDU corresponding to the above-mentioned receiving node, etc., and this disclosure does not make too many restrictions and details on this.

[0085] Some optional embodiments of the present disclosure are described below.

[0086] In some optional embodiments, the present disclosure may assign the above PDU information (such as the sending sequence number corresponding to the above target PDU, the identifier of the receiving node corresponding to the above target PDU, and other information) to the header field of the above target PDU. For example, the present disclosure may assign the sending sequence number corresponding to the above target PDU to the sending sequence number area of ​​the header field in the target PDU. The identifier of the receiving node corresponding to the above target PDU may be assigned to the receiving node indication area of ​​the header field in the target PDU, etc.

[0087] In some other optional embodiments, when the present disclosure identifies that the sending sequence number of the above-mentioned target PDU is greater than the preset PDU sequence number, it can perform a modulo operation (%) based on the above-mentioned preset PDU sequence number and the sending sequence number of the above-mentioned target PDU, so that the sending sequence number of the above-mentioned target PDU is less than or equal to the above-mentioned preset PDU sequence number. In the specific implementation process, the sending sequence number PDU_SN can be updated to (PDU_SN+1)% PDU_SN_MAX after each use, where PDU_SN_MAX refers to the above-mentioned preset PDU sequence number, such as the maximum sending sequence number of the PDU, which usually depends on the number of valid bits in the sending sequence number indication area. Thereby ensuring that the sending sequence number of each target SDU is valid or identifiable.

[0088] It can be seen that PDU has the following advantages in the multiplexing process: 1) The header field of PDU no longer indicates the number of spliced ​​SDUs and their corresponding lengths, so PDU does not need to calculate the header overhead before deciding the number of SDUs that can be multiplexed in the multiplexing process. It only needs to connect the SDUs one by one in the payload field, thereby simplifying the construction complexity; 2) The payload field of PDU can splice multiple SDUs, compared with 5G RLC PDU, which can only splice 2 SDUs at most, which greatly improves the multiplexing performance; 3) The payload field of PDU no longer has padding content, compared with 4G RLC PDU with padding content, which also improves the multiplexing performance; 4) Since there is a probability of false detection in the synchronization header, adding an integrity protection area to the header (which depends on part of the data content) effectively reduces the probability of false detection while also reducing the probability of attack on the constructed SDU.

[0089] To help better understand the embodiments of the present disclosure, the following examples are given. Figure 7 FIG. 1 is a flow chart showing a PDU encapsulation (also referred to as PDU decompression) process according to an exemplary embodiment. Figure 7 The process shown may include the following implementation steps: S701, determine the receiving node (Ird) corresponding to the target PDU and the number of decomposable bytes of the target PDU (PDU_B). Generally, the number of decomposable bytes of the target PDU is set to the size of the remaining transport blocks in a transport block TB during initialization.

[0090] S702. Assign content to the header field of the target PDU. Specifically, for example, the receiving node indication area is assigned to the identifier Ird of the above-mentioned receiving node, and the sending sequence number indication area is assigned to the sending sequence number (PDU_SN) of the target PDU. Usually, it can be updated to (PDU_SN+1)% PDU_SN_MAX after each use. It can correspond to the relevant introduction in the embodiment described in Figure 2 above, which will not be repeated here. Optionally, the number of decomposable bytes (PDU_B) of the above-mentioned target PDU can also be updated, which can be specifically PDU_B= PDU_B- PDU_HB. Among them, PDU_HB represents the length of the header field of the above-mentioned target PDU.

[0091] S703: Determine whether the SDU queue corresponding to the receiving node Ird is empty. The SDU queue may be a First Input First Output (FIFO) queue.

[0092] The present disclosure may execute step S708 when it is determined that the SDU queue is empty; conversely, when it is determined that the SDU queue is not empty, step S704 may be executed.

[0093] S704: Extract the first SDU in the SDU queue as the target SDU, and calculate the current resolvable length of the target SDU, SDU_B = SDU_TB - SDU_MPos, where SDU_B represents the current resolvable length of the target SDU, SDU_TB represents the length of the target SDU, and SDU_MPos represents the current resolvable position of the target SDU.

[0094] S705 . Determine whether the current decomposable length (SDU_B) of the target SDU is greater than the number of decomposable bytes (PDU_B) of the target PDU.

[0095] When it is determined that the current resolvable length SDU_B of the target SDU is not greater than the number of resolvable bytes (PDU_B) of the target PDU, step S706 may be continued. On the contrary, when it is determined that the current resolvable length SDU_B of the target SDU is greater than the number of resolvable bytes (PDU_B) of the target PDU, step S707 may be continued.

[0096] S706. Copy the part of the target SDU that needs to be multiplexed to the corresponding position of the PDU. Delete the target SDU from the SDU queue. Update the number of decomposable bytes of the target PDU PDU_B = PDU_B-SDU_B. Update the payload length of the target PDU PDU_PB = PDU_PB + SDU_B. Repeat the above steps S703 to S708.

[0097] S707, copy the part of the target SDU that needs to be multiplexed to the corresponding position of the PDU, update the payload length of the target PDU PDU_PB = PDU_PB + PDU_B, and update the current multiplexing position SDU_MPos of the target SDU = SDU_MPos + PDU_B.

[0098] S708: Stop decomposing, and assign the payload length PDU_PB of the target PDU to the length indication area of ​​the header field in the target PDU.

[0099] For details not described in the embodiments of the present disclosure, please refer to the aforementioned Figures 3 to 6 The specific introduction in the embodiments will not be repeated here.

[0100] See also Figure 8 FIG. 1 is a flow chart of a PDU parsing method according to an exemplary embodiment. Figure 8 The method shown can be applied to a receiving node, and the method may include the following implementation steps: S801. Obtain a target PDU to be parsed, wherein the target PDU includes a header field and a payload field, wherein the header field includes a receiving node indication area, a sending sequence number indication area, and a length indication area, and the payload field is used to carry a corresponding SDU.

[0101] In the present disclosure, the target PDU mentioned above may refer to the PDU to be parsed received by the receiving node. Usually, the receiving node can store the received unparsed PDU in the PDU queue (DM_PDUs), and when parsing is required, the PDUs in the PDU queue (DM_PDUs) can be directly traversed in order for parsing. In other words, the target PDU mentioned above may also be any PDU in the PDU queue (DM_PDUs). The present disclosure only takes the target PDU in the PDU queue (DM_PDUs) as an example to introduce the specific content of PDU parsing, but it does not constitute a limitation.

[0102] The present disclosure does not limit the implementation method of obtaining the above-mentioned target PDU. For example, the PDU sent by the sending node can be directly received, or it can be obtained by traversing the PDU queue (DM_PDUs), etc. The present disclosure does not make too many limitations and details on this. For the introduction of the encapsulation format / transmission format of the target PDU, please refer to the above Figure 2A The relevant introduction in the embodiments will not be repeated here.

[0103] S802: Perform field analysis on the target PDU.

[0104] The present disclosure does not limit the specific implementation of the above field parsing. For example, in one implementation, the state information of the above target PDU includes an asynchronous state. Fig. 9 FIG. 1 is a flow chart showing a field parsing process according to an exemplary embodiment. Fig. 9 The process shown may include the following implementation steps: S901. When the state information of the target PDU includes an asynchronous state, obtain a synchronization code position in the target PDU.

[0105] The present disclosure can identify the current state information of the target PDU, and the state information may include a synchronous state and an asynchronous state. When the above-mentioned target PDU is in an asynchronous state, the present disclosure can obtain the synchronization code position (PDU.SPos) in the above-mentioned target PDU. The synchronization code position may refer to the information carried in the synchronization indication area of ​​each SDU in the target PDU, which may also be referred to as synchronization information. The present disclosure does not limit the implementation method for obtaining the above-mentioned synchronization code position. For example, the above-mentioned target PDU can usually be parsed, the synchronization indication area of ​​each SDU in the target PDU can be identified, and the above-mentioned synchronization code position can be traversed from the preset synchronization code position (PDU.SPos) to find a new synchronization code position. During initialization, the above-mentioned synchronization code position (PDU.SPos) may be a custom position, such as 0.

[0106] S902: When the synchronization code position is an unprocessed synchronization code position, enter the synchronization state of the target PDU and perform field parsing on the target PDU.

[0107] After obtaining the synchronization code position of the target PDU, it can be determined whether the synchronization code position is an unprocessed synchronization code position (e.g., a new synchronization code position), that is, whether the synchronization code position has been processed before. If it is determined that the synchronization code position is an unprocessed synchronization code position, the synchronization state can be entered to perform field parsing on the target PDU, which can be referred to in the following section of this disclosure. Fig.10 The relevant introduction in the embodiment will not be described in detail here.

[0108] S903: When the synchronization code position is not an unprocessed synchronization code position, delete the target PDU.

[0109] If it is determined that the synchronization code position is not an unprocessed synchronization code position (eg, a new synchronization code position), the target PDU may be deleted, for example, by deleting the target PDU from a PDU queue (DM_PDUs).

[0110] In yet another embodiment, the target PDU status information includes a synchronization status. Fig.10 FIG. 1 is a flow chart showing another field parsing process according to an exemplary embodiment. Fig.10 The flowchart shown may include the following implementation steps: S1001. Based on a synchronization code position in the target PDU, determine whether SDU information corresponding to the synchronization code position is successfully acquired, where the SDU information at least includes a target SDU.

[0111] After obtaining the synchronization code position in the target PDU, the present disclosure can update the synchronization code position, for example, PDU.SPos= PDU.SPos+traversal length. The traversal length is the length of traversing and searching for the synchronization code position in the asynchronous state.

[0112] After obtaining the synchronization code position in the above-mentioned target PDU, it can be determined / judged whether the SDU information corresponding to the above-mentioned synchronization code position can be read from the PDU queue (DM_PDUs). The SDU information refers to the relevant information used to describe the target SDU corresponding to the above-mentioned synchronization code position, which may include but is not limited to information such as the header field of the target SDU and the load field of the target SDU. Among them, the header field of the above-mentioned target SDU may include but is not limited to any one or more of the following combinations: the synchronization indication area, the extended indication area, the length indication area and the content of part of the data packet in the target SDU. The content of the above-mentioned part of the data packet can be carried in the extended indication area of ​​the target SDU, etc.

[0113] S1002: When the SDU information is successfully obtained, perform integrity and legality judgment on the SDU information.

[0114] After determining that the SDU information corresponding to the synchronization code position can be successfully obtained, the present disclosure can perform integrity and legality judgment on the above SDU information. The present disclosure does not limit the specific implementation method of the above integrity and legality judgment. For example, see Fig.11 FIG. 1 is a flow chart showing a process of integrity legality judgment according to an exemplary embodiment. Fig.11 The process shown may include the following implementation steps: S1101. Perform integrity protection calculation based on the header field of the target SDU to obtain corresponding data to be checked.

[0115] The present disclosure can use a preset algorithm (such as a checksum algorithm of the Internet Protocol (IP)) to calculate the header field of the target SDU (specifically, for example, including a synchronization indication area, an extension indication area, a length indication area, and part of the content in the data packet as a load (such as the first dozens of bytes in the Ethernet data packet), etc.) to obtain a corresponding calculation result. The above-mentioned data to be checked is obtained based on the calculation result.

[0116] For example, the present disclosure may use the synchronization indication area, the extension indication area, the length indication area and part of the content in the data packet serving as the payload (e.g., the first few dozen bytes in the Ethernet data packet) in the above-mentioned target SDU as the input of the above-mentioned IP checksum algorithm to calculate a 2-byte result, and extract the data content of the last 1 byte as the above-mentioned data to be checked.

[0117] S1102. Match the data to be verified with the verification data carried by the integrity protection area in the target SDU.

[0118] After calculating and obtaining the above-mentioned data to be verified, the present disclosure can match the above-mentioned data to be verified with the verification data carried in the integrity protection area of ​​the above-mentioned target SDU. If the match is successful, the process proceeds to step S1103 to determine that the result of the above-mentioned integrity legality judgment is legal, that is, to determine that the above-mentioned SDU information is legal. On the contrary, if the match is unsuccessful, the process proceeds to step S1104 to determine that the result of the above-mentioned integrity legality judgment is illegal, that is, to determine that the above-mentioned SDU information is illegal.

[0119] S1103: If the match is successful, determine that the SDU information is legal.

[0120] S1104: If the matching fails, determine that the SDU information is illegal.

[0121] S1003. When the SDU information is legal, determine whether the target SDU corresponding to the SDU information is successfully acquired, and obtain a corresponding parsing result; wherein the parsing result is used to indicate whether the target SDU is successfully acquired.

[0122] After determining that the SDU information is legal, the present disclosure can determine / judge whether the complete target SDU can be read from the PDU queue (DM_PDUs) according to the SDU length indicated by the length indication area in the SDU information, thereby obtaining a corresponding parsing result. The parsing result is used to indicate whether the target SDU can be successfully obtained.

[0123] Some optional embodiments of the present disclosure are described below.

[0124] In some optional embodiments, the present disclosure may enter an asynchronous state when determining that the above SDU information is illegal. For details, please refer to the above Fig. 9 The relevant introduction in the embodiments will not be repeated here.

[0125] In some further optional embodiments, when the above parsing result is used to indicate that the above target SDU can be successfully acquired, the present disclosure may send the above target SDU to the transport layer. Optionally, if the current demultiplexing position of the target PDU is greater than 0, the present disclosure may delete all PDUs before the position from the PDU queue (DM_PDUs).

[0126] In some other optional embodiments, when the above-mentioned analysis result is used to indicate that the above-mentioned target SDU is not successfully acquired, the corresponding failure reason can be read and analyzed. If the above-mentioned failure reason is that the sending sequence number of the target PDU is not continuous, it can be specifically caused by the discontinuous sending sequence number in the PDU queue (DM_PDUs). Then the present disclosure can delete all PDUs (including the above-mentioned target PDU) with discontinuous sending sequence numbers from the above-mentioned PDU queue (DM_PDUs).

[0127] In some other optional embodiments, the present disclosure can identify and determine whether the target PDU also includes other SDUs in addition to the target SDU. If it is determined that the target PDU also includes other SDUs, the present disclosure can update the synchronization code position in the target PDU based on the length of the target PDU, for example, the synchronization code position PDU.SPos = PDU.SPos + the length of the target SDU.

[0128] In some other optional embodiments, if it is determined that the target PDU does not include other SDUs except the target SDU, the present disclosure may use the target SDU to enter an asynchronous state. For details, please refer to the aforementioned Fig. 9 The relevant introduction in the embodiments will not be repeated here.

[0129] It can be seen that the data link layer PDU uses a synchronization mechanism to complete the SDU detection during the demultiplexing process, which has the following advantages: 1) During the demultiplexing process, the PDU does not need to count the number of SDUs and their corresponding lengths from the header field. It only needs to obtain the load length from the header and then enter the load field to read the SDU according to its own state; 2) Since there is a probability of false detection in the synchronization header, adding an integrity protection area to the header (which also depends on part of the data content) effectively reduces the probability of false detection while also reducing the probability of the constructed SDU being attacked; 3) Introducing a state machine mechanism in the PDU demultiplexing process, clarifying the SDU synchronization behavior in each state, thereby reducing the complexity of normal processing and improving the stability of exception processing.

[0130] To facilitate a better understanding of the embodiments of the present disclosure, the following examples are given. Fig.12 FIG. 1 is a flow chart showing a PDU parsing (also referred to as PDU decompression) process according to an exemplary embodiment. Fig.12 The flowchart shown may include a synchronous state process and an asynchronous state process. The asynchronous state process may include steps S11-S14, and the synchronous state process may include steps S21-S29. The asynchronous state process: S11. Determine whether the PDU queue (DM_PDUs) is empty.

[0131] When it is determined that the PDU queue (DM_PDUs) is empty, the process can be terminated. Otherwise, step S12 can be continued. When the present disclosure receives any unparsed PDU, it can be stored in the above-mentioned PDU queue (DM_PDUs). The above-mentioned PDU queue can be a first-in-first-out (FIFO) queue.

[0132] S12, extracting the first PDU from the PDU queue as the target PDU, and traversing the target PDU starting from the preset synchronization code position (PDU.SPos) in the target PDU to find a new synchronization code position PDU.SPos.

[0133] S13: Determine whether a new synchronization code position can be found from the target PDU.

[0134] When it is determined that the new synchronization code position PDU.SPos can be found, the synchronization state can be entered and step S21 can be executed. On the contrary, when it is determined that the new synchronization code position PDU.SPos cannot be found, step S14 can be continued.

[0135] S14. Delete the target PDU from the PDU queue (DM_PDUs).

[0136] Synchronization status process: S21. Update the synchronization code position PDU.SPos in the target PDU=PDU.SPos+traversal length.

[0137] S22. Determine whether the header field of the target SDU corresponding to the synchronization code position, such as the synchronization header and part of the data content, can be read from the PDU queue (DM_PDUs).

[0138] When it is determined that the header field of the target SDU can be read, step S23 may be continued to be executed; otherwise, when it is determined that the header field of the target SDU cannot be read, step S28 may be continued to be executed.

[0139] In some optional embodiments, when receiving any unparsed PDU, the present disclosure may store the received PDU into the above PDU queue (DM_PDUs). For example, when reading the header field of the above target SDU, the received unparsed PDU may be stored into the above PDU queue (DM_PDUs).

[0140] S23: Perform integrity and legality judgment based on the header field of the target SDU, that is, judge whether the synchronization is valid based on integrity and legality.

[0141] When the result of the integrity legality judgment is determined to be legal, the present disclosure may continue to execute step S24; otherwise, when the result of the integrity legality judgment is determined to be illegal, the asynchronous state process may be entered.

[0142] S24. According to the length indication area of ​​the header field in the target SDU, it is determined whether the complete target SDU can be read from the PDU queue (DM_PDUs).

[0143] When it is determined that the above target SDU can be read completely, step S25 can be continued to be executed; otherwise, when it is determined that the above target SDU cannot be read completely, step S28 can be continued to be executed.

[0144] S25, passing the complete SDU to the transport layer. When the position of the current demultiplexed PDU is greater than 0, all PDUs before the position can be deleted from the PDU queue (DM_PDUs).

[0145] S26: Determine whether the target PDU also includes other SDUs.

[0146] The present disclosure may enter step S27 when it is determined that the target PDU includes other SDUs; conversely, when it is determined that the target PDU includes other SDUs, an asynchronous state process may be entered.

[0147] S27, correct the synchronization code position PDU.SPos of the target PDU, and detect whether the position is the same as the synchronization code position of the SDU. If yes, the above steps S22-S28 can be executed cyclically. If not, the asynchronous state process can be entered.

[0148] S28. Determine whether the reading failure is caused by discontinuous sending sequence numbers in the PDU queue (DM_PDUs).

[0149] If the present disclosure determines that the above failure is caused by discontinuous sending sequence numbers in the PDU queue (DM_PDUs), then step S29 may be continued to be executed; otherwise, the original state is maintained and new PDUs are waited for to perform DM_PDUs and repeat step S22 or step S24.

[0150] S29. Delete all PDUs before the sequence number interruption / discontinuity from the PDU queue (DM_PDUs).

[0151] For details not described in the embodiments of the present disclosure, please refer to the aforementioned Figures 8 to 11 The specific introduction in the embodiments will not be repeated here.

[0152] By implementing the embodiments of the present disclosure, the following advantages can be achieved: 1) The construction of SDU can not only indicate the transmission status of the service in the protocol through the extended field (increasing the construction flexibility), but also perfectly combine the synchronization mechanism with the PDU multiplexing and demultiplexing process.

[0153] 2) The introduction of the SDU synchronization header means that when constructing the PDU, there is no need to use a specific area to indicate the number and length of the spliced ​​SDUs. Therefore, when PDU multiplexing (retaining the advantages of 4G and 5G RLC PDU multiplexing), the splicing performance is greatly improved on the basis of simplifying the process.

[0154] 3) Introduce a state machine mechanism in the PDU decompression process to clarify the SDU synchronization behavior in each state, thereby reducing the complexity of normal processing and improving the stability of exception processing.

[0155] 4) This method adds a header integrity detection mechanism to the SDU, which reduces the probability of misdetection of the SDU synchronization header and improves synchronization efficiency.

[0156] 5) The data transmission protocol architecture is flatter, greatly reducing the complexity of protocol implementation.

[0157] Based on the above examples, see Fig.13 FIG. 1 is a schematic diagram showing a structure of a PDU packaging device according to an exemplary embodiment. Fig.13 The device shown can be applied to a sending node, and the device may include an acquisition module 1301 and a processing module 1302. Among them: The acquisition module 1301 is configured to acquire PDU information to be encapsulated, wherein the PDU information at least includes a receiving node for receiving a target PDU; The processing module 1302 is configured to encapsulate the SDU in the SDU queue corresponding to the receiving node based on the PDU information to obtain the target PDU; The target PDU includes a header field and a load field, the header field includes a receiving node indication area, a sending sequence number indication area and a length indication area, and the load field is used to carry the corresponding SDU in the SDU queue.

[0158] In some embodiments, the processing module 1302 is configured to: Calculate the current resolvable length of the target SDU according to the length of the target SDU and the current resolvable position, wherein the current resolvable position is used to reflect the position of the target SDU when PDU resolvable is currently performed, and the current resolvable length is used to reflect the length currently supported when resolvable is performed on the target SDU; Performing encapsulation processing based on the current resolvable length of the target SDU; The target SDU is any SDU in the SDU queue.

[0159] In some embodiments, the PDU information further includes the number of decomposable bytes of the target PDU, and the processing module 1302 is configured to: When the current re-decomposable length of the target SDU is greater than the number of re-decomposable bytes of the target PDU, copy the content of the number of re-decomposable bytes after the current re-decomposition position in the target SDU to the target PDU; or, When the current decomposable length of the target SDU is less than or equal to the number of decomposable bytes of the target PDU, the target SDU is copied to the target PDU.

[0160] In some embodiments, after the content of the decomposable bytes after the current decomposable position in the target SDU is copied to the target PDU, the processing module 1302 is further configured to: Based on the number of decomposable bytes of the target PDU, updating the payload length of the target PDU and / or the current decomposition position of the target SDU; and / or, Assign the payload length of the target PDU to the length indication area of ​​the target PDU.

[0161] In some embodiments, after the target SDU is copied to the target PDU, the processing module 1302 is further configured to: Deleting the target SDU in the SDU queue; and / or, Based on the current decomposable length of the target SDU, the number of decomposable bytes of the target PDU and / or the payload length of the target PDU are updated.

[0162] In some embodiments, the PDU information further includes a sending sequence number corresponding to the target PDU, and the processing module 1302 is further configured to: The PDU information is assigned to the header field of the target PDU accordingly.

[0163] In some embodiments, the processing module 1302 is further configured to: When the sending sequence number of the target PDU is greater than the preset PDU sequence number, a modulo operation is performed based on the preset PDU sequence number and the sending sequence number of the target PDU, so that the sending sequence number of the target PDU is less than or equal to the preset PDU sequence number.

[0164] In some embodiments, The receiving node indication area is used to indicate the receiving node corresponding to the target PDU; The sending sequence number indication area is used to indicate the sending sequence number corresponding to the target PDU; The length indication area is used to indicate the sum of the lengths of each SDU in the target PDU.

[0165] For the contents not introduced in the embodiments of the present disclosure, please refer to the relevant introduction in the aforementioned corresponding method embodiments, which will not be repeated here.

[0166] The present disclosure also provides a computer-readable storage medium having computer program instructions stored thereon, and the program instructions, when executed by a processor, implement the steps of the PDU encapsulation method provided by the present disclosure.

[0167] See also Fig.14 FIG. 1 is a schematic diagram showing a structure of a PDU parsing device according to an exemplary embodiment. Fig.14 The device shown can be applied to a receiving node, and the device may include an acquisition module 1401 and a processing module 1402. Among them: The acquisition module 1401 is configured to acquire a target PDU to be parsed, wherein the target PDU includes a header field and a payload field, wherein the header field includes a receiving node indication area, a sending sequence number indication area, and a length indication area, and the payload field is used to carry a corresponding SDU; The processing module 1402 is configured to perform field analysis on the target PDU.

[0168] In some embodiments, The receiving node indication area is used to indicate the receiving node corresponding to the target PDU; The sending sequence number indication area is used to indicate the sending sequence number corresponding to the target PDU; The length indication area is used to indicate the sum of the lengths of each SDU in the target PDU.

[0169] In some embodiments, the processing module 1402 is configured to: When the state information of the target PDU includes an asynchronous state, obtaining a synchronization code position in the target PDU; When the synchronization code position is an unprocessed synchronization code position, entering the synchronization state of the target PDU, and performing field parsing on the target PDU; When the synchronization code position is not an unprocessed synchronization code position, the target PDU is deleted.

[0170] In some embodiments, the processing module 1402 is further configured to: Based on the synchronization code position in the target PDU, determining whether SDU information corresponding to the synchronization code position is successfully acquired, the SDU information at least including the target SDU; When the SDU information is successfully obtained, performing integrity and legality judgment on the SDU information; When the SDU information is legal, determining whether the target SDU corresponding to the SDU information is successfully acquired, and obtaining a corresponding parsing result; The parsing result is used to indicate whether the target SDU is successfully acquired.

[0171] In some embodiments, the processing module 1402 is further configured to: When the parsing result indicates that the target SDU is successfully acquired, sending the target SDU to a transport layer; or, When the parsing result is used to indicate that the target SDU was not successfully acquired or when the SDU information was not successfully acquired, if the failure reason includes that the sending sequence number of the target PDU is discontinuous, then all PDUs before the discontinuous sending sequence number are deleted, and all PDUs include at least the target PDU.

[0172] In some embodiments, the processing module 1402 is further configured to: When the target PDU also includes other SDUs except the target SDU, updating the synchronization code position in the target PDU based on the length of the target PDU; or, When the target PDU does not include other SDUs except the target SDU, the target SDU is deleted.

[0173] In some embodiments, the SDU information includes at least a header field of the target SDU, and the processing module 1402 is configured to: Perform integrity protection calculation based on the header field of the target SDU to obtain corresponding data to be checked; Matching the data to be verified with verification data carried by the integrity protection area in the target SDU; Determining whether the SDU information is legal based on a matching result corresponding to the matching; If the matching result is used to indicate that the matching is successful, then the SDU information is determined to be legal; or if the matching result is used to indicate that the matching is unsuccessful, then the SDU information is determined to be illegal.

[0174] In some embodiments, the processing module 1402 is further configured to: When the SDU information is illegal, the target PDU enters an asynchronous state.

[0175] For the contents not introduced in the embodiments of the present invention, please refer to the relevant introduction in the aforementioned corresponding method embodiments, which will not be repeated here.

[0176] The present disclosure also provides a computer-readable storage medium having computer program instructions stored thereon, and when the program instructions are executed by a processor, the steps of the PDU parsing method provided by the present disclosure are implemented.

[0177] Fig.15 1 is a schematic diagram of a communication device according to an exemplary embodiment. For example, the communication device 500 may be a sending node or a receiving node; they may be devices such as mobile phones, computers, digital broadcast terminals, message transceiver devices, game consoles, tablet devices, medical devices, fitness equipment, personal digital assistants, etc.

[0178] Reference Fig.15 , the communication device 500 may include one or more of the following components: a processing component 502 , a memory 504 , a power component 506 , a multimedia component 508 , an audio component 510 , an input / output interface 512 , a sensor component 514 , and a communication component 516 .

[0179] The processing component 502 generally controls the overall operation of the communication device 500, such as operations associated with display, phone calls, data communications, camera operations, and recording operations. The processing component 502 may include one or more processors 520 to execute instructions to complete all or part of the steps of the above-mentioned PDU encapsulation method or PDU parsing method. In addition, the processing component 502 may include one or more modules to facilitate the interaction between the processing component 502 and other components. For example, the processing component 502 may include a multimedia module to facilitate the interaction between the multimedia component 508 and the processing component 502.

[0180] The memory 504 is configured to store various types of data to support operations on the communication device 500. Examples of such data include instructions for any application or method operating on the communication device 500, contact data, phone book data, messages, pictures, videos, etc. The memory 504 can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic disk or optical disk.

[0181] The power supply component 506 provides power to the various components of the communication device 500. The power supply component 506 may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power for the communication device 500.

[0182] The multimedia component 508 includes a screen that provides an output interface between the communication device 500 and the user. In some embodiments, the screen may include a liquid crystal display (LCD) and a touch panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen to receive input signals from the user. The touch panel includes one or more touch sensors to sense touch, slide, and gestures on the touch panel. The touch sensor may not only sense the boundaries of the touch or slide action, but also detect the duration and pressure associated with the touch or slide operation. In some embodiments, the multimedia component 508 includes a front camera and / or a rear camera. When the communication device 500 is in an operating mode, such as a shooting mode or a video mode, the front camera and / or the rear camera may receive external multimedia data. Each front camera and rear camera may be a fixed optical lens system or have a focal length and optical zoom capability.

[0183] The audio component 510 is configured to output and / or input audio signals. For example, the audio component 510 includes a microphone (MIC), and when the communication device 500 is in an operation mode, such as a call mode, a recording mode, and a speech recognition mode, the microphone is configured to receive an external audio signal. The received audio signal can be further stored in the memory 504 or sent via the communication component 516. In some embodiments, the audio component 510 also includes a speaker for outputting audio signals.

[0184] The input / output interface 512 provides an interface between the processing component 502 and the peripheral interface modules, which may be keyboards, click wheels, buttons, etc. These buttons may include but are not limited to: a home button, a volume button, a start button, and a lock button.

[0185] The sensor assembly 514 includes one or more sensors for providing various aspects of status assessment for the communication device 500. For example, the sensor assembly 514 can detect the open / closed state of the communication device 500, the relative positioning of components, such as the display and keypad of the communication device 500, and the sensor assembly 514 can also detect the position change of the communication device 500 or a component of the communication device 500, the presence or absence of user contact with the communication device 500, the orientation or acceleration / deceleration of the communication device 500, and the temperature change of the communication device 500. The sensor assembly 514 may include a proximity sensor configured to detect the presence of a nearby object without any physical contact. The sensor assembly 514 may also include an optical sensor, such as a CMOS or CCD image sensor, for use in imaging applications. In some embodiments, the sensor assembly 514 may also include an accelerometer, a gyroscope sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.

[0186] The communication component 516 is configured to facilitate wired or wireless communication between the communication device 500 and other devices. The communication device 500 can access a wireless network based on a communication standard, such as WiFi, 2G or 3G, or a combination thereof. In an exemplary embodiment, the communication component 516 receives a broadcast signal or broadcast-related information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communication component 516 also includes a near field communication (NFC) module to facilitate short-range communication. For example, the NFC module can be implemented based on radio frequency identification (RFID) technology, infrared data association (IrDA) technology, ultra-wideband (UWB) technology, Bluetooth (BT) technology and other technologies.

[0187] In an exemplary embodiment, the communication device 500 may be implemented by one or more application-specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), controllers, microcontrollers, microprocessors, or other electronic components to execute the above-mentioned PDU encapsulation method or PDU parsing method.

[0188] In an exemplary embodiment, a non-transitory computer-readable storage medium including instructions is also provided, such as a memory 504 including instructions, and the instructions can be executed by the processor 520 of the communication device 500 to complete the above-mentioned PDU encapsulation method or PDU parsing method. For example, the non-transitory computer-readable storage medium can be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, etc.

[0189] In addition to being an independent electronic device, the above-mentioned device can also be a part of an independent electronic device. For example, in one embodiment, the device can be an integrated circuit (IC) or a chip, wherein the integrated circuit can be an IC or a collection of multiple ICs; the chip can include but is not limited to the following types: GPU (Graphics Processing Unit), CPU (Central Processing Unit), FPGA (Field Programmable Gate Array), DSP (Digital Signal Processor), ASIC (Application Specific Integrated Circuit), SOC (System on Chip, SoC), etc. The above-mentioned integrated circuit or chip can be used to execute executable instructions (or codes) to implement the above-mentioned PDU encapsulation method or PDU parsing method. The executable instructions can be stored in the integrated circuit or chip, or can be obtained from other devices or equipment, for example, the integrated circuit or chip includes a processor, a memory, and an interface for communicating with other devices. The executable instruction can be stored in the memory, and when the executable instruction is executed by the processor, the above-mentioned PDU encapsulation method or PDU parsing method is implemented; alternatively, the integrated circuit or chip can receive the executable instruction through the interface and transmit it to the processor for execution, so as to implement the above-mentioned PDU encapsulation method or PDU parsing method.

[0190] In another exemplary embodiment, a computer program product is also provided, which includes a computer program that can be executed by a programmable device, and the computer program has a code portion for executing the above-mentioned PDU encapsulation method or PDU parsing method when executed by the programmable device.

[0191] See also Fig.16 FIG. 1 is a schematic diagram showing the structure of a chip according to an exemplary embodiment. Fig.16 The chip 600 shown includes a processor 601 and an interface 602. Optionally, it may also include a memory 603. The number of the processor 601 may be one or more, and the number of the interface 602 may be more than one.

[0192] In one embodiment, for a case where a chip is used to implement the method embodiment of the present disclosure: The interface 602 is used to receive or output signals; The processor 601 is used to execute part or all of the contents in the PDU encapsulation method or the PDU parsing method embodiment.

[0193] It is understandable that the processor in the embodiment of the present disclosure can be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method embodiment can be completed by an integrated logic circuit of hardware in the processor or instructions in the form of software. The above processor can be a general-purpose processor, a digital signal processor (DigitalSignal Processor, DSP), an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components.

[0194] It is understandable that the memory in the embodiments of the present disclosure may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example but not limitation, many forms of RAM are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), and direct RAM bus RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0195] It should be noted here that the description of the above storage medium, device and chip embodiments is similar to the description of the above method embodiments, and has similar beneficial effects as the method embodiments. For technical details not disclosed in the storage medium, storage medium and device embodiments of the present disclosure, please refer to the description of the method embodiments of the present disclosure for understanding.

[0196] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the present disclosure. The present disclosure is intended to cover any variations, uses or adaptations of the present disclosure that follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The description and examples are to be considered as exemplary only, and the true scope and spirit of the present disclosure are indicated by the following claims.

[0197] It should be understood that the present disclosure is not limited to the exact structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims

1. A PDU encapsulation method, characterized in that: Applied to a sending node, the method comprises: Acquire PDU information to be encapsulated, where the PDU information at least includes a receiving node for receiving a target PDU; Based on the PDU information, encapsulate the SDU in the SDU queue corresponding to the receiving node to obtain the target PDU; The target PDU includes a header field and a load field, the header field includes a receiving node indication area, a sending sequence number indication area and a length indication area, and the load field is used to carry the corresponding SDU in the SDU queue.

2. The method according to claim 1, characterized in that The encapsulating the SDU in the SDU queue corresponding to the receiving node based on the PDU information includes: Calculate the current resolvable length of the target SDU according to the length of the target SDU and the current resolvable position, wherein the current resolvable position is used to reflect the position of the target SDU when PDU resolvable is currently performed, and the current resolvable length is used to reflect the length currently supported when resolvable is performed on the target SDU; Performing encapsulation processing based on the current resolvable length of the target SDU; The target SDU is any SDU in the SDU queue.

3. The method according to claim 2, characterized in that The PDU information also includes the number of decomposable bytes of the target PDU, where the number of decomposable bytes is used to reflect the decomposition length supported by the target PDU. The encapsulation processing based on the current decomposable length of the target SDU includes: When the current re-decomposable length of the target SDU is greater than the number of re-decomposable bytes of the target PDU, copy the content of the number of re-decomposable bytes after the current re-decomposition position in the target SDU to the target PDU; or, When the current decomposable length of the target SDU is less than or equal to the number of decomposable bytes of the target PDU, the target SDU is copied to the target PDU.

4. The method according to claim 3, characterized in that: After the content of the number of decomposable bytes after the current decomposable position in the target SDU is copied to the target PDU, the method further includes: Based on the number of decomposable bytes of the target PDU, updating the payload length of the target PDU and / or the current decomposition position of the target SDU; and / or, Assign the payload length of the target PDU to the length indication area of ​​the target PDU.

5. The method according to claim 3, characterized in that: After the target SDU is copied to the target PDU, the method further includes: Deleting the target SDU in the SDU queue; and / or, Based on the current decomposable length of the target SDU, the number of decomposable bytes of the target PDU and / or the payload length of the target PDU are updated.

6. A PDU parsing method, characterized in that: Applied to a receiving node, the method comprises: Obtain a target PDU to be parsed, wherein the target PDU includes a header field and a payload field, wherein the header field includes a receiving node indication area, a sending sequence number indication area, and a length indication area, and the payload field is used to carry a corresponding SDU; Perform field parsing on the target PDU.

7. The method according to claim 6, characterized in that The performing field parsing on the target PDU comprises: When the state information of the target PDU includes an asynchronous state, obtaining a synchronization code position in the target PDU; When the synchronization code position is an unprocessed synchronization code position, entering the synchronization state of the target PDU, and performing field parsing on the target PDU; When the synchronization code position is not an unprocessed synchronization code position, the target PDU is deleted.

8. The method according to claim 6, characterized in that The performing field parsing on the target PDU further includes: Based on the synchronization code position in the target PDU, determining whether SDU information corresponding to the synchronization code position is successfully acquired, the SDU information at least including the target SDU; When the SDU information is successfully obtained, performing integrity and legality judgment on the SDU information; When the SDU information is legal, determine whether the target SDU corresponding to the SDU information is successfully acquired, and obtain a corresponding parsing result; wherein the parsing result is used to indicate whether the target SDU is successfully acquired.

9. The method according to claim 8, characterized in that The method further comprises: When the parsing result indicates that the target SDU is successfully acquired, sending the target SDU to a transport layer; or, When the parsing result is used to indicate that the target SDU was not successfully acquired or when the SDU information was not successfully acquired, if the failure reason includes that the sending sequence number of the target PDU is discontinuous, then all PDUs before the discontinuous sending sequence number are deleted, and all PDUs include at least the target PDU.

10. The method according to claim 8, characterized in that The method further comprises: When the target PDU also includes other SDUs except the target SDU, updating the synchronization code position in the target PDU based on the length of the target PDU; or, When the target PDU does not include other SDUs except the target SDU, the target SDU is deleted.

11. The method according to claim 8, characterized in that The SDU information at least includes a header field of the target SDU, and the performing integrity and legality judgment on the SDU information includes: Perform integrity protection calculation based on the header field of the target SDU to obtain corresponding data to be checked; Matching the data to be verified with verification data carried by the integrity protection area in the target SDU; Determining whether the SDU information is legal based on a matching result corresponding to the matching; If the matching result is used to indicate that the matching is successful, then the SDU information is determined to be legal; or if the matching result is used to indicate that the matching is unsuccessful, then the SDU information is determined to be illegal.

12. A communication device, characterized in that: include: processor; a memory for storing processor-executable instructions; The processor is configured to execute the executable instructions to implement the steps of the method described in any one of claims 1 to 5; or the processor is configured to execute the executable instructions to implement the steps of the method described in any one of claims 6 to 11.

13. A computer-readable storage medium having computer program instructions stored thereon, characterized in that: When the computer program instructions are executed by the processor, the steps of the method described in any one of claims 1 to 5 are implemented; or, when the computer program instructions are executed by the processor, the steps of the method described in any one of claims 6 to 11 are implemented.

Images