Data processing method, apparatus, and storage medium

By using the first generation matrix to encode and process data packets and XOR recovery technology in 5G mobile communication, the problems of data transmission delay and resource consumption are solved, and efficient and reliable data transmission is achieved.

WO2024250723A1PCT designated stage expired Publication Date: 2024-12-12ZTE CORP

Patent Information

Application Number
PCT/CN2024/076012
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-06-07
Filing Date
2024-02-05
Publication Date
2024-12-12

AI Technical Summary

Technical Problem

In 5G mobile communication, the retransmission mechanism causes a large delay in data transmission, affecting real-time services. In carrier aggregation or dual-connection mode, the PDCP repetition mechanism consumes more resources, making it difficult to ensure the reliability of data transmission and reduce resource overhead.

Method used

By encoding the data packets according to the first generation matrix at the first transmission node, the encoded data packets are generated, and the lost data packets are recovered by XOR operation at the second transmission node, the retransmission delay is avoided and the decoding operation amount is reduced.

Benefits of technology

It realizes that while ensuring the reliability of data transmission, it reduces resource overhead and improves the efficiency and reliability of data transmission.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2024076012_12122024_PF_FP_ABST
    Figure CN2024076012_12122024_PF_FP_ABST
Patent Text Reader

Abstract

Embodiments of the present application relate to the technical field of communications, and provide a data processing method, an apparatus, and a storage medium, for use in ensuring the reliability of data transmission and reducing the resource overhead. The method comprises: acquiring m first data packets, wherein m is a positive integer; determining k second data packets according to the m first data packets, wherein k is a positive integer, the value range of elements in a first generator matrix is [0, q-1], and q is a prime or a prime power; encoding the k second data packets according to the first generator matrix to obtain n first encoded data packets, wherein n is a positive integer; and sending all or some first encoded data packets among the n first encoded data packets to a second transmission node.
Need to check novelty before this filing date? Find Prior Art

Description

Data processing method, device and storage medium

[0001] This disclosure claims priority to Chinese patent application No. 202310674811.9, filed on June 7, 2023, the entire contents of which are incorporated herein by reference. Technical Field

[0002] The present application relates to the field of communication technology, and in particular to a data processing method, device, and storage medium. Background Art

[0003] In fifth-generation mobile communication technology (5G) mobile communications, in order to improve data transmission reliability, automatic retransmission request (ARQ) is used in the radio link control (RLC) layer and hybrid automatic repeat request (HARQ) is used in the medium access control (MAC) layer to improve data reliability. However, the retransmission mechanism will generate a large delay, affecting real-time services and resulting in low data transmission reliability. In addition, in carrier aggregation (CA) or dual connectivity (DC) mode, 5G mobile communications use packet data convergence protocol (PDCP) duplication to improve reliability through air interface transmission redundancy. However, the use of PDCP duplication consumes a lot of computing resources. Therefore, how to ensure the reliability of data transmission and reduce resource overhead is a technical problem that needs to be solved urgently.

[0004] Summary of the Invention

[0005] The present application provides a data processing method, device, and storage medium for ensuring the reliability of data transmission and reducing resource overhead.

[0006] In order to achieve the above objectives, this application adopts the following technical solutions:

[0007] In a first aspect, a data processing method is provided. The method is applied to a first transmission node, and the method includes:

[0008] Get m first data packets, where m is a positive integer;

[0009] Determine k second data packets according to the m first data packets, where k is a positive integer;

[0010] Encoding the k second data packets according to the first generation matrix to obtain n first encoded data packets, where n is a positive integer, wherein the value range of the elements in the first generation matrix is ​​[0, q-1], and q is a prime number or a prime power;

[0011] All or part of the n first coded data packets are sent to the second transmission node.

[0012] In a second aspect, a data processing method is provided. The method is applied to a second transmission node, and the method includes:

[0013] Obtaining the number n of first coded data packets, the number k of second data packets, an index identifier of each first coded data packet, and k correctly received first coded data packets generated by the first transmission node; wherein k is a positive integer, and the k correctly received first coded data packets are a subset of n first coded data packets obtained by the first transmission node encoding the k second data packets according to the first generation matrix;

[0014] According to the number n of first coded data packets, the number k of second data packets and the index identifier of each first coded data packet, k correctly received first coded data packets are processed to obtain lost second data packets.

[0015] According to a third aspect, a communication device is provided, the device comprising:

[0016] an acquiring unit, configured to acquire m first data packets, where m is a positive integer;

[0017] a processing unit, configured to determine k second data packets according to the m first data packets, where k is a positive integer;

[0018] The processing unit is further configured to encode the k second data packets according to the first generation matrix to obtain n first encoded data packets, where n is a positive integer, wherein the value range of the elements in the first generation matrix is ​​[0, q-1], and q is a prime number or a prime power;

[0019] A sending unit is configured to send all or part of the n first coded data packets to the second transmission node.

[0020] According to a fourth aspect, a communication device is provided, the device comprising:

[0021] an acquisition unit, configured to acquire the number n of first coded data packets, the number k of second data packets, an index identifier of each first coded data packet, and k correctly received first coded data packets generated by the first transmission node; wherein k is a positive integer, and the k correctly received first coded data packets are a subset of n first coded data packets obtained by the first transmission node encoding the k second data packets according to the first generation matrix;

[0022] The processing unit is configured to process k correctly received first coded data packets according to the number n of first coded data packets, the number k of second data packets and the index identifier of each first coded data packet to obtain the lost second data packets.

[0023] In a fifth aspect, a communication device is provided, comprising: a processor and a memory; the memory stores instructions executable by the processor; when the processor is configured to execute the instructions, the communication device implements the method provided in any one of the first or second aspects above.

[0024] In a sixth aspect, a computer-readable storage medium is provided, which stores computer instructions. When the computer instructions are executed on a computer, the computer executes the method provided in either the first aspect or the second aspect.

[0025] In a seventh aspect, a computer program product comprising computer instructions is provided, which, when executed on a computer, enables the computer to execute the method provided in either the first aspect or the second aspect.

[0026] In an embodiment of the present application, since the first coded data packet is processed by the first generation matrix, the second transmission node can complete decoding by receiving k first coded data packets, which can avoid the delay caused by repeated data transmission. Moreover, since the first coded data packet is processed by the first generation matrix, when a single first data packet is erroneous or lost, the second transmission node can recover the single first data packet that has erroneous or lost by an exclusive OR operation based only on the received first coded data packet, thereby reducing the decoding operation amount, thereby ensuring the reliability of data transmission, and reducing resource overhead. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] The accompanying drawings are used to provide a further understanding of the technical solution of the present invention and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the technical solution of the present invention and do not constitute a limitation on the technical solution of the present invention.

[0028] FIG1 is a schematic diagram of the structure of a communication system provided in an embodiment of the present application;

[0029] FIG2 is a flow chart of a data processing method provided in an embodiment of the present application;

[0030] FIG3 is a schematic diagram of the composition of a first generation matrix provided in an embodiment of the present application;

[0031] FIG4 is a schematic diagram of data packet encoding at a PDCP layer provided in an embodiment of the present application;

[0032] FIG5 is a schematic diagram of data packet encoding at the PDCP layer in a DC scenario provided by an embodiment of the present application;

[0033] FIG6 is a schematic diagram of data packet encoding at the PDCP layer in a CA scenario provided by an embodiment of the present application;

[0034] FIG7 is a schematic diagram of data packet encoding at an RLC layer provided in an embodiment of the present application;

[0035] FIG8 is a schematic diagram of data packet encoding at a MAC layer provided in an embodiment of the present application;

[0036] FIG9 is a schematic diagram of data packet encoding at the physical layer provided in an embodiment of the present application;

[0037] FIG10 is a flow chart of another data processing method provided in an embodiment of the present application;

[0038] FIG11 is a schematic diagram of the composition of a communication device provided in an embodiment of the present application;

[0039] FIG12 is a schematic diagram of the composition of another communication device provided in an embodiment of the present application;

[0040] FIG13 is a schematic structural diagram of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0041] The following will be combined with the drawings in the embodiments of this application to clearly and completely describe the technical solutions in the embodiments of this application. Obviously, the embodiments described are only part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0042] The terms "first," "second," etc., are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of the technical features being referred to. Thus, a feature identified with "first," "second," etc., may explicitly or implicitly include one or more of the features. Throughout the description of this application, unless otherwise specified, "plurality" means two or more.

[0043] In the embodiments of this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of this application should not be interpreted as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.

[0044] According to the 5G Technical Specification (TS) of the 3rd Generation Partnership Project (3GPP), the transmission time interval (TTI) is introduced in R15 to meet the requirements of 1ms one-way delay and 10 -5 To meet the reliability requirements, R16 introduces Time Sensitive Networking (TSN) to meet the air interface one-way delay of 0.5-1ms and 10 -6 In the future development of B5G (Beyond 5th Generation) / 6G (6th Generation) communication technology, there will be higher requirements for transmission delay and data transmission reliability. The requirement for 6G is no less than 10 -7 The reliability is not less than 10 -9 reliability.

