WO2023016506A1

WO2023016506A1 - Method for transmitting data and communication apparatus

Info

Publication number: WO2023016506A1
Application number: PCT/CN2022/111611
Authority: WO
Inventors: 刘菁; 董朋朋; 曹振臻
Original assignee: 华为技术有限公司
Priority date: 2021-08-13
Filing date: 2022-08-11
Publication date: 2023-02-16
Also published as: CN115706621A

Abstract

The present application provides a method for transmitting data and a communication apparatus. According to the method, when a receiving device receives T data packets by means of a first entity, once the receiving device performs a network decoding operation on the T data packets to restore one piece of M pieces of original data, or once the network decoding operation is performed on the T data packets to restore the M pieces of original data, the receiving device submits the restored original data by means of the first entity. Thus, the problem of how the receiving device submits the restored original data is solved. The present application can be applied to extended reality (XR) services, or other services that require high delay.

Description

Data transmission method and communication device

This application claims the priority of a Chinese patent application filed with the State Intellectual Property Office of China on August 13, 2021, with the application number 202110932673.0 and the application title "Method and communication device for transmitting data", the entire contents of which are incorporated herein by reference. Applying.

technical field

The present application relates to the field of wireless communication, and more specifically, to a data transmission method and a communication device.

Background technique

In the long term evolution (LTE) system, the radio link control (radio link control, RLC) layer includes a reordering function, thereby ensuring Layers deliver data sequentially.

Unlike the LTE system, in the new radio (NR) system or the 5th generation (5G) system, the RLC layer cancels the reordering function, and moves the reordering function up to the PDCP layer for implementation. That is to say, if the data received by the PDCP layer from the RLC layer is out of order, the PDCP layer supports reordering the out-of-order data, and then submits the data to its upper layer in order.

However, none of the above solutions considered the impact on the receiving end after the introduction of the network coding (NC) function, for example: how the receiving end performs data submission, or how the receiving end pushes the receiving window, etc.

Contents of the invention

The present application provides a data transmission method in order to solve the problem of how the receiving end submits the decoded original data.

In the first aspect, a method for transmitting data is provided, the method is applied to a receiving device, and the method includes: receiving T data packets through a first entity, and the T data packets belong to K data packets, wherein the K The data packets include N system packets and (K-N) redundant packets, and the K data packets and the N original data packets satisfy a coding relationship, or the K data packets include N original data packets and (K-N) redundant packets. The remaining packets, the redundant packets in the K data packets and the N original data packets satisfy the encoding relationship; the N original data packets are obtained by performing one or more of the following processing on the M original data: segmentation, concatenation Or add padding, T, K, N, and M are positive integers, K is greater than T, and K is greater than N; the original data is submitted by the first entity in the first submission method or the second submission method; the first submission method includes: when When performing a network decoding operation on the T data packets to recover one of the M original data, submit the original data through the first entity; the second delivery method includes: when the T data packets When the network decoding operation is performed to recover the M original data, the first entity submits the M original data, where T is not less than N.

Based on the above technical solution, if the receiving device submits the original data in the first delivery mode through the first entity, after receiving the T data packets, the receiving device performs a network decoding operation on the received T data packets to recover a original data, the receiving device submits the restored original data through the first entity, thus solving the problem of how the receiving device submits the restored original data. In addition, when the receiving device uses the first delivery method to submit the original data, since the receiving device performs the network decoding operation on the received T data packets to recover one original data, it will submit the recovered original data packets, so It can guarantee the delay requirement of transmitting data packets. In this way, T can be smaller than N.

If the receiving device submits the original data in the second delivery mode, after receiving the T data packets, once the receiving device performs the network decoding operation on the received T data packets to restore M original data, the receiving device passes The first entity submits the restored M pieces of original data, thus solving the problem of how the receiving device submits the restored original data. In addition, when the receiving device uses the second delivery method to submit the original data, since the receiving device performs the network decoding operation on the received T data packets to restore the M original data, it submits the M original data, so the receiving The device may sort the M pieces of original data through the first entity and then submit them, so that the submitted original data can be guaranteed to be in order.

It should be noted that, in the case where K data packets include N system packets and (K-N) redundant packets, the coding relationship between the above K data packets and N original data packets is as follows: K data packets are pairs of N It is obtained by encoding the original data packets. Wherein, the N system packets included in the K data packets are respectively generated by encoding the N original data packets with the coefficient factor of the unit vector and adding the coded packet header. Or, in the case where K data packets include N system packets and (K-N) redundant packets, the encoding relationship satisfied by the above K data packets and N original data packets is: (K-N) The redundant packets are obtained by encoding the N original data packets, and the N system packets included in the K data packets are generated by adding encoded packet headers to the N original data packets respectively. That is, the encoding relationship also includes adding an encoded packet header.

With reference to the first aspect, in some implementations of the first aspect, the receiving device is a terminal device, and the method further includes: receiving first indication information from the access network device, where the first indication information is used to indicate that the terminal The delivery method used by the device, the delivery method includes the first delivery method or the second delivery method.

Based on the above technical solution, the terminal device may determine a delivery mode for delivering the recovered original data according to the received first indication information.

It should be noted that, in the above-mentioned first delivery method or second delivery method, the network decoding operation performed by the receiving device on the T data packets includes one or more of the following: decoding header, decoding, aggregation (segmented reverse operation), split (cascade reverse operation), defill, and remove the original data packet header. For example, if the T data packets include redundant packets, the network decoding operation performed by the receiving device on the T data packets includes decoding and decoding headers. For another example, if the T data packets include system packets or original data packets, the network decoding operation performed by the receiving device on the T data packets includes removing headers of the original data packets. For another example, if the sending device divides M original data to obtain N original data packets, then the network decoding operation performed by the receiving device on T data packets includes aggregation. For another example, if the sending device concatenates M original data to obtain N original data packets, then the network decoding operation performed by the receiving device on T data packets includes splitting. For another example, if the sending device adds padding to the M original data to obtain N original data packets, then the network decoding operation performed by the receiving device on the T data packets includes de-filling.

With reference to the first aspect, in some implementations of the first aspect, the network decoding operation is implemented by a service data adaptation protocol (service data adaptation protocol, SDAP) layer or a network coding (network coding, NC) layer, the The NC layer is located between the PDCP layer and the SDAP layer, and the method further includes: enabling the out-of-order delivery function of the PDCP entity.

Based on the characteristics of network coding, even if the data packets submitted by the PDCP entity to the SDAP entity or NC entity are discontinuous, the SDAP entity or NC entity can perform network decoding operations on the received data packets to recover all the original data. Therefore, based on the above technical solution, when the receiving device enables the out-of-order delivery function of the PDCP entity, it does not affect the decoding process of the SDAP entity or the NC entity, but can guarantee the delay requirement of data transmission.

With reference to the first aspect, in some implementation manners of the first aspect, the network decoding operation is implemented by a PDCP layer, and the method further includes: disabling the reordering function of the PDCP entity.

Based on the above technical solution, when the PDCP reordering function is turned off, the receiving device does not need to consider how to push the lower limit of the receiving window, thus simplifying the processing logic of the receiving device.

With reference to the first aspect, in some implementation manners of the first aspect, the first entity is a PDCP entity, and the network decoding operation is implemented by a PDCP layer, and the method further includes: when the PDCP reordering timer is on , through the first entity, part or all of the T data packets are sent to the decoder for decoding processing, wherein the start of the PDCP reordering timer is determined by receiving T PDCP protocol data units (protocol data unit , PDU) and the sequence number (sequence number, SN) of the previous PDCP PDU in the PDCP PDU that is discontinuous in the PDCP PDU with the largest SN triggers, the T PDCP PDUs correspond to the T data packets, and the T data packets The part of includes data packets other than data packets whose sequence numbers are continuous with the sequence number of the data packet of the lower limit of the PDCP receiving window, and the T PDCP PDUs are received within the PDCP receiving window.

Wherein, part of the above T data packets may also include the data packet contained in the PDCP PDU with the largest SN among the PDCP PDUs whose sequence number (sequence number, SN) is discontinuous with the previous PDCP PDU, and the Among the PDCP PDUs with discontinuous sequence numbers (sequence number, SN), the data packets contained in all PDUs received before the arrival of the PDCP PDU with the largest SN and not yet delivered to the decoder. Since, before the PDCP reordering timer is started, the data packets whose sequence number is continuous with the sequence number of the data packet of the lower limit of the PDCP receiving window can be sent to the decoder, so the part of the T data packets described in this paragraph is the same as the one in the previous paragraph Some of the T data packets include the same data packets.

Based on the above technical solution, even if the T PDCP PDUs received by the receiving device include PDCP PDUs with discontinuous SNs, the receiving device will send all or part of the received T data packets to the translator when the reordering timing is enabled. Decoder for decoding processing, without having to wait until the reordering timer expires or after receiving SN continuous PDCP PDUs, and then send the received data packets to the decoder for processing, so that the original data can be quickly restored, reducing Latency of data transmission.

With reference to the first aspect, in some implementations of the first aspect, the method further includes: after performing the network decoding operation on the T data packets to restore the M original data, stopping the PDCP reordering timer.

Based on the above technical solution, once the receiving device performs the network decoding operation on the received T data packets and restores M original data, it stops the PDCP reordering timer, thus solving the problem of the receiving device when the NC function is introduced. When stopping the PDCP reordering timer problem. The lower limit of the PDCP receiving window is slid while the PDCP reordering timer is stopped, thus solving the problem of when to slide the lower limit of the PDCP receiving window.

With reference to the first aspect, in some implementations of the first aspect, the method further includes: after performing the network decoding operation on the T data packets to recover the M original data, sliding the The lower limit of the PDCP receive window.

Based on the above technical solution, once the receiving device performs network decoding operations on the received T data packets to recover M original data, it slides the lower limit of the receiving window, thereby solving the problem of when the receiving device slides when the NC function is introduced. The problem of the lower limit of the PDCP receiving window.

With reference to the first aspect, in some implementation manners of the first aspect, the first entity is a PDCP entity, and the network decoding operation is implemented by a PDCP layer, and the method further includes: when the PDCP reordering timer expires, through the The first entity sends at least one of the following data packets to the decoder for decoding processing: the data packet contained in the out-of-order PDCP PDU among the T PDCP PDUs, received before the out-of-order PDCP PDU and has not yet been delivered Data packets contained in all PDCP PDUs to the decoder, wherein the start of the PDCP reordering timer is determined by the PDCP PDU with the largest SN among the PDCP PDUs that are discontinuous with the SN of the previous PDCP PDU among the T PDCP PDUs Triggered, the T PDCP PDUs correspond to the T data packets. Among them, the out-of-order PDCP PDUs include the PDCP PDU with the largest SN among the PDCP PDUs whose sequence number (sequence number, SN) is not continuous with the previous PDCP PDU.

Based on the above technical solution, if there are out-of-sequence PDCP PDUs among the received T PDCP PDUs, the first entity, after the reordering timer expires, reorders the data contained in the out-of-order PDUs among the T PDCP PDUs. packets, and/or, the data packets contained in all PDCP PDUs received before the out-of-order PDCP PDUs and not yet delivered to the decoder are sent to the decoder for decoding processing, which facilitates the realization of data packets Sequential raw data obtained after network decoding operations.

With reference to the first aspect, in some implementation manners of the first aspect, the first entity is an RLC entity, and the network decoding operation is implemented by an RLC layer, and the method further includes: when the RLC reordering timer is on, Through the first entity, all or part of the T data packets are sent to the decoder for decoding processing, wherein the start of the RLC reordering timer is determined by the SN receiving the T RLC PDUs and the previous RLC PDU The RLC PDU with the largest SN among the discontinuous RLC PDUs is triggered. The T RLC PDUs correspond to the T data packets, and the part of the T data packets includes the sequence numbers of the data packets except the sequence number and the lower limit of the RLC receiving window. For data packets other than data packets, the T RLC PDUs are received within the RLC receiving window.

Based on the above technical solution, even if the T RLC PDUs received by the receiving device include RLC PDUs with discontinuous SNs, when the reordering timing is enabled, the receiving device will send all or part of the received T data packets to the translator. Decoder for decoding processing, without having to wait until the reordering timer expires or after receiving SN continuous RLC PDUs, and then send the received data packets to the decoder for processing, so that the original data can be quickly restored, reducing Latency of data transmission.

With reference to the first aspect, in some implementations of the first aspect, the method further includes: after performing the network decoding operation on the T data packets to restore the M original data, stopping the RLC reordering timer.

Based on the above technical solution, once the receiving device performs the network decoding operation on the received T data packets and restores M original data, it stops the RLC reordering timer, thus solving the problem of the receiving device when the NC function is introduced. When stopping the RLC reordering timer problem.

With reference to the first aspect, in some implementations of the first aspect, the method further includes: after performing the network decoding operation on the T data packets to recover the M original data, sliding the RLC through the first entity Receive window lower limit.

Based on the above technical solution, once the receiving device can perform network decoding operations on the received T data packets to recover M original data, it will slide the lower limit of the receiving window and stop the RLC reordering timer, thereby solving the problem of introducing the NC function. When the receiving device slides the lower limit of the RLC receiving window.

With reference to the first aspect, in some implementation manners of the first aspect, the first entity is an RLC entity, and the network decoding operation is implemented by an RLC layer, and the method further includes: when the RLC reordering timer expires, through the The first entity sends at least one of the following data packets to the decoder for decoding processing: among the T RLC PDUs, the data packets contained in the out-of-order RLC PDUs, received before the out-of-order RLC PDUs and have not yet been delivered Packets contained in all RLC PDUs to the decoder, wherein the RLC reordering timer is started by the RLC PDU with the largest SN among the RLC PDUs that are discontinuous with the SN of the previous RLC PDU among the T RLC PDUs trigger, the T RLC PDUs correspond to the T data packets. Wherein, the RLC PDUs arriving out of order include the RLC PDU with the largest SN among the RLC PDUs whose sequence number (sequence number, SN) is discontinuous with the previous RLC PDU.

Based on the above technical solution, if there are out-of-order RLC PDUs among the received T RLC PDUs, after the reordering timer expires, the first entity reorders the data contained in the out-of-order PDUs among the T RLC PDUs. packets, and/or, the data packets contained in all RLC PDUs received before the out-of-order RLC PDUs and not yet delivered to the decoder are sent to the decoder for decoding processing, which facilitates the realization of data packets Sequential raw data obtained after network decoding operations.