[0045] In related technologies, HARQ is used to improve the reliability of data transmission, but retransmission will generate a large delay, affecting real-time services and resulting in low data transmission reliability. In addition, in CA or DC mode, PDCP repetition in 5G mobile communications improves reliability through air interface transmission redundancy. R15 supports 2 redundant links, and R16 supports up to 4 redundant links. PDCP repetition is suitable for small packet high-reliability services. In theory, it can increase reliability from 99% of a single link to 99.99%. However, PDCP repetition is to copy the same data into multiple copies and transmit them on different cells (Cell) or cell groups (Cell Group). PDCP repetition consumes more resources and is mainly used for smaller data packets. When the data packets are large, it will lead to excessive resource consumption. Therefore, how to reduce resource overhead while ensuring the reliability of data transmission is a technical problem that needs to be solved urgently.

[0046] Based on this, an embodiment of the present application provides a data processing method, device, and storage medium. After obtaining m first data packets, the first transmission node determines k second data packets based on the m first data packets, so that the k second data packets have the same size for ease of encoding. After obtaining the k second data packets, the k second data packets are encoded according to the first generation matrix to obtain n first coded data packets, and then all or part of the n first coded data packets are sent to the second transmission node. Because the first coded data packets are processed by the first generation matrix, the second transmission node can complete decoding based on the received k first coded data packets, which can avoid the delay caused by repeated data transmission. Moreover, because the first coded data packets are processed by the first generation matrix, when a single first data packet is erroneous or lost, the second transmission node can recover the single erroneous or lost first data packet through an exclusive OR operation based only on the received first coded data packet, reducing the decoding operation amount, thereby ensuring the reliability of data transmission and reducing resource overhead.

[0047] The following describes the solutions of the embodiments of the present application with reference to the accompanying drawings.

[0048] The technical solution provided in the embodiment of the present application can be applied to various mobile communication networks, for example, in 5G communication networks. However, it is understandable that in the future development of 6G communication technology, there will be higher requirements for data transmission rate, transmission delay and data transmission reliability. The technical solution in this embodiment can also be applied to but not limited to 6G communication systems and even higher levels of communication systems.

[0049] Figure 1 is a schematic diagram of the structure of a communication system provided by an embodiment of the present application. As shown in Figure 1, the communication system includes, but is not limited to, a first transmission node 110 and a second transmission node 120. The first transmission node 110 and the second transmission node 120 can transmit and receive wireless signals, and perform related interactions.

[0050] In some embodiments, the relative position, quantity, etc. of the first transmission node 110 and the second transmission node 120 can be set accordingly in a specific application scenario. For example, the first transmission node 110 can radiate signals outward, and the second transmission node 120 can move along the trajectory formed by the first transmission node 110 when radiating signals outward. It can be understood that if there are multiple second transmission nodes 120 and different second transmission nodes 120 are set in the above manner, the wireless signal sent by the first transmission node 110 can be received at different spatial locations. It is worth noting that the spatial position here can be different geographical conditions.

[0051] In some embodiments, the first transmission node 110 or the second transmission node 120 may include, but is not limited to, one of the following devices: a base station (BS), an access point (AP), a node B, a g node B (g node B, generalized node B), a radio network controller (RNC), an evolved node B (eNB), a base station controller (BSC), a base transceiver station (BTS), a transceiver function (TF), a radio router, a radio transceiver, a basic service set (BSS), an extended service set (ESS) or a radio base station (RBS). This embodiment does not specifically limit this.

[0052] In some embodiments, the first transmission node 110 or the second transmission node 120 may have other names, such as access terminal, user equipment (UE), subscriber unit, subscriber station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent, or user device. For example, the first transmission node 110 or the second transmission node 120 may be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal device in a 5G network or a future 5G or higher network, etc. This embodiment does not specifically limit this.

[0053] In some embodiments, the first transmission node 110 has at least the functions of obtaining a first data packet, processing the first data packet to obtain a second data packet, encoding the second data packet according to a first generation matrix to obtain a first encoded data packet, and sending the first encoded data packet to the second transmission node.

[0054] In some embodiments, the second transmission node 120 has at least the functions of receiving a first coded data packet sent by the first transmission node 110 and processing the first coded data packet, wherein the first coded data packet is obtained by the first transmission node encoding the second data packet according to the first generation matrix.

[0055] In one embodiment, the above functions of the first transmission node 110 or the second transmission node 120 can be applied to different application scenarios and are not limited here.

[0056] It should be understood that Figure 1 is an exemplary structural diagram, and the number of devices included in the communication system shown in Figure 1 is not limited. For example, the number of first transmission nodes and second transmission nodes is not limited. Furthermore, in addition to the devices shown in Figure 1, the communication system shown in Figure 1 may also include other devices, which is not limited.

[0057] Next, as shown in FIG2 , an embodiment of the present application provides a data processing method, which is applied to a first transmission node. The first transmission node may be the first transmission node 110 shown in FIG1 . The method includes the following steps:

[0058] S101. Obtain m first data packets.

[0059] In some embodiments, when the first transmission node needs to perform data transmission, the first transmission node obtains m first data packets, where m is a positive integer.

[0060] In some embodiments, the first data packet may also have other names, such as a source data packet.

[0061] In some embodiments, the first transmission node may obtain m first data packets from the wireless interface protocol stack. Based on this, the m first data packets include at least one of the following:

[0062] Data packets of the PDCP layer in the radio interface protocol stack;

[0063] Data packets of the RLC layer in the radio interface protocol stack;

[0064] Data packets of the MAC layer in the wireless interface protocol stack;

[0065] Data packets at the physical layer in the radio interface protocol stack.

[0066] It should be understood that the first transmission node obtains m first data packets so as to subsequently perform encoding according to the first generation matrix to generate a first encoded data packet.

[0067] It should be noted that the first data packet can be selected and set according to the specific application scenario and is not limited in the embodiments of the present application. Since the method of obtaining m first data packets is well known to those skilled in the art, obtaining m first data packets from the wireless interface protocol stack is only an example and is not described in detail here.

[0068] S102: Determine k second data packets according to the m first data packets.

[0069] Wherein, k is a positive integer.

[0070] It should be noted that, in the following embodiments, b=[b0; b1; ...; b m-1 ] represents m first data packets, where b i is a row vector, the size of the i-th first data packet among the m first data packets is S i Byte. Use a=[a0;a1;…;a k-1 ] represents k second data packets, where the first data packet a i is a row vector, and the size of each second data packet is T bytes. The second data packet can also be called by other names, for example, source sub-data packet.

[0071] As a possible example, determining k second data packets according to m first data packets may include at least one of the following implementations:

[0072] Implementation 1: In the case where m first data packets have the same size, the m first data packets can be used as k second data packets, where m=k.

[0073] Implementation method 2: In the case where the m first data packets do not have the same size, padding processing may be performed on the m first data packets to obtain k second data packets, where m=k.

[0074] As a possible implementation manner, the sizes of the first data packets other than the target first data packet in the m first data packets may be padded to the same size as the target first data packet, wherein the target first data packet is the largest data packet among the m first data packets.

[0075] For example, the size of the target data packet in the m first data packets is S max Bytes, the remaining m-1 first data packets can be padded so that the size of each first data packet in the remaining m-1 first data packets is S max Bytes. In one example, for the i-th first data packet b among the remaining m-1 first data packets, i , for b i Fill S max -S i 0 bytes so that bi The size reaches S max Bytes. S i Indicates b i The number of bytes contained in .

[0076] Implementation 3: When the m first data packets are not of the same size, the m first data packets may be preprocessed to obtain k second data packets. The preprocessing includes at least one of the following: combining, padding, and segmenting. Exemplarily, preprocessing the m first data packets to obtain k second data packets may include the following steps:

[0077] A1. Combine and process the m first data packets to obtain a third data packet.

[0078] The size of the third data packet is S bytes. S i Indicates the number of bytes contained in the i-th data packet among the m first data packets, that is, the size of the i-th data packet.

[0079] A2. Perform padding processing on the third data packet to obtain a fourth data packet.

[0080] For example, the third data packet may be filled with 0 bytes, and obtain the fourth data packet, which includes k* Bytes. Where ceil() represents the smallest integer greater than or equal to the value in the brackets.

[0081] A3. Segment the fourth data packet to obtain k second data packets.

[0082] After obtaining the fourth data packet, the fourth data packet can be segmented to obtain k second data packets, each of which has a size of bytes.

[0083] It should be understood that the combining process, the filling process, and the segmenting process may have different orders and may include only one of the processes or a combination of multiple processes.

[0084] As an example, m first data packets are combined to obtain k second data packets, wherein each second data packet after the combination has the same size.

[0085] As another example, padding processing is performed on m data packets to obtain k second data packets, wherein each second data packet after padding processing has the same size.

[0086] As another example, m data packets are segmented to obtain k second data packets, wherein each second data packet after segmentation has the same size.

[0087] As another example, m data packets are combined and padded to obtain k second data packets, wherein each second data packet after the combination and padded processing has the same size.

[0088] As another example, m data packets are combined and segmented to obtain k second data packets, wherein each second data packet after the combination and segmentation has the same size.

[0089] As another example, padding and segmentation are performed on m data packets to obtain k second data packets, wherein each second data packet after padding and segmentation has the same size.

[0090] In some embodiments, the number k of second data packets is determined based on at least one of: the number m of first data packets, the size S of the m first data packets, the size T of one second data packet, channel state information, capability information of the user equipment, control signaling, the number of links, and the number of carriers;

[0091] The channel state information includes at least one of the following: channel quality indicator information, rank indicator information, and precoding matrix indicator information; the user equipment capability information includes at least one of the following: an upper limit on the number of antennas supported by the user equipment, an upper limit on the data transmission rate supported by the user equipment, and an upper limit on the modulation order supported by the user equipment. If the user equipment is a second transmitting node, the user equipment capability information is also the capability information of the second transmitting node.

[0092] As an example, when the number k of second data packets is determined according to the channel state information, at least one of the following implementations may be included:

[0093] Implementation method 1: When the channel state information is channel quality indication information, the number k of second data packets is determined based on the index value of the channel quality indication information. For example, when the channel quality indication index value is an integer from 1 to 5, the number k of second data packets is a first preset value; when the channel quality index value is an integer from 6 to 10, the number k of second data packets is a second preset value; and when the channel quality index value is an integer from 11 to 15, the number k of second data packets is a third preset value. The first preset value, the second preset value, and the third preset value are all positive integers. In one example, the first preset value is 5, the second preset value is 10, and the third preset value is 15.

[0094] Implementation method 2: When the channel state information is rank indication information, the number k of second data packets is determined according to the value of the rank indication information. For example, when the value of the rank indication information is equal to 1 or 2, the number k of second data packets is a fourth preset value; when the value of the rank indication information is equal to 3, the number k of second data packets is a fifth preset value; and when the value of the rank indication information is equal to 4, the number k of second data packets is a sixth preset value. The fourth preset value, the fifth preset value, and the sixth preset value are all positive integers. In one example, the fourth preset value is equal to 5, the fifth preset value is equal to 10, and the sixth preset value is equal to 15.

[0095] Implementation method 3: When the channel state information is precoding matrix indication information, the number k of the second data packets is determined according to the index value of the precoding matrix indication information. For example: for single-layer transmission with four antenna ports with transform precoding, when the precoding matrix indication index value is an integer from 0 to 7, the number k of the second data packets is the seventh preset value, when the precoding matrix indication index value is an integer from 8 to 15, the number k of the second data packets is the eighth preset value, and when the precoding matrix indication index value is an integer from 16 to 27, the number k of the second data packets is the ninth preset value. Among them, the seventh preset value, the eighth preset value, and the ninth preset value are all positive integers. In one example, the seventh preset value is equal to 5, the eighth preset value is equal to 10, and the ninth preset value is equal to 15.

[0096] As another example, when the number k of second data packets is determined according to the capability information of the user equipment, at least one of the following implementations may be included:

[0097] Implementation 1: When the capability information of the user equipment is an upper limit value of the number of antennas supported by the user equipment, and when the upper limit value of the number of antennas supported by the user equipment is greater than a first threshold value w1, that is, when the maximum number of antennas supported by the user equipment is greater than the first threshold value w1, the number k of second data packets is a tenth preset value; otherwise, the number of second data packets is an eleventh preset value, where w1 is equal to one of the following: 4, 6, 8, 12, or 16. The tenth preset value and the eleventh preset value are positive integers. In one example, the tenth preset value is equal to 20, and the eleventh preset value is equal to 10.

[0098] Implementation 2: When the capability information of the user equipment is an upper limit value of the data transmission rate supported by the user equipment, and when the upper limit value of the data transmission rate supported by the user equipment is greater than a second threshold value w2, that is, when the maximum supported data transmission rate supported by the user equipment is greater than the second threshold value w2, the number of second data packets is a twelfth preset value; otherwise, the number of second sub-data packets is a thirteenth preset value, where w2 is equal to one of the following: 500 Mbps, 1 Gbps, or 10 Gbps. The twelfth preset value and the thirteenth preset value are positive integers. In one example, the twelfth preset value is equal to 5, and the thirteenth preset value is equal to 10.

[0099] Implementation 3: When the capability information of the user equipment is an upper limit value of the modulation order supported by the user equipment, and the upper limit value of the modulation order supported by the user equipment is greater than a third threshold value w3, that is, the maximum modulation order supported by the user equipment is greater than the third threshold value w3, then the number of second data packets is a fourteenth preset value; otherwise, the number of second data packets is a fifteenth preset value, where w3 is equal to one of the following: 4, 6, 8, or 10. The fourteenth preset value and the fifteenth preset value are positive integers. In one example, the fourteenth preset value is equal to 5, and the fifteenth preset value is equal to 10.

[0100] As another example, when the number k of second data packets is determined according to control signaling, the control signaling is used to indicate the number k of second data packets.

[0101] Exemplarily, the control signaling indicates the number of second data packets using p bits, where p is an integer greater than 0, and p bits indicate a maximum of 2 p In one possible example, when p=1, there are two selectable numbers of second data packets: "0" indicates that the number of second data packets is the sixteenth preset value, and "1" indicates that the number of second data packets is the seventeenth preset value. The sixteenth preset value and the seventeenth preset value are positive integers. In one example, the sixteenth preset value is equal to 6, and the seventeenth preset value is equal to 12.

[0102] As another example, when the number k of second data packets is determined based on the number of links, the number k of second data packets is determined based on the number of associations between one entity and another entity indicated by the number of links. For example, if the number of links is represented as the number of associations between one PDCP entity and an RLC entity, when one PDCP entity is associated with two RLC entities, the number of second data packets is the eighteenth preset value. When one PDCP entity is associated with four RLC entities, the number of second data packets is the nineteenth preset value. The eighteenth and nineteenth preset values ​​are positive integers. In one example, the eighteenth and nineteenth preset values ​​are equal to 8 and 16, respectively.

[0103] As another example, when the number k of second data packets is determined based on the number of carriers, different numbers of carriers correspond to different numbers of second data packets k, and each carrier corresponds to an independent cell. For example, if the number of carriers is 2, the number of second data packets is the twentieth preset value. For another example, if the number of carriers is 4, the number of second data packets is the twenty-first preset value. The twentieth preset value and the twenty-first preset value are positive integers. In one example, the twentieth preset value is 6, and the twenty-first preset value is 12.

[0104] As another example, when determining the number k of the second data packets according to the number m of the first data packets, different ranges of m correspond to different numbers k of the second data packets. In a possible example, when the range of m is within the interval [m1, m2], the number of the second data packets is the twenty-second preset value; when the range of m is within the interval (m2, m3], the number of the second data packets is the twenty-third preset value, where m1, m2, and m3 are positive integers, and m1 < m2 < m3. The twenty-second preset value and the twenty-third preset value are positive integers. In one example, the twenty-second preset value is equal to 4, and the twenty-third preset value is equal to 8.

[0105] As another example, when determining the number k of the second data packets according to the size S of the first data packets, different ranges of S correspond to different numbers k of the second data packets. In a possible example, when the range of S is within the interval [s1, s2], the number of the second data packets is the twenty-fourth preset value; when the range of S is within the interval (s2, s3], the number of the second data packets is the twenty-fifth preset value, where s1, s2, and s3 are positive integers, and s1 < s2 < s3. The twenty-fourth preset value and the twenty-fifth preset value are positive integers. In one example, the twenty-fourth preset value is equal to 4, and the twenty-fifth preset value is equal to 8.

[0106] As another example, when determining the number k of the second data packets according to the size T of one second data packet, different ranges of T correspond to different numbers k of the second data packets. In a possible example, when the range of T is within the interval [t1, t2], the number of the second data packets is the twenty-sixth preset value; when the range of S is within the interval (t2, t3], the number of the second data packets is the twenty-seventh preset value, where t1, t2, and t3 are positive integers, and t1 < t2 < t3. The twenty-sixth preset value and the twenty-seventh preset value are positive integers. In one example, the twenty-sixth preset value is equal to 6, and the twenty-seventh preset value is equal to 12.

[0107] It should be understood that the sizes of the m first data packets may be different. When performing encoding processing according to the first generation matrix subsequently, if the sizes of the m first data packets are different, it may cause the encoding to fail smoothly. Based on this, the embodiments of the present application propose to process the m first data packets to obtain k second data packets with the same size, so that subsequent encoding of the k second data packets with the same size according to the first generation matrix can be carried out smoothly, thereby ensuring the reliability of data transmission.

[0108] S103. Perform encoding processing on the k second data packets according to the first generation matrix to obtain n first encoded data packets.

[0109] Wherein, n is a positive integer, the value range of the elements in the first generator matrix is ​​[0, q-1], and q is a prime number or a prime power.

[0110] In some embodiments, the first generation matrix may be preconfigured or determined according to the number k of second data packets and / or the number n of first coded data packets.

[0111] In some embodiments, the first generator matrix G includes an identity matrix I and a second generator matrix G2. The identity matrix I has a size of k×k, and the second generator matrix G2 has a size of r×k, where n=r+k, and r is a positive integer. Based on this, the n first encoded data packets include k second data packets and r second encoded data packets, where the r second encoded data packets are data packets obtained by encoding the k second data packets according to the second generator matrix.

[0112] In some embodiments, the second encoded data packet may also have other names, for example, the second encoded data packet may also be called a verification data packet.

[0113] In some embodiments, the number r of second coded data packets is determined based on at least one of: the number k of second data packets, channel state information, and control signaling; wherein the channel state information includes at least one of: channel quality indication information, rank indication information, and precoding matrix indication information.

[0114] As an example, when the number r of second encoded data packets is determined based on the number k of second data packets, the number k of second data packets corresponds to a value of the number r of second encoded data packets in each value interval. For example, when the number k of second data packets is in the value interval [k1, k2], r is the twenty-eighth preset value. Where k1 and k2 are two different positive integers, and the twenty-eighth preset value can have different values ​​in different value intervals of k. In one example, k1=4, k2=8, and the twenty-eighth preset value is equal to 2.