In a second aspect, a data processing method is provided, which is applied to a first entity, and the method includes: receiving T data packets, where the T data packets belong to K data packets, wherein the K data packets include N system packets and (K-N) redundant packets, the K data packets and N original data packets satisfy the encoding relationship, or the K data packets include N original data packets and (K-N) redundant packets, the K data packets include N original data packets and (K-N) redundant packets, the The redundant packets in the K data packets and the N original data packets satisfy the encoding relationship; the N original data packets are obtained by performing one or more of the following processing on the M original data: segmentation, concatenation or filling, T, K, N, and M are positive integers, K is greater than T, and K is greater than N; when the reordering timer is on, part or all of the T data packets are sent to the decoder for decoding processing, where , the start of the reordering timer is triggered by the PDU with the largest SN among the PDUs that are discontinuous with the SN of the previous PDU among the T PDUs. The T PDUs correspond to the T data packets, and the part of the T data packets The T PDUs are received within the receiving window, including data packets except data packets whose sequence numbers are continuous with the sequence numbers of the lower limit of the receiving window.

Based on the above technical solution, even if the T PDUs received by the receiving device include PDUs with discontinuous SNs, when the reordering timing is turned on, the receiving device will send all or part of the received T data packets to the decoder Perform decoding processing without waiting until the reordering timer expires or after receiving consecutive PDUs from SN, and then send the received data packets to the decoder for processing, thereby ensuring fast recovery of original data and reducing data transmission overhead delay.

With reference to the second aspect, in some implementations of the second aspect, the first entity is a PDCP entity, the reordering timer is a PDCP reordering timer, the receiving window is a PDCP receiving window, and the method further includes: when After the network decoding operation is performed on the T data packets to restore the M original data, the PDCP reordering timer is stopped.

Based on the above technical solution, once the receiving device performs the network decoding operation on the received T data packets and restores M original data, it stops the PDCP reordering timer, thus solving the problem of the receiving device when the NC function is introduced. When stopping the PDCP reordering timer problem.

With reference to the second aspect, in some implementations of the second aspect, the first entity is a PDCP entity, the reordering timer is a PDCP reordering timer, the receiving window is a PDCP receiving window, and the method further includes: when After the network decoding operation is performed on the T data packets to restore the M original data, the lower limit of the PDCP receiving window is slid.

Based on the above technical solution, once the receiving device performs network decoding operations on the received T data packets to recover M original data, it slides the lower limit of the receiving window and stops the PDCP reordering timer, thereby solving the problem of introducing the NC function. In this case, when the receiving device slides the lower limit of the PDCP receiving window.

With reference to the second aspect, in some implementations of the second aspect, the first entity is an RLC entity, the reordering timer is an RLC reordering timer, the receiving window is an RLC receiving window, and the method further includes: when After the network decoding operation is performed on the T data packets to restore the M original data, the RLC reordering timer is stopped.

With reference to the second aspect, in some implementations of the second aspect, the first entity is an RLC entity, the reordering timer is an RLC reordering timer, the receiving window is an RLC receiving window, and the method further includes: when After recovering the M original data for the T data packets, slide the lower limit of the RLC receiving window.

Based on the above technical solution, once the receiving device performs network decoding operations on the received T data packets to recover M original data, it slides the lower limit of the receiving window and stops the RLC reordering timer, thus solving the problem of introducing the NC function. In this case, how does the receiving device slide the lower limit of the RLC receiving window.

In a third aspect, a data processing method is provided, wherein the method is applied to a first entity, and the method includes: receiving T data packets, where the T data packets belong to K data packets, wherein the K The K data packets include N system packets and (K-N) redundant packets, and the K data packets and the N original data packets satisfy the coding relationship, or the K data packets include N original data packets and (K-N) Redundant packets, the redundant packets in the K data packets and the N original data packets satisfy the encoding relationship; the N original data packets are obtained by performing one or more of the following processing on the M original data: segmentation, classification T, K, N and M are positive integers, K is greater than T, and K is greater than N; when the reordering timer expires, send at least one of the following data packets to the decoder for decoding processing: T In the PDU, the data packets contained in the PDUs that arrive out of order, and the data packets contained in all PDUs that are received before the PDUs that arrive out of order and have not yet been delivered to the decoder, wherein the start of the reordering timer is determined by the T The PDU with the largest SN among the PDUs that are discontinuous with the SN of the previous PDU among the PDUs is triggered, and the T PDUs correspond to the T data packets. Wherein, the PDUs arriving out of order include the PDU with the largest SN among the PDUs whose sequence numbers (sequence number, SN) are not continuous with the previous PDU.

Exemplarily, the first entity is a PDCP entity, and the reordering timer is a PDCP reordering timer.

Also exemplary, the first entity is an RLC entity, and the reordering timer is an RLC reordering timer.

Based on the above technical solution, if there are out-of-order PDUs among the received T PDUs, after the reordering timer expires, the first entity sends the data packets contained in the out-of-order PDUs among the T PDUs, and /or, the data packets contained in all PDUs received before the out-of-order PDUs and not yet delivered to the decoder are sent to the decoder for decoding processing, which is beneficial to realize the network decoding operation on the data packets The obtained sequential raw data.

In a fourth aspect, a communication device is provided, and the communication device has a function of implementing the method in the first aspect or any possible implementation thereof. The functions described above may be implemented by hardware, or may be implemented by executing corresponding software on the hardware. The hardware or software includes one or more units corresponding to the above functions.

Optionally, as an example, the communication device described in the fourth aspect includes:

The transceiver unit is used to receive T data packets, and the T data packets belong to K data packets, wherein the K data packets include N system packets and (K-N) redundant packets, and the K data packets and N Original data packets satisfy the coding relationship, or, the K data packets include N original data packets and (K-N) redundant packets, and the redundant packets in the K data packets satisfy the coding relationship with the N original data packets; The N original data packets are obtained by performing one or more of the following processing on the M original data: segmentation, concatenation or filling, T, K, N and M are positive integers, K is greater than T, and K is greater than N;

The transceiver unit is also used to submit the original data in the first delivery mode or the second delivery mode;

The first delivery method includes: submitting the one original data when the network decoding operation is performed on the T data packets to restore one original data among the M original data;

The second delivery method includes: submitting the M original data when the network decoding operation is performed on the T data packets to recover the M original data, where T is not less than N.

In an implementation manner, the transceiving unit is further configured to receive first indication information from the access network device, where the first indication information is used to indicate the delivery mode used by the communication device, and the delivery mode includes the first delivery mode method or this second delivery method.

In an implementation manner, the network decoding operation is implemented by the SDAP layer or the NC layer, and the NC layer is located between the PDCP layer and the SDAP layer, and the communication device further includes:

The processing unit is configured to enable the out-of-order delivery function of the PDCP entity.

In a possible implementation manner, the network decoding operation is implemented by a PDCP layer, and the communication device further includes:

The processing unit is configured to close the reordering function of the PDCP entity.

In a possible implementation, the network decoding operation is implemented by the PDCP layer, and the transceiver unit is further configured to: when the PDCP reordering timer is on, send some or all of the T data packets to The decoder performs decoding processing, wherein the start of the PDCP reordering timer is triggered by receiving the PDCP PDU with the largest SN among the PDCP PDUs that are discontinuous with the SN of the previous PDCP PDU among the T PDCP PDUs. The PDU corresponds to the T data packets, and the part of the T data packets includes data packets other than the data packets whose sequence number is continuous with the sequence number of the data packet of the lower limit of the PDCP receiving window. The T PDCP PDUs are received in the PDCP received in the window.

In a possible implementation manner, the processing unit is further configured to: stop the PDCP reordering timer after performing the network decoding operation on the T data packets to recover the M original data.

In a possible implementation manner, the processing unit is further configured to: slide the lower limit of the PDCP receiving window after performing the network decoding operation on the T data packets to recover the M original data.

In a possible implementation, the network decoding operation is implemented by the PDCP layer, and the transceiver unit is further configured to: when the PDCP reordering timer expires, send at least one of the following data packets to the decoder for decoding Processing: the data packets contained in the out-of-order PDCP PDUs among the T PDCP PDUs, the data packets contained in all PDCP PDUs received before the out-of-order PDCP PDUs and not yet delivered to the decoder, where the PDCP The start of the reordering timer is triggered by the PDCP PDU with the largest SN among the PDCP PDUs that are discontinuous with the SN of the previous PDCP PDU among the T PDCP PDUs, and the T PDCP PDUs correspond to the T data packets. Among them, the out-of-order PDCP PDUs include the PDCP PDU with the largest SN among the PDCP PDUs whose sequence number (sequence number, SN) is not continuous with the previous PDCP PDU.

In a possible implementation, the network decoding operation is implemented by the RLC layer, and the transceiver unit is further configured to: when the RLC reordering timer is on, send all or part of the T data packets to The decoder performs decoding processing, wherein the opening of the RLC reordering timer is triggered by the RLC PDU with the largest SN among the RLC PDUs that receive T RLC PDUs that are discontinuous with the SN of the previous RLC PDU, and the T RLC PDUs Corresponding to the T data packets, the part in the T data packets includes data packets except the data packets whose sequence numbers are continuous with the sequence numbers of the data packets of the lower limit of the RLC receive window, and the T RLC PDUs are in the RLC receive window Received within.

In a possible implementation manner, the processing unit is further configured to: stop the RLC reordering timer after performing the network decoding operation on the T data packets to recover the M original data.

In a possible implementation manner, the processing unit is further configured to: slide the lower limit of the RLC receiving window after performing the network decoding operation on the T data packets to recover the M original data.

In a possible implementation, the network decoding operation is implemented by the RLC layer, and the transceiver unit is also configured to: when the RLC reordering timer expires, send at least one of the following data packets to the decoder for decoding Processing: the data packets contained in the RLC PDUs that arrive out of order among the T RLC PDUs, and the data packets contained in all RLC PDUs that are received before the RLC PDUs that arrive out of order and have not yet been delivered to the decoder. The opening of the reordering timer is triggered by the RLC PDU with the largest SN among the RLC PDUs that are discontinuous with the SN of the previous RLC PDU among the T RLC PDUs, and the T RLC PDUs correspond to the T data packets. Wherein, the RLC PDUs arriving out of order include the RLC PDU with the largest SN among the RLC PDUs whose sequence number (sequence number, SN) is discontinuous with the previous RLC PDU.

In a fifth aspect, a communication device is provided, and the communication device has a function of implementing the method in the second aspect or any possible implementation thereof. The functions described above may be implemented by hardware, or may be implemented by executing corresponding software on the hardware. The hardware or software includes one or more units corresponding to the above functions.

Optionally, as an example, the communication device described in the fifth aspect includes:

The transceiver unit is used to receive T data packets, and the T data packets belong to K data packets, wherein the K data packets include N system packets and (K-N) redundant packets, and the K data packets and N Original data packets satisfy the coding relationship, or, the K data packets include N original data packets and (K-N) redundant packets, and the redundant packets in the K data packets satisfy the coding relationship with the N original data packets; The N original data packets are obtained by performing one or more of the following processing on the M original data: segmentation, concatenation or filling, T, K, N and M are positive integers, K is greater than T, and K is greater than N; When the reordering timer is on, part or all of the T data packets are sent to the decoder for decoding processing, wherein the reordering timer is started by the SN of the previous PDU among the T PDUs The PDU with the largest SN among the discontinuous PDUs is triggered. The T PDUs correspond to the T data packets, and some of the T data packets include data packets whose serial numbers are continuous with the lower limit of the receiving window. of data packets, the T PDUs are received within the receiving window.

In an implementation manner, the communication device is a PDCP entity, the reordering timer is a PDCP reordering timer, the receiving window is a PDCP receiving window, and the communication device further includes:

The processing unit is configured to stop the PDCP reordering timer after performing network decoding operations on the T data packets to restore the M original data.

The processing unit slides the lower limit of the PDCP receiving window after performing a network decoding operation on the T data packets to recover the M original data.

In an implementation manner, the communication device is an RLC entity, the reordering timer is an RLC reordering timer, the receiving window is an RLC receiving window, and the communication device further includes:

The processing unit is configured to stop the RLC reordering timer after performing network decoding operations on the T data packets to recover the M original data.

The processing unit slides the lower limit of the RLC receiving window after performing a network decoding operation on the T data packets to restore the M original data.

In a sixth aspect, a communication device is provided, and the communication device has a function of implementing the method in the third aspect or any possible implementation thereof. The functions described above may be implemented by hardware, or may be implemented by executing corresponding software on the hardware. The hardware or software includes one or more units corresponding to the above functions.

Optionally, as an example, the communication device described in the sixth aspect includes:

The transceiver unit is used to receive T data packets, and the T data packets belong to K data packets, wherein the K data packets include N system packets and (K-N) redundant packets, and the K data packets and N Original data packets satisfy the coding relationship, or, the K data packets include N original data packets and (K-N) redundant packets, and the redundant packets in the K data packets satisfy the coding relationship with the N original data packets; The N original data packets are obtained by performing one or more of the following processing on the M original data: segmentation, concatenation or filling, T, K, N and M are positive integers, K is greater than T, and K is greater than N; When the reordering timer expires, at least one of the following data packets will be sent to the decoder for decoding processing: the data packets contained in the PDUs that arrive out of sequence among the T PDUs, the data packets that are received before the PDUs that arrive out of sequence and have not yet The data packets contained in all PDUs delivered to the decoder, wherein the start of the reordering timer is triggered by the PDU with the largest SN among the PDUs that are discontinuous with the SN of the previous PDU among the T PDUs, and the T The PDU corresponds to the T data packets.

In a seventh aspect, a communication device is provided, including a processor and a memory. Optionally, a transceiver may also be included. Wherein, the memory is used to store computer programs, and the processor is used to run the computer programs stored in the memory, and control the transceiver to send and receive signals, so that the communication device executes the method in the first aspect or any possible implementation thereof.

Exemplarily, the communication device is a receiving end of wireless communication.

In an eighth aspect, a communication device is provided, including a processor and a memory. Optionally, a transceiver may also be included. Wherein, the memory is used to store computer programs, and the processor is used to run the computer programs stored in the memory, and control the transceiver to send and receive signals, so that the communication device executes the method in the second aspect or any possible implementation thereof. Alternatively, perform the method in the third aspect or any possible implementation thereof.

In a ninth aspect, a communication device is provided, including a processor and a communication interface, the communication interface is used to receive data and/or information, and transmit the received data and/or information to the processor, and the processing The processor processes the data and/or information, and the communication interface is further configured to output the data and/or information processed by the processor, so that the method in the first aspect or any possible implementation thereof is executed.