[0115] As another example, determining the number r of second coded data packets according to the channel state information may employ at least one of the following implementations:

[0116] Implementation method 1: When the channel state information is channel quality indication information, the number r of second coded data packets is determined based on the index value of the channel quality indication information. For example, when the channel quality indication index value is an integer from 1 to 5, the number r of second coded data packets is the 29th preset value; when the channel quality index value is an integer from 6 to 10, the number r of second coded data packets is the 30th preset value; and when the channel quality index value is an integer from 11 to 15, the number r of second coded data packets is the 31st preset value. The 29th preset value, the 30th preset value, and the 31st preset value are all positive integers. In one example, the 29th preset value is 2, the 30th preset value is 3, and the 31st preset value is 4.

[0117] Implementation method 2: When the channel state information is rank indication information, the number r of second coded data packets is determined according to the value of the rank indication information. For example, when the value of the rank indication information is 1 or 2, the number r of second coded data packets is a 32nd preset value; when the value of the rank indication information is 3, the number r of second coded data packets is a 33rd preset value; and when the value of the rank indication information is 4, the number k of second data packets is a 34th preset value. The 32nd preset value, the 33rd preset value, and the 34th preset value are all positive integers. In one example, the 32nd preset value is 2, the 33rd preset value is 3, and the 34th preset value is 4.

[0118] Implementation method 3: When the channel state information is precoding matrix indication information, the number r of second coded data packets is determined according to the index value of the precoding matrix indication information. For example: for single-layer transmission with four antenna ports with transform precoding, when the precoding matrix indication index value is an integer from 0 to 7, the number r of second coded data packets is the thirty-fifth preset value, when the precoding matrix indication index value is an integer from 8 to 15, the number r of second coded data packets is the thirty-sixth preset value, and when the precoding matrix indication index value is an integer from 16 to 27, the number r of second coded data packets is the thirty-seventh preset value. The thirty-fifth preset value, the thirty-sixth preset value, and the thirty-seventh preset value are all positive integers. In one example, the thirty-fifth preset value is equal to 2, the thirty-sixth preset value is equal to 3, and the thirty-seventh preset value is equal to 4.

[0119] As another example, when the number r of second coded data packets is determined according to control signaling, the control signaling is used to indicate the number r of second coded data packets.

[0120] Exemplarily, the control signaling indicates that x bits are used to indicate the number r of the second coded data packets, where x is an integer greater than 0, and x bits indicate at most 2 xIn one possible example, when x=1, there are two selectable numbers of second encoded data packets: "0" indicates that the number of second encoded data packets is the 38th preset value, and "1" indicates that the number of second encoded data packets is the 39th preset value. The 38th preset value and the 39th preset value are positive integers. In one example, the 38th preset value is 2, and the 39th preset value is 4.

[0121] In some embodiments, as shown in FIG3, a schematic diagram of the composition of a first generation matrix provided in an embodiment of the present application is shown. Referring to FIG3, the first generation matrix 1200 is composed of a unit matrix 1201 and a second generation matrix 1202. i,j is an element value under the Galois Field GF(q), and 0≤i≤r-1, 0≤j≤k-1, and the size q of the Galois Field is a prime number or a prime power. For example, q includes but is not limited to 2, 4, 8, 16, 32, 64, 128, 256, and 512.

[0122] In some embodiments, for any k rows in the first generator matrix, any k rows are linearly independent under the Galois Field GF(q). In other words, a submatrix of size k×k formed by any k rows of the first generator matrix is ​​invertible under the Galois Field GF(q).

[0123] It should be understood that any k rows in the first generating matrix are linearly independent under the Galois field GF(q), that is, the submatrix formed by any k rows in the first generating matrix is ​​reversible, in order to ensure maximum distance separable (MDS), that is, to ensure that when any r first coded data packets among the n first coded data packets fail, k second data packets can be successfully decoded, thereby ensuring the reliability of data transmission.

[0124] In some embodiments, there is a target row in the second generation matrix, and the values ​​of the elements in the target row are all 1. That is, there is a row in which the values ​​of the elements are all 1 in the second generation matrix.

[0125] In some embodiments, the check data packet obtained by encoding k second data packets according to the target row may also be referred to as a third encoded data packet.

[0126] It should be understood that when a single second data packet is lost among n first encoded data packets, since there are rows in the second generation matrix whose element values ​​are all 1, the single lost second data packet can be quickly recovered through an XOR operation (which is faster than multiplication). Since the amount of calculation is lower than that of multiplication, resource overhead is reduced.

[0127] In some embodiments, for any r columns in the merged matrix consisting of the second generator matrix and the identity matrix of size r×r, any r columns are linearly independent under the Galois Field GF(q).

[0128] As an example, a unit matrix (size r×r) can be added to the right side of the second generation matrix (size r×k) to form a merge matrix of size r×n (n=r+k), where n is the number of first encoded data packets.

[0129] In some embodiments, the merge matrix may also be referred to as a check matrix.

[0130] It should be understood that the generator matrix and the check matrix can be understood as descriptions of the same encoding method from different perspectives, and the characteristics of the encoding method can be described by either the generator matrix or the check matrix.

[0131] As a possible example, the value of the element with row number i and column number j in the second generation matrix is ​​determined according to the following parameters: k, i, j; where i and j are both non-negative integers, and 0≤i≤r-1, 0≤j≤k-1.

[0132] As another possible example, the value of the element with row number i and column number j in the second generation matrix is ​​determined according to the following formula: i,j =(k+j) / (k+i+j);

[0133] Among them, g i,j represents the value of the element with row number i and column number j in the second generator matrix, where i and j are both non-negative integers, and 0≤i≤r-1, 0≤j≤k-1, / represents a division operation under the Galois field GF(q), and + represents a bitwise exclusive OR operation under the Galois field GF(q).

[0134] As an example, the second generation matrix G2 may be expressed as follows:

[0135] For example, taking the Galois field size q=256, the source data blocks k=5, and the number of second coded data blocks r=2 as an example, the second generator matrix G2 can be shown as follows:

[0136] In some embodiments, any two columns or two rows in the second generator matrix can be exchanged, that is, the second generator matrix can be obtained by exchanging any two columns or two rows in the second generator matrix.

[0137] As a possible example, according to formula g i,j =(k+j) / (k+i+j) and any two rows or columns of the matrix obtained by swapping them will give the second generator matrix. i,jRepresents the value of the element with row number i and column number j in the matrix, where i and j are both non-negative integers, and 0≤i≤r-1, 0≤j≤k-1, / represents the division operation under the Galois field GF(q), and + represents the bitwise exclusive-OR operation under the Galois field GF(q).

[0138] For example, the Galois field size q = 256, the source data block k = 5, the number of second coded data blocks r = 2, and the exchange according to formula g i,j =(k+j) / (k+i+j) as an example. The second generation matrix G2 can be shown as follows:

[0139] As another possible example, the value of the element with row number i and column number j in the second generation matrix is ​​determined according to the following formula: i,j =((k+j)*(k+i)) / ((k+i+j)*k);

[0140] Among them, g i,j represents the value of the element with row number i and column number j in the second generator matrix, / represents a division operation under the Galois Field GF(q), + represents a bitwise exclusive OR operation under the Galois Field, and * represents a multiplication operation under the Galois Field GF(q).

[0141] As an example, the second generation matrix G2 may be expressed as follows:

[0142] For example, taking the Galois field size q=256, the source data blocks k=5, and the number of second coded data blocks r=2 as an example, the second generator matrix G2 can be shown as follows:

[0143] As a possible example, according to formula g i,j =((k+j)*(k+i)) / ((k+i+j)*k)) and swap any two rows or columns of the matrix to get the second generator matrix. i,j Represents the value of the element with row number i and column number j in the matrix, where i and j are both non-negative integers, and 0≤i≤r-1, 0≤j≤k-1, / represents the division operation under the Galois field GF(q), and + represents the bitwise exclusive-OR operation under the Galois field GF(q).

[0144] For example, the Galois field size q = 256, the source data block k = 5, the number of second coded data blocks r = 2, and the exchange according to formula g i,j =((k+j)*(k+i)) / ((k+i+j)*k) as an example. The second generation matrix G2 can be shown as follows:

[0145] In some embodiments, k source data blocks are encoded according to the second generation matrix to obtain n first encoded data blocks, which are determined according to the following formula: d = [a; G2*a];

[0146] Where d represents n first coded data blocks, G2 represents the first generator matrix, * represents the matrix multiplication operation under the Galois field GF(q), a represents k source data blocks, a=[a0,a1,…,a k-1 ] T d=[d0,d1,…,d n-1 ] T =[a0,a1,…,a k-1 ,h0,h1,…,h r-1 ] T , h j represents the jth second coded data block among the r second coded data blocks, j is a non-negative integer less than r, and T represents transpose.

[0147] In some embodiments, the n first coded data packets are determined according to the following formula: d=G*a;

[0148] Wherein, d represents n first coded data packets, G represents the first generator matrix, * represents the matrix multiplication operation under the Galois field GF(q), a represents k second data packets, a=[a0,a1,…,a k-1 ] T Since the first k rows of the first generation matrix are an identity matrix, the first k first coded data packets of the n first coded data packets have the same value as the k second data packets, d=[d0,d1,…,d n-1 ] T =[a0,a1,…,a k-1 ,h0,h1,…,h r-1 ] T . Where T represents transpose, [d k ,d k+1 ,…,d n-1 ]=[h0,h1,…,h r-1 ], h j represents the jth second coded data packet among r second coded data packets, where j is a non-negative integer less than r.