In a tenth aspect, a communication device is provided, including a processor and a communication interface, the communication interface is used to receive (or input) data and/or information, and transmit the received data and/or information to the processor processor, the processor processes the data and/or information, and the communication interface is further configured to output the data and/or information processed by the processor, so that as in the second aspect or any possible implementation thereof A method is performed, or, a method is performed as in the third aspect or any possible implementation thereof.

In an eleventh aspect, a computer-readable storage medium is provided, wherein computer instructions are stored in the computer-readable storage medium, and when the computer instructions are run on a computer, as described in the first aspect or any possible implementation thereof method is executed.

In a twelfth aspect, a computer-readable storage medium is provided, and computer instructions are stored in the computer-readable storage medium. When the computer instructions are run on a computer, as in the second aspect or any possible implementation thereof, A method is performed, or, a method is performed as in the third aspect or any possible implementation thereof.

In a thirteenth aspect, a computer program product is provided, the computer program product includes computer program code, and when the computer program code is run on a computer, the method in the first aspect or any possible implementation thereof is executed implement.

In a fourteenth aspect, a computer program product is provided, the computer program product includes computer program code, and when the computer program code is run on a computer, the method in the second aspect or any possible implementation thereof is executed Execute, or, the method in the third aspect or any possible implementation thereof is executed.

Description of drawings

Fig. 1 shows a schematic diagram of a scenario of a communication system applicable to the present application.

Fig. 2 is a schematic diagram of an application scenario applicable to the technical solution provided by the embodiment of the present application.

Fig. 3 shows a schematic flow chart of network coding.

Fig. 4 shows a schematic diagram of another network coding process.

Fig. 5 shows a schematic diagram of random linear network coding.

FIG. 6 shows a schematic diagram of the receiving end moving the lower limit of the receiving window.

Fig. 7 shows a schematic flowchart of the method provided by the embodiment of the present application.

FIG. 8 is a schematic diagram of a processing procedure at a receiving end.

FIG. 9 is a schematic diagram of a processing procedure at a receiving end.

Fig. 10 shows a schematic flowchart of the method provided by the embodiment of the present application.

Fig. 11 shows a schematic diagram of the processing procedure at the receiving end.

Fig. 12 shows a schematic flowchart of the method provided by the embodiment of the present application.

Fig. 13 shows a schematic diagram of the processing procedure at the receiving end.

Fig. 14 is a schematic block diagram of a communication device provided in this application.

FIG. 15 is a schematic structural diagram of a communication device provided in the present application.

Detailed ways

The technical solution in this application will be described below with reference to the accompanying drawings.

The technical solutions of the embodiments of the present application can be applied to various communication systems, including but not limited to: the fifth generation (the 5th generation, 5G) system or new radio (new radio, NR) system, long term evolution (long term evolution, LTE) ) system, LTE frequency division duplex (frequency division duplex, FDD) system, LTE time division duplex (time division duplex, TDD) system, etc. The technical solutions provided in this application can also be applied to future communication systems, such as the sixth generation mobile communication system. In addition, it can also be applied to device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, machine-to-machine (M2M) communication, machine type communication (machine type communication, MTC), and the Internet of Things (Internet of Things, IoT) communication system or other communication systems, etc.

A communication system applicable to this application may include one or more sending ends, and one or more receiving ends. Optionally, one of the sending end and the receiving end may be a terminal device, and the other may be a network device. Alternatively, one is an end device and the other is another end device. Alternatively, one is a network device and the other is another network device.

Exemplarily, the terminal equipment may also be a user equipment (user equipment, UE), an access terminal, a subscriber unit, a subscriber station, a mobile station, a mobile station (mobile station, MS), a mobile terminal (mobile terminal, MT), a remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user device. The terminal device in the embodiment of the present application may be a device that provides voice and/or data connectivity to users, and can be used to connect people, objects and machines, such as handheld devices with wireless connection functions, vehicle-mounted devices, and the like. The terminal device in the embodiment of the present application can be mobile phone (mobile phone), tablet computer (Pad), notebook computer, palmtop computer, mobile internet device (mobile internet device, MID), wearable device, virtual reality (virtual reality, VR) equipment, augmented reality (augmented reality, AR) equipment, wireless terminals in industrial control (industrial control), wireless terminals in self-driving (self-driving), wireless terminals in remote medical surgery, Wireless terminals in smart grid, wireless terminals in transportation safety, wireless terminals in smart city, wireless terminals in smart home, etc. Optionally, UE can be used to act as a base station. For example, a UE may act as a scheduling entity that provides sidelink signals between UEs in V2X or D2D, etc. Optionally, the UE may also be a relay device providing wireless backhaul, for example: an integrated access and backhaul (IAB) node.

In this embodiment of the present application, the device for realizing the function of the terminal may be a terminal, or a device capable of supporting the terminal to realize the function, such as a chip system or a chip, and the device may be installed in the terminal. In the embodiment of the present application, the system-on-a-chip may be composed of chips, or may include chips and other discrete devices.

Exemplarily, the network device may be a device with a wireless transceiver function, and the network device may be a device that provides wireless communication function services, usually located on the network side, including but not limited to a next-generation base station (gNodeB, gNB) in a 5G communication system , the base station in the sixth generation (6th generation, 6G) mobile communication system, the base station in the future mobile communication system or the access point in the wireless fidelity (wireless fidelity, WiFi) system, etc., the evolved node B in the LTE system (evolved node B, eNB), radio network controller (radio network controller, RNC), node B (node B, NB), base station controller (base station controller, BSC), home base station (for example, home evolved Node B, HNB), base band unit (BBU), transmission reception point (transmission reception point, TRP), transmission point (transmitting point, TP), base transceiver station (base transceiver station, BTS), etc. In a network structure, the network device may include a centralized unit (centralized unit, CU) node, or a distributed unit (distributed unit, DU) node, or a wireless access network (radio access network, including a CU node and a DU node, RAN) device, or control plane CU node and user plane CU node, and RAN device of DU node, or, the network device can also be a wireless controller and a relay station in a cloud radio access network (cloud radio access network, CRAN) scenario , in-vehicle devices, and wearable devices. In addition, the base station may be a macro base station, a micro base station, a relay node, a donor node, a host node, or a combination thereof. The base station can also be a mobile switching center, a device that assumes the function of a base station in D2D, V2X, and M2M communications, a network-side device in a 6G network, and a device that assumes the function of a base station in a future communication system. The base station may support networks of the same or different access technologies, without limitation.

In the embodiment of the present application, the device for realizing the function of the network device may be a network device, or a device capable of supporting the network device to realize the function, such as a chip system or a chip, and the device may be installed in the network device. In the embodiment of the present application, the system-on-a-chip may be composed of chips, or may include chips and other discrete devices.

Referring to FIG. 1 , FIG. 1 is a schematic diagram of a scenario applicable to a communication system of the present application. This application can be applied to a variety of specific communication scenarios, for example, point-to-point transmission between a base station and a terminal device or between a terminal device (as shown in Figure 1 (a) between a base station and a terminal device), base station and Multi-hop (as shown in (b) and (c) in Figure 1) transmission of terminal equipment, dual connectivity (DC) between multiple base stations and terminal equipment (as shown in (d) in Figure 1) or multi-connection scenarios. It should be noted that the above specific communication application scenarios are just examples and do not pose limitations. In particular, from a service point of view, the embodiments of the present application are applicable to many service scenarios, such as data encoding scenarios and uplink large-capacity scenarios in XR services. In addition, FIG. 1 does not limit the network architecture applicable to this application, and this application does not limit transmissions such as uplink, downlink, access link, backhaul (backhaul) link, and sidelink (sidelink).

Fig. 2 is a schematic diagram of an application scenario of the technical solution provided by the embodiment of the present application.

As shown in (a) in FIG. 2 , after the UE randomly accesses the gNB, communication between the UE and the gNB can be performed. Among them, gNB includes a three-layer structure: layer one is the physical (PHY) layer, layer two is the medium access control (medium access control, MAC) layer, radio link control (radio link control, RLC) layer and packet data The convergence protocol (packet data convergence protocol, PDCP) layer, and the third layer is the radio resource control (radio resource control, RRC) layer. UE includes PDCP layer, RLC layer, MAC layer and PHY layer.

If UE and gNB have network coding (network coding, NC) function, for DL, gNB performs encoding function, UE performs decoding function; for UL, UE performs encoding function, gNB performs decoding function.

As shown in (b) in Figure 2, the UE can access the gNB-CU through the gNB-DU. Among them, gNB-CU includes RRC layer and PDCP layer, and gNB-DU includes RLC layer, MAC layer and PHY layer. If the NC function is located on the UE and the gNB-CU, for the DL, the gNB-CU performs the encoding function, and the UE performs the decoding function; for the UL, the UE performs the encoding function, and the gNB-CU performs the decoding function. More specifically, the NC function is deployed within or above the PDCP layer. If the NC function is located on UE and gNB-DU, for DL, gNB-DU performs encoding function, UE performs decoding function; for UL, UE performs encoding function, and gNB-DU performs decoding function. More specifically, the NC function is deployed within or below the RLC layer.

It should be understood that the application scenario of the technical solution provided by this application is only illustrated in FIG. 2 by taking the communication between UE and gNB as an example. The technical solution provided by this application is also applicable to integrated access and backhaul (IAB ) scenario, that is, the UE in Figure 2 can be replaced by an IAB mobile terminal (IAB mobile termination, IAB-MT).

In addition, in addition to the above-mentioned air interface single-link scenario, the technical solution provided by the embodiment of the present application is also applicable to the air interface multi-link scenario. That is, there is at least one IAB node between the gNB or gNB-DU (considering the CU-DU separation architecture) and the UE.

To facilitate understanding of the embodiments of the present application, several basic concepts involved in the embodiments of the present application are briefly described. It should be understood that the basic concepts introduced below are simply described by taking several basic concepts stipulated in the NR protocol as examples, but this does not limit that the embodiment of the present application can only be applied to the NR system. Therefore, the standard names that appear when describing the NR system as an example are functional descriptions, and the specific names are not limited. They only represent the functions of the device and can be extended to other systems correspondingly, such as the second generation (2nd generation, 2G), Third generation (3rd generation, 3G), fourth generation (4th generation, 4G) or future communication systems.

1. Hybrid automatic repeat request (HARQ):

It belongs to the function of the MAC layer. After the sending end sends a transport block (TB) to the receiving end, the receiving end will perform a cyclic redundancy check (CRC) on the TB. If the CRC check is successful, the receiving end will feed back acknowledgment (acknowledgment, ACK) information to the sending end, otherwise it will feed back negative acknowledgment (negative acknowledgment, NACK) information. After the sending end receives the ACK information fed back by the receiving end, it will trigger the transmission of new data, otherwise it will trigger the retransmission of the TB.

2. Automatic repeat request (automatic repeat request, ARQ):

It belongs to the function of RLC layer. The sending end sends continuous RLC protocol data unit (RLC protocol data unit, RLC PDU) to the receiving end. PDU data volume) or according to the polling (polling) instruction sent by the sender, trigger the feedback of the RLC status report to the sender, so as to notify the sender of the receiving status of the RLC PDU at the receiver, so that the sender triggers the retransmission of the RLC PDU.

3. Network coding (NC) function:

The above-mentioned feedback-based retransmission mechanism generally has a relatively long delay, including: air interface transmission delay, data processing delay at the receiving end, and feedback delay of ACK/NACK information, etc., resulting in low system spectrum efficiency. In view of the above problems, a network coding technology may be used to perform a network coding operation on a data packet (packet), and the time delay and spectrum efficiency performance may be considered by transmitting the network coded packet.

The network coding function in this application includes performing network coding on the original data packet and adding a coded packet header. Wherein, the network coding can be realized by an encoder, the input of the encoder is N original data packets, and the output of the encoder is K encoded data packets (abbreviated as encoded packets), where N and K are both positive integers, and K is greater than N. The coded package includes K-N (K minus N) redundant packages and N system packages, or, K redundant packages (that is, all coded packages are redundant packages, excluding system packages). Wherein, the content of the package body of the system package is consistent with the content of the original data package (that is, the system package is composed of the coded package header and the original data package). Therefore, the system packet can be obtained by an encoder, or by directly adding a packet header to the original data packet. In this case, the encoding coefficient of the system packet is equivalent to a unit vector. Coding coefficients of redundant packets are non-unit vectors. Through the association between the content of the redundant packet and the content of the original data packet that generated the redundant packet, the receiving end can decode the redundant packet and the successfully received original data packet or system packet together to restore the original data packet that was not successfully received. data pack. Based on the characteristics of network coding, the packet size of the original data packet is equal.

Optionally, the network coding function may also include processing an original data unit (such as a service data unit (service data unit, SDU) or a protocol data unit (protocol data unit, PDU)) to obtain an equal-sized original data packet, The processing may include one or more of segmentation, concatenation, or padding.

The network coding function of the sending end corresponds to the network decoding function of the receiving end. The receiving end can recover N original data packets by decoding at least N coded packets successfully received together. The protocol layer with the network coding function or the corresponding decoding function of the network coding is called the network coding/decoding layer. In this application, the network coding/decoding layer is referred to as the network coding layer for short. is the network encoding layer.

The network coding layer can be radio resource control (radio resource control, RRC) layer, service data adaptation protocol (service data adaptation protocol, SDAP), packet data convergence protocol (packet data convergence protocol, PDCP) layer, backhaul adaptation Protocol (backhaul adaptation protocol, BAP) layer, radio link control (radio link control, RLC) layer, media access control (medium access control, MAC) layer, or physical layer (physical layer, PHY) and other protocol layers. The network coding layer can also be a new protocol layer except the PHY layer, the MAC layer, the RLC layer, the BAP layer, the PDCP layer, the SDAP layer and the RRC layer, which can increase the network coding layer above the PDCP layer (for example: In 5G NR, a network coding layer is added between the PDCP layer and the SDAP layer), or, a network coding layer is added above the BAP layer, or, a network coding layer is added between the PDCP layer and the RLC layer, or, at the RLC layer Add a network coding layer between the MAC layer and the MAC layer, or add a network coding layer between the MAC layer and the PHY layer.

Commonly used network coding schemes include block codes and convolutional codes. The block code schemes include random linear network coding (RLNC), deterministic linear network coding (DLNC), Batch sparse code (BATS code), erasure code (erasure code), fountain code (fountain code), maximum distance separable code (maximum distance separable code, MDS code), ruby transform code (luby transform, LT ) code, fast tornado (rapid tornado) code, RaptorQ code, rateless (rateless) code and RS (Reed-solomon) code, etc., the scheme of convolutional code includes convolutional network coding (convolutional network One or more of coding, CNC), streaming code (streaming code) and sliding window network coding (sliding window network coding), etc.