[0149] For example, taking the Galois field size q=256, the number of second data packets k=5, the number of second coded data packets r=2, and each second data packet containing 2 bytes as an example, the k second data packets can be expressed as follows:

[0150] In some embodiments, in g i,j=(k+j) / (k+i+j), the n first coded data packets can be determined according to the following relationship:

[0151] In some embodiments, in g i,j =((k+j)*(k+i)) / ((k+i+j)*k), the n first coded data packets can be determined according to the following relationship:

[0152] In some embodiments, r second encoded data packets may be obtained according to the following formula: h=G2*a;

[0153] Where h represents r second coded data packets, G2 is the second generation matrix, and a is k second data packets. Then, k second data packets and r second coded data packets are combined to obtain n first coded data packets, d=[d0,d1,…,d n-1 ] T =[a0,a1,…,a k-1 ,h0,h1,…,h r-1 ] T , T represents transpose.

[0154] In some embodiments, the first transmission node encodes k second data packets to obtain n first encoded data packets. The second data packets may be data packets from one of the following sublayers in the radio interface protocol stack: PDCP layer, RLC layer, MAC layer, physical layer.

[0155] As an example, in the case where the second data packet comes from the PDCP layer, the second data packet is obtained according to a service data unit (SDU) data packet of the PDCP layer.

[0156] As shown in Figure 4, a schematic diagram of data packet encoding at the PDCP layer provided in an embodiment of the present application is provided. Referring to Figure 4, a first transmission node 1308 encodes k second data packets 1302, where the number of second data packets 1302 is k, where k is an integer greater than 0, and in Figure 4, k is 4 as an example. The k second data packets 1302 are encoded using a first generation matrix to obtain n first encoded data packets 1304, where n is an integer greater than k, and in Figure 4, n is 6 as an example. A PDCP header is then added to the first encoded data packets 1304 to obtain a PDCP PDU 1306, which is then transmitted to the RLC layer via the RLC channel. Then, the second transmission node 1310 receives the first coded data packets 1, 3, 4, and 5, among which the first coded data packet 5 is the third coded data packet. The PDCP header is removed at the PDCP layer of the second transmission node 1310, and the second data packet can be decoded and restored by XOR; the white framed part 1302 represents the second data packet, the black part on the left of 1306 represents the data packet header, and the lower left slashed part in 1304 and 1306 represents the second coded data packet.

[0157] It should be noted that in FIG4 , Encode means encoding, Add header means adding a packet header, and PHY means the physical layer physics.

[0158] The following uses different scenarios to illustrate how the second data packet is obtained based on the SDU data packet of the PDCP layer.

[0159] Scenario 1: Taking the DC scenario where the second data packet is obtained based on the SDU data packet of the PDCP layer as an example for explanation.

[0160] As shown in Figure 5, a schematic diagram of data packet encoding at the PDCP layer in a DC scenario provided by an embodiment of the present application is provided. Referring to Figure 5, the first transmission node 1408 encodes k second data packets 1402, where the number of second data packets 1402 is k, where k is an integer greater than 0, and in Figure 5, k is taken as an example. The k second data packets 1402 are encoded using a first generation matrix to obtain n first encoded data packets 1404, where n is an integer greater than k, and in Figure 5, n is taken as an example. A PDCP header is then added to the first encoded data packets 1404 to obtain a PDCP PDU. In the DC scenario, the encoded PDCP PDUs are distributed based on the channel state information-reference signal (CSI-RS), downlink control information (DCI), and other channel state information. Cells with good channel quality or idle cells carry more first encoded data packets. In Figure 5, four second data packets 1402 are encoded to obtain six first encoded data packets 1404. A PDCP header is then added to the first encoded data packets 1404 to obtain six PDCP PDUs. The primary cell transmits three PDCP PDUs, and the secondary cell transmits three PDCP PDUs. The three PDCP PDUs transmitted by the primary cell are represented by 1406A, and the three PDCP PDUs transmitted by the secondary cell are represented by 1406B. The second transmitting node receives the first encoded data packets 1 and 2 transmitted via the primary cell, as well as the first encoded data packets 4 and 5 transmitted via the secondary cell. First encoded data packet 5 is the third encoded data packet. The PDCP header is removed at the PDCP layer of the second transmitting node, and the second data packet is decoded and recovered through an exclusive-OR operation.

[0161] Scenario 2: Taking the acquisition of the second data packet according to the SDU data packet of the PDCP layer in the CA scenario as an example for explanation.

[0162] For example, as shown in FIG6 , a schematic diagram of data packet encoding at the PDCP layer in a CA scenario provided by an embodiment of the present application is provided. Referring to FIG6 , a first transmission node 1508 encodes k second data packets 1502 , where k is an integer greater than 0, and FIG6 takes k as an example. The k second data packets 1502 are encoded using a first generation matrix to obtain n first encoded data packets 1504 , where n is an integer greater than k, and FIG6 takes n as an example. A PDCP header is then added to the first encoded data packets 1504 to obtain a PDCP PDU. In the CA scenario, the encoded PDCP PDU is diverted based on CSI-RS, DCI and other channel state information and sent through different carriers. In Figure 6, the four second data packets 1502 are encoded to obtain six first encoded data packets 1504, and then the first encoded data packets 1504 are added with a PDCP header to obtain six PDCP PDUs, three PDCP PDUs of 1506A are transmitted on the first carrier, and three PDCP PDUs of 1506B are transmitted on the second carrier; the second transmission node receives the first encoded data packets 1 and 2 transmitted via the first carrier, and receives the first encoded data packets 4 and 5 transmitted via the second carrier, where the first encoded data packet 5 is the third encoded data packet. The PDCP header is removed at the PDCP layer of the second transmission node, and the second data packet can be decoded and restored by an XOR operation.

[0163] It should be noted that the first carrier and the second carrier are merely expressions of different carriers and have no order relationship.

[0164] As another example, in the case where the second data packet comes from the RLC layer, the second data packet is obtained according to the SDU data packet of the RLC layer.

[0165] As shown in FIG7 , a schematic diagram of packet encoding at the RLC layer according to an embodiment of the present application is provided. Referring to FIG7 , a first transmission node 1608 encodes k second packets 1602, where k is an integer greater than 0. In FIG7 , k is 4 as an example. The k second packets 1602 are encoded using a first generator matrix to generate n first encoded packets 1604, where n is an integer greater than k. In FIG7 , n is 6 as an example. An RLC header is then added to the first encoded packets 1604 to generate an RLC PDU 1606. Subsequently, a second transmission node 1610 receives the first encoded packets 1, 3, 4, and 5, where first encoded packet 5 is the third encoded packet. The RLC layer of the second transmission node 1610 removes the RLC header and decodes the second packet using an exclusive-OR operation. The white outlined portion of 1602 represents the second packet, the black portion on the left of 1606 represents the packet header, and the lower-left slashed portions of 1604 and 1606 represent the second encoded packet.

[0166] As another example, in the case where the second data packet comes from the MAC layer, the second data packet is obtained according to the SDU data packet of the MAC layer.

[0167] As shown in FIG8 , a schematic diagram of MAC layer packet encoding is provided in an embodiment of the present application. Referring to FIG8 , a first transmission node 1708 encodes k second packets 1702, where k is an integer greater than 0. In FIG8 , k is 4 as an example. The k second packets 1702 are encoded using a first generation matrix to obtain n first encoded packets 1704, where n is an integer greater than k. In FIG8 , n is 6 as an example. A MAC header is then added to the first encoded packets 1704 to obtain a PDCP PDU 1706. Subsequently, a second transmission node 1710 receives first encoded packets 1, 3, 4, and 5, where first encoded packet 5 is the third encoded packet. The MAC layer of the second transmission node 1710 removes the MAC header and decodes the second packet using an exclusive-OR operation. The white outlined portion of 1702 represents the second packet, the black portion on the left of 1706 represents the packet header, and the lower-left slashed portions of 1704 and 1706 represent the second encoded packet.

[0168] As another example, in the case where the second data packets come from the physical layer, the second data packets are obtained according to the transmission blocks of the physical layer, and each second data packet corresponds to a code block.

[0169] Exemplarily, as shown in FIG9 , a schematic diagram of code block encoding of a physical layer provided by an embodiment of the present application is provided. The first transmission node 1808 encodes the second data packet 1802. The number of the second data packets 1802 is k, where k is an integer greater than 0. In FIG9 , k is taken as an example to be 4. The k second data packets 1802 are encoded by the first generation matrix to obtain n first coded data packets 1804, where n is an integer greater than k. In FIG9 , n is taken as an example to be 6. Then, the second transmission node 1810 receives the first coded data packets 1, 3, 4, and 5, and decodes and recovers the second data packet through an XOR operation. Among them, the first coded data packet 5 is the third coded data packet,

[0170] S104: Send all or part of the n first coded data packets to the second transmission node.

[0171] In some embodiments, the first coded data packet has an index identifier I(u). The index identifier I(u) of a first coded data packet is used to indicate the order in which the first transmitting node generates the first coded data packet and / or to indicate the position of the k second data packets within the n first coded data packets. Where 0≤u≤n-1, I(u) is a non-negative integer.