Two possible network coding processes of the network coding function of the sending end (referred to as the sending end) are introduced below.

The first possible network coding process:

The originator obtains the original data (PDU or SDU) first. Taking the original data as a PDU as an example, the originator performs one or more of the following processes on one or more PDUs to obtain an original data packet of equal size: segmentation, concatenation, or padding. Wherein, each original data packet carries a corresponding relationship, and the corresponding relationship is a corresponding relationship between the original data packet and one or more PDUs corresponding to the original data packet. Each original data packet may carry a corresponding relationship explicitly, for example, each original data packet carries a position mapping relationship between the original data packet and one or more PDUs corresponding to the original data packet. The corresponding relationship carried by each original data packet may also be carried implicitly. For example, the corresponding relationship between each original data packet and one or more PDUs corresponding to the original data packet is default. In this way, the receiving end (referred to as the receiving end for short) can recover the PDU from the original data packet based on the correspondence.

Optionally, the header of each original data packet carries the correspondence between the original data packet and one or more PDUs corresponding to the original data packet. In this case, a possible implementation method is: the originator first performs one or more of the following processes on the PDU to obtain the original data: segmentation, concatenation, or adding padding, and then adds a header to the original data to obtain the original data of the same size. data pack.

Optionally, the above corresponding relationship may be indicated by the division and/or concatenation of the one or more PDUs.

It can be understood that if the original data itself is equal in size, then the above-mentioned steps of processing one or more PDUs or SDUs to obtain the original data packets of equal size can be skipped, that is, the PDU or SDU is equal in size original packet.

Figure 3 and Figure 4 illustrate the first network coding process by taking PDUs with different sizes and carrying the above corresponding relationship through the packet header as examples. As shown in Figure 3 and Figure 4, the sender first processes PDU1 to PDU4 to obtain the original data (that is, data 1 to data 4), and the sender can process the PDUs by one or more of operations such as segmentation, concatenation, or padding. multiple. The size of the original data can be equal or unequal. Further, the originating end adds a packet header to the group of original data to obtain N original data packets (that is, Pkt1-Pkt4). The original data packet can be understood as an unencoded data packet, and the size of the original data packet is equal.

The originator then encodes multiple original data packets of equal size.

Specifically, any one of the following three methods may be adopted for encoding multiple original data packets of equal size.

Method 1:

As shown in Figure 3, the sender can obtain K-N encoded packets (EPkt1~EPkt2 shown in Figure 3) by encoding N original data packets and adding encoded packet headers. The encoded packets here can be called verification packets or redundant packages.

Through the above operations, the originator finally sends N original data packets and K-N redundant packets.

Mode 2 and Mode 3:

As shown in FIG. 4 , the originating end obtains K coded packets (ie, EPkt1 - EPkt6 shown in FIG. 4 ) by processing N original data packets. The encoding package can be divided into a system package and a check package, the system package can also be called a system data package, and the check package can be called a redundant package. Wherein, the header of the encoded packet may include a coefficient factor field, and the coefficient factor field indicates the encoding coefficient for obtaining the encoded packet. The system package (ie EPkt1~EPkt4 shown in Figure 4) is composed of a coded packet header and a packet body. The content of the packet body is consistent with the content of the original data packet, and the coefficient factor field included in the packet header is a unit vector.

The difference between mode 2 and mode 3 lies in the process of processing the original data package to obtain the system package.

Wherein, in mode 2, a system packet is generated by directly adding an encoded packet header to the original data packet, that is, without encoding processing.

Wherein, in mode 3, the original data packet is encoded, that is, encoded by the coefficient factor of the unit vector, and a header of the encoded packet is added to generate a system packet.

The verification packets in mode 2 and mode 3 are generated in the same manner, both of which are generated by encoding the original data packet and adding the header of the encoded packet. As shown in Figure 4, K-N verification packets (i.e. EPkt5~EPkt6) are generated by encoding N original data packets (i.e. Pkt1~Pkt4) and adding the header of the encoded packet. ) is the result of multiplication and addition of N original data packets and coefficient factors, where the coefficient factors are non-unit vectors.

Through the above operations, the originator finally sends K coded packets.

Correspondingly, still taking FIG. 3 as an example, for the receiving end, for mode 1, the receiving end receives at least N data packets, and the N data packets are linearly independent, that is, the rank of the corresponding coefficient matrix is equal to N. In this way, the receiving end can recover N original data packets through decoding, and then recover corresponding PDUs. Wherein, the at least N data packets may all be redundant packets, or some may be original data packets and some may be redundant packets, which is not limited here. It can be understood that, if the receiving end receives N original data packets, decoding may not be performed.

For

modes

2 and 3, still taking FIG. 4 as an example, the receiving end receives at least N data packets, and the N data packets are linearly independent, that is, the rank of the corresponding coefficient matrix is equal to N. In this way, the receiving end can recover N original data packets through decoding, and then recover corresponding PDUs. All of the at least N data packets may be redundant packets, or some of them may be system packets and some of them may be redundant packets, which is not limited herein. It can be understood that if the receiving end receives N system packets, then it is not necessary to perform decoding, but to perform de-encoding packet header processing.

To sum up, in the above network coding function, the originator obtains equal-sized original data packets by performing one or more of the following processes on one or more original data: segmentation, concatenation, or adding padding. Wherein, each original data packet carries a corresponding relationship between the original data packet and one or more original data corresponding to the original data packet.

The second possible network coding process:

In the second possible network coding process, the originating end can use one or more of virtual segmentation, concatenation, or padding to obtain original data packets of equal size. In this way, the originator first maps the original data and the header information of each original data to the cache, which can be a real cache or a virtual cache, and the header information of each original data indicates that each original data is mapped in location in the cache. The originating end then obtains multiple equal-sized original data packets from the cache. Further, a plurality of equal-sized original data packets are encoded to obtain an encoded packet. Wherein, the method of obtaining multiple original data packets of the same size from the cache can be preset, or the sending end indicates to the receiving end, or the one in the control position of the two parties of data transmission determines and indicates to the other party. In this method, the original data packet has no header, but considering the alignment with the description in the first method, the equal-sized data segment obtained from the cache in this solution is still called the original data packet. It can be understood that the original data packet in this solution may also be referred to as an original data segment.

Wherein, the manner of encoding multiple equal-sized original data packets to obtain encoded packets is similar to the manner 1 in the first possible implementation process. The difference from method 1 is that in this solution, after encoding multiple equal-sized original data packets, the sender sends one or more original data and the header information of the one or more original data, and the encoded One or more of the redundant packets; while in mode 1, the sender sends one or more encoded packets

It can be understood that the input of the network coding layer may be one or more original data units, such as original data, and the output of the network coding layer may be one or more PDUs, and the one or more PDUs may include the aforementioned original data package and redundant package, or, the aforementioned system package and redundant package. Wherein, outputting the one or more PDUs may be understood as outputting the one or more PDUs in the terminal device or in the network device to a module that subsequently processes the one or more PDUs through a communication interface. It can be understood that the output mentioned in this application may refer to sending a signal on an air interface, or may refer to outputting a signal in a device (for example, a terminal device or a network device) to other modules in the device through a communication interface. The specific process is specifically described in the application scenario, and will not be repeated here.

The specific encoding operation is briefly described by taking RLNC as an example. The RLNC scheme uses a coding block (block) as a coding unit, and a coding block includes multiple original data packets of the same size, and a set of coded packets can be obtained by constructing a coding coefficient matrix to encode the original data packets. Usually, the coefficients in the coding coefficient matrix are randomly selected in a finite field, such as Galois field (Galois field, GF).

Referring to FIG. 5, FIG. 5 is a schematic diagram of random linear network coding. As shown in Figure 5, the size of the coding coefficient matrix (ie, G ^K×N shown in Figure 5) is K×N, that is, K rows and N columns, wherein, in this example, a row vector in the coding coefficient matrix is called a Coding coefficient vector, by performing network coding on a coding block (X ^N×1 in Figure 5) containing N original data packets, to obtain K coded data (Y ^K×1 in Figure 5), the corresponding code rate Expressed as N/K, or, the corresponding redundancy rate is expressed as (KN)/N. Among them, the encoding coefficient matrix randomly selects coefficients in the GF(q) field, q represents the size of the Galois field, and the value of the Galois field is in the interval [0,q-1]. Both K and N are positive integers.

It should be understood that, in the RLNC scheme, there is no correlation between each coding block, wherein, network coding is performed on a coding block containing N original data packets to obtain K coded data, that is, the coding operation is performed on each independent coding block. The redundancy (code rate) of each coding block may be the same or different. The encoder/transmitter adds header information to the N original data packets and the generated K encoded data before sending them. When the decoding end/receiving end correctly receives at least N coded packets whose coding coefficient vectors are linearly independent, or when at least N coded packets are correctly received and the rank of the coding coefficient matrix corresponding to the received coded packets is N, The N original data packets can be correctly decoded and recovered. This is because the coded data packet combines the information of several original data packets, so the receiving end can use the coded packet to restore the original data.

4. System package: obtained by multiplying the original data package by the encoded data generated by the encoding coefficient of the unit vector and adding the header of the encoded packet, or directly adding the header of the encoded packet to the original data packet. For example, the original data packet is network-encoded using a coding coefficient matrix of size K×N (ie, G ^K×N in FIG. 5 ) to obtain K coded data. where the encoding coefficient matrix can be written as

The sub-matrix I _N formed by the first N rows is a unit matrix, which is composed of N unit vectors. Among the K coded data obtained according to the coded coefficient matrix, the N coded data corresponding to the I _N part is the data part of the N system packets, and the system packet is obtained by adding header information to the coded data.

5. Redundant packets: generated by network coding the original data packets, and the coding coefficients of the redundant packets are non-unit vectors. For example, a coding coefficient matrix of size K×N (that is, G ^K×N in Figure 5) is used for network coding to obtain K coded data, where the coding coefficient matrix can be written as

Among the K coded data, KN coded data corresponding to A _(KN)×N parts are data parts of KN redundant packets, and header information is added to the KN coded data to obtain redundant packets. In this embodiment of the application, the term "redundant package" may also be referred to as "check package" for short, and the two may be used interchangeably.

6. Network coding grouping: a term related to grouping codes. In grouping codes, a network coding grouping is a collection of multiple original data packets. For example, dividing every N original data packets into a network coding group and performing independent network coding can obtain coded data corresponding to the network coding group. In this embodiment of the present application, the term "network coding group" may also be referred to as "network coding block", "coding group", or "coding block".

7. Network coding layer: The network coding layer refers to the protocol layer with network coding function. The network coding layer can be RRC layer, SDAP layer, PDCP layer, BAP layer, RLC layer, MAC layer, or PHY layer with network coding function. One or more of the protocol layers. The specific layer is not limited in this application. The network coding layer can also be a new protocol layer other than the above protocol layer, for example, the new protocol layer can be above the PDCP layer, above the BAP layer, between the PDCP layer and the RLC layer, between the RLC layer and the MAC layer Between layers, or between the MAC layer and the PHY layer, the position of the new protocol layer may not be limited in this application. In this embodiment of the application, the term "network coding layer" may also be referred to as "codec layer", "codec layer", "network codec layer", "network codec layer", "network codec layer" , "network encoding/decoding layer" or other names are not limited in this application.

8. Decoding corresponding to network coding: The decoding of network coding is the inverse process of network coding. Using the received coded data, the original data packet can be recovered by multiplying the inverse matrix of the corresponding matrix of the coded data with the coded data.

9. Protocol data unit (protocol data unit, PDU): A data unit passed between protocol entities. The PDU contains information from the upper layer and additional information from the entity of the current layer. This PDU will be transmitted to the next lower layer.

10. Service data unit (service data unit, SDU): The data unit transmitted between the protocol layers is the data from the upper layer or the data to be transmitted to the upper layer.

In the LTE system, the RLC layer includes a reordering function, so as to ensure that the RLC layer at the receiving end delivers data to the PDCP layer in order (that is, the data received by the PDCP layer from the RLC layer must be in order). Therefore, under normal circumstances (except for switching scenarios), the PDCP layer does not need to enable the reordering function, and it can also ensure that the PDCP layer at the receiving end delivers data to its upper layer in order.

Different from the LTE system, in the NR system, the RLC layer cancels the reordering function, and moves the reordering function up to the PDCP layer for implementation. That is to say, in the NR system, the data received by the PDCP layer from the RLC layer may be out of order. The PDCP layer reorders the out-of-order data received from the RLC layer, and then submits the data to its upper layer in order.

Specifically, the PDCP layer is composed of at least one PDCP entity, and one PDCP entity corresponds to one DRB. As shown in Figure 6, for a receiving PDCP entity, it only receives PDUs within the receiving window. That is to say, if the receiving PDCP receives a PDU that is not within the receiving window, it will directly discard the PDU. The PDCP entity at the receiving end performs window pushing based on a reordering timer (t-reordering) timeout mechanism. When the PDCP entity at the receiving end receives out-of-sequence PDUs, it starts the reordering timer. Once the reordering timer expires, it pushes the lower limit of the receiving window forward.

However, the existing solution only involves the working mechanism of the RLC layer/PDCP layer at the receiving end without introducing the NC function. However, after the introduction of the NC function, how the receiving end RLC layer/PDCP layer works is not considered.

In view of this, the present application provides a data transmission method in order to solve the problem of how the receiving end submits the decoded original data.

The method for transmitting data provided by the embodiment of the present application is described below with reference to the accompanying drawings.

It should be understood that, for ease of understanding and description, the method in each embodiment will be described below by taking the receiving device as an execution subject of the method in each embodiment as an example. However, this should not limit the execution subject of the method provided in this application. For example, the receiving device in the following embodiments may be replaced with components (such as chips or circuits, etc.) configured in the receiving device.

The embodiments shown below do not specifically limit the specific structure of the execution subject of the method provided by the embodiment of the present application, as long as the program that records the code of the method provided by the embodiment of the present application can be executed according to the method provided by the embodiment of the present application The method may be used for communication. For example, the execution body of the method provided in the embodiment of the present application may be a receiving device, or a functional module capable of executing a program in the receiving device.

In the following embodiments, the receiving device may be the above-mentioned terminal device, network device or IAB node.

It should be noted that the data packets described in the following embodiments are the above-mentioned system packets, or the above-mentioned redundant packets, or the above-mentioned original data packets.