[0172] In the case where the index identifier I(u) of the first coded data packet is used to represent the order in which the first transmitting node generates the first coded data packet, as an example, n first coded data packets d=[d0, d1, ..., d n-1 ] The corresponding index identifiers<I(0),I(1),…,I(n-1)> =<0,1,…,n-1>. As another example, n first coded data packets d=[d0,d1,…,d n-1 ] The corresponding index identifiers<I(1),I(2),…,I(n)> =<1,2,…,n>.

[0173] In the case where the index identifier I(u) of the first coded data packet is used to represent the positions of the k second data packets in the n first coded data packets, as an example, the index identifier<I(0),I(1),…,I(n-1)> = <0,1,…,n-1>, where<I(0),I(1),…,I(k-1)> =<0,1,…,k-1> represents the index identifiers of k second data packets. As another example, the index identifier<I(0),I(1),…,I(n-1)> =<1,2,…,n>, where<I(0),I(1),…,I(k-1)> =<1,2,…,k> represents the index identifiers of k second data packets.

[0174] In some embodiments, the index identifier of the first encoded data packet can be carried in the header information of the first encoded data packet. That is, the index identifier of the first encoded data packet transmitted by the first transmission node can be carried and sent via the header information. It should be understood that carrying the index identifier of the first encoded data packet in the header information can ensure that the second transmission node can stably and reliably receive the index identifier of the first encoded data packet, thereby ensuring the stability of data transmission.

[0175] In some embodiments, the first transmission node may send all or part of n first coded data packets to the second transmission node through M links, and the number of first coded data packets sent by the i-th link among the M links is M. i is less than or equal to n, M is a positive integer, and i is a positive integer less than or equal to M. As an example, M is equal to 1, 2, or 4.

[0176] For example, when M is equal to 1, all or part of the n first coded data packets are transmitted to the second transmission node through one link.

[0177] For another example, when M is greater than 1, each link sends the same number of first coded data packets, that is, each link sends n / M first coded data packets.

[0178] In some embodiments, the first transmitting node may further determine the number of first coded data packets transmitted over a link based on the channel quality of the link. For example, the channel quality of a link is positively correlated with the number of first coded data packets transmitted over the link, i.e., the better the channel quality of the link, the greater the number of first data packets transmitted.

[0179] Taking the channel quality of the link as the average packet loss rate of the link as an example, for example, taking M equal to 2, the average packet loss rate of the first link is P1, the average packet loss rate of the second link is P2, the number of first encoded data packets transmitted by the first link is M1=n*P2 / (P1+P2), and the number of first encoded data packets transmitted by the second link is M2=n*P1 / (P1+P2).

[0180] It should be understood that in step S104, the first transmission node transmits part of the first coded data packets or all of the n first coded data packets to the second transmission node, so that the second transmission node receives enough first coded data packets for processing. That is to say, since the first transmission node only needs to send the corresponding first coded data packets to the second transmission node, the second transmission node can effectively complete decoding, avoiding the delay caused by the retransmission of data packets. When the second transmission node only loses one second data packet and the third coded data packet is correctly received, the lost second data packet can be obtained through a simple XOR operation, thereby ensuring the reliability of data transmission and reducing resource overhead.

[0181] The embodiment shown in FIG2 provides at least the following beneficial effects: by converting m first data packets into k second data packets, the k second data packets have the same size, so that the k second data packets can be smoothly encoded according to the first generator matrix to obtain n first encoded data packets, thereby ensuring the reliability of data transmission. The n first encoded data packets are obtained by encoding the k second data packets according to the first generator matrix. Since any k rows in the first generator matrix are linearly independent under the Galois field GF(q), it is guaranteed that when any r of the n first encoded data packets fail, k second data packets can be successfully decoded. This reduces the encoding computation load without reducing storage reliability, that is, reduces resource overhead. Moreover, since the target row exists in the second generator matrix, the failed first encoded data packet can be restored through a simple XOR operation, reducing the computation load, that is, reducing resource overhead, thereby ensuring the reliability of data transmission and reducing resource overhead.

[0182] In some embodiments, as shown in FIG10 , an embodiment of the present application provides a data processing method, which is applied to a second transmission node. The second transmission node may be the second transmission node 120 shown in FIG1 . The method includes the following steps:

[0183] S201: Obtain the number n of first coded data packets, the number k of second data packets, an index identifier of each first coded data packet, and k correctly received first coded data packets generated by a first transmission node.

[0184] Wherein, n and k are positive integers, and the k correctly received first coded data packets are a subset of the n first coded data packets.

[0185] S202: Process k correctly received first coded data packets according to the number n of first coded data packets, the number k of second data packets, and the index identifier of each first coded data packet to obtain lost second data packets.

[0186] As a possible example, step S202 may include the following steps:

[0187] S1. Determine unreceived first coded data packets according to the number of first coded data packets, the index identifier of each first coded data packet, and k correctly received first coded data packets.

[0188] It should be understood that the number of first coded data packets is the number of first coded data packets sent by the first transmission node to the second transmission node. Based on the number of first coded data packets, the index identifier of each first coded data packet and the number k of second data packets, the index identifier of the unreceived first coded data packet can be determined, and then the unreceived second data packet can be restored based on the k correctly received first coded data packets.

[0189] After determining the index identifier of the first encoded data packet that has not been received, at least one of the following steps S2 to S4 may be included:

[0190] S2. When the unreceived first coded data packets include one second data packet and the second transmission node receives the third coded data packet, perform XOR processing on the k-1 received second data packets and the third coded data packet to obtain the lost second data packet.

[0191] As can be seen from the above, the third coded data packet is a data packet obtained by encoding the second data packet according to the target row in the second generation matrix, and the values ​​of the elements in the target row are all 1.

[0192] S3. When the unreceived first coded data packets include only one second data packet, and the second transmission node receives other second coded data packets in addition to the third coded data packet, the lost second data packet is determined based on Gaussian elimination or at least one of the following parameters: a second generating matrix, k-1 received second data packets, 1 received second coded data packet, and index identifiers of k received first coded data packets.

[0193] S4. When the unreceived first coded data packets include p second data packets and the second transmission node receives at least p second coded data packets, the lost second data packets are determined based on Gaussian elimination or at least one of the following parameters: a second generating matrix, kp received second data packets, at least p received second coded data packets, and index identifiers of k received first coded data packets.

[0194] Wherein, p is an integer greater than 1 and less than or equal to r.

[0195] It should be understood that when the number of unreceived first coded data packets exceeds r, data recovery cannot be completed, where r=nk, where r is a positive integer. When the number of unreceived first coded data packets is 0, data is not lost and no data recovery is required. When the unreceived first coded data packets include zero second coded data packets, data is not lost and no data recovery is required.

[0196] It should be noted that S2, S3 and S4 are only descriptions for different situations, and there is no order relationship between S2, S3 and S4.

[0197] The embodiment shown in Figure 10 brings at least the following beneficial effects: when the number of unreceived first coded data packets does not exceed r, the second transmission node obtains the unreceived second data packets based on k correctly received first coded data packets. Since any k rows of the first generating matrix are linearly independent, it is only necessary to obtain any k first coded data packets and complete data recovery through a simple XOR operation without obtaining more than k first coded data packets, thereby ensuring the reliability and throughput of data transmission and reducing resource overhead.

[0198] The above mainly introduces the solution provided by the present application from the perspective of the interaction between each node. It can be understood that each node, such as the first transmission node or the second transmission node, includes a hardware structure and / or software module corresponding to the execution of each function in order to realize the above functions. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present invention can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.

[0199] FIG11 is a schematic diagram showing the composition of a communication device provided in an embodiment of the present application. As shown in FIG11 , the communication device 30 includes an acquisition unit 301 , a processing unit 302 , and a sending unit 303 .

[0200] The communication device 30 may be the first transmission node or a chip in the first transmission node. When the communication device 30 is used to implement the function of the first transmission node in the above embodiment, each unit is specifically used to implement the following functions.

[0201] An acquiring unit 301 is configured to acquire m first data packets, where m is a positive integer;

[0202] The processing unit 302 is configured to determine k second data packets according to the m first data packets, where k is a positive integer;

[0203] The processing unit 302 is further configured to encode the k second data packets according to the first generation matrix to obtain n first encoded data packets, where n is a positive integer, wherein the value range of the elements in the first generation matrix is ​​[0, q-1], and q is a prime number or a power of a prime number;

[0204] The sending unit 303 is configured to send all or part of the n first coded data packets to the second transmission node.

[0205] In some embodiments, the m first data packets include at least one of the following: data packets of the Packet Data Convergence Protocol (PDCP) layer in the wireless interface protocol stack; data packets of the Radio Link Control (RLC) layer in the wireless interface protocol stack; data packets of the Medium Access Control (MAC) layer in the wireless interface protocol stack; and data packets of the physical layer in the wireless interface protocol stack.

[0206] In some embodiments, the processing unit 302 is specifically used to: when the m first data packets have the same size, use the m first data packets as k second data packets, m=k; when the m first data packets do not have the same size, fill the size of the first data packets in the m first data packets except the target first data packet to the same size as the target first data packet to obtain k second data packets, and the target first data packet is the largest data packet among the m first data packets, m=k.

[0207] In some embodiments, the processing unit 302 is specifically configured to preprocess the m first data packets to obtain k second data packets, where the preprocessing includes at least one of the following: combining processing, filling processing, and segmentation processing.

[0208] In some embodiments, the number k of second data packets is determined based on at least one of the following: the number m of first data packets, the size S of m first data packets, the size T of a second data packet, channel state information, capability information of the user equipment, control signaling, the number of links, and the number of carriers; wherein the channel state information includes at least one of the following: channel quality indication information, rank indication information, and precoding matrix indication information; the capability information of the user equipment includes at least one of the following: the upper limit value of the number of antennas supported by the user equipment, the upper limit value of the data transmission rate supported by the user equipment, and the upper limit value of the modulation order supported by the user equipment.

[0209] In some embodiments, when the channel state information is channel quality indication information, the number k of second data packets is determined according to the index value of the channel quality indication information; when the channel state information is rank indication information, the number k of second data packets is determined according to the value of the rank indication information; when the channel state information is precoding matrix indication information, the number k of second data packets is determined according to the index value of the precoding matrix indication information.

[0210] In some embodiments, the first generation matrix is ​​determined according to one of the following: determined according to preconfiguration; determined according to the number k of the second data packets and / or the number n of the first encoded data packets.

[0211] In some embodiments, the first generating matrix includes a unit matrix and a second generating matrix, the size of the unit matrix is ​​k×k, the size of the second generating matrix is ​​r×k, and n=r+k, r is a positive integer; the n first coded data packets include k second data packets and r second coded data packets, and the r second coded data packets are data packets obtained by encoding the k second data packets according to the second generating matrix.

[0212] In some embodiments, the number r of second coded data packets is determined based on at least one of: the number k of second data packets, channel state information, and control signaling; wherein the channel state information includes at least one of: channel quality indication information, rank indication information, and precoding matrix indication information.

[0213] In some embodiments, for any k rows in the first generator matrix, any k rows are linearly independent under the Galois Field GF(q); wherein q is a prime number or a prime power.

[0214] In some embodiments, for any r columns in the merged matrix consisting of the second generator matrix and the unit matrix of size r×r, any r columns are linearly independent under the Galois Field GF(q); where q is a prime number or a prime power.

[0215] In some embodiments, there is a target row in the second generation matrix, and the values ​​of the elements in the target row are all 1.

[0216] In some embodiments, the value of the element with row number i and column number j in the second generation matrix is ​​determined according to the following parameters: k, i, j; wherein i and j are both non-negative integers, and 0≤i≤r-1, 0≤j≤k-1.

[0217] In some embodiments, the value of the element with row number i and column number j in the second generator matrix is ​​determined according to the following formula: i,j =(k+j) / (k+i+j);

[0218] Among them, g i,j represents the value of the element with row number i and column number j in the second generator matrix, where i and j are both non-negative integers and 0≤i≤r-1, 0≤j≤k-1, / represents the division operation under the Galois field GF(q), and + represents the bitwise exclusive-OR operation under the Galois field GF(q).

[0219] In some embodiments, the value of the element with row number i and column number j in the second generator matrix is ​​determined according to the following formula: i,j =((k+j)*(k+i)) / ((k+i+j)*k);

[0220] Among them, g i,j represents the value of the element with row number i and column number j in the second generator matrix, / represents the division operation under the Galois field GF(q), + represents the bitwise exclusive OR operation under the Galois field GF(q), * represents the multiplication operation under the Galois field GF(q), and q is a prime number or a prime power.

[0221] In some embodiments, any two rows or columns in the second generator matrix can be swapped.

[0222] In some embodiments, the n first coded data blocks are determined according to the following formula: d=G*a;

[0223] Wherein, d represents n first coded data blocks, G represents a first generator matrix, * represents a multiplication operation under the Galois field GF(q), a represents k second data packets, and q is a prime number or a prime power.

[0224] In some embodiments, the first coded data packet has an index identifier, which is used to represent the order in which the first transmission node generates the first coded data packets and / or to represent the positions of the k second data packets in the n first coded data packets.

[0225] In some embodiments, the index identifier of the first encoded data packet is carried in the header information of the first encoded data packet.

[0226] FIG12 is a schematic diagram showing the composition of another communication device provided in an embodiment of the present application. As shown in FIG12 , the communication device 40 includes an acquisition unit 401 and a processing unit 402 .

[0227] The communication device 40 may be the second transmission node or a chip in the second transmission node. When the communication device 40 is used to implement the function of the second transmission node in the above embodiment, each unit is specifically used to implement the following functions.

[0228] An acquiring unit 401 is configured to acquire the number n of first coded data packets, the number k of second data packets, an index identifier of each first coded data packet, and k correctly received first coded data packets generated by a first transmission node; wherein k is a positive integer, and the k correctly received first coded data packets are a subset of n first coded data packets obtained by the first transmission node encoding the k second data packets according to a first generation matrix;

[0229] The processing unit 402 is configured to process k correctly received first coded data packets according to the number n of first coded data packets, the number k of second data packets and the index identifier of each first coded data packet to obtain lost second data packets.

[0230] In some embodiments, the processing unit 402 is specifically configured to: determine the index identifier of the unreceived first encoded data packet based on the number of first encoded data packets, the index identifier of each first encoded data packet, and the number k of second data packets;

[0231] When the unreceived first coded data packets include one second data packet and the second transmission node receives a third coded data packet, performing an exclusive-OR process on the k-1 received second data packets and the third coded data packet to obtain the lost second data packet; wherein the third coded data packet is a data packet obtained by encoding the second data packet according to a target row in the second generator matrix, and the values ​​of the elements in the target row are all 1;

[0232] When only one second data packet is included in the unreceived first coded data packets, and the second transmission node receives other second coded data packets in addition to the third coded data packet, determining the lost second data packet based on Gaussian elimination or at least one of the following parameters: a second generator matrix, k-1 received second data packets, one received second coded data packet, and index identifiers of k received first coded data packets;

[0233] When the unreceived first coded data packets include p second data packets and the second transmission node receives at least p second coded data packets, the lost second data packets are determined based on Gaussian elimination or at least one of the following parameters: a second generating matrix, kp received second data packets, index identifiers of at least p received second coded data packets, and k received first coded data packets; where p is an integer greater than 1 and less than or equal to r.

[0234] It should be noted that the units in Figures 11 and 12 may also be referred to as modules. For example, the sending unit may be referred to as a sending module. In addition, in the embodiments shown in Figures 11 and 12, the names of the units may not be those shown in the figures. For example, the sending unit may be referred to as a communication unit, and the acquiring unit may be referred to as a communication unit.

[0235] If the various units in Figures 11 and 12 are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor (processor) to execute all or part of the steps of the various embodiments of the present application. The storage medium for storing computer software products includes various media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0236] When the communication device 30 or 40 implements the functions of the integrated modules in hardware, an embodiment of the present application provides a schematic structural diagram of the communication device. As shown in Figure 13, the communication device 50 includes: a processor 502, a communication interface 503, and a bus 504. Optionally, the communication device 50 may also include a memory 501.

[0237] Processor 502 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of this application. Processor 502 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. It may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of this application. Processor 502 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, or a combination of a DSP and a microprocessor.

[0238] The communication interface 503 is used to connect to other devices via a communication network, such as Ethernet, wireless access network, wireless local area network (WLAN), etc.

[0239] The memory 501 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0240] As a possible implementation, the memory 501 can exist independently of the processor 502. The memory 501 can be connected to the processor 502 via a bus 504 to store instructions or program codes. When the processor 502 calls and executes the instructions or program codes stored in the memory 501, the data processing method provided in the embodiment of the present application can be implemented.

[0241] In another possible implementation, the memory 501 may also be integrated with the processor 502 .

[0242] Bus 504 can be an Extended Industry Standard Architecture (EISA) bus, etc. Bus 504 can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, FIG13 shows only one thick line, but this does not mean that there is only one bus or only one type of bus.

[0243] Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and conciseness of the description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be assigned to different functional modules as needed, that is, the internal structure of the base station or terminal is divided into different functional modules to complete all or part of the functions described above.

[0244] The embodiment of the present application also provides a computer-readable storage medium. All or part of the processes in the above-mentioned method embodiment can be completed by computer instructions to instruct the relevant hardware, and the program can be stored in the above-mentioned computer-readable storage medium. When the program is executed, it may include the processes of the above-mentioned method embodiments. The computer-readable storage medium can be the memory or memory of any of the above-mentioned embodiments. The above-mentioned computer-readable storage medium can also be an external storage device of the above-mentioned base station or terminal, such as a plug-in hard disk, a smart memory card (smart media card, SMC), a secure digital (secure digital, SD) card, a flash card (flash card), etc. equipped on the above-mentioned base station or terminal. Furthermore, the above-mentioned computer-readable storage medium can also include both the internal storage unit of the above-mentioned base station or terminal and an external storage device. The above-mentioned computer-readable storage medium is used to store the above-mentioned computer program and other programs and data required by the above-mentioned base station or terminal. The above-mentioned computer-readable storage medium can also be used to temporarily store data that has been output or is to be output.

[0245] An embodiment of the present application further provides a computer program product, which includes a computer program. When the computer program product is run on a computer, the computer is enabled to execute any one of the data processing methods provided in the above embodiments.