Fig. 7 is a schematic flowchart of a method for transmitting data provided by an embodiment of the present application. As shown in FIG. 7 , the method 700 may include S710 and S720 , and each step in the method 700 will be described in detail below.

S710, the receiving device receives T data packets through the first entity, the T data packets belong to K data packets, the K data packets include N system packets and (K-N) redundant packets, and the K data packets are related to the N The original data packets satisfy the encoding relationship, or, K data packets include N original data packets and (K-N) redundant packets, and the redundant packets in the K data packets and the N original data packets satisfy the encoding relationship; the N The original data packet is obtained by performing one or more of the following processes on the M original data: segmentation, concatenation or padding. T, K, N and M are all positive integers, K is greater than T, and K is greater than N.

Among them, in the case where the K data packets include N system packets and (K-N) redundant packets, the N system packets correspond to the N original data packets one by one, that is, one system packet is obtained according to one original data packet , for example, a system packet is formed after adding an NC header to an original data packet. The (K-N) redundant packets are obtained by performing network coding on the N original data packets. For more descriptions about system packages and redundant packages, please refer to the description above. Exemplarily, reference may be made to FIG. 4 for a process of obtaining N system packages and (K-N) redundant packages according to M original data.

In the case where K data packets include N system packets and (K-N) redundant packets, the coding relationship between K data packets and N original data packets is as follows: K data packets encode N original data packets dealt with. Wherein, the N system packets included in the K data packets are respectively generated by encoding the N original data packets with the coefficient factor of the unit vector and adding the coded packet header. Or, in the case that K data packets include N system packets and (K-N) redundant packets, the coding relationship between K data packets and N original data packets is: (K-N) redundant packets included in K data packets The remaining packets are obtained by encoding the N original data packets, and the N system packets included in the K data packets are generated by adding encoded packet headers to the N original data packets respectively. That is, the encoding relationship also includes adding an encoded packet header.

In the case that the K data packets include N original data packets and (K-N) redundant packets, the (K-N) redundant packets are obtained by performing network coding on the N original data packets. For more descriptions about original data packets and redundant packets, please refer to the description above. Exemplarily, reference may be made to FIG. 3 for a process of obtaining N original data packets and (K-N) redundant packets according to M original data.

The embodiment of the present application does not limit the type of original data, and the original data may be SDU or PDU. That is, the original data can be SDAP SDU or SDAP PDU; or, the original data can be PDCP SDU or PDCP PDU; or, the original data can be RLC SDU or RLC PDU; or, the original data can be It can be a MAC SDU or a MAC PDU; or, in a relay transmission scenario, the original data can be a backhaul adaptation protocol (BAP) SDU or a BAP PDU.

S720. The receiving device submits the original data through the first entity in the first delivery manner or in the second submission manner.

Exemplarily, the receiving device submits the original data to the upper layer of the first entity through the first entity in the first delivery manner or in the second submission manner. For example, the first entity is a PDCP entity, and the receiving device submits the original data to the SDAP layer through the PDCP entity in the first delivery manner or in the second delivery manner.

In another example, the receiving device submits the original data to the processing module after the NC module through the first entity in the first submission manner or in the second submission manner. In this case, the first entity includes an NC module for implementing NC functions. For example, the network coding function is located in the PDCP layer, such as after the header compression function of the PDCP layer and before the security function, and is implemented by the NC module. In this case, the first entity is the PDCP entity, and the processing module after the NC module is The header decompression module, the receiving device submits the original data to the header decompression module in the PDCP entity through the PDCP entity, specifically, the NC module in the PDCP entity in the first delivery mode or the second submission mode.

Wherein, the first delivery method includes: when performing a network decoding operation on T data packets to recover one original data among M original data, submitting the one original data through the first entity.

The second delivery method includes: when the network decoding operation is performed on the T data packets to recover M original data, the first entity submits the M original data. It can be understood that when the network decoding operation on the received data packets can restore M original data, the number of data packets received by the receiving device is not less than the number of original data packets, that is, T is not less than N.

It should be understood that, in the above-mentioned first delivery mode, when an original data recovered from T data packets, such as system packets or original data packets, has not yet been submitted, the receiving device directly submits the original data through the first entity. Conversely, if an original data recovered from the T data packets has already been delivered, the original data will not be delivered again.

It should also be understood that, in the above-mentioned second delivery method, when T is less than N, and M original data cannot be recovered according to the T data packets, the receiving device may cache T data packets until the received data packets After the M original data can be recovered, the network decoding operation is performed on the received data packet to recover the M original data. In the case where the receiving device caches T data packets, the embodiment of the present application does not limit whether the receiving device restores part of the M original data through the system packets or original data packets in the T data packets. It should also be understood that even if the receiving device restores some of the M original data from the system packets or original data packets in the T data packets, the receiving device will not submit any of the M original data through the first entity. part of the original data. It should also be understood that when recovering the M original data from the T data packets, the receiving device delivers the M original data sequentially through the first entity.

In order to facilitate the understanding of the embodiment of the present application, the method for transmitting data provided by the embodiment of the present application will be described below in conjunction with FIG. 8 and FIG. 9, taking K data packets including N system packets and (K-N) redundant packets as an example. However, this embodiment of the present application should not be construed as any limitation, and the embodiments described below are also applicable to the scheme in which K data packets include N original data packets and (K-N) redundant packets. For the solution where K data packets include N original data packets and (K-N) redundant packets, it is only necessary to replace the system packets described in the following embodiments with the original data packets.

For example, as shown in (a) in Figure 8 and Figure 9, after the sending device performs at least one of the following operations on the four original data P ₁ , P ₂ , P ₃ and P ₄ : concatenation, segmentation, padding, and generation Original data packets X ₁ , X ₂ and X ₃ of equal size. The sending device then generates system packets Y ₁ , Y ₂ and Y ₃ from the original data packets X ₁ , X ₂ and X ₃ . Further, the sending device generates a redundant packet Y ₄ after performing network coding processing on the original data packets X ₁ , X ₂ and X ₃ . Still further, the sending device sequentially sends data packets Y ₁ , Y ₂ , Y ₃ and Y ₄ to the receiving device.

In an implementation manner, the receiving device submits the original data in a first delivery manner through the first entity.

In this implementation mode, there are the following possibilities for recovering one of the M original data for the T data packets: (1) recovering one of the M original data for a system package in the T data packets Original data; (2) Recover one original data among the M original data for a plurality of system packets in the T data packets.

For example, as shown in (b1) in FIG. 8 , the receiving device receives data packets Y ₁ , Y ₃ and Y ₄ sequentially, wherein Y ₁ and Y ₃ are system packets, and Y ₄ is a redundant packet. When the receiving device receives data packet Y ₁ , the receiving device receives 1 data packet in total (ie T=1). Since the data packet Y ₁ (system packet) includes the complete original data P ₁ and a part of the original data P ₂ , the receiving device can recover one original data P ₁ according to the one data packet Y ₁ . Since the receiving device has not submitted the original data P ₁ , the receiving device submits the original data P ₁ through the first entity. Further, when the receiving device receives the data packet _Y3 , the receiving device receives 2 data packets in total (ie T=2). Since the data packet Y ₃ (system packet) includes a part of the original data P ₃ and the complete original data P ₄ , the receiving device can recover an original data P ₄ according to the data packet Y ₃ . Since the receiving device has not submitted the original data P ₄ , the receiving device submits the original data P ₄ through the first entity. When the receiving device receives data packet Y ₄ , the receiving device receives 3 data packets in total (ie T=3). The receiving device can restore the original data P ₁ , P ₂ , P ₃ and P ₄ through network decoding according to the system packets Y ₁ , Y ₃ and redundant packet Y ₄ . Since the receiving device has already submitted the original data P ₁ and P ₄ , the receiving device only submits the original data P ₂ and P ₃ through the first entity.

For example, as shown in (b2) in FIG. 8 , the receiving device receives data packets Y ₂ , Y _{3 ,} and Y ₄ sequentially, wherein Y ₂ and Y ₃ are system packets, and Y ₄ is a redundant packet. When the receiving device receives data packet Y ₂ , the receiving device receives 1 data packet in total (ie T=1). Since the data packet Y ₂ (system packet) includes a part of the original data P ₂ and a part of the original data P ₃ , the receiving device cannot recover an original data (for example: P ₂ or P ₃ ) based on the one data packet. When the receiving device receives data packet Y ₃ , the receiving device receives 2 data packets in total (ie T=2). Since the data packet Y ₃ (system packet) includes a part of the original data P ₃ and the complete original data P ₄ , the receiving device can restore an original data P ₃ and an original data P ₄ according to the two data packets. Since the receiving device has not submitted the original data P ₃ and P ₄ , the receiving device submits the original data P ₃ and P ₄ sequentially through the first entity. When the receiving device receives the data packet _Y4 , the receiving device has received a total of 3 data packets (that is, T=3), and the receiving device can perform network decoding according to the system packets _Y2 , _Y3 and redundant packet _Y4 to recover the output Raw data P ₁ , P ₂ , P ₃ and P ₄ . Since the receiving device has already submitted the original data P ₃ and P ₄ , the receiving device only submits the original data P ₁ and P ₂ through the first entity.

From the above example, it can be seen that when the receiving device submits the original data according to the first delivery method, if the receiving device receives T data packets and cannot restore one original data according to the T data packets, the receiving device caches the T data packets , and continue to receive the next packet. For example, as shown in (b2) in FIG. 8 , after receiving the data packet Y ₂ , the receiving device caches the data packet Y ₂ if the original data cannot be recovered from the data packet Y ₂ . Further, after receiving the data packet _Y3 , the receiving device restores the original data _P3 and _P4 according to the data packets _Y2 and _Y3 , and then the receiving device submits the original data _P3 and _P4 through the first entity.

It can also be known from the above example that when the receiving device submits the original data according to the first delivery method, the receiving device may restore more than one original data by network decoding of the T data packets. For example, as shown in (b1) in Figure 8, after receiving the data packets Y ₁ , Y ₃ , and Y ₄ , the receiving device performs network decoding on the data packets Y ₁ , Y _{3 ,} and Y ₄ to recover 4 original data P ₁ , _P2 , _P3 and _P4 . Therefore, when the receiving device submits the original data according to the first delivery method, no matter how many original data can be recovered through T data packets, as long as the complete original data can be recovered through T data packets (rather than recovering one original data part), the receiving device submits the recovered original data through the first entity.

In the embodiment of this application, after receiving T data packets, once the receiving device can recover an original data from the received T data packets, or once it can perform network translation for some of the T data packets code to recover a set of original data, the receiving device submits the recovered original data through the first entity, thus solving the problem of how the receiving device submits the original data recovered by network decoding. In addition, according to the above method, the time delay requirement for transmitting data can also be guaranteed.

In another implementation manner, the receiving device submits the original data in a second delivery manner through the first entity.

For example, as shown in FIG. 9 , the receiving device receives data packets Y ₁ , Y ₃ and Y ₄ sequentially, wherein Y ₁ and Y ₃ are system packets, and Y ₄ is a redundant packet. When the receiving device receives data packet Y ₁ , the receiving device receives 1 data packet in total (ie T=1). If the receiving device cannot recover M original data (P ₁ , P ₂ , P ₃ and P ₄ ) based on the one data packet, the receiving device buffers the data packet Y ₁ . Further, when the receiving device receives the data packet _Y3 , the receiving device receives 2 data packets in total (ie T=2). If the receiving device still cannot recover the M original data according to the two data packets, the receiving device buffers the data packet Y ₃ . Still further, when the receiving device receives data packet Y ₄ , the receiving device receives 3 data packets in total (that is, T=3). The receiving device can restore M original data according to the 3 data packets, then the receiving device performs network decoding on the data packets Y ₁ , Y ₃ and Y ₄ to restore the original data P ₁ , P ₂ , P ₃ and P ₄ , the first entity submits the original data P ₁ , P ₂ , P ₃ and P ₄ in sequence.

It should be understood that in this implementation manner, even if the receiving device can restore some of the M original data according to the received T data packets, the receiving device will not submit the original data through the first entity. For example, as shown in FIG. 9 , after the receiving device receives the data packet Y ₁ , even if an original data P ₁ can be recovered according to the data packet Y ₁ , the receiving device will not submit the original data P ₁ through the first entity. Instead, after the original data P ₁ , P ₂ , P ₃ and P ₄ , the first entity submits the original data P ₁ , P ₂ , P ₃ and P ₄ .

In the embodiment of this application, after receiving T data packets, once the receiving device can recover M original data according to the received T data packets, it submits the M original data through the first entity, thereby solving the problem of receiving How the device submits the original data recovered by network decoding. In addition, according to the above method, the submitted raw data is sequential, thereby simplifying the processing logic of the entity (or module) receiving the raw data.

As mentioned above, the embodiment of the present application does not limit the type of original data. Therefore, it should be understood that for different types of original data, NC functions will be implemented by different protocol layers.

For example, if the type of raw data is SDAP SDU, the NC function is implemented by the SDAP layer. That is to say, for the sending device, the sending device performs network coding on the SDAP SDU through the SDAP entity to obtain K data packets. For the receiving device, after the receiving device performs a network decoding operation on the received T data packets through the SDAP entity to restore the SDAP SDU, it submits the SDAP SDU through the SDAP entity (that is, submits it to the Internet Protocol (internet protocol, IP) layer).

For another example, if the type of the original data is SDAP PDU, then the NC function can be realized by the SDAP layer, or by the NC layer, or by the PDCP layer, and the NC layer is located between the SDAP layer and the PDCP layer. That is to say, for the sending device, the sending device performs network coding on the SDAP PDU through the SDAP entity/NC entity/PDCP entity to obtain K data packets. For the receiving device, after the receiving device performs network decoding operation on the received T data packets through the SDAP entity to restore the SDAP PDU, it submits the SDAP PDU through the SDAP entity (that is, the processing module after the NC module in the SDAP entity, For example, it is submitted to the SDAP header module to remove the header field of the SDAP PDU). Or, after the receiving device performs a network decoding operation on the received T data packets through the NC entity to restore the SDAP PDU, it submits the SDAP PDU through the NC entity (that is, submits it to the SDAP layer). Or, after the receiving device performs a network decoding operation on the received T data packets through the PDCP entity to restore the SDAP PDU, it submits the SDAP PDU through the PDCP entity (that is, submits it to the SDAP layer).