[0246] Although the present application is described herein in conjunction with various embodiments, in the process of implementing the claimed application, those skilled in the art may understand and implement other variations of the disclosed embodiments by reviewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and "one" or "an" does not exclude multiple components. A single processor or other unit may implement several functions listed in the claims. Certain measures are recorded in different dependent claims, but this does not mean that these measures cannot be combined to produce good results.

[0247] Although the present application has been described with reference to specific features and embodiments thereof, it is apparent that various modifications and combinations may be made thereto without departing from the spirit and scope of the present application. Accordingly, this specification and the drawings are merely illustrative of the present application as defined by the appended claims and are deemed to cover any and all modifications, variations, combinations or equivalents within the scope of the present application. Obviously, those skilled in the art may make various modifications and variations to the present application without departing from the spirit and scope of the present application. Thus, the present application is intended to include such modifications and variations as fall within the scope of the claims of the present application and their equivalents.

[0248] The above are only specific embodiments of the present application, but the scope of protection of the present application is not limited thereto. Any changes or replacements within the technical scope disclosed in this application should be included in the scope of protection of the present application. Therefore, the scope of protection of the present application should be based on the scope of protection of the claims.

Claims

1. A data processing method, characterized in that: Applied to a first transmission node, the method includes: Get m first data packets, where m is a positive integer; Determine k second data packets according to the m first data packets, where k is a positive integer; Encode the k second data packets according to the first generation matrix to obtain n first encoded data packets, where n is a positive integer, wherein the value range of the elements in the first generation matrix is ​​[0, q-1], and q is a prime number or a prime power; All or part of the n first coded data packets are sent to the second transmission node.

2. The method according to claim 1, characterized in that The m first data packets include at least one of the following: Data packets of the Packet Data Convergence Protocol (PDCP) layer in the radio interface protocol stack; Data packets of the radio link control RLC layer in the radio interface protocol stack; Data packets of the media access control MAC layer in the wireless interface protocol stack; Data packets at the physical layer in the radio interface protocol stack.

3. The method according to claim 1, characterized in that The step of determining k second data packets according to the m first data packets comprises at least one of the following: When the m first data packets have the same size, the m first data packets are used as the k second data packets, m=k; When the m first data packets do not have the same size, the sizes of the first data packets other than the target first data packet among the m first data packets are padded to the same size as the target first data packet to obtain the k second data packets, where the target first data packet is the largest data packet among the m first data packets, m=k.

4. The method according to claim 1, characterized in that: The step of determining k second data packets according to the m first data packets comprises: The m first data packets are preprocessed to obtain the k second data packets; the preprocessing includes at least one of the following: combination processing, filling processing, and segmentation processing.

5. The method according to claim 1, characterized in that: The number k of the second data packets is determined according to at least one of the following: The number m of the first data packets, the size S of the m first data packets, the size T of a second data packet, channel state information, capability information of the user equipment, control signaling, the number of links and the number of carriers; wherein the channel state information includes at least one of the following: channel quality indication information, rank indication information and precoding matrix indication information; the capability information of the user equipment includes at least one of the following: the upper limit value of the number of antennas supported by the user equipment, the upper limit value of the data transmission rate supported by the user equipment, and the upper limit value of the modulation order supported by the user equipment.

6. The method according to claim 5, characterized in that When the channel state information is the channel quality indication information, determining the number k of the second data packets according to the index value of the channel quality indication information; When the channel state information is the rank indication information, determining the number k of the second data packets according to the value of the rank indication information; When the channel state information is the precoding matrix indication information, the number k of the second data packets is determined according to the index value of the precoding matrix indication information.

7. The method according to claim 1, characterized in that The first generator matrix is ​​determined according to one of the following: Determined according to pre-configuration; The method is determined according to the number k of the second data packets and / or the number n of the first encoded data packets.

8. The method according to claim 1, characterized in that The first generator matrix includes a unit matrix and a second generator matrix, the unit matrix has a size of k×k, the second generator matrix has a size of r×k, and n=r+k, where r is a positive integer; The n first coded data packets include k second data packets and r second coded data packets, and the r second coded data packets are data packets obtained by encoding the k second data packets according to the second generation matrix.

9. The method according to claim 8, characterized in that The number r of the second encoded data packets is determined according to at least one of the following: The number k of the second data packets, channel state information, and control signaling; wherein the channel state information includes at least one of the following: channel quality indication information, rank indication information, and precoding matrix indication information.

10. The method according to claim 1, characterized in that For any k rows in the first generator matrix, the k rows are linearly independent under the Galois Field GF(q); wherein q is a prime number or a prime power.

11. The method according to claim 8, characterized in that For any r columns in the merged matrix consisting of the second generator matrix and the unit matrix of size r×r, the any r columns are linearly independent under the Galois Field GF(q); wherein q is a prime number or a prime power.

12. The method according to claim 8, characterized in that There is a target row in the second generation matrix, and the values ​​of the elements in the target row are all 1.

13. The method according to claim 8, characterized in that The value of the element with row number i and column number j in the second generation matrix is ​​determined according to the following parameters: k, i, j; wherein i and j are both non-negative integers, and 0≤i≤r-1, 0≤j≤k-1.

14. The method according to claim 13, characterized in that The value of the element with row number i and column number j in the second generator matrix is ​​determined according to the following formula: i,j =(k+j) / (k+i+j); Among them, g i,j represents the value of the element with row number i and column number j in the second generator matrix, where i and j are both non-negative integers, and 0≤i≤r-1, 0≤j≤k-1, / represents a division operation under the Galois field GF(q), and + represents a bitwise exclusive OR operation under the Galois field GF(q).

15. The method according to claim 13, characterized in that The value of the element with row number i and column number j in the second generation matrix is ​​determined according to the following formula: i,j =((k+j)*(k+i)) / ((k+i+j)*k); Among them, g i,j represents the value of the element with row number i and column number j in the second generator matrix, / represents a division operation under the Galois field GF(q), + represents a bitwise exclusive OR operation under the Galois field GF(q), * represents a multiplication operation under the Galois field GF(q), and q is a prime number or a prime power.

16. The method according to claim 14 or 15, characterized in that Any two rows or two columns in the second generator matrix can be exchanged.

17. The method according to claim 1, characterized in that The n first coded data blocks are determined according to the following formula: d=G*a; Wherein, d represents the n first coded data blocks, G represents the first generator matrix, * represents the multiplication operation under the Galois field GF(q), a represents the k second data packets, and q is a prime number or a prime power.

18. The method according to claim 1, characterized in that The first coded data packet has an index identifier, and the index identifier is used to represent the order in which the first transmission node generates the first coded data packets, and / or to represent the positions of the k second data packets in the n first coded data packets.

19. The method according to claim 18, characterized in that The index identifier of the first encoded data packet is carried in the header information of the first encoded data packet.

20. A data processing method, characterized in that: Applied to the second transmission node, the method includes: Obtain the number n of first coded data packets, the number k of second data packets, the index identifier of each of the first coded data packets, and k correctly received first coded data packets generated by the first transmission node; wherein n, and k are positive integers, and the k correctly received first coded data packets are a subset of n first coded data packets obtained by the first transmission node encoding k second data packets according to the first generation matrix; According to the number n of the first coded data packets, the number k of the second data packets and the index identifier of each of the first coded data packets, The k correctly received first encoded data packets are processed to obtain lost second data packets.

21. The method according to claim 20, characterized in that The first generator matrix includes a unit matrix and a second generator matrix, the unit matrix has a size of k×k, the second generator matrix has a size of r×k, and n=r+k, where r is a positive integer; The step of processing the k correctly received first coded data packets to obtain the lost second data packet comprises: Determine the index identifier of the first encoded data packet that has not been received according to the number of the first encoded data packets, the index identifier of each of the first encoded data packets, and the number k of the second data packets; When the unreceived first coded data packet includes one second data packet and the second transmission node receives a third coded data packet, an XOR process is performed on k-1 received second data packets and the third coded data packet to obtain the lost second data packet; wherein the third coded data packet is a data packet obtained by encoding the second data packet according to a target row in the second generation matrix, and the values ​​of the elements in the target row are all 1; When only one second data packet is included in the unreceived first coded data packets, and the second transmission node receives other second coded data packets except the third coded data packet, the lost second data packet is determined according to Gaussian elimination or at least one of the following parameters: the second generation matrix, the received k-1 second data packets, the received one second coded data packet, and the index identifiers of the k received first coded data packets; When the unreceived first coded data packets include p second data packets and the second transmission node receives at least p second coded data packets, the lost second data packet is determined according to the Gaussian elimination or at least one of the following parameters: the second generating matrix, the received kp second data packets, the received at least p second coded data packets and the index identifiers of the k received first coded data packets; wherein p is an integer greater than 1 and less than or equal to r.

22. A communication device, characterized in that: include: Processor and memory; The memory stores instructions executable by the processor; When the processor is configured to execute the instructions, the communication device implements the method according to any one of claims 1 to 21.

23. A computer-readable storage medium, characterized in that: The computer-readable storage medium comprises computer instructions, which, when executed on a computer, cause the computer to perform the method according to any one of claims 1 to 21.

Citation Information

Patent Citations

  • Data processing method and device and storage medium

    CN119109550A

  • Data transmission method, device and system and electronic equipment

    CN112751644A

  • Method for transmitting and receiving data and communication device

    CN115549850A

  • Communication method and device

    CN115913453A

  • Data communication method, terminal and information security device

    WO2015120758A1

Cited By

  • Red and blue cooperative fountain code communication method and device based on rail transit system

    CN120498604A