For another example, if the type of the original data is PDCP SDU, the NC function can be implemented by the PDCP layer. That is to say, for the sending device, the sending device performs network coding on the PDCP SDU through the PDCP entity to obtain K data packets. For the receiving device, after the receiving device performs network decoding operation on the received T data packets through the PDCP entity to restore the PDCP SDU, it submits the PDCP SDU through the PDCP entity (that is, submits it to the SDAP layer, or submits it to the PDCP entity in the PDCP entity) The processing module after the NC module, for example: submitting to the header decompression module).

For another example, if the type of the original data is PDCP PDU, the NC function may be implemented by the PDCP layer, or by the NC layer, or by the RLC layer, and the NC layer is located between the PDCP layer and the RLC layer. That is to say, for the sending device, the sending device performs network coding on the PDCP PDU through the PDCP entity/NC entity/RLC entity to obtain K data packets. For the receiving device, after the receiving device performs network decoding operation on the received T data packets through the PDCP entity to restore the PDCP PDU, it submits the PDCP PDU through the PDCP entity (that is, the processing module after the NC module in the PDCP entity, For example, it is submitted to the PDCP header removal module to remove the header field of the PDCP PDU). Or, after the receiving device performs a network decoding operation on the received T data packets through the NC entity to restore the PDCP PDU, it submits the PDCP PDU through the NC entity (that is, submits it to the PDCP layer). Or, after the receiving device performs a network decoding operation on the received T data packets through the RLC entity to restore the PDCP PDU, it submits the PDCP PDU through the RLC entity (that is, submits it to the PDCP layer).

For another example, if the type of the original data is RLC SDU, the NC function is implemented by the RLC layer. That is to say, for the sending device, the sending device performs network coding on the RLC SDU through the RLC entity to obtain K data packets. For the receiving device, after the receiving device performs network decoding operations on the received T data packets through the RLC entity to obtain the RLC SDU, it submits the RLC SDU through the RLC entity (that is, submits it to the PDCP layer).

For another example, if the type of the original data is RLC PDU, then the NC function can be realized by the RLC layer, or by the NC layer, or by the MAC layer, and the NC layer is located between the RLC layer and the MAC layer. That is to say, for the sending device, the sending device performs network coding on the RLC PDU through the RLC entity/NC entity/MAC entity to obtain K data packets. For the receiving device, after the receiving device performs network decoding operation on the received T data packets through the RLC entity to restore the RLC PDU, it submits the RLC PDU through the RLC entity (that is, the processing module after the NC module in the RLC entity, For example, it is submitted to the RLC header module to remove the header field of the RLC PDU). Or, after the receiving device performs a network decoding operation on the received T data packets through the NC entity to restore the RLC PDU, it submits the RLC PDU through the NC entity (that is, submits it to the RLC layer). Or, after the receiving device performs a network decoding operation on the received T data packets through the MAC entity to restore the RLC PDU, it submits the RLC PDU through the MAC entity (that is, submits it to the RLC layer).

For another example, if the type of the original data is MAC SDU, the NC function is implemented by the MAC layer. That is to say, for the sending device, the sending device performs network coding on the MAC SDU through the MAC entity to obtain K data packets. For the receiving device, after the receiving device performs a network decoding operation on the received T data packets through the MAC entity to restore the MAC SDU, it submits the MAC SDU through the MAC entity (that is, submits it to the RLC layer).

For another example, if the original data type is MAC PDU, then the NC function can be realized by the MAC layer, or by the NC layer, or by the PHY layer, and the NC layer is located between the MAC layer and the PHY layer. That is to say, for the sending device, the sending device performs network coding on the MAC PDU through the MAC entity/NC entity/PHY entity to obtain K data packets. For the receiving device, after the receiving device performs network decoding operation on the received T data packets through the MAC entity to restore the MAC PDU, it submits the MAC PDU through the MAC entity (that is, the processing module after the NC module in the MAC entity, For example, submitted to the HARQ processing module). Or, after the receiving device performs a network decoding operation on the received T data packets through the NC entity to restore the MAC PDU, it submits the MAC PDU through the NC entity (ie, submits it to the MAC layer). Or, after the receiving device performs a network decoding operation on the received T data packets through the PHY entity to restore the MAC PDU, it submits the MAC PDU through the PHY entity (that is, submits it to the MAC layer).

As mentioned above, for the receiving device, the network decoding in the NC function can be implemented by the SDAP layer or the NC layer, and the NC layer is located between the PDCP and the SDAP layer. Alternatively, the network decoding operation in the NC function can also be implemented by the PDCP layer. Alternatively, the network decoding operation in the NC function can also be implemented by the RLC layer.

Optionally, if the network decoding operation is implemented by the SDAP layer or the NC layer, and the NC layer is located between the SDAP layer and the PDCP layer, the method 700 further includes: the receiving device enables the out-of-order delivery function of the PDCP entity.

That is to say, even if the PDCP entity receives out-of-order PDCP PDUs from the lower layer (such as the RLC layer), the PDCP entity can directly recover the out-of-order PDCP PDUs from the PDCP SDU and submit them to the upper layer for processing without waiting until After the PDCP reordering timer expires, the received PDCP PDUs are restored to PDCP SDUs in order, and the restored PDCP SDUs are submitted upwards. Wherein, the PDCP SDU is one data packet in the K data packets, or the PDCP SDU contains one data packet. For example, if the PDCP entity receives PDCP PDU#2 from the lower layer, the PDCP SDU corresponding to PDCP PDU#2 contains data packet #2 in the K data packets, but the PDCP entity does not receive PDCP PDU#1, PDCP PDU#1 The corresponding PDCP SDU contains data packet #1 among the K data packets, then the PDCP entity can directly submit data packet #2 to the upper layer after recovering the PDCP SDU, without having to wait until receiving PDCP PDU#1 and recovering the PDCP PDU After #1 and PDCP PDU#2 respectively correspond to PDCP SDUs, then data packet #1 and data packet #2 are delivered to the upper layer in sequence.

As shown in FIG. 8, even if the data packets received by the receiving device are discontinuous, the receiving device can recover all the original data. Therefore, when the receiving device enables the out-of-order delivery function of the PDCP entity, it does not affect the decoding process of the SDAP entity or the NC entity, but can guarantee the delay requirement of data transmission.

Optionally, the network decoding operation is implemented by the PDCP layer, and the method 700 further includes: the receiving device disables the reordering function of the PDCP entity. For example, the receiving device sets the reordering timer of the PDCP entity to 0. That is to say, if the PDCP entity receives PDCP PDUs that arrive out of order from the lower layer (such as the RLC layer), the PDCP entity can directly send the data packets contained in the out-of-order PDCP PDUs to the decoder for decoding processing. For example, if the PDCP entity receives PDCP PDU #2 from the lower layer, and PDCP PDU #2 contains packet #2, but the PDCP entity does not receive PDCP PDU #1, and PDCP PDU #1 contains packet #1, then the PDCP entity can directly Send data packet #2 to the decoder for decoding processing, instead of waiting for receiving PDCP PDU#1, and then submit data packet #1 and data packet #2 to the decoder in sequence for decoding processing.

Optionally, when the network decoding operation is implemented by the PDCP layer, there is also a problem of when the PDCP entity of the receiving device slides the lower limit of the PDCP receiving window. Alternatively, when the network decoding operation is implemented by the RLC layer, in the RLC acknowledgment mode (AM), there is also a problem of when the RLC entity of the receiving device slides the lower limit of the RLC receiving window.

The following describes the problem of when the PDCP entity and/or RLC entity of the receiving device slides the lower limit of the receiving window when the NC function is introduced with reference to FIG. 10 to FIG. 13 .

FIG. 10 is a schematic flowchart of a data processing method provided by an embodiment of the present application. As shown in FIG. 10 , the method 1000 may include S1010 and S1020 , and each step in the method 1000 will be described in detail below.

S1010, the first entity receives T data packets, the T data packets belong to K data packets, the K data packets include N system packets and (K-N) redundant packets, and the K data packets are related to the N original data packets Satisfy the encoding relationship, or, the K data packets include N original data packets and (K-N) redundant packets, and the redundant packets in the K data packets and the N original data packets satisfy the encoding relationship; the N original data packets It is obtained by performing one or more of the following processes on the M original data: segmentation, concatenation or padding. T, K, N and M are all positive integers, K is greater than T, and K is greater than N.

Wherein, for more description about the K data packets, reference may be made to S710 above.

It should be understood that, in S1010, the T data packets received by the first entity are included in the PDU. That is to say, the first entity receives T PDUs, and the T PDUs correspond to T data packets, that is, each PDU contains a data packet (for example, each data packet generates a PDU after header processing).

S1020, when the reordering timer is on, the first entity sends part or all of the T data packets to the decoder for decoding processing.

Wherein, the start of the reordering timer is triggered by the PDU with the largest SN among the T PDUs that are discontinuous with the SN of the previous PDU. For example, as shown in Figure 13, when the first entity receives PDU1 (SN=1), PDU3 (SN=3), PDU5 (SN=5) and PDU6 (SN=6), PDU3 and PDU5 are respectively the same as the previous PDU The SNs are discontinuous (the SNs of PDU3 and PDU1 are discontinuous, and the SNs of PDU5 and PDU3 are discontinuous). Since the SN of PDU5 is larger than that of PDU3, the start of the reordering timer is triggered by PDU5.

Part of the T data packets includes data packets other than data packets whose sequence numbers are continuous with the sequence numbers of the data packets at the lower limit of the receiving window. It should be understood that when the reordering timer is on, if the first entity sends part of the T data packets to the decoder for decoding processing, the first entity sends the T data packets before the reordering timer is on. The data packets whose sequence number is continuous with the sequence number of the data packet at the lower limit of the receiving window are sent to the decoder for decoding processing. It should be noted that since the T data packets correspond to the T PDUs one-to-one, it can be considered that the sequence number of each data packet in the T data packets is the SN of the corresponding PDU. T PDUs are received within the receive window.

For example, the sequence number of the packet receiving the lower limit of the window is 1. When the first entity receives PDU1 (SN=1), PDU2 (SN=2), PDU5 (SN=5) and PDU6 (SN=6), the reordering timing The decoder is triggered by PDU5. When the reordering timer is on, the first entity can submit the data packets contained in PDU1, PDU2, PDU5, and PDU6 to the decoder for decoding. code processing. Or, before the reordering timer starts, the first entity submits the data packets contained in PDU1 and the data packets contained in PDU2 to the decoder for decoding processing, and when the reordering timer is on, the first entity sends the data packets contained in PDU5 The data packet and the data packet contained in PDU6 are submitted to the decoder for decoding processing,

Exemplarily, the first entity is a PDCP entity, the T PDUs are T PDCP PDUs, the reordering timer is a PDCP reordering timer, and the receiving window is a PDCP receiving window.

Also exemplary, the first entity is an RLC entity, the T PDUs are T RLC PDUs, the reordering timer is an RLC reordering timer, and the receiving window is an RLC receiving window.

In S1020, even if the reordering timer is already on, the first entity will send some or all of the T data packets to the decoder for processing. That is to say, in S1020, the first entity does not pay attention to whether the SN of the received PDU is continuous with the SN of the previous PDU, as long as the first entity receives a PDU from the lower layer, it can The data packet is sent to the decoder for processing. It should be understood that the first entity will only send data packets contained in PDUs received within the receiving window to the decoder for processing, but will not send data packets contained in PDUs received outside the receiving window to the decoder to process.

In the following, in conjunction with FIG. 11 , the first entity is a PDCP entity, the T PDUs are PDCP DPUs, and the interface window is a PDCP interface window for example.

For example, as shown in Figure 11, after the sending PDCP entity performs network coding function processing on the PDCP SDUs with

sequence numbers

1, 2, and 3 through the NC function, PDCP PDUs with

SNs

0, 1, 2, and 3 are obtained. Among them, the PDCP PDU with SN 0 and the PDCP PDU with SN 1 contain system packets, and the PDCP PDU with SN 2 and PDCP PDU with SN 3 contain redundant packets. Alternatively, PDCP PDUs with SN 0 and PDCP PDUs with SN 1 contain the original data packets, and PDCP PDUs with SN 2 and PDCP PDUs with SN 3 contain redundant packets.

Correspondingly, as shown in FIG. 11 , the receiving PDCP entity receives PDCP PDUs whose SNs are 0, 2, and 3 respectively (that is, T=3). When the receiving PDCP entity receives a PDCP PDU with an SN of 0, since the sequence number of the PDCP PDU with an SN of 0 is equal to the lower limit of the receiving window, the receiving PDCP entity sends the system packet or original data packet contained in the PDCP PDU with an SN of 0 to to the decoder for processing. When the receiving PDCP entity receives the PDCP PDU with SN 2, it finds that the sequence numbers of the PDCP PDU with SN 2 and the PDCP PDU with SN 0 are not consecutive, that is, the PDCP PDU with SN 2 arrives out of order, so the PDCP retry is enabled. Sort the timer, and continue to send the redundant packets contained in the PDCP PDU with SN 2 to the decoder for decoding processing. After the receiving PDCP entity receives the PDCP PDU with SN of 2, even if the PDCP reordering timer is already on, the receiving PDCP entity still sends the redundant packets contained in the PDCP PDU with SN of 2 to the decoder for processing.

Optionally, the method 1000 further includes: after performing a network decoding operation on the T data packets to restore M original data, the first entity stops/restarts the reordering timer.

Optionally, the method 1000 further includes: after performing a network decoding operation on the T data packets to recover M original data, the first entity slides the lower limit of the receiving window. It should be understood that the above T PDUs are received within the receiving window.

Exemplarily, the first entity slides the lower limit of the receiving window to the sequence number of the first PDU that has not yet been delivered to the decoder. For example, the sending device sends PDU0 (SN=0), PDU1 (SN=1), PDU2 (SN=2), and PDU3 (SN=3), wherein PDU0 to PDU3 are obtained by network coding SDU1 to SDU3 . When the first entity receives PDU0, PDU2, and PDU3, the first entity sends the data packets contained in PDU0, the data contained in PDU2, and the data packets contained in PDU3 to the decoder for processing, and according to the data packets contained in PDU0, PDU2 SDU1, SDU2 and SDU3 are recovered from the data contained in PDU3 and the packet contained in PDU3. Since the SNs of PDU2 and PDU0 received are not continuous, PDU2 triggers the start of the reordering timer. If the first entity does not receive other PDUs before the decoder recovers SDU1 to SDU3, then the first entity slides the lower limit of the receiving window to 4 after recovering SDU1 to SDU3 (that is, the PDU4 that is not delivered to the decoder ( SN=sequence number of 4). At this point, the reorder timer can be stopped or restarted. If the first entity submits the data packet contained in PDU0, the data contained in PDU2 and the data packet contained in PDU3 to the decoder, and before the decoder restores SDU1 to SDU3, the first entity receives PDU4, PDU5 (SN =5) and PDU7 (SN=7), since the SNs of PDU4 and PDU5 are continuous with PDU3, the first entity continues to submit the data packets contained in PDU4 and the data packets contained in PDU5 to the decoder for decoding processing, and After recovering SDU1 to SDU3, the decoder restarts the reordering timer, and slides the lower limit of the receiving window to 7 (that is, the sequence number of PDU7 not submitted to the decoder).

In the following still referring to FIG. 11 , the first entity is a PDCP entity, the T PDUs are PDCP DPUs, and the interface window is a PDCP interface window for example.

For example, as shown in Figure 11, after the receiving PDCP entity sends the data packets contained in the PDCP PDUs with SNs of 0, 2, and 3 to the decoder for decoding processing, the PDCP packets with sequence numbers of 1, 2, and 3 can be restored. SDUs. Further, the receiving PDCP entity instructs the restart/stop of the PDCP reordering timer, and the receiving PDCP entity slides the lower limit of the PDCP receiving window. That is to say, even if the receiving PDCP entity does not receive the PDCP PDU with the SN of 1, the receiving PDCP entity decodes and restores the PDCP SDU1 according to the data packets contained in the received PDCP PDUs with the SNs of 0, 2, and 3 respectively. , PDCP SDU2 and PDCP SDU3, the receiving PDCP entity stops/restarts the PDCP reordering timer, and slides the lower limit of the PDCP receiving window to move forward. Wherein, the restart of the reordering timer means that the reordering timer is bound with the next PDU that satisfies the condition of starting the reordering timer, and is in the enabled state.

It should be noted that, in S1020, after the first entity restores the original data according to the T data packets, the original data may be submitted through the first delivery method or the second delivery method in the method 700. Specifically, after the first entity restores an original data according to the system packets or original data packets in the T data packets, it may submit the restored original data through the first delivery method in method 700; or, the first entity according to After performing network decoding on the T data packets to restore M original data, the original data may be submitted through the second delivery method in method 700 .

In the embodiment of the present application, once the first entity can decode and recover M original data from the network decoding of the received T data packets, it slides the lower limit of the receiving window, thus solving the problem of the first entity when the NC function is introduced. The problem of when to slide the lower limit of the receiving window. In addition, the first entity does not pay attention to whether the received PDUs are continuous. Even if the T PDUs received by the first entity include PDUs with discontinuous sequence numbers, when the reordering timing is enabled, the first entity will receive All or part of the T data packets are sent to the decoder for decoding processing, without waiting for the reordering timer to expire or after receiving PDUs with continuous sequence numbers, and then send the received data packets to the decoder for processing , so that the original data can be restored quickly and the delay of data transmission can be reduced.

Fig. 12 is a schematic flowchart of a data processing method provided by an embodiment of the present application. As shown in FIG. 12 , the method 1200 may include S1210 and S1220 , and each step in the method 1200 will be described in detail below.

S1210, the first entity receives T data packets, the T data packets belong to K data packets, the K data packets include N system packets and (K-N) redundant packets, and the K data packets are related to the N original data packets Satisfy the encoding relationship, or, the K data packets include N original data packets and (K-N) redundant packets, and the redundant packets in the K data packets and the N original data packets satisfy the encoding relationship; the N original data packets It is obtained by performing one or more of the following processes on the M original data: segmentation, concatenation or padding. T, K, N and M are all positive integers, K is greater than T, and K is greater than N.

It should be understood that, in S1210, the data packet received by the first entity is included in the PDU. That is to say, the first entity receives T PDUs, and the T PDUs correspond to T data packets, that is, each PDU includes a data packet (for example, each data packet generates a PDU after adding a header).

S1220, only when the reordering timer expires, the first entity sends at least one of the following data packets to the decoder for decoding processing:

The data packets included in the out-of-order PDUs among the T PDUs, and the data packets included in all PDUs received before the out-of-order PDUs and not delivered to the decoder.

Exemplarily, the first entity is a PDCP entity, the T PDUs are T PDCP PDUs, and the reordering timer is a PDCP reordering timer.

Also exemplary, the first entity is an RLC entity, the T PDUs are RLC PDUs, and the reordering timer is an RLC reordering timer.

For example, as shown in FIG. 13 , the first entity receives PDU1 , PDU3 , PDU5 and PDU6 (that is, T=4). Specifically, when the first entity receives PDU1, since the sequence number of PDU1 is equal to the lower limit of the receiving window, after receiving PDU1, the first entity directly sends the data packet contained in PDU1 to the decoder for processing. According to the received PDU3, the first entity can know that PDU2 has not been received, and according to the received PDU5, can know that PDU4 has not been received, that is, it thinks that PDU3, PDU5 and PDU6 are all received out of order. Therefore, the first entity After receiving PDU5, the entity starts the reordering timer. Since the reordering timer has been started, the first entity will not send the data packets contained in PDU3, PDU5, and PDU6 arriving out of order to the decoder for processing. Only when the reordering timer expires, the first entity will The data packets contained in PDU3, PDU5 and PDU6 will be sent to the decoder for processing.

Optionally, the method 1200 further includes: after the reordering timer expires, the first entity slides the lower limit of the receiving window. It should be understood that the above T PDUs are received within the receiving window.

Exemplarily, the first entity slides the lower limit of the receiving window to the sequence number of the first PDU that has not yet been delivered to the decoder. For example, the sending device sends PDU1 (SN=1), PDU2 (SN=2), PDU3 (SN=3), and PDU4 (SN=4), wherein PDU1 to PDU4 are obtained by network coding SDU1 to SDU3 . When the first entity receives PDU1, PDU3 and PDU4, the first entity sends the data packet contained in PDU1 to the decoder for processing, and after the reordering timer expires, the data packet contained in PDU3 and the data contained in PDU4 The packets are sent to the decoder for processing. If the first entity does not receive other PDUs before the reordering timer expires, the first entity slides the lower limit of the receiving window to 5 after the reordering timer expires (that is, PDU5 (SN=5) not delivered to the decoder ) of the serial number). If the first entity receives PDU5, PDU6 (SN=6) and PDU8 (SN=8) before the reordering timer expires, then after the timer expires, the first entity sends the data packets contained in PDU3 and the packets contained in PDU4 The data packet, the data packet contained in PDU5 and the data packet contained in PDU6 are submitted to the decoder for decoding processing, and the lower limit of the receiving window is slid to 8 (that is, the sequence number of PDU8 not submitted to the decoder).

Exemplarily, the first entity is a PDCP entity, and the receiving window is a PDCP receiving window.

In another example, the first entity is an RLC entity, and the receiving window is an RLC receiving window.

It should be noted that, in S1220, after the first entity restores the original data according to the T data packets, the original data may be submitted through the first delivery method or the second delivery method in the method 700 . Specifically, after the first entity restores an original data according to the system packets or original data packets in the T data packets, it may submit the restored original data through the first delivery method in method 700; or, the first entity according to After performing network decoding on the T data packets to restore M original data, the original data may be submitted through the second delivery method in method 700 .

In this embodiment of the application, if there are out-of-order PDUs among the T PDUs received by the first entity, the first entity will include the out-of-order PDUs among the T PDUs after the reordering timer expires. The data packets, and at least one of the data packets contained in all PDUs received before the out-of-order PDUs and not yet delivered to the decoder are sent to the decoder for decoding processing, which is conducive to the realization of Sequenced original data is obtained after network decoding of the data packets. In addition, changes to the existing method of sliding the lower limit of the receiving window by timeout of the reordering timer are avoided.

It should be understood that the various embodiments described herein may be independent solutions, or may be combined according to internal logic, and these solutions all fall within the protection scope of the present application.

The method for transmitting data provided by the present application has been described in detail above, and the communication device provided by the present application will be introduced below.

Referring to FIG. 14 , FIG. 14 is a schematic block diagram of a communication device provided by the present application. As shown in FIG. 14 , a communication device 1400 includes a transceiver unit 1410 and a processing unit 1420 .

The transceiver unit 1410 is configured to receive T data packets, the T data packets belong to K data packets, wherein the K data packets include N system packets and (K-N) redundant packets, and the K data packets are related to N original data packets satisfy the coding relationship, or, the K data packets include N original data packets and (K-N) redundant packets, and the redundant packets in the K data packets and the N original data packets satisfy the coding relationship ;The N original data packets are obtained by performing one or more of the following processing on the M original data: segmentation, concatenation or filling, T, K, N and M are positive integers, K is greater than T, and K is greater than N ;

The transceiver unit 1410 is further configured to submit original data in a first delivery mode or a second delivery mode; the first delivery mode includes: performing network decoding operations on the T data packets to recover one of the M original data For original data, submit the original data through the first entity; the second delivery method includes: when performing network decoding operations on the T data packets to recover the M original data, submit the original data through the first entity M raw data.

Optionally, in an embodiment, the transceiving unit 1410 is further configured to receive first indication information from the access network device, where the first indication information is used for a delivery mode used by the terminal device, and the delivery mode includes The first delivery method or the second delivery method.

Optionally, in one embodiment, the network decoding operation is implemented by the SDAP layer or the NC layer, the NC layer is located between the PDCP layer and the SDAP layer, and the processing unit 1420 is configured to enable the out-of-order delivery function of the PDCP entity .

Optionally, in one embodiment, the network decoding operation is implemented by the PDCP layer, and the processing unit 1420 is configured to disable the reordering function of the PDCP entity.

Optionally, in one embodiment, the network decoding operation is implemented by the PDCP layer, and the transceiver unit 1410 is also configured to: when the PDCP reordering timer is on, obtain all the parts of the T data packets and send them to To the decoder for decoding processing, wherein the start of the PDCP reordering timer is triggered by receiving the PDCP PDU with the largest SN among the PDCP PDUs that are discontinuous with the SN of the previous PDCP PDU among the T PDCP PDUs. A PDCP PDU corresponds to the T data packets, and the part of the T data packets includes data packets other than the data packets whose sequence numbers are continuous with the sequence numbers of the data packets of the lower limit of the PDCP receiving window. The T PDCP PDUs are in the Received within the PDCP receive window.

Optionally, in one embodiment, after the network decoding operation is performed on the T data packets to restore the M original data, the processing unit 1420 is further configured to stop the PDCP reordering timer.

Optionally, in an embodiment, after the T data packets are decoded by the network to recover the M original data, the processing unit 1420 is further configured to slide the lower limit of the PDCP receiving window.

Optionally, in one embodiment, the network decoding operation is implemented by the PDCP layer, and the transceiver unit 1410 is also configured to: when the PDCP reordering timer expires, send at least one of the following data packets to the decoder for Decoding processing: among the T PDCP PDUs, the data packets contained in the out-of-order PDCP PDUs, and the data packets contained in all PDCP PDUs received before the out-of-order PDCP PDUs and not yet delivered to the decoder, among which , the start of the PDCP reordering timer is triggered by the PDCP PDU with the largest SN among the PDCP PDUs that are discontinuous with the SN of the previous PDCP PDU among the T PDCP PDUs, and the T PDCP PDUs and the T data packets correspond.

In addition, in various embodiments, the processing unit 1420 is configured to perform processing and/or operations implemented internally by the sending end except for the sending and receiving actions. The transceiver unit 1410 is configured to perform receiving and/or sending actions.

Referring to FIG. 15 , FIG. 15 is a schematic structural diagram of a communication device provided by the present application. As shown in FIG. 15 , the communication device 1500 includes: one or more processors 1510 , one or more memories 1520 and one or more communication interfaces 1530 . The processor 1510 is used to control the communication interface 1530 to send and receive signals, the memory 1520 is used to store a computer program, and the processor 1510 is used to call and run the computer program from the memory 1520, so that the communication device 1500 executes the method described in each method embodiment of the present application. Processing and/or operations performed by the sender.

For example, the processor 1510 may have the functions of the processing unit 1420 shown in FIG. 14 , and the communication interface 1530 may have the functions of the transceiver unit 1410 shown in FIG. 14 .

In an implementation manner, the communication apparatus 1500 may be the receiving device in the method embodiment. In such an implementation, communication interface 1530 may be a transceiver. Transceivers may include receivers and/or transmitters. Optionally, the processor 1510 may be a baseband device, and the communication interface 1530 may be a radio frequency device.

In another implementation, the communication apparatus 1500 may be a chip (or chip system) installed in a receiving device. In this implementation, the communication interface 1530 may be an interface circuit or an input/output interface.

Wherein, the dotted box behind the device (for example, processor, memory or communication interface) in FIG. 15 indicates that there may be more than one device.

Optionally, the memory and the processor in the foregoing apparatus embodiments may be physically independent units, or the memory and the processor may also be integrated together, which is not limited herein.

In addition, the present application also provides a computer-readable storage medium, where computer instructions are stored in the computer-readable storage medium, and when the computer instructions are run on the computer, the operations performed by the receiving device in each method embodiment of the present application are and/or processing is performed.

The present application also provides a computer-readable storage medium, where computer instructions are stored in the computer-readable storage medium, and when the computer instructions are run on the computer, the operations performed by the first entity in each method embodiment of the present application and /or processing is performed.

In addition, the present application also provides a computer program product. The computer program product includes computer program codes or instructions. When the computer program codes or instructions are run on the computer, the operations performed by the receiving device in each method embodiment of the present application and/or or processing is performed.

The present application also provides a computer program product. The computer program product includes computer program codes or instructions. When the computer program codes or instructions are run on the computer, the operations performed by the first entity in each method embodiment of the present application and/or Processing is performed.

In addition, the present application also provides a chip, the chip includes a processor, the memory for storing the computer program is set independently of the chip, the processor is used for executing the computer program stored in the memory, so that the sending end of the chip is installed Execute the operations and/or processing performed by the receiving device in any one method embodiment.

Further, the chip may further include a communication interface. The communication interface may be an input/output interface, or an interface circuit or the like. Further, the chip may further include the memory.

The present application also provides a chip, the chip includes a processor, a memory for storing computer programs is provided independently of the chip, and the processor is used for executing the computer programs stored in the memory, so that the receiving end installed with the chip executes any Operations and/or processing performed by a first entity in a method embodiment.

Optionally, there may be one or more processors, one or more memories, and one or more memories.

In addition, the present application also provides a communication device (for example, it may be a chip or a chip system), including a processor and a communication interface, the communication interface is used to receive (or be referred to as input) data and/or information, and will receive The received data and/or information are transmitted to the processor, and the processor processes the data and/or information, and the communication interface is also used to output (or be referred to as output) the data and/or processed by the processor or information, so that the operation and/or processing performed by the receiving device in any one method embodiment is performed.

The present application also provides a communication device (for example, it may be a chip or a chip system), including a processor and a communication interface, the communication interface is used to receive (or be referred to as input) data and/or information, and the received The data and/or information are transmitted to the processor, and the processor processes the data and/or information, and the communication interface is also used to output (or be referred to as output) the data and/or information processed by the processor , so that the operation and/or processing performed by the first entity in any one method embodiment is performed.

In addition, the present application also provides a communication device, including at least one processor, the at least one processor is coupled to at least one memory, and the at least one processor is configured to execute computer programs or instructions stored in the at least one memory, The communication apparatus is made to perform the operation and/or processing performed by the receiving device in any one method embodiment.

The present application also provides a communication device, including at least one processor, the at least one processor is coupled to at least one memory, and the at least one processor is used to execute the computer program or instruction stored in the at least one memory, so that the The communication device executes the operation and/or processing performed by the first entity in any one method embodiment.

In addition, the present application also provides a communication device, including a processor and a memory. Optionally, a transceiver may also be included. Wherein, the memory is used to store computer programs, and the processor is used to run the computer programs stored in the memory, and control the transceiver to send and receive signals, so that the communication device performs the operation and/or processing performed by the receiving device in any method embodiment.

The present application also provides a communication device, including a processor and a memory. Optionally, a transceiver may also be included. Wherein, the memory is used to store computer programs, and the processor is used to run the computer programs stored in the memory, and control the transceiver to send and receive signals, so that the communication device performs the operation and/or processing performed by the first entity in any one method embodiment.

The memory in the embodiments of the present application may be a volatile memory or a nonvolatile memory, or may include both volatile and nonvolatile memories. Among them, the non-volatile memory can be read-only memory (read-only memory, ROM), programmable read-only memory (programmable ROM, PROM), erasable programmable read-only memory (erasable PROM, EPROM), electrically programmable Erases programmable read-only memory (electrically EPROM, EEPROM) or flash memory. The volatile memory can be random access memory (RAM), which acts as external cache memory. By way of illustration and not limitation, many forms of RAM are available such as static random access memory (static RAM, SRAM), dynamic random access memory (dynamic RAM, DRAM), synchronous dynamic random access memory (synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (double data rate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous connection dynamic random access memory (synchlink DRAM, SLDRAM ) and direct memory bus random access memory (direct rambus RAM, DRRAM). It should be noted that the memory of the systems and methods described herein is intended to include, but not be limited to, these and any other suitable types of memory.

The methods provided in the foregoing embodiments may be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it may be implemented in whole or in part in the form of a computer program product. The computer program product may comprise one or more computer instructions. When the computer program instructions are loaded and executed on the computer, the processes or functions according to the embodiments of the present application will be generated in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable devices. The computer instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website, computer, server or data center Transmission to another website site, computer, server, or data center by wired (eg, coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (eg, infrared, wireless, microwave, etc.) means. The computer-readable storage medium may be any available medium that can be accessed by a computer, or a data storage device such as a server or a data center integrated with one or more available media.

In the embodiments of the present application, "at least one" means one or more, and "multiple" means two or more. "And/or" describes the association relationship of associated objects, indicating that there may be three types of relationships, for example, A and/or B, which can mean: A exists alone, A and B exist simultaneously, and B exists alone, where A, B can be singular or plural. The character "/" generally indicates that the contextual objects are an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one item (unit) of a, b, or c may represent: a, b, c; a and b; a and c; b and c; or a and b and c. Where a, b, c can be single or multiple.

Those skilled in the art can appreciate that the units and algorithm steps of the examples described in conjunction with the embodiments disclosed herein can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are executed by hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art may use different methods to implement the described functions for each specific application, but such implementation should not be regarded as exceeding the scope of the present application.

Those skilled in the art can clearly understand that for the convenience and brevity of the description, the specific working process of the above-described system, device and unit can refer to the corresponding process in the foregoing method embodiment, which will not be repeated here.

In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods may be implemented in other ways. For example, the device embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or May be integrated into another system, or some features may be ignored, or not implemented. In another point, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces, and the indirect coupling or communication connection of devices or units may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, each unit may exist separately physically, or two or more units may be integrated into one unit.

If the functions described above are realized in the form of software function units 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 present application is essentially or the part that contributes to the prior art or the 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 Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (read-only memory, ROM), random access memory (random access memory, RAM), magnetic disk or optical disc, etc., which can store program codes. .

The above is only a specific implementation of the application, but the scope of protection of the application is not limited thereto. Anyone familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the application. Should be covered within the protection scope of this application. Therefore, the protection scope of the present application should be determined by the protection scope of the claims.

Claims

A method for transmitting data, characterized in that the method is applied to a receiving device, and the method includes:

T data packets are received by the first entity, and the T data packets belong to K data packets, wherein the K data packets include N system packets and (K-N) redundant packets, and the K data packets Satisfy the encoding relationship with N original data packets; or, the K data packets include N original data packets and (K-N) redundant packets, and the redundant packets in the K data packets are related to the N original data packets Satisfy the encoding relationship; the N original data packets are obtained by performing one or more of the following processing on the M original data: segmentation, concatenation or filling, T, K, N and M are positive integers, and K is greater than T , K is greater than N;

submitting the original data through the first entity by the first delivery method or the second delivery method;

The first delivery method includes: when performing a network decoding operation on the T data packets to restore one original data among the M original data, submitting the one original data through the first entity;

The second delivery method includes: when performing a network decoding operation on the T data packets to restore the M original data, submitting the M original data through the first entity, where T is not less than N.
The method according to claim 1, wherein the receiving device is a terminal device, and the method further comprises:

Receive first indication information from the access network device, where the first indication information is used to indicate the delivery mode used by the terminal device, where the delivery mode includes the first delivery mode or the second delivery mode.
The method according to claim 1 or 2, wherein the network decoding operation is implemented by a service data adaptation protocol SDAP layer or a network coding NC layer, and the NC layer is located between the packet data convergence protocol PDCP layer and the Between SDAP layers, the method also includes:

Enable the out-of-order delivery function of PDCP entities.
The method according to claim 1 or 2, wherein the network decoding operation is implemented by a PDCP layer, and the method further comprises:

Disable the reordering function of PDCP entities.
The method according to claim 1 or 2, wherein the first entity is a PDCP entity, and the network decoding operation is implemented by a PDCP layer, and the method further comprises:

When the PDCP reordering timer is on, the first entity sends all or part of the T data packets to the decoder for decoding processing, wherein the PDCP reordering timer is started by Among the received T PDCP protocol data unit PDUs, the PDCP PDU with the largest SN among the PDCP PDUs whose sequence number SN is discontinuous with the previous PDCP PDU is triggered, and the T PDCP PDUs correspond to the T data packets, so Part of the T data packets includes data packets other than data packets whose sequence numbers are continuous with the sequence number of the data packet of the lower limit of the PDCP receiving window, and the T PDCP PDUs are received within the PDCP receiving window.
The method according to claim 5, wherein the method further comprises:

After the network decoding operation is performed on the T data packets to recover the M original data, the PDCP reordering timer is stopped by the first entity.
The method according to claim 5 or 6, wherein the method further comprises:

After the network decoding operation is performed on the T data packets to restore the M original data, the lower limit of the PDCP receiving window is slid by the first entity.
The method according to claim 1 or 2, wherein the first entity is a PDCP entity, and the network decoding operation is implemented by a PDCP layer, and the method further comprises:

When the PDCP reordering timer expires, the first entity sends at least one of the following data packets to the decoder for decoding processing: the data packets contained in the PDCP PDUs arriving out of order among the T PDCP PDUs, The data packets contained in all PDCP PDUs received before the PDCP PDUs arriving in order and not yet delivered to the decoder, wherein the start of the PDCP reordering timer is determined by the T PDCP PDUs and the previous PDCP PDU The PDCP PDU with the largest SN among the PDCP PDUs with discontinuous SNs is triggered, and the T PDCP PDUs correspond to the T data packets.
The method according to claim 1 or 2, wherein the first entity is a Radio Link Control (RLC) entity, and the network decoding operation is implemented by an RLC layer, and the method further comprises:

When the RLC reordering timer is on, the first entity sends all or part of the T data packets to the decoder for decoding processing, wherein the RLC reordering timer is started by The RLC PDU with the largest SN among the RLC PDUs whose SNs are discontinuous between T RLC PDUs and the previous RLC PDU is triggered, the T RLC PDUs correspond to the T data packets, and the part of the T data packets Including data packets other than data packets whose sequence number is continuous with the sequence number of the data packet of the lower limit of the RLC receiving window, the T RLC PDUs are received within the RLC receiving window.
The method according to claim 9, characterized in that the method further comprises:

After performing the network decoding operation on the T data packets to restore the M original data, the first entity stops the RLC reordering timer.
The method according to claim 9, characterized in that the method further comprises:

After performing the network decoding operation on the T data packets to restore the M original data, the lower limit of the RLC receiving window is slid by the first entity.
The method according to claim 1 or 2, wherein the first entity is an RLC entity, and the network decoding operation is implemented by an RLC layer, and the method further comprises:

When the RLC reordering timer expires, the first entity sends at least one of the following data packets to the decoder for decoding processing: the data packets contained in the RLC PDUs that arrive out of sequence among the T RLC PDUs, The data packets contained in all RLC PDUs received before the RLC PDUs arriving in order and not yet delivered to the decoder, wherein the opening of the RLC reordering timer is determined by the connection between the T RLC PDUs and the previous RLC PDU The RLC PDU with the largest SN among the RLC PDUs with discontinuous SNs is triggered, and the T RLC PDUs correspond to the T data packets.
A data processing method, characterized in that the method is applied to a first entity, and the method includes:

Receive T data packets, the T data packets belong to K data packets, wherein, the K data packets include N system packets and (K-N) redundant packets, and the K data packets are related to the N original The data packets satisfy the coding relationship, or, the K data packets include N original data packets and (K-N) redundant packets, and the redundant packets in the K data packets and the N original data packets satisfy the coding relationship; The N original data packets are obtained by performing one or more of the following processing on the M original data: segmentation, concatenation or filling, T, K, N and M are positive integers, K is greater than T, and K is greater than N ;

When the reordering timer is on, part or all of the T data packets are sent to the decoder for decoding processing, wherein the reordering timer is started by T protocol data units PDU and The PDU whose sequence number SN of the previous PDU is not continuous is triggered by the PDU with the largest SN. The T PDUs correspond to the T data packets. For data packets other than data packets with consecutive sequence numbers, the T PDUs are received within the receiving window.
The method according to claim 13, wherein the first entity is a Packet Data Convergence Protocol (PDCP) entity, the reordering timer is a PDCP reordering timer, the receiving window is a PDCP receiving window, and the Methods also include:

When the network decoding operation is performed on the T data packets to restore the M original data, the PDCP reordering timer is stopped.
The method according to claim 13, wherein the first entity is a PDCP entity, the reordering timer is a PDCP reordering timer, and the receiving window is a PDCP receiving window, the method further comprising:

After the network decoding operation is performed on the T data packets to recover the M original data, the lower limit of the PDCP receiving window is slid.
The method according to claim 13, wherein the first entity is a radio link control (RLC) entity, the reordering timer is an RLC reordering timer, the receiving window is an RLC receiving window, and the Methods also include:

After the network decoding operation is performed on the T data packets to restore the M original data, the RLC reordering timer is stopped.
The method according to claim 13, wherein the first entity is an RLC entity, the reordering timer is an RLC reordering timer, and the receiving window is an RLC receiving window, and the method further comprises:

After recovering the M original data from the T data packets, slide the lower limit of the RLC receiving window.
A data processing method, characterized in that the method is applied to a first entity, and the method includes:

Receive T data packets, the T data packets belong to K data packets, wherein, the K data packets include N system packets and (K-N) redundant packets, and the K data packets are related to the N original The data packets satisfy the coding relationship, or, the K data packets include N original data packets and (K-N) redundant packets, and the redundant packets in the K data packets and the N original data packets satisfy the coding relationship; The N original data packets are obtained by performing one or more of the following processing on the M original data: segmentation, concatenation or filling, T, K, N and M are positive integers, K is greater than T, and K is greater than N ;

When the reordering timer expires, send at least one of the following data packets to the decoder for decoding processing: the data packets contained in the PDUs that arrive out of order among the T protocol data units PDUs, and the packets received before the PDUs that arrive out of order The data packets contained in all PDUs that have arrived and have not yet been delivered to the decoder, wherein the reordering timer is started by the SN of the PDU that is not continuous with the sequence number SN of the previous PDU among the T PDUs PDU triggers, the T PDUs correspond to the T data packets.
The method according to claim 18, wherein the first entity is a Packet Data Convergence Protocol (PDCP) entity, and the reordering timer is a PDCP reordering timer
The method according to claim 18, wherein the first entity is a Radio Link Control (RLC) entity, and the reordering timer is an RLC reordering timer.
A communication device, characterized in that it includes at least one processor, the at least one processor is coupled to at least one memory, and the at least one processor is configured to execute a computer program or instructions stored in the at least one memory, so that The communication device executes the method according to any one of claims 1-12.
A communication device, characterized in that it includes at least one processor, the at least one processor is coupled to at least one memory, and the at least one processor is configured to execute a computer program or instructions stored in the at least one memory, so that The communication device executes the method according to any one of claims 13 to 17, or causes the communication device to execute the method according to any one of claims 18 to 20.
A chip, characterized in that it includes a processor and a communication interface, the communication interface is used to receive data and/or information, and transmit the received data and/or information to the processor, and the processor processes Said data and/or information, to carry out the method according to any one of claims 1 to 12, or to carry out the method according to any one of claims 13 to 17, or to carry out the method according to claim 18 The method described in any one of to 20.
A computer-readable storage medium, characterized in that computer instructions are stored in the computer-readable storage medium, and when the computer instructions are run on a computer, the method according to any one of claims 1 to 12 is executed Realize, or cause the method as described in any one of claims 13 to 17 to be realized, or cause the method as described in any one of claims 18 to 20 to be realized.
A computer program product, characterized in that the computer program product comprises computer program code, and when the computer program code is run on a computer, the method according to any one of claims 1 to 12 is implemented, Or causing the method according to any one of claims 13 to 17 to be implemented, or causing the method according to any one of claims 18 to 20 to be implemented.