CN115278769A - Data transmission method, device and system and readable storage medium - Google Patents

Abstract

The present application provides a network coding method and device. The method includes: the sending end encodes the original data on multiple transmission opportunities, and generates a set of first-type check packets or encoded packets, and the sending timing of this group of first-type check packets is relative to the number of the multiple transmission opportunities. The last transmission opportunity can be delayed by several transmission opportunities, which can solve the problem of burst errors in the channel, thereby ensuring transmission reliability. Further, it also includes: the sending end encodes the original data on a transmission opportunity and/or the first type of verification packets on the transmission opportunity to generate a group of second type of verification packets. The second type of check packet is sent at the transmission opportunity or delayed for several transmission opportunities, which can solve the problem of random errors in the channel and further ensure transmission reliability. The present application can be applied to extended reality XR services, low latency and/or uplink large capacity scenarios.

Description

Data transmission method, device, system and readable storage medium

technical field

The present application relates to the technical field of communication, and in particular to a communication method, device and system.

Background technique

In wireless communication networks, network coding technology provides a transmission mechanism that takes both time delay and spectrum efficiency into consideration. In network coding technology, the sending end encodes multiple original data to obtain and send the encoded data, and sends indication information such as encoding coefficients corresponding to the encoded data; the receiving end can decode the encoded data according to the encoding coefficients to obtain the original data . Through network coding, the system can maximize the throughput of the entire network and effectively improve the transmission performance of the wireless communication system.

However, due to factors such as fading caused by mobility or interference caused by other users, continuous errors occur in the decoded code block (CB) at the receiving end.

How to avoid the impact of continuous errors in the transmission process on the communication quality is an urgent problem to be solved.

Contents of the invention

Embodiments of the present application provide a data transmission method and device for effectively improving transmission performance of a wireless communication system.

In the first aspect, the embodiment of the present application provides a data transmission method. The method may be executed by a terminal or a network device, or may be executed by a component (such as a processor, a chip, or a chip system, etc.) of the terminal or network device, including: Encoding the M first original data to obtain N first encoded data, where M is a positive integer and N is a positive integer; sending the M first original data and the N first encoded data, wherein, for transmitting the The number of transmission opportunities for the M first original data is P, and includes the first transmission opportunity, and the transmission opportunities for transmitting the N first encoded data are larger than the P transmission opportunities for transmitting the M first original data The transmission opportunity is delayed by X transmission opportunities, X is a non-negative integer, P is a positive integer and satisfies P≥2.

The encoded data is obtained by encoding the original data on at least two transmission opportunities, so that the M first original data used for encoding can occupy at least two transmission opportunities, and the first encoded data and the M first original data At least one is not transmitted on the same transmission opportunity, which can solve the problem of burst errors in the channel, thereby ensuring transmission reliability.

Optionally, the sending end acquires relevant parameters of the first encoded data. Wherein, the relevant parameters of the first coded data include the coded depth M, the ratio R of the first coded data or the number N of the first coded data or the code rate R′, the transmission opportunity of the first coded data, grouping information and other parameters. one or more. In this application, the coding depth M means that M original data are encoded, and M original data are sent on P transmission opportunities, where P is a positive integer not less than 2. The coded depth may also be referred to as coded length, convolutional depth, coded block size, coded window size, or sliding window size, etc. The number of first coded data is the number of a group of first coded data generated by encoding M original data. The number of first coded data in different groups can be determined separately. The number of first coded data in different groups may be different or the same. The ratio of the first encoded data is the ratio of the total number N of a set of first encoded data generated by encoding M first original data to the corresponding total number M of the first original data, and the ratio R of the first encoded data is also It may be a ratio of the total number N of a set of first encoded data generated by encoding M pieces of first original data to the sum of the corresponding total number M of first original data plus the total number N of first encoded data. The code rate R' is the ratio of the number M of the first original data to the sum of the total number N of the first encoded data generated by encoding the first original data plus the number M of the first original data, The code rate R' may also be the ratio of the number M of the first original data to the total number N of a set of first encoded data generated by encoding the M first original data. The sending end encodes the original data according to the relevant parameters of the first coded data to obtain coded data, which can solve the problem of burst errors in the channel, thereby ensuring transmission reliability. In the case of configurable parameters, the flexibility of coding can be further increased, so as to adapt to channel conditions and improve transmission reliability and efficiency.

Optionally, the sending end obtains the relevant parameters of the first encoded data, which means that the network coding layer of the sending end obtains the parameters related to the first encoded data. The network coding layer refers to a protocol layer having a network coding function, and the network coding layer may be a radio resource control (Radio Resource Control, RRC) layer, a packet data convergence layer protocol (Packet Data Convergence Protocol, PDCP) layer, a backhaul adaptation protocol ( Protocol layers such as a Backhaul Adaptation Protocol (BAP) layer, an RLC layer, a MAC layer, or a physical layer (Physical Layer, PHY). The network coding layer can also be a new protocol layer other than the MAC layer, the RLC layer, the BAP layer, and the PDCP layer, and can be a protocol layer added above the PDCP layer, which has a network coding function, or, Add a network coding layer above the BAP layer, or add a network coding layer between the PDCP layer and the RLC layer, or add a network coding layer between the RLC layer and the MAC layer, or, add a network coding layer between the MAC layer and the PHY layer A network coding layer is added between them.

Optionally, for the acquisition of related parameters of the first encoded data, the acquisition method of the sending end may be predefined, or it may be semi-statically configured by the network side device to the sending end, such as semi-static configuration or dynamic configuration, It can also be a custom one preset by the sending end device, for example, one or more preset or configured according to system requirements, actual communication status, or protocol reservation. The acquisition methods of different encoding parameters may be the same or different. For example, the coding depth M is semi-statically configured by the network side device, the ratio or number of the first coded data is determined by the sender device according to the actual communication status, and the transmission opportunity of the first coded data is predefined by the sender according to the transmission rules determined, where the transmission rule may be specified by the protocol.

Optionally, the first transmission opportunity is also used to transmit other original data except the first original data. Through this method, network coding can be implemented for different packet data, which can solve the problem of burst errors in the channel while reducing the complexity of coding and decoding to ensure transmission reliability.

With reference to the first aspect, in some implementations of the first aspect, the network coding layer at the sending end performs network coding on the obtained M first original data, and obtains a set of first original data corresponding to the M first original data. - Encoded data. The number or proportion of the first coded data to be generated by network coding is obtained according to the relevant parameters of the above-mentioned first coded data. Wherein, the coding pattern adopted by the coding can be a Maximum Distance Separable (MDS) code, a random linear network coding (RLNC) code, a linear network coding (LNC) code, a definite One of code types such as linear network coding, Batched Sparse (BATS) code, block code, LT (Luby Transform) code, rateless code, RS (Reed-solomon) code, etc. Different code patterns correspond to different encoding methods. Through this implementation mode, the encoded data obtained by encoding the original data is transmitted at different transmission opportunities, which can solve the problem of burst errors in the channel, thereby ensuring transmission reliability.

的原始数据，其中

(2)对于第g(g＝mod(L,G), mod(L,G)+1,…,G)个分组，包含编号

的原始数据， 其中

通过该实施方式，发送端针对多个传输机会上的相同组号的原始数据 进行编码，从而可以解决信道出现突发错误的问题，提升传输可靠性；并且通过分组进行编 码还可以减少编解码的复杂度。With reference to the first aspect, in some implementation manners of the first aspect, the sending end obtains grouping information, and according to the grouping information, the sending end may group the original data on each transmission opportunity. The group information generally includes the number of groups G, that is, the original data on one transmission opportunity is divided into G groups, and the original data of different groups can be obtained. The original data of different groups can have different group numbers or identifications. For example, different groups can be identified as 1~G group number. Since the number of original data transmitted by each transmission opportunity can be fixed or dynamically changed, the number of original data of the same group number in each transmission opportunity may be equal or may not be equal. Moreover, the numbers of original data in different packets within the same transmission opportunity can be equal or unequal. In the case of grouping the original data on each transmission opportunity, the above-mentioned M first original data refers to a group of original data with the same group number, and encoding the above-mentioned M first original data may refer to a group of original data with The M pieces of first original data with the same group number are encoded. For example, when grouping, the difference in the number of original data contained in different groups does not exceed 1. Specifically, grouping can be performed according to the following rules: if the number of groups G is equal to the number L of original data on one transmission opportunity, then one group contains one original data, If the number of groups G is not equal to L, the number of original data in each group can be confirmed by the following process: (1) For the gth (g=0,1,...,mod(L,G)-1) group, containing numbered

the original data of

(2) For the g(g=mod(L,G), mod(L,G)+1,...,G)th grouping, include the number

the original data of , where

Through this implementation, the sender encodes the original data of the same group number on multiple transmission opportunities, so that the problem of burst errors in the channel can be solved, and the transmission reliability can be improved; and encoding by grouping can also reduce the cost of encoding and decoding. the complexity.

Optionally, sending the above M pieces of first original data and the above N pieces of first coded data, where the number of transmission opportunities for transmitting the above M pieces of first original data is P and includes the first transmission opportunity, and The transmission opportunities used to transmit the above N first encoded data are delayed by X transmission opportunities compared with the P transmission opportunities used to transmit the above M first original data, X is a non-negative integer, P is a positive integer and satisfies P≥2 .

Optionally, the above-mentioned N pieces of first coded data are coded data obtained by encoding with a generator matrix including an identity sub-matrix, wherein the coded data obtained through the identity sub-matrix corresponds to the M pieces of first original data sent above, The remaining coded data correspond to the N pieces of first coded data sent above.

Optionally, the above-mentioned first transmission opportunity is also used to transmit other original data except the above-mentioned first original data. In a possible implementation manner, the group number of the first raw data is different from the group numbers of the other raw data.

Optionally, a possible implementation in which the transmission opportunities for transmitting the above-mentioned N pieces of first encoded data is delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the above-mentioned M pieces of first original data includes the following A sort of:

The transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at least X transmission opportunities than the first transmission opportunity of the P transmission opportunities for transmitting the above-mentioned M first original data, and X≥P-1 ;

The last transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at most X transmission opportunities than the first transmission opportunity of the P transmission opportunities for transmitting the above-mentioned M first original data, and X≥P -1;

The transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at least X transmission opportunities than the last transmission opportunity among the P transmission opportunities for transmitting the above-mentioned M first original data; or

The last transmission opportunity for transmitting the N first encoded data is delayed by at most X transmission opportunities than the last transmission opportunity of the P transmission opportunities for transmitting the M first original data.

Optionally, in a possible implementation manner in which the transmission opportunities for transmitting the N first encoded data are delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the M first original data, the method further includes : The transmission opportunity for transmitting the above-mentioned N first coded data is delayed by no more than Y transmission opportunities than the P transmission opportunities for transmitting the above-mentioned M first original data, and Y is a non-negative integer. The method includes one of the following:

The transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity of the P transmission opportunities for transmitting the above-mentioned M first original data, And satisfy Y≥X≥P-1;

The transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at least X transmission opportunities than the first transmission opportunity of the P transmission opportunities for transmitting the above-mentioned M first original data, and is delayed by at least X transmission opportunities than the first one of the P transmission opportunities for transmitting the above-mentioned M first original data. The last transmission opportunity among the P transmission opportunities of the first raw data is delayed by at most Y transmission opportunities, and Y≥(X-P+1) and X≥P-1 are satisfied;

The transmission opportunity for transmitting the above-mentioned N first coded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the last transmission opportunity among the P transmission opportunities for transmitting the above-mentioned M first original data, and satisfy Y ≥ X; or

The transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at least X transmission opportunities than the last transmission opportunity among the P transmission opportunities for transmitting the above-mentioned M first original data, and is delayed by at least X transmission opportunities than the last one of the P transmission opportunities for transmitting the above-mentioned M first original data. The first transmission opportunity among the P transmission opportunities of an original data is delayed by at most Y transmission opportunities, and Y≧X+P−1 is satisfied.

With reference to the first aspect, in some embodiments of the first aspect, the above-mentioned N pieces of first coded data include the first coded data A, the third transmission opportunity is used to transmit the first coded data A, and the third transmission opportunity is also used For transmitting one or more of encoded data other than the first encoded data or raw data other than the first raw data, the method further comprises:

Encoding the above-mentioned other coded data, the above-mentioned first original data, one or more items of the above-mentioned other original data, and the above-mentioned first coded data A on the third transmission opportunity to obtain the second coded data. Through this embodiment, the sending end can also generate a set of second encoded data by encoding the original data packet on a transmission opportunity and/or the first encoded data on the current transmission opportunity, which can further solve the problem of random errors in the channel, Further improve transmission reliability.

Since there are both the first coded data and the second coded data, this coding method can be called horizontal and vertical coding.

Optionally, the sending end may also acquire the relevant parameters of the above-mentioned second coded data, and the relevant parameters of the second coded data include the ratio r of the second coded data or the number n of the second coded data or the code rate r′, the second One or more of the parameters such as the transmission timing of the encoded data. For the meaning and acquisition method of the parameters corresponding to the second coded data, please refer to the description of the relevant parameters of the first coded data above, which will not be repeated here.

Optionally, the generation method of the above-mentioned second coded data, that is, the coding method, includes code types such as MDS code, RLNC code, LNC code, BATS code, determined linear network code, block code, LT code, rateless code, or RS code One or more of them, and which code pattern to use specifically may be based on system design requirements or protocol regulations or based on configuration, and details are not described here.

Optionally, the above-mentioned third transmission opportunity is also used to transmit the above-mentioned second coded data. In this manner, the second coded data can be transmitted on the third transmission opportunity, which can solve the problem of random errors in the channel and ensure transmission reliability.

Optionally, the transmission opportunity for transmitting the second coded data is delayed by Z transmission opportunities compared with the third transmission opportunity, where Z is a non-negative integer. In a possible implementation manner, the sending end sends the second encoded data delayed by Z transmission opportunities compared with the third transmission opportunity according to the acquired related parameters of the second encoded data. In this way, the sending end delays several transmission opportunities to send the second coded data, which can solve the problem of burst errors in the channel, thereby ensuring transmission reliability.

With reference to the first aspect, in some implementations of the first aspect, indication information is sent or received; the indication information is used to indicate one or more of the following:

The sliding window information of the above-mentioned M first original data, the above-mentioned sliding window information indicates the M first original data corresponding to the above-mentioned N first encoded data; or

The group numbers corresponding to the above M pieces of first raw data. In this way, the encoded data is decoded according to the indication information to obtain the original data, so that the receiving end can know the sliding window and/or group number without additional calculation, which reduces the decoding complexity.

Optionally, the sliding window information may indicate identification information of the M pieces of first original data corresponding to the above-mentioned N pieces of first encoded data for the above-mentioned sliding window information. By sending or receiving instruction information, the original data can be encoded or decoded according to the instruction information, which can solve the problem of random errors in the channel and further improve transmission reliability.

Optionally, the above indication information is encapsulated in the data packet header of the first encoded data, that is, the data packet header of the first encoded data carries the above indication information. Optionally, the above indication information may be partially encapsulated in the data packet header of the above first encoded data, and other information may be indicated by other information (such as signaling mode, semi-static indication, etc.).

With reference to the first aspect, in some embodiments of the first aspect, the sending end sends indication information to the receiving end, and the receiving end can know which data packets to decode together according to the indication information. One kind of indication information indicates the sliding window information, which can be the position of the window head and window tail, that is, the minimum SN number of the original data corresponding to the encoded data in the packet header information of the first encoded data, and the original data corresponding to the encoded data The maximum SN number. Therefore, the network coding layer at the receiving end receives the first encoded data, analyzes the information in the header packet (which may be referred to as header information for short), and converts all the received encoded data with the same minimum SN number and maximum SN number to the minimum SN number The corresponding original data, the original data corresponding to the largest SN number, and the original data whose SN number is between the smallest SN number and the largest SN number are decoded corresponding to the network coding, so as to obtain all the original data in the current sliding window. The sliding window information can also be window head and window length, where the window length is the number of original data in the window. Similar to the above description, the network coding layer at the receiving end receives the first encoded data, parses the header information, and combines all the received encoded data with the same minimum SN number and the same window length with the original data corresponding to the minimum SN number, and the SN number is between The minimum SN number, the original data between the minimum SN number and the window length are decoded corresponding to the network coding, so as to obtain all the original data in the current sliding window. The sliding window information can also be the window tail and window length. Similarly, the network coding layer at the receiving end receives the first coded data, parses the header information, and converts all received coded data with the same maximum SN number and the same window length and the maximum SN The original data corresponding to the SN number, the original data whose SN number is between the maximum SN number minus the window length, and the maximum SN number are decoded corresponding to the network coding, so as to obtain all the original data in the current sliding window. If the window length is a fixed value, the indication information may only include the window head or the window tail. In this way, the coded data is decoded according to the instruction information to obtain the original data, so that the receiving end can know the sliding window and/or the group number without additional calculation, which reduces the decoding complexity. In addition, the coding window can be made variable, which increases the flexibility of coding, so that it can adapt to channel conditions and improve transmission reliability and efficiency.

Optionally, in the case of grouping the raw data on each transmission opportunity, the above indication information may also include a group number ID, that is, the indication information may include a group number ID and sliding window information. Optionally, the sliding window information can be the position of the window head and window tail. The header information of the first coded data indicates the minimum SN number of the original data corresponding to the coded data, the maximum SN number of the original data corresponding to the coded data, and the group number ID. Therefore, the network coding layer at the receiving end receives the first coded data, parses the header information, and combines all the received coded data with the same minimum SN number and maximum SN number, the original data corresponding to the minimum SN number, and the data corresponding to the maximum SN number The original data and the original data whose SN number is between the minimum SN number and the maximum SN number and have the same group number ID are decoded corresponding to the network coding, so as to obtain all the original data in the current sliding window. The sliding window information can also be the window head, the window length and the group ID, where the window length is the number of original data in the window. Similar to the above description, the network coding layer at the receiving end receives the first encoded data, parses the header information, and combines all the received encoded data with the same minimum SN number and the same window length with the original data corresponding to the minimum SN number, and the SN number is between The minimum SN number and the minimum SN number plus the window length and the original data with the same group number ID are put together for decoding corresponding to the network coding, so as to obtain all the original data in the current sliding window. The sliding window information can also be window tail, window length and group number ID. Similarly, the network coding layer at the receiving end receives the first encoded data, parses the header information, and combines all the received encoded data with the same maximum SN number and the same window length with the original data corresponding to the maximum SN number, and the SN number is between the maximum The original data between the SN number minus the window length and the maximum SN number and the same group number ID are put together for decoding corresponding to the network coding, so as to obtain all the original data in the current sliding window. In this way, it is possible to realize the corresponding decoding of network coding for different packet data, which can solve the problem of burst errors in the channel, reduce the complexity of coding and decoding, and ensure the reliability of transmission.

Optionally, the generation of the above-mentioned first coded data can be realized by using a sliding window, and the number of transmission opportunities for obtaining the above-mentioned M first original data by using the sliding window is P, and the above-mentioned M first original data are networked Encoding, obtaining the above-mentioned first coded data corresponding to the above-mentioned M pieces of first original data. Then, the sliding window slides S transmission opportunities to obtain another set of M other original data, and then performs network coding on the M other original data to obtain other coded data corresponding to the M other original data. Wherein, the sliding granularity is S transmission opportunities, and the value range of S may be 1≤S≤P.

In the second aspect, the embodiment of the present application provides a data transmission method. The method may be executed by a terminal or a network device, or may be executed by a component (such as a processor, a chip, or a chip system, etc.) of the terminal or network device, including: Receive M' pieces of first original data and N' pieces of first coded data, where M' is a positive integer, and N' is a positive integer. Decoding the M' first original data and the N' first encoded data to obtain M first original data, wherein the number of transmission opportunities used in the M first original data is P, including The first transmission opportunity, and the transmission opportunity for the N' first encoded data is delayed by X transmission opportunities compared with the P transmission opportunities for the M first original data, X is a non-negative integer, and P is a positive integer And satisfy P≥2, M is a positive integer and satisfy M'+N'≥M, M≥M'.

The original data obtained by decoding M' first original data and N' first encoded data, since the M first original data used for encoding occupies at least two transmission opportunities, and the first encoded data and M At least one of the first original data is not transmitted on the same transmission opportunity, which can solve the problem of burst errors in the channel, thereby ensuring transmission reliability.

Optionally, the receiving end acquires relevant parameters of the first encoded data. Wherein, the relevant parameters of the first coded data include the coded depth M, the ratio R of the first coded data or the number N of the first coded data or the code rate R', the transmission opportunity of the first coded data, grouping information and other parameters. one or more. During the transmission and reception process of the communication system, some data may be discarded due to problems such as burst errors caused by channel quality, so the number of data actually received by the receiving device may be less than the number of data sent by the sender. .

Optionally, the receiving end acquires parameters related to the first encoded data, which means that the network coding layer at the receiving end acquires parameters related to the first encoded data. For the acquisition of the relevant parameters of the first encoded data, the acquisition method may be predefined, semi-statically configured by the network side device, or customized by the receiving end device. The acquisition methods of different encoding parameters can be the same or different. For example, the encoding depth M is semi-statically configured by the network side device, the ratio or number of the first encoded data is customized by the receiving end device, and the transmission of the first encoded data Opportunities are predefined. The receiving end decodes the encoded data according to the relevant parameters of the first encoded data to obtain the original data. When these parameters are configured, the coding flexibility can be increased, the channel state can be further adapted, and the transmission reliability and efficiency can be improved.

With reference to the second aspect, in some implementations of the second aspect, the M' first original data and the N' first encoded data are decoded to obtain M first original data, wherein, for The number of transmission opportunities in the M first original data is P, including the first transmission opportunity, and the transmission opportunities used for the N' first encoded data are more than those used for the M first original data The P transmission opportunities of delay X transmission opportunities, X is a non-negative integer, P is a positive integer and satisfies P ≥ 2, M is a positive integer and satisfies M'+N'≥M, M≥M'. By decoding the M' first original data and the N' first coded data to obtain M first original data, the problem of channel burst errors can be solved, thereby ensuring transmission reliability.

Optionally, the network coding layer at the receiving end performs network coding corresponding decoding on the obtained M' first original data and the N' first coded data, and obtains the M' first original data and the obtained M pieces of first original data corresponding to the N' pieces of first coded data. The number or proportion of the first raw data that needs to be generated for decoding (also referred to as decoding) corresponding to network coding is obtained according to the relevant parameters of the above-mentioned first coded data. The decoding method of the first original data may be a maximum distance separable (Maximum Distance Separable, MDS) code, a random linear network coding (random linear network coding, RLNC) code, a linear network coding (linear network coding, LNC) code, Determine one or more of linear network coding, batch sparse (Batched Sparse, BATS) codes, block codes, LT (LubyTransform) codes, rateless codes, RS (Reed-solomon) codes, etc. type.

Optionally, the receiving end obtains grouping information, and according to the grouping information, the receiving end can group the original data on each transmission opportunity. The group information generally includes the number of groups G, that is, the original data on one transmission opportunity is divided into G groups to obtain the original data of different groups, and different groups can be identified as group numbers 1-G. Since the number of original data transmitted by each transmission opportunity can be fixed or dynamically changed, the number of original data of the same group number in each transmission opportunity may be equal or different. Moreover, the number of original data in different packets in the same transmission opportunity can be equal or unequal. The above M' first original data refer to a group of original data with the same group number. The grouping of the above-mentioned N' first coded data is similar to the above-mentioned M' first original data, and also refers to a group of coded data with the same group number. Decoding the above-mentioned M' first original data and the above-mentioned N' first encoded data may refer to decoding the above-mentioned M' first original data and the above-mentioned N' first encoded data with the same group number . In this way, different packet data can be decoded, which can solve the problem of burst errors in the channel, reduce the complexity of encoding and decoding, and ensure transmission reliability. When the grouping information can be changed, different grouping information can be used in different channel states to further improve the transmission efficiency and reliability.

Optionally, the above-mentioned first transmission opportunity is also used for other original data except the above-mentioned first original data. In this way, different packet data can be decoded, which can solve the problem of burst errors in the channel, reduce the complexity of encoding and decoding, and ensure transmission reliability.

Optionally, the transmission opportunity for the above-mentioned N' first encoded data is delayed by X transmission opportunities than the P transmission opportunities for the above-mentioned M first original data include one of the following:

The transmission opportunity for the above-mentioned N' first coded data is delayed by at least X transmission opportunities than the first transmission opportunity in the P transmission opportunities for the above-mentioned M first original data, and X≥P-1 is satisfied;

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at most X transmission opportunities than the first transmission opportunity in the P transmission opportunities for the above-mentioned M first original data, and X≥P-1 is satisfied;

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at least X transmission opportunities than the last transmission opportunity among the P transmission opportunities for the above-mentioned M first original data; or

The transmission opportunity for the N' first encoded data is delayed by at most X transmission opportunities than the last transmission opportunity among the P transmission opportunities for the M first original data.

Optionally, the transmission opportunities for the above N' first encoded data are delayed by no more than Y transmission opportunities than the P transmission opportunities for the above M first original data, and Y is a non-negative integer; the method also includes one of the following:

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity of the P transmission opportunities for the above-mentioned M first original data, and Satisfy Y≥X≥P-1;

The transmission opportunity for the above-mentioned N' first coded data is delayed by at least X transmission opportunities than the first transmission opportunity of the P transmission opportunities for the above-mentioned M first original data, The last transmission opportunity among the P transmission opportunities of the original data is delayed by at most Y transmission opportunities, and Y≥(X-P+1) and X≥P-1 are satisfied;

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the last transmission opportunity of the P transmission opportunities for the above-mentioned M first original data, and satisfies Y≥X; or

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at least X transmission opportunities than the last transmission opportunity among the P transmission opportunities for the above-mentioned M first original data, The first transmission opportunity among the P transmission opportunities of data is delayed by at most Y transmission opportunities, and Y≥X+P-1 is satisfied.

With reference to the second aspect, in some implementation manners of the second aspect, second encoded data is received. By decoding the second coded data to obtain the original data, the problem of random errors in the channel can be solved, thereby ensuring transmission reliability.

Optionally, the receiving end may also obtain related parameters of the above-mentioned second encoded data. The related parameters of the second encoded data include the ratio r of the second encoded data or the number n of the second encoded data or the code rate r′, the second One or more of the parameters such as the transmission timing of the encoded data. For the meaning and acquisition method of the parameters corresponding to the second coded data, please refer to the description of the relevant parameters of the first coded data above, which will not be repeated here.

Optionally, the decoding method of the above-mentioned second coded data includes one or more of MDS codes, RLNC codes, LNC codes, BATS codes, determined linear network codes, block codes, LT codes, rateless codes, RS codes, etc. item, which will not be described here.

In conjunction with the second aspect, in some implementations of the second aspect, the above-mentioned N' pieces of first coded data include the first coded data A, the third transmission opportunity is used for the transmission of the first coded data A, and the third transmission opportunity Also for the transmission of one or more of encoded data other than the first encoded data or raw data other than the first raw data, the method further comprising:

The data received on the above-mentioned third transmission opportunity is decoded to obtain the above-mentioned first coded data A, and the data received on the above-mentioned third transmission opportunity includes one or more of the following:

The first coded data A, the above-mentioned other coded data, the above-mentioned first original data, the above-mentioned other original data and the above-mentioned second coded data. By decoding the received data on the third transmission opportunity to obtain the first coded data A, the problem of channel burst errors can be solved, thereby ensuring transmission reliability.

Optionally, the transmission opportunity for the second coded data is delayed by Z' transmission opportunities compared with the third transmission opportunity, and Z' is a non-negative integer. Since the total number of received data V1 on the third transmission opportunity is greater than the total number sent on the first transmission opportunity minus the quantity of the second coded data, the total number sent on the first transmission opportunity minus the quantity of the second coded data is represented by V2, Then, the received data can be used to solve the random error of any V1-V2 data on the third transmission opportunity, so as to overcome the problem of random interference.

With reference to the second aspect, in some implementations of the second aspect, the receiving end receives indication information; the indication information is used to indicate one or more of the following:

The sliding window information of the above-mentioned M first original data, the above-mentioned sliding window information indicates the identification information of the M first original data corresponding to the above-mentioned N' first encoded data; or

The group numbers corresponding to the above M pieces of first raw data. Obtain decoding-related parameters through the instruction information, thereby decoding the received data to obtain the original data, which can solve the problem of burst errors in the channel, thereby ensuring transmission reliability. In this way, the coded data is decoded according to the indication information to obtain the original data, which can solve the problem of burst errors in the channel and ensure transmission reliability.

Optionally, the sliding window information may indicate identification information of the M pieces of first original data corresponding to the above-mentioned N′ pieces of first encoded data for the above-mentioned sliding window information. By sending or receiving instruction information, the original data can be encoded or decoded according to the instruction information, which can solve the problem of random errors in the channel and further improve transmission reliability.

Optionally, the above indication information is encapsulated in the data packet header of the first encoded data, that is, the data packet header of the first encoded data carries the above indication information. Optionally, the above indication information may be partially encapsulated in the data packet header of the above first coded data, and another part of the information may be indicated by other information (such as signaling). In this way, the coded data is decoded according to the indication information to obtain the original data, which can solve the problem of burst errors in the channel, thereby ensuring transmission reliability.

In the third aspect, the embodiments of this application provide a device that can implement the method in the above-mentioned first aspect or any possible implementation manner of the first aspect. The apparatus comprises corresponding units or components for performing the method described above. The units included in the device can be realized by software and/or hardware. The apparatus can be, for example, a terminal, network device, server or centralized controller, or a chip, chip system, or processor that can support the terminal, network device, server or centralized controller to implement the above method.

In the fourth aspect, the embodiment of this application provides a device that can implement the method in the above second aspect or any possible implementation manner of the second aspect. The apparatus comprises corresponding units or components for performing the method described above. The units included in the device can be realized by software and/or hardware. The apparatus can be, for example, a terminal, network device, server or centralized controller, or a chip, chip system, or processor that can support the terminal, network device, server or centralized controller to implement the above method.

In the fifth aspect, the embodiment of the present application provides an apparatus, including: a processor, the processor is coupled to a memory, and the memory is used to store a program or an instruction, and when the program or instruction is executed by the processor, The device is made to implement the method described in the above-mentioned first aspect or any possible implementation manner of the first aspect.

In a sixth aspect, the embodiment of the present application provides an apparatus, including: a processor, the processor is coupled to a memory, and the memory is used to store a program or an instruction, and when the program or instruction is executed by the processor, The device is made to implement the method described in the above-mentioned second aspect, or any possible implementation manner of the second aspect.

In the seventh aspect, the embodiments of the present application provide a computer-readable medium on which computer programs or instructions are stored, and when the computer programs or instructions are executed, the computer executes the above-mentioned first aspect, or any possibility of the first aspect The method described in the implementation of .

In the eighth aspect, the embodiments of the present application provide a computer-readable medium on which computer programs or instructions are stored, and when the computer programs or instructions are executed, the computer executes the second aspect above, or any possibility of the second aspect The method described in the implementation of .

In the ninth aspect, the embodiment of the present application provides a computer program product, which includes computer program code, and when the computer program code runs on the computer, the computer executes the first aspect above, or any possible implementation of the first aspect method described in the method.

In the tenth aspect, the embodiment of the present application provides a computer program product, which includes computer program code, and when the computer program code runs on the computer, the computer executes the second aspect above, or any possible implementation of the second aspect method described in the method.

In an eleventh aspect, the embodiment of the present application provides a chip, including: a processor, the processor is coupled to a memory, and the memory is used to store programs or instructions, and when the programs or instructions are executed by the processor , so that the chip implements the method described in the above first aspect or any possible implementation manner of the first aspect.

In a twelfth aspect, the embodiment of the present application provides a chip, including: a processor, the processor is coupled to a memory, and the memory is used to store programs or instructions, and when the programs or instructions are executed by the processor , so that the chip implements the method described in the above second aspect or any possible implementation manner of the second aspect.

Description of drawings

FIG. 1 is a schematic diagram of a communication system applied in an embodiment provided by the present application;

FIG. 2 is a schematic diagram of various specific communication scenarios applied in the embodiments provided by the present application;

Fig. 3 shows a schematic diagram of an example architecture of a communication system;

FIG. 4 shows a schematic flowchart of a communication method provided by an embodiment of the present application;

5a-5d show a schematic flow diagram of network coding provided by the embodiment of the present application;

6a-6b show a schematic flow diagram of network coding provided by the embodiment of the present application;

FIG. 7 shows a schematic flowchart of a communication method provided by an embodiment of the present application;

FIG. 8 is a schematic structural diagram of a communication device provided by an embodiment of the present application;

FIG. 9 is a schematic structural diagram of another communication device provided by an embodiment of the present application;

FIG. 10 is a schematic structural diagram of another communication device provided by an embodiment of the present application.

Detailed ways

The method and device provided in the embodiments of the present application may be applied in a communication system. Fig. 1 is a schematic structural diagram of a communication system 1000 applied in an embodiment of the present application. As shown in FIG. 1 , the communication system includes a radio access network 100 and a core network 200 , and optionally, the communication system 1000 may also include the Internet 300 . Wherein, the radio access network 100 may include at least one radio access network device (such as 110a and 110b in Figure 1), and may also include at least one terminal (such as 120a-120j in Figure 1). The terminal is connected to the radio access network equipment in a wireless manner, and the radio access network equipment is connected to the core network in a wireless or wired manner. The core network equipment and the wireless access network equipment can be independent and different physical equipment, or the functions of the core network equipment and the logical functions of the wireless access network equipment can be integrated on the same physical equipment, or it can be a physical equipment It integrates some functions of core network equipment and some functions of wireless access network equipment. Terminals and wireless access network devices can be connected to each other in a wired or wireless manner. Fig. 1 is only a schematic diagram, and the communication system may also include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown in Fig. 1 .

The radio access network equipment may be a base station (base station), an evolved base station (evolved NodeB, eNodeB), a transmission reception point (transmission reception point, TRP), or a next-generation mobile communication system in the fifth generation (5th generation, 5G) Base station (next generation NodeB, gNB), the next generation base station in the sixth generation (6thgeneration, 6G) mobile communication system, the base station in the future mobile communication system or the access node in the WiFi system, etc.; it can also complete part of the functions of the base station The module or unit of , for example, can be a centralized unit (central unit, CU) or a distributed unit (distributed unit, DU). The radio access network device may be a macro base station (as shown in 110a in Figure 1), a micro base station or an indoor station (as shown in 110b in Figure 1), or a relay node or a donor node. The embodiment of the present application does not limit the specific technology and specific equipment form adopted by the radio access network equipment. For ease of description, a base station is used as an example of a radio access network device for description below.

A terminal may also be called terminal equipment, user equipment (user equipment, UE), mobile station, mobile terminal, and so on. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), and Internet of Things (Internet of Things). of things, IOT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grid, smart furniture, smart office, smart wear, smart transportation, smart city, etc. Terminals can be mobile phones, tablet computers, computers with wireless transceiver functions, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, etc. The embodiment of the present application does not limit the specific technology and specific equipment form adopted by the terminal.

Base stations and terminals can be fixed or mobile. Base stations and terminals can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; they can also be deployed on aircraft, balloons and artificial satellites in the air. The embodiments of the present application do not limit the application scenarios of the base station and the terminal.

The roles of the base station and the terminal can be relative. For example, the helicopter or UAV 120i in FIG. base station; however, for base station 110a, 120i is a terminal, that is, communication between 110a and 120i is performed through a wireless air interface protocol. Of course, communication between 110a and 120i may also be performed through an interface protocol between base stations. In this case, relative to 110a, 120i is also a base station. Therefore, both the base station and the terminal can be collectively referred to as a communication device, and 110a, 110b, and 120a-120j in FIG. 1 can be referred to as a communication device with their corresponding functions, such as a communication device with a base station function, or a communication device.

The communication between the base station and the terminal, between the base station and the base station, and between the terminal and the terminal can be carried out through the licensed spectrum, the communication can also be carried out through the unlicensed spectrum, and the communication can also be carried out through the licensed spectrum and the unlicensed spectrum at the same time; Communications may be performed on frequency spectrums below megahertz (gigahertz, GHz), or communications may be performed on frequency spectrums above 6 GHz, or communications may be performed using both frequency spectrums below 6 GHz and frequency spectrums above 6 GHz. The embodiments of the present application do not limit the frequency spectrum resources used by wireless communication.

In the embodiments of the present application, the functions of the base station may also be performed by modules (such as chips) in the base station, or may be performed by a control subsystem including the functions of the base station. The control subsystem including base station functions here may be the control center in the application scenarios of the above-mentioned terminals such as smart grid, industrial control, intelligent transportation, and smart city. The functions of the terminal can also be performed by a module (such as a chip or a modem) in the terminal, or can be performed by a device including the terminal function.

Furthermore, the present application can be applied to various specific communication scenarios, for example, point-to-point transmission between a base station and a terminal or between terminals (as shown in Figure 2(a) is a point-to-point transmission between a base station and a terminal), multiple communication between a base station and a terminal Jump (as shown in Figure 2(b) and Figure 2(c)) transmission, dual connectivity (Dual Connectivity, DC) of multiple base stations and terminals (as shown in Figure 2(d)) or multiple connections. It should be noted that the above specific communication application scenarios are just examples and do not pose limitations. In particular, from a business perspective, the embodiments of the present application are applicable to many business scenarios, such as data encoding scenarios and uplink large-capacity scenarios in extended reality (extended reality, XR) services. In addition, Figure 2 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).

The technology described in the embodiments of the present invention can be used in various communication systems, such as the fourth generation (4th generation, 4G) communication system, 4.5G communication system, 5G communication system, a system where multiple communication systems are integrated, or a communication system that evolves in the future (eg 6G communication system). For example, long term evolution (long term evolution, LTE) system, new radio interface (newradio, NR) system, wireless fidelity (wireless-fidelity, WiFi) system, wireless ad hoc system, device-to-device direct communication system, and the third generation A communication system related to a partnership project (3rd generation partnership project, 3GPP), etc., and other such communication systems.

FIG. 3 shows a schematic diagram of a possible architecture example of a communication system. As shown in FIG. , DU) base station (such as gNodeB or gNB) with separate architecture. The RAN can be connected to the core network (for example, it can be the core network of LTE, or the core network of 5G, etc.). CU and DU can be understood as the division of the base station from the perspective of logical functions. CU and DU can be physically separated or deployed together. Multiple DUs can share one CU. One DU can also be connected to multiple CUs (not shown in the figure). The CU and DU can be connected through an interface, for example, an F1 interface. CU and DU can be divided according to the protocol layer of the wireless network. For example, functions of a packet data convergence protocol (packet data convergence protocol, PDCP) layer and a radio resource control (radio resource control, RRC) layer are set in the CU, and radio link control (radio link control, RLC), media access control ( Functions such as a media access control (MAC) layer and a physical (physical) layer are set in the DU. It can be understood that the division of the CU and DU processing functions according to this protocol layer is only an example, and can also be divided in other ways. For example, a CU or DU can be divided into functions with more protocol layers. For example, a CU or DU can also be divided into partial processing functions having a protocol layer. In one design, part of the functions of the RLC layer and the functions of the protocol layers above the RLC layer are set in the CU, and the remaining functions of the RLC layer and the functions of the protocol layers below the RLC layer are set in the DU. In another design, the functions of the CU or DU may also be divided according to service types or other system requirements. For example, according to delay, the functions whose processing time needs to meet the delay requirement are set in the DU, and the functions that do not need to meet the delay requirement are set in the CU. The network architecture shown in FIG. 3 can be applied to a 5G communication system, and it can also share one or more components or resources with the LTE system. In another design, the CU may also have one or more functions of the core network. One or more CUs can be set centrally or separately. For example, the CU can be set on the network side to facilitate centralized management. The DU can have multiple radio functions, or the radio functions can be set remotely.

The functions of the CU can be implemented by one entity, or the control plane (CP) and the user plane (UP) can be further separated, that is, the control plane (CU-CP) and the user plane (CU-UP) of the CU can have different functions entity, and the CU-CP and CU-UP can be coupled with the DU to jointly complete the functions of the base station.

It can be understood that the embodiments provided in this application are also applicable to an architecture in which CUs and DUs are not separated.

For ease of understanding, firstly, the communication nouns or terms involved in the embodiments of this application are explained, and the communication nouns or terms are also part of the content of this application.

Network coding technology provides a transmission mechanism that takes into account delay and spectrum efficiency. In network coding technology, the sender encodes multiple original data units to obtain multiple encoded data units, and then generates multiple encoded packets. Each encoded packet It includes an encoded data unit and encoding coefficient indication information; the receiving end can decode the encoded data unit according to the encoding coefficient, so as to obtain the original data unit.

In the communication system, the feedback retransmission mechanism can realize effective error control. Such as the hybrid automatic repeat request (HARQ) retransmission mechanism of the medium access control (medium access control, MAC) layer and the automatic repeat request (automatic repeat request) of the radio link control (radio link control, RLC) layer , ARQ) retransmission mechanism jointly ensures the reliability of transmission. With the evolution and development of communication technology, new radio (new radio, NR) puts forward higher requirements on the reliability and effectiveness of the system. The ARQ mechanism is a function of an RLC layer acknowledged mode (acknowledged mode, AM) transmission mode. The ARQ operation of the sending end includes transmission and retransmission of protocol data unit (protocol data unit, PDU) or segment, receiving the status report sent by the receiving end, and receiving the HARQ transmission failure indication sent by the bottom layer; the ARQ operation of the receiving end includes detecting the RLC layer PDU reception whether to fail. Regularly feed back the data reception status to the sender through the RLC layer status report. The information contained in the status report includes the serial number (serial number, SN) of the RLC layer PDU that the receiver has received and the SN number that has not been received. The receiver detects When there is a packet loss, the sender is notified through the RLC layer status report that a certain AM PDU or re-segment has not been received, and the sender is requested to retransmit the PDU.

The retransmission delay based on feedback is relatively large, and the round-trip time (round-trip time, RTT) of an uplink HARQ process in a frequency-division duplex (FDD) system is 8 transmission time intervals (transmission time interval, TTI). Therefore, the feedback retransmission mechanism faces many problems, such as frequent feedback overhead and performance loss in multicast or broadcast scenarios, serious performance loss in burst and continuous error scenarios, dual connections or multi-connection congestion scenarios, etc. Network coding technology, as a forward error correction technology, encodes the original data packet and adds redundancy to combat packet loss or performance loss in wireless transmission, and can avoid the time delay and feedback overhead caused by feedback. Network coding pattern includes random linear network coding (random linear network coding, RLNC), convolutional network coding (convolutional network coding, CNC), deterministic linear network coding, batch sparse code (batch sparse code, BATS), erasure code ( erasure code), fountain code (fountaincode), convolutional network coding (convolutional network coding, CNC), streaming code (streaming code), maximum distance separable (Maximum Distance Separable, MDS) code, LT (Luby Transform) code, rateless code, RS (Reed-solomon) code, etc.

In the wireless channel environment, due to the influence of channel additive noise, random errors will occur in the code block (code block, CB) in the physical layer transport block (transport block, TB) received by the receiving end, where TB can be a high-level Packets, the size of a packet is close to the size of a CB. For low-latency services, due to strict constraints on transmission delay, the physical layer has no chance of retransmission, and random packet loss will occur at the high layer. At the same time, due to factors such as fading caused by mobility or interference caused by other users, continuous errors occur in the decoded CB at the receiving end. Similarly, for low-latency services, data packets will be continuously lost at the upper layers.

At present, the forward error correction code (forward error correction, FEC) network coding method is generally used for low-latency services. The FEC coding method is to add a certain number of original data packets to be sent by the sender to add a part of redundant error correction coded packets or The FEC coding package or verification package is sent together, and the specific code generation methods involved in the coding package or verification package can be RLNC, definite linear network coding, BATS code, erasure code, fountain code, CNC, streaming code, MDS code , LT code, rateless code, RS code, etc. Generally, the number of original data packets in technical solutions such as FEC is fixed, and the several original data packets and their corresponding check packets will be sent to the receiving end continuously through the TB of the physical layer. However, since the physical layer generally uses adaptive modulation and coding (AMC) to adapt the transmission quality of the wireless channel, that is, the size of each TB changes dynamically or the number of data packets contained in each TB is dynamically changing. If the complexity and decoding delay are considered, the FEC coding strategy will use redundant coding error correction for a small number of original data packets. However, if a long burst error occurs in the channel, an error will occur in both the FEC coded packet and the original data packet, so that the original data packet cannot be recovered.

In order to solve the above-mentioned technical problems, the embodiments of this application propose a network coding method, in which the sending end encodes the original data on multiple transmission opportunities to generate a set of first-type coded data; The first or last transmission opportunity in the transmission opportunity, this group of first-type check packets is delayed by several transmission opportunities to solve the problem that the original data packet cannot be recovered due to long burst errors in the channel. Further, the sending end encodes the first type of coded data and the original data on the transmission opportunity where the first type of coded data is located, and can also generate a set of second type of coded data, which can be transmitted on the transmission opportunity where the first type of coded data is located. Opportunistic transmission or transmission delayed by several transmission opportunities compared with the transmission opportunity where the first type of coded data is located can solve the problem of random channel errors and further improve transmission reliability.

In this embodiment of the application, the data before encoding may be referred to as original data, system data, system data block, original data block, or original data, etc., and the encoded data may be referred to as encoded data or encoded block, etc. A piece of pre-encoded data includes one or more pre-encoded data packets, wherein the pre-encoded data packets can also be called original data packets, original data packets, or original packets. A piece of encoded data includes one or more encoded data packets, where the encoded data packets can also be called encoded data packets, or encoded packets, etc. In the following description of this application, different names of the same concept will be used in different places, which have the same meaning and will not be repeated here.

In the embodiment of the present application, the protocol layer with the encoding and decoding function can be collectively referred to as the network encoding layer, and the encoding and decoding function can be the network encoding function, or other encoding and decoding functions similar to the network encoding function, which are not limited here . The network encoding layer encodes the data before encoding to generate encoded data. The encoded data may be a data unit output by a module of the network coding layer, where the output encoded data unit can be understood as outputting the encoded data unit to the subsequent processing of the encoded data unit in the terminal device or in the network device through the communication interface. Module of data unit. It can be understood that the output involved in this application may refer to sending signals or data on the air interface, or may refer to outputting signals or data to other devices in the device (such as terminal equipment or network equipment) through the communication interface. module. The specific process is specifically described in the application scenario, and will not be repeated here.

In the embodiment of the present application, the network coding layer at the sending end obtains the original data packet on the transmission opportunity, and the original data packet may be aggregated by the network coding layer according to a service data unit (service data unit, SDU) or PDU (also called concatenation). And/or the data packet obtained after segmentation can also be SDU or PDU itself.

In this embodiment of the present application, a transmission opportunity may also be called a scheduling opportunity, a transmission opportunity, a transmission time interval, or other names. The physical meaning of the transmission opportunity may refer to a time slot (slot), TTI, frame, subframe, or, corresponding to the protocol layer to transmit a fixed number of data units, the data unit can be SDU, PDU, data packet, number of bits, or, bytes etc. Currently, only the RLC layer and protocol layers below the RLC layer can identify time slots in the standard. Taking the RLC layer as an example, the MAC layer can determine the TB size on each time slot, and notify the RLC layer of the TB size indication information indicating the TB size. The RLC layer sends one or more RLC PDUs to the MAC layer, and the sum of the data volume of the one or more RLC PDUs is the data volume indicated by the TB size indication information. Accordingly, the RLC layer can identify each time slot and each time slot raw data packets on time slots. However, the protocol layer above the RLC layer can only recognize the packets received one by one in sequence, and cannot determine which packet is a data packet in a time slot from which packet starts to which packet ends, so it cannot determine which original packets are transmitted in multiple time slots. data pack. Similarly, if the transmission opportunity is a concept related to time, such as scheduling opportunity, transmission opportunity, transmission time interval, etc., it is also necessary for lower layers such as the MAC layer to pass relevant indication information to the network coding layer so that the network coding layer can identify multiple Raw packets on transport opportunities. If there are one or more intermediate layers between the network coding layer and the MAC layer, the indication information can be transmitted through the one or more intermediate layers. Optionally, if the network coding layer is not at the RLC layer and is at a protocol layer above the RLC layer, the transmission opportunity can also be that every time the network coding layer sends one or several PDUs or SDUs or original data packets to the next layer, it will be regarded as a transmission Chance. For multiple transmission opportunities, the number of original data packets transmitted by each transmission opportunity may be the same or different.

The technical solution of the present application will be described in detail below with specific embodiments in conjunction with the accompanying drawings. The following embodiments and implementation methods can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. It should be understood that the functions referred to in this application may be implemented by hardware circuits, using software running in conjunction with a processor/microprocessor or general purpose computer, using application specific integrated circuits, and/or using one or more digital signal processing device to achieve. When this application is described as a method, it can also be implemented by a computer processor and memory coupled to the processor.

FIG. 4 is a schematic flowchart of a communication method 400 provided in an embodiment of the present application. The subject of execution of the method is the sending device (also referred to as the sending end or the sending end device). The sending device may be a terminal (such as an XR terminal), or a chip, a chip system, or a processor that supports the terminal to implement the method. Alternatively, the sending device may be a network device (such as a core network device, an access network device, a WiFi router, or a WiFi access point), or a chip, a chip system, or a processor that supports the network device to implement the method. The sending device may be a server (such as a cloud server), or a chip, a chip system, or a processor that supports the server to implement the method. As shown in Figure 4, the method 400 of this embodiment may include part 410 and part 420:

Part 410: Encoding the M first original data to obtain N first coded data, where M is a positive integer and N is a positive integer.

In part 410, optionally, the sending end acquires relevant parameters of the first encoded data. Wherein, the relevant parameters of the first coded data include the coded depth M, the ratio R of the first coded data or the number N of the first coded data or the code rate R′, the transmission opportunity of the first coded data, grouping information and other parameters. one or more.

In the embodiment of the present application, the coding depth M means that M original data are encoded, and the M original data are sent on P transmission opportunities, where P is a positive integer not less than 2. The coded depth may also be referred to as coded length, convolutional depth, coded block size, coded window size, or sliding window size, etc. The number of first coded data is the number of a group of first coded data generated by encoding the M original data. The numbers of different groups of first coded data can be individually determined. The number of first coded data in different groups may be different or the same. The ratio of the first encoded data is the ratio of the total number N of a set of first encoded data generated by encoding M first original data to the corresponding total number M of the first original data, and the ratio R of the first encoded data is also It may be a ratio of the total number N of a set of first encoded data generated by encoding M pieces of first original data to the sum of the corresponding total number M of first original data plus the total number N of first encoded data. The code rate R' is the ratio of the number M of the first original data to the sum of the total number N of the first encoded data generated by encoding the first original data plus the number M of the first original data, The code rate R' may also be the ratio of the number M of the first original data to the total number N of a set of first encoded data generated by encoding the M first original data.

In part 410, optionally, the sending end acquires parameters related to the first encoded data, which means that the network coding layer at the sending end acquires parameters related to the first encoded data. The network coding layer refers to the protocol layer having the network coding function, and the network coding layer may be a radio resource control (Radio Resource Control, RRC) layer, a packet data convergence layer protocol (Packet Data Convergence Protocol, PDCP) layer, a backhaul adaptation protocol (Backhaul Adaptation Protocol, BAP) layer, RLC layer, MAC layer, or physical layer (Physical Layer, PHY) and other protocol layers. Specifically which 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. The above-mentioned network coding layer may also be called codec layer, codec layer, network codec layer, network codec layer, or other names, which are not limited in this application.

For the acquisition of parameters related to the first encoded data, the acquisition method of the sending end may be predefined, or may be configured to the sending end by the network side device, such as semi-statically configured or dynamically configured, or may be configured by the sending end in advance. Preset, such as one or more preset or configured according to system requirements, actual communication status, or protocol reservations. The acquisition methods of different encoding parameters may be the same or different. For example, the coding depth M is semi-statically configured by the network side device, the ratio or number of the first coded data is determined by the sender according to the actual communication status, and the transmission opportunity of the first coded data is determined by the sender according to the transmission rules, wherein, Transmission rules may be protocol-specific.

In a possible implementation manner of encoding the above-mentioned M first original data in part 410, the network coding layer at the sending end performs network coding on the above-mentioned M first original data obtained, and obtains the above-mentioned M first original data. A set of first coded data corresponding to the data. The number or proportion of the first coded data that needs to be generated by network coding is obtained according to the relevant parameters of the above-mentioned first coded data. The coding pattern used in the encoding can be a Maximum Distance Separable (MDS) code, a random linear network coding (RLNC) code, a linear network coding (LNC) code, a deterministic linear One of network coding, batch sparse (Batched Sparse, BATS) codes, block codes, LT (Luby Transform) codes, rateless codes, RS (Reed-solomon) codes and other code types. Different code patterns correspond to different encoding methods.

的原始数据，其中

(2)对于第g(g＝mod(L,G),mod(L,G)+1,…,G)个分组，包含编号

的原始数据，其中

In a possible implementation manner of encoding the above M pieces of first original data in part 410, the sender acquires grouping information, and according to the grouping information, the sender can group the original data on each transmission opportunity. The group information generally includes the number of groups G, that is, the original data on one transmission opportunity is divided into G groups, and the original data of different groups can be obtained. The original data of different groups can have different group numbers or identifications. For example, different groups can be identified as 1~G group number. Since the number of original data to be transmitted by each transmission opportunity can be fixed or dynamically changed, the number of original data of the same group number in each transmission opportunity may be equal or may not be equal. Moreover, the numbers of original data in different packets within the same transmission opportunity can be equal or unequal. In the case of grouping the original data on each transmission opportunity, the above-mentioned M first original data refers to a group of original data with the same group number, and encoding the above-mentioned M first original data may refer to a group of original data with The M pieces of first original data with the same group number are encoded. For example, when grouping, the difference in the number of original data contained in different groups does not exceed 1. Specifically, grouping can be performed according to the following rules: if the number of groups G is equal to the number L of original data on a transmission opportunity, then one group contains one original data, If the number of groups G is not equal to L, the number of original data in each group can be confirmed by the following process: (1) For the gth (g=0,1,...,mod(L,G)-1) group, containing numbered

the original data of

(2) For the g(g=mod(L,G), mod(L,G)+1,...,G)th grouping, including the number

the original data of

Section 420: sending the above-mentioned M first original data and the above-mentioned N first coded data, wherein the number of transmission opportunities for transmitting the above-mentioned M first original data is P, and includes the first transmission opportunity, and uses The transmission opportunities for transmitting the N first coded data are delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the M first original data, X is a non-negative integer, P is a positive integer and P≥2.

In a possible implementation manner of sending the above-mentioned N first coded data in part 420, the above-mentioned N first coded data are coded data obtained by encoding with a generator matrix including a unit sub-matrix, wherein the unit sub-matrix The coded data obtained by the matrix corresponds to the M pieces of first original data sent above, and the remaining coded data corresponds to the N pieces of first coded data sent above.

In part 420, optionally, the above-mentioned first transmission opportunity is also used to transmit other original data except the above-mentioned first original data. In a possible implementation manner, the group number of the first raw data is different from the group numbers of the other raw data.

In part 420, optionally, in a possible implementation manner, the transmission opportunity for transmitting the above-mentioned N first coded data is delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the above-mentioned M first original data , including one of the following:

The transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at least X transmission opportunities than the first transmission opportunity of the P transmission opportunities for transmitting the above-mentioned M first original data, and X≥P-1 ;

The last transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at most X transmission opportunities than the first transmission opportunity of the P transmission opportunities for transmitting the above-mentioned M first original data, and X≥P -1;

The transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at least X transmission opportunities than the last transmission opportunity among the P transmission opportunities for transmitting the above-mentioned M first original data; or

The last transmission opportunity for transmitting the N first encoded data is delayed by at most X transmission opportunities than the last transmission opportunity of the P transmission opportunities for transmitting the M first original data.

In part 420, optionally, in a possible implementation manner, the transmission opportunity for transmitting the above-mentioned N first coded data is delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the above-mentioned M first original data , the method further includes: the transmission opportunity for transmitting the N first coded data is delayed by no more than Y transmission opportunities than the P transmission opportunities for transmitting the M first original data, and Y is a non-negative integer. The method includes one of the following:

The transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity of the P transmission opportunities for transmitting the above-mentioned M first original data, And satisfy Y≥X≥P-1;

The transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at least X transmission opportunities than the first transmission opportunity of the P transmission opportunities for transmitting the above-mentioned M first original data, and is delayed by at least X transmission opportunities than the first one of the P transmission opportunities for transmitting the above-mentioned M first original data. The last transmission opportunity among the P transmission opportunities of the first raw data is delayed by at most Y transmission opportunities, and Y≥(X-P+1) and X≥P-1 are satisfied;

The transmission opportunity for transmitting the above-mentioned N first coded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the last transmission opportunity among the P transmission opportunities for transmitting the above-mentioned M first original data, and satisfy Y ≥ X; or

The transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at least X transmission opportunities than the last transmission opportunity among the P transmission opportunities for transmitting the above-mentioned M first original data, and is delayed by at least X transmission opportunities than the last one of the P transmission opportunities for transmitting the above-mentioned M first original data. The first transmission opportunity among the P transmission opportunities of an original data is delayed by at most Y transmission opportunities, and Y≧X+P−1 is satisfied.

Optionally, as shown in FIG. 4, method 400 may also include part 430 and part 440:

Section 430: the above N pieces of first encoded data include first encoded data A, the third transmission opportunity is used to transmit the first encoded data A and the third transmission opportunity is also used to transmit other encoded data except the first encoded data or One or more of other raw data other than the first raw data, the method also includes:

Encoding the above-mentioned other coded data, the above-mentioned first original data, one or more items of the above-mentioned other original data, and the above-mentioned first coded data A on the third transmission opportunity to obtain the second coded data.

Similar to the acquisition of the relevant parameters of the above-mentioned first coded data by the sending end in part 410, the sending end can also obtain the relevant parameters of the above-mentioned second coded data, and the relevant parameters of the second coded data include the ratio r of the second coded data or the ratio r of the second coded data One or more of parameters such as the number n of data, the code rate r′, and the transmission timing of the second coded data. For the meaning and acquisition method of the parameters corresponding to the second coded data, please refer to the above description of the relevant parameters of the first coded data, which will not be repeated here.

Similar to the generation method of the above-mentioned first coded data in part 410, the above-mentioned method of generating the second coded data, that is, the coded method, includes MDS code, RLNC code, LNC code, BATS code, determined linear network code, block code, LT code , rateless code, or RS code, etc., which code type to use may be based on system design requirements or protocol regulations or based on configuration, and details will not be described here.

In part 430, optionally, the third transmission opportunity is also used to transmit the second coded data.

In part 430, optionally, the transmission opportunity for transmitting the second coded data is delayed by Z transmission opportunities compared with the third transmission opportunity, where Z is a non-negative integer. In a possible implementation manner, the sending end sends the second encoded data delayed by Z transmission opportunities compared with the third transmission opportunity according to the acquired related parameters of the second encoded data.

Section 440: Sending or receiving indication information; the indication information is used to indicate one or more of the following:

The sliding window information of the above-mentioned M first original data, the above-mentioned sliding window information indicates the M first original data corresponding to the above-mentioned N first encoded data; or

The group numbers corresponding to the above M pieces of first raw data.

Optionally, the sliding window information may indicate identification information of the M pieces of first original data corresponding to the N pieces of first encoded data.

It can be understood that the indications in this application may be explicit indications or implicit indications.

It can be understood that the application does not limit the execution sequence of part 430 and part 440 . For example, part 420 can be executed first and then part 440, or part 440 can be executed first and then part 410 can be executed; part 420 can also be executed before part 430, or part 430 can be executed first and then part 420; and the execution order of parts 440 are not specifically limited.

In part 440, optionally, the indication information is encapsulated in the data packet header of the first encoded data, that is, the data packet header of the first encoded data carries the indication information. Optionally, the above-mentioned indication information may be partially encapsulated in the header of the data packet of the above-mentioned first coded data, and another part of the information may be indicated by other information (such as a signaling method)

In a possible implementation manner of part 440, the sending end sends indication information to the receiving end, and the receiving end can know which data packets to decode together according to the indication information. One kind of indication information indicates the sliding window information, which can be the window head and window tail position, that is, the minimum SN number of the original data corresponding to the encoded data in the packet header information of the first encoded data, and the original data corresponding to the encoded data The maximum SN number. Therefore, the network coding layer at the receiving end receives the first coded data, analyzes the information in the header packet (which may be referred to as header information for short), and converts all received coded data with the same minimum SN number and maximum SN number to the minimum SN number The corresponding original data, the original data corresponding to the largest SN number, and the original data whose SN number is between the smallest SN number and the largest SN number are decoded corresponding to the network coding together, so as to obtain all the original data in the current sliding window. The sliding window information can also be a window head and a window length, where the window length is the number of original data in the window. Similar to the above description, the network coding layer at the receiving end receives the first encoded data, parses the header information, and combines all the received encoded data with the same minimum SN number and the same window length with the original data corresponding to the minimum SN number, and the SN number is between The minimum SN number, the original data between the minimum SN number and the window length are decoded corresponding to the network coding together, so as to obtain all the original data in the current sliding window. The sliding window information can also be the window tail and window length. Similarly, the network coding layer at the receiving end receives the first coded data, parses the header information, and converts all received coded data with the same maximum SN number and the same window length and the maximum SN The original data corresponding to the SN number, the original data whose SN number is between the maximum SN number minus the window length, and the maximum SN number are decoded corresponding to the network coding, so as to obtain all the original data in the current sliding window. If the window length is a fixed value, the indication information can include the window head or window tail.

Optionally, in the case of grouping the raw data on each transmission opportunity, the above indication information may also include a group number ID, that is, the indication information may include a group number ID and sliding window information. Optionally, the sliding window information can be the position of the window head and window tail. The header information of the first coded data indicates the minimum SN number of the original data corresponding to the coded data, the maximum SN number of the original data corresponding to the coded data, and the group number ID. Therefore, the network coding layer at the receiving end receives the first coded data, parses the header information, and combines all the received coded data with the same minimum SN number and maximum SN number, the original data corresponding to the minimum SN number, and the data corresponding to the maximum SN number The original data and the original data whose SN number is between the minimum SN number and the maximum SN number and have the same group number ID are decoded corresponding to the network coding, so as to obtain all the original data in the current sliding window. The sliding window information can also be the window head, the window length and the group ID, where the window length is the number of original data in the window. Similar to the above description, the network coding layer at the receiving end receives the first encoded data, parses the header information, and combines all the received encoded data with the same minimum SN number and the same window length with the original data corresponding to the minimum SN number, and the SN number is between The minimum SN number and the minimum SN number plus the window length and the original data with the same group number ID are decoded corresponding to the network coding together, so as to obtain all the original data in the current sliding window. The sliding window information can also be window tail and window length and group number ID. Similarly, the network coding layer at the receiving end receives the first encoded data, parses the header information, and combines all the received encoded data with the same maximum SN number and the same window length with the original data corresponding to the maximum SN number, and the SN number is between the maximum The original data between the SN number minus the window length and the maximum SN number and the same group number ID are decoded corresponding to the network coding, so as to obtain all the original data in the current sliding window.

If the network coding layer is at the physical layer or the MAC layer or between the physical layer and the MAC layer, the information indicated by the sender to the receiver can also include the number of time slots and the group ID of the coded packet delayed compared to its original data , the receiving end receives the coded data and uses the HARQ process number in its control message and the number of delayed time slots above to know which original data packets on which time slots the coded packet corresponds to and which have the same group number ID, and receive them The original data and the encoded data are decoded together to obtain all the original data. It can be understood that in the embodiment of the present application, the size of the window can be obtained according to the number of delayed time slots. For example: the receiving end receives a set of encoded data in HARQ process 5, and the number of delays relative to the first transmission opportunity of the original data is 3, then the first transmission opportunity of the original data is process 2. The original data between process 2 and process 4 are taken as M original data, that is, the window size is 3.

In a possible implementation of part 400, the generation of the above-mentioned first coded data may be realized by using a sliding window, and the number of transmission opportunities for obtaining the above-mentioned M first original data by using the sliding window is P, and the above-mentioned M Network coding is performed on the first original data to obtain the first coded data corresponding to the M first original data. Then, the sliding window slides S transmission opportunities to obtain another set of M other original data, and then performs network coding on the M other original data to obtain other coded data corresponding to the M other original data. Wherein, the sliding granularity is S transmission opportunities, and the value range of S can be 1≤S≤P. Taking P=3 as an example, the scheme of this embodiment is schematically shown in Figures 5a-5d by adopting the sliding window implementation.

For example, as shown in Figure 5a, a sequence of O-t-1 within a sliding window represents the raw data sent on transmission opportunity t. For different transmission opportunities, that is, slot t, the number of raw data represented by O-t-1 may be different. Perform network coding such as RLNC, MDS, RS, etc. on the M first raw data of the sliding window to generate the first coded data; and delay transmission by 2 transmission opportunities relative to the last transmission opportunity of the first raw data in the sliding window ; Or, the first transmission opportunity of the first original data within the sliding window is delayed by 4 transmission opportunities. It can be understood that in this embodiment, delaying sending by one transmission opportunity is equivalent to sending at the next transmission opportunity. For example, the first original data represented by O-1-1, O-2-1, and O-3-1 are transmitted on the three transmission opportunities t=1, t=2, and t=3 included in the sliding window. The first raw data corresponding to O-1-1, O-2-1, and O-3-1 is network-encoded to generate the first encoded data, represented by P-5-1, and the first encoded data is sent at t=5 transmission opportunities - Encoded data. Wherein, the transmission opportunity at t=5 is delayed by 2 transmission opportunities relative to the last transmission opportunity t=3 in the window. The sliding window slides S=1 transmission opportunities each time along the transmission opportunity, performs network coding on another group of M other original data in the window, and generates another group of other coded data. Delay 2 transmission opportunities relative to the last transmission opportunity of M other original data in this sliding window; or delay 4 transmission opportunities relative to the first transmission opportunity of M other original data in this sliding window . For example, after a sliding window that includes 3 transmission opportunities t=1, t=2, and t=3 slides S=1 transmission opportunities along the transmission opportunity direction, the sliding window includes t=2, t=3, t= 4Other raw data represented by O-2-1, O-3-1, O-4-1 on these 3 transmission opportunities. Perform network coding on other raw data corresponding to O-2-1, O-3-1, and O-4-1 to generate a group of other coded data, represented by P-6-1, and sent on t=6 transmission opportunities, The last transmission opportunity t=4 within the relative window where t=6 is delayed by 2 transmission opportunities. Network coding is performed on other original data packets on the transmission opportunity where the first coded data is located and/or the first coded data to obtain the second coded data. Sending at the current transmission opportunity or delaying transmission by T3 transmission opportunities, for example, the first coded data P-6-1 generated by the sliding window including t=2, t=3, t=4 these 3 transmission opportunities is For example, the group of first coded data of P-6-1 and other original data packets O-6-1 on its transmission opportunity t=6 are network coded to generate second coded data, using P-6-2 , and send the second coded data of P-6-2 on the current transmission opportunity t=6.

For another example, as shown in FIG. 5b, a series of O-t-1 in the sliding window represents the original data sent on the transmission opportunity t. For different transmission opportunities t, the number of original data packets represented by O-t-1 can be different. Perform network coding on the M first raw data of the sliding window to generate first coded data. The first encoded data is sent at most delayed by 2 transmission opportunities relative to the last transmission opportunity of the first original data in the sliding window; or, the first encoded data is delayed by at least the last transmission opportunity of the M first original data in the sliding window 1 transmission opportunity; or, the first encoded data is delayed by at most 2 transmission opportunities and at least 1 transmission opportunity relative to the last transmission opportunity of the M first original data in the sliding window; or, the first encoded data is relatively The first transmission opportunity of the M first original data in the sliding window is delayed by at least 3 transmission opportunities; or, the first encoded data is delayed by at most 4 relative to the first transmission opportunity of the M first original data in the sliding window transmission opportunities; or, the first encoded data is delayed by at least 3 and at most 4 transmission opportunities relative to the first transmission opportunity of the M first original data in the sliding window; or, the first encoded data is transmitted relative to the first transmission opportunity in the sliding window The first transmission opportunity of the M first original data is delayed by at most 4 transmission opportunities and the transmission is delayed by at least one transmission opportunity relative to the last transmission opportunity of the M first original data within the sliding window. For example, for a sliding window that includes 3 transmission opportunities of t=1, t=2, and t=3, the corresponding first raw data are represented by O-1-1, O-2-1, and O-3-1 respectively , and perform network coding on the first raw data in the window to generate the first coded data, represented by P-4-1. This group of first coded data is sent on two transmission opportunities t=4 and t=5, which is delayed by at least one transmission opportunity relative to the last transmission opportunity t=3 in the window, and relative to the first transmission opportunity in the window The transmission opportunity t=1 is delayed by at most 4 transmission opportunities. The sliding window slides S=1 transmission opportunities each time with the transmission opportunities, and performs network coding on another group of M other original data in the window to generate another group of other coded data. Relative to the last transmission opportunity of M other original data in this sliding window, the sending of 1 transmission opportunity is delayed, and relative to the first transmission opportunity of M other original data in this sliding window, the sending of 3 transmission opportunities is delayed. For example, at this time, the sliding window contains other original data represented by O-2-1, O-3-1, O-4-1, network coding generates a group of other coded data P-5-1, at t=5 and t=6 transmission opportunity to send. At least 1 transmission opportunity is delayed relative to the last transmission opportunity t=4 in the window, and at most 4 transmission opportunities are delayed relative to the first transmission opportunity t=2 in the window. Perform network coding on other original data and/or first coded data on the transmission opportunity where the first coded data is located to obtain second coded data, and send it at the current transmission opportunity or delay Z transmission opportunities, for example, t=5 transmission opportunities It contains part of the first coded data of P-4-1, some other coded data of P-5-1 and other original data represented by O-5-1, and network coding is performed on these data to generate the second coded data, such as P-5-2, and send on transmission opportunity t=5. The difference between the embodiment in Figure 5b and the embodiment in Figure 5a is that the coded data is carried by multiple transmission opportunities, which enhances the interleaving capability of the coded data and can better resist random channel errors. However, due to the same maximum delay constraint, the embodiment in Figure 5b has a smaller transmission interval between encoded data and original data than in the embodiment in Figure 5a, so the ability to resist burst errors is slightly weaker.

For another example, as shown in Figure 5c, the difference from the embodiment in Figure 5a is that the sliding granularity of the sliding window is S=P transmission opportunities, that is, the sliding window in the embodiment in Figure 5c does not have any overlapped, and the sliding window of the embodiment in FIG. 5a includes repeatedly encoded original data during the sliding process. Therefore, the encoding and decoding complexity of the embodiment in Fig. 5c is lower than that of the embodiment in Fig. 5a, but the error correction capability of the embodiment in Fig. 5c is not as good as that of the embodiment in Fig. 5a.

For another example, as shown in Figure 5d, similar to the difference between the embodiment in Figure 5c and the embodiment in Figure 5a, the difference between the embodiment in Figure 5d and the embodiment in Figure 5b is that the sliding granularity of the sliding window is S=P transmission opportunities, that is, the sliding window of the embodiment in Fig. 5d does not overlap during the sliding process, and the sliding window of the embodiment in Fig. 5b includes repeated encoded data packets in the sliding process, so Fig. The embodiment in FIG. 5d has lower encoding and decoding complexity than the embodiment in FIG. 5b, but the error correction capability of the embodiment in FIG. 5d is not as good as that in the embodiment in FIG. 5b.

In another possible implementation manner of part 400, the generation of the above-mentioned first coded data may also be implemented in a sliding window manner. In this embodiment, the above M pieces of first original data refer to a group of original data with the same group number. The sliding window is divided into G groups, and G is the number of divided groups of the original data that needs to be sent for each transmission opportunity, then the gth (1≤g≤G) group of sliding windows contains the gth group of original data. Use the g-th group sliding window to obtain the M first original data on the g-th group, the number of transmission opportunities for the M first original data is P, and perform network coding on the M first original data to obtain the same as A group of first coded data corresponding to the M first original data in the g-th group. Then, slide S transmission opportunities for the g-th group sliding window to obtain another set of M other original data on the g-th group, and then perform network coding on the M other original data on the g-th group to obtain the same A group of other coded data corresponding to the M other original data in group g. Wherein, the sliding granularity is S transmission opportunities, and the value range of S may be 1≤S≤P. Taking P=3, G=3 as an example, the schematic diagram of the solution of this embodiment using the sliding window implementation is shown in Figures 6a-6b.

For example, as shown in Figure 6a, the original data on the transmission opportunity t is divided into G (= 3) groups, denoted by t-1, t-2, t-3 respectively, for different transmission opportunities t or different groups The number of raw data represented by g, t-g can be different, and according to the number of groups of raw data, the number of sliding windows is also three groups, and the size of each group of sliding windows is M first raw data, corresponding to P transmission opportunities, for the gth The M first raw data on the group sliding window are subjected to network coding such as RLNC, MDS, or RS to generate the first coded data, and the last transmission opportunity of the M first raw data in the sliding window is delayed by 2 The transmission opportunity is sent; or, the first transmission opportunity of the M first original data within the sliding window is delayed by 4 transmission opportunities. The g-th group of sliding windows slides S=P transmission opportunities each time with the g-th group of raw data, and performs network coding on another group of M other raw data on the g-th group in the window to generate another group of other coded data. Delay 2 transmission opportunities relative to the last transmission opportunity of M other original data in this sliding window; or delay 4 transmission opportunities relative to the first transmission opportunity of M other original data in this sliding window . For different groups of sliding windows, the positions of the window head or the window tail of two adjacent groups of sliding windows may be staggered by Q transmission opportunities. In the figure, Q=1 transmission opportunities are staggered. For example, the first group of sliding windows slides to the transmission opportunities corresponding to 4-1, 5-1, and 6-1, and the second group of sliding windows slides to the corresponding transmission positions of 5-2, 6-2, and 7-2. Perform network coding on other original data and/or first coded data on the transmission opportunity where the first coded data is located, to obtain second coded data. The second coded data is sent at the current transmission opportunity or delayed for Z transmission opportunities. In the figure, the second coded data is sent at the current transmission opportunity. In the figure, the first coded data only occupies one transmission opportunity. If the first coded data occupies two transmission opportunities, the second coded data can be composed of other original data on the transmission opportunity where the first coded data is located, the first coded data, or One or more items of other coded data on the transmission opportunity where the first coded data is located are obtained by performing network coding.

For another example, in the embodiment in FIG. 6b, the difference between the embodiment in FIG. 6a is that for different groups of sliding windows, the positions of the window head or the window tail of two adjacent groups of sliding windows can be staggered by Q transmission opportunities. In the figure, the staggered Q= 2 transmission opportunities, for example, the first group of sliding windows slides to the transmission opportunities corresponding to 4-1, 5-1, and 6-1, and the second group of sliding windows slides to the transmissions corresponding to 6-2, 7-2, and 8-2 Location.

FIG. 7 is a schematic flowchart of a communication method 700 provided in an embodiment of the present application. The execution subject of this method is the receiving device. The receiving device may be a terminal (such as an XR terminal), or a chip, a chip system, or a processor that supports the terminal to implement the method. The receiving device may be a network device (such as a core network device, an access network device, a WiFi router, or a WiFi access point), or a chip, a chip system, or a processor that supports the network device to implement the method. The receiving device may be a server (such as a cloud server), or a chip, a chip system, or a processor that supports the server to implement the method. As shown in FIG. 7, the method 700 of this embodiment may include part 710 and part 720:

Part 710: receiving M' pieces of first original data and N' pieces of first coded data, wherein M' is a positive integer, and N' is a positive integer.

In part 710, optionally, the receiving end acquires relevant parameters of the first encoded data. Wherein, the relevant parameters of the first coded data include the coded depth M, the ratio R of the first coded data or the number N of the first coded data or the code rate R', the transmission opportunity of the first coded data, grouping information and other parameters. one or more. During the transmission and reception process of the communication system, some data may be discarded due to problems such as burst errors caused by channel quality, so the number of data actually received by the receiving end may be less than the number of data sent by the sending end . In view of this, in the embodiment of the present application, M', N', etc. are used in part 710 to describe the number of relevant data of the receiving end.

In part 710, optionally, the receiving end acquires parameters related to the first encoded data, which means that the network coding layer at the receiving end acquires parameters related to the first encoded data. For the acquisition of the relevant parameters of the first encoded data, the acquisition method can be predefined, semi-statically configured by the network side device, or customized by the receiving end device. The acquisition methods of different encoding parameters can be the same or different. For example, the encoding depth M is semi-statically configured by the network side device, the ratio or number of the first encoded data is customized by the receiving end device, and the transmission of the first encoded data Opportunities are predefined.

Part 720: Decoding the M' first original data and the N' first coded data to obtain M first original data, where the transmission opportunities used in the M first original data The number is P, including the first transmission opportunity, and the transmission opportunity for the N' first encoded data is delayed by X transmission opportunities compared with the P transmission opportunities for the M first original data, and X is Non-negative integer, P is a positive integer and satisfies P≥2, M is a positive integer and satisfies M'+N'≥M, M≥M'.

In a possible implementation manner of decoding the above-mentioned M' first original data and the N' first coded data in part 720 to obtain M first original data, the network coding layer at the receiving end performs the above-mentioned The M' first original data and the N' first encoded data are decoded corresponding to network coding, and the M' first original data corresponding to the above-mentioned N' first encoded data are obtained. Raw data. The number or ratio of the first raw data that needs to be generated for decoding (also referred to as decoding) corresponding to network coding is obtained according to the relevant parameters of the above-mentioned first coded data. Wherein the decoding method of the first original data may be a maximum distance separable (Maximum Distance Separable, MDS) code, a random linear network coding (random linear network coding, RLNC) code, a linear network coding (linear network coding, LNC) code, a determined One of linear network coding, batch sparse (Batched Sparse, BATS) code, block code, LT (Luby Transform) code, rateless code, RS (Reed-solomon) code, etc.

In part 720, in a possible implementation manner of decoding the above-mentioned M' first original data and the above-mentioned N' first encoded data to obtain M first original data, the receiving end obtains grouping information, and according to the grouping information, The receiver can packetize the raw data on each transmission opportunity. The group information generally includes the number of groups G, that is, the original data on one transmission opportunity is divided into G groups to obtain the original data of different groups, and different groups can be identified as group numbers 1 to G. Since the number of original data to be transmitted by each transmission opportunity can be fixed or dynamically changed, the number of original data of the same group number in each transmission opportunity may be equal or different. Moreover, the number of original data in different packets within the same transmission opportunity can be equal or unequal. The above M' first raw data refers to a group of raw data with the same group number. The grouping of the above-mentioned N' first coded data is similar to the above-mentioned M' first original data, and also refers to a group of coded data with the same group number. Decoding the above-mentioned M' first original data and the above-mentioned N' first encoded data may refer to decoding the above-mentioned M' first original data and the above-mentioned N' first encoded data with the same group number .

In part 720, optionally, the above-mentioned first transmission opportunity is also used for other original data except the above-mentioned first original data.

In part 720, optionally, the transmission opportunity for the above-mentioned N' first encoded data is delayed by X transmission opportunities than the P transmission opportunities for the above-mentioned M first original data include one of the following:

The transmission opportunity for the above-mentioned N' first coded data is delayed by at least X transmission opportunities than the first transmission opportunity in the P transmission opportunities for the above-mentioned M first original data, and X≥P-1 is satisfied;

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at most X transmission opportunities than the first transmission opportunity in the P transmission opportunities for the above-mentioned M first original data, and X≥P-1 is satisfied;

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at least X transmission opportunities than the last transmission opportunity among the P transmission opportunities for the above-mentioned M first original data; or

The transmission opportunity for the N' first encoded data is delayed by at most X transmission opportunities than the last transmission opportunity among the P transmission opportunities for the M first original data.

In part 720, optionally, the transmission opportunity for the above-mentioned N' first encoded data is delayed by no more than Y transmission opportunities than the P transmission opportunities for the above-mentioned M first original data, and Y is a non-negative integer ; the method also includes one of the following:

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity of the P transmission opportunities for the above-mentioned M first original data, and Satisfy Y≥X≥P-1;

The transmission opportunity for the above-mentioned N' first coded data is delayed by at least X transmission opportunities than the first transmission opportunity of the P transmission opportunities for the above-mentioned M first original data, The last transmission opportunity among the P transmission opportunities of the original data is delayed by at most Y transmission opportunities, and Y≥(X-P+1) and X≥P-1 are satisfied;

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the last transmission opportunity of the P transmission opportunities for the above-mentioned M first original data, and satisfies Y≥X; or

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at least X transmission opportunities than the last transmission opportunity among the P transmission opportunities for the above-mentioned M first original data, The first transmission opportunity among the P transmission opportunities of data is delayed by at most Y transmission opportunities, and Y≥X+P-1 is satisfied.

Optionally, as shown in FIG. 7 , method 700 may further include part 730, part 740 and part 750:

Part 730: Receive second coded data.

Similar to the acquisition of the relevant parameters of the above-mentioned first encoded data by the receiving end in part 710, the receiving end may also obtain the relevant parameters of the above-mentioned second encoded data, and the relevant parameters of the second encoded data include the ratio r of the second encoded data or the second encoded data One or more of parameters such as the number n of data, the code rate r′, and the transmission timing of the second coded data. For the meaning and acquisition method of the parameters corresponding to the second coded data, please refer to the above description of the relevant parameters of the first coded data, which will not be repeated here.

Similar to the decoding method of the above-mentioned first encoded data in part 710, the decoding method of the above-mentioned second encoded data includes MDS code, RLNC code, LNC code, BATS code, definite linear network coding, block code, LT code, rateless code, RS Codes such as codes, etc., will not be described in detail here.

Part 740: the above N' first coded data includes the first coded data A, the third transmission opportunity is used for the transmission of the first coded data A and the third transmission opportunity is also used for other coded data except the first coded data or the transmission of one or more of other raw data other than the first raw data, the method also includes:

The data received on the above-mentioned third transmission opportunity is decoded to obtain the above-mentioned first coded data A, and the data received on the above-mentioned third transmission opportunity includes one or more of the following:

The first coded data A, the above-mentioned other coded data, the above-mentioned first original data, the above-mentioned other original data and the above-mentioned second coded data.

In part 740, optionally, the transmission opportunity for the second encoded data is delayed by Z' transmission opportunities compared with the third transmission opportunity, where Z' is a non-negative integer. In the embodiment of the present application, since the total number of received data V1 on the third transmission opportunity is greater than the total number sent on the first transmission opportunity minus the quantity of the second coded data, the total number sent on the first transmission opportunity minus the second The quantity of coded data is represented by V2, and the received data can be used to solve random errors of any V1-V2 data on the third transmission opportunity, thereby overcoming the problem of random interference. Wherein, V1 and V2 are positive integers.

Part 750: Receive indication information; the indication information is used to indicate one or more of the following:

The sliding window information of the above-mentioned M first original data, the above-mentioned sliding window information indicates the identification information of the M first original data corresponding to the above-mentioned N' first encoded data; or

The group numbers corresponding to the above M pieces of first raw data.

It can be understood that the application does not limit the execution order of part 730 and part 750 . For example, part 730 can be executed first and then part 710 can be executed, or part 710 can be executed first and then part 730 can be executed. For another example, part 750 may be executed first, and then part 710 may be executed, or part 710 may be executed first, and then part 750 may be executed. This application does not specifically limit the execution order of Part 730 and Part 750.

Figure 8 shows a schematic structural diagram of a device. The apparatus 800 may be a network device, a terminal device, a server or a centralized controller, and may also be a chip, a chip system, or a processor that supports the network device, terminal device, server or centralized controller to implement the above method. The device can be used to implement the methods described in the above method embodiments, and for details, refer to the descriptions in the above method embodiments.

The apparatus 800 may include one or more processors 801, and the processors 801 may also be referred to as processing units, and may implement certain control functions. The processor 801 may be a general-purpose processor or a special-purpose processor. For example it could be a baseband processor or a central processing unit. The baseband processor can be used to process communication protocols and communication data, and the central processing unit can be used to control communication devices (such as base stations, baseband chips, terminals, terminal chips, DU or CU, etc.), execute software programs, and process Data for Software Programs.

In an optional design, the processor 801 can also store instructions and/or data 803, and the instructions and/or data 803 can be executed by the processor, so that the device 800 executes the above-mentioned method embodiment. described method.

In another optional design, the processor 801 may include a transceiver unit configured to implement receiving and sending functions. For example, the transceiver unit may be a transceiver circuit, or an interface, or an interface circuit, or a communication interface. The transceiver circuit, interface or interface circuit used to realize the receiving and transmitting functions can be separated or integrated together. The above-mentioned transceiver circuit, interface or interface circuit can be used for code/data reading and writing, or, the above-mentioned transceiver circuit, interface or interface circuit can be used for signal transmission or transfer.

In yet another possible design, the apparatus 800 may include a circuit, and the circuit may implement the function of sending or receiving or communicating in the foregoing method embodiments.

Optionally, the device 800 may include one or more memories 802, on which instructions 804 may be stored, and the instructions may be executed on the processor, so that the device 800 executes the above-mentioned method embodiments. described method. Optionally, data may also be stored in the memory. Optionally, instructions and/or data may also be stored in the processor. The processor and memory can be set separately or integrated together. For example, the corresponding relationships described in the foregoing method embodiments may be stored in a memory or in a processor.

Optionally, the apparatus 800 may further include a transceiver 805 and/or an antenna 806 . The processor 801 may be called a processing unit, and controls the apparatus 800. The transceiver 805 may be called a transceiver unit, a transceiver, a transceiver circuit, a transceiver device, or a transceiver module, etc., and is used to implement a transceiver function.

Optionally, the device 800 in this embodiment of this application can be used to execute the method described in Figure 4 or Figure 7 in this embodiment of this application.

The processors and transceivers described in this application can be implemented on integrated circuits (integrated circuits, ICs), analog ICs, radio frequency integrated circuits (RFICs), mixed-signal ICs, application specific integrated circuits (ASICs), printed circuit boards (printed circuit board, PCB), electronic equipment, etc. The processor and transceiver can also be fabricated using various IC process technologies such as complementary metal oxide semiconductor (CMOS), nMetal-oxide-semiconductor (NMOS), P-type Metal oxide semiconductor (positive channel metal oxide semiconductor, PMOS), bipolar junction transistor (Bipolar Junction Transistor, BJT), bipolar CMOS (BiCMOS), silicon germanium (SiGe), gallium arsenide (GaAs), etc.

The devices described in the above embodiments may be network devices or terminal devices, but the scope of the devices described in this application is not limited thereto, and the structure of the devices may not be limited by FIG. 8 . A device may be a stand-alone device or may be part of a larger device. For example the device may be:

(1) Stand-alone integrated circuits ICs, or chips, or chip systems or subsystems;

(2) A set of one or more ICs, optionally, the set of ICs may also include storage components for storing data and/or instructions;

(3) ASIC, such as modem (MSM);

(4) Modules that can be embedded in other devices;

(5) Receivers, terminals, smart terminals, cellular phones, wireless devices, handsets, mobile units, vehicle-mounted devices, network devices, cloud devices, artificial intelligence devices, machine devices, household devices, medical devices, industrial devices, etc.;

(6) Others and so on.

FIG. 9 provides a schematic structural diagram of a terminal device. The terminal device is applicable to the scenario shown in FIG. 1 . For ease of description, Figure 9 only shows the main components of the terminal device. As shown in FIG. 9 , the terminal device 900 includes a processor, a memory, a control circuit, an antenna, and an input and output device. The processor is mainly used to process communication protocols and communication data, control the entire terminal, execute software programs, and process data of software programs. Memory is primarily used to store software programs and data. The radio frequency circuit is mainly used for the conversion of the baseband signal and the radio frequency signal and the processing of the radio frequency signal. Antennas are mainly used to send and receive radio frequency signals in the form of electromagnetic waves. Input and output devices, such as touch screens, display screens, keyboards, etc., are mainly used to receive data input by users and output data to users.

When the terminal device is turned on, the processor can read the software program in the storage unit, analyze and execute the instructions of the software program, and process the data of the software program. When it is necessary to send data wirelessly, the processor performs baseband processing on the data to be sent, and then outputs the baseband signal to the radio frequency circuit. The radio frequency circuit processes the baseband signal to obtain a radio frequency signal and sends the radio frequency signal through the antenna in the form of electromagnetic waves. . When data is sent to the terminal device, the radio frequency circuit receives the radio frequency signal through the antenna, the radio frequency signal is further converted into a baseband signal, and the baseband signal is output to the processor, and the processor converts the baseband signal into data and processes the data deal with.

For ease of illustration, only one memory and processor are shown in FIG. 9 . In an actual terminal device, there may be multiple processors and memories. A memory may also be called a storage medium or a storage device, which is not limited in this embodiment of the present invention.

As an optional implementation, the processor may include a baseband processor and a central processing unit, the baseband processor is mainly used to process communication protocols and communication data, and the central processor is mainly used to control the entire terminal device, execute A software program that processes data for a software program. The processor in FIG. 9 integrates the functions of the baseband processor and the central processing unit. Those skilled in the art can understand that the baseband processor and the central processing unit can also be independent processors, interconnected through technologies such as a bus. Those skilled in the art can understand that a terminal device may include multiple baseband processors to adapt to different network standards, a terminal device may include multiple central processors to enhance its processing capability, and various components of a terminal device may be connected through various buses. The baseband processor may also be expressed as a baseband processing circuit or a baseband processing chip. The central processing unit may also be expressed as a central processing circuit or a central processing chip. The function of processing the communication protocol and communication data can be built in the processor, or stored in the storage unit in the form of a software program, and the processor executes the software program to realize the baseband processing function.

In an example, the antenna and the control circuit with the transceiver function may be regarded as the transceiver unit 911 of the terminal device 900 , and the processor with the processing function may be regarded as the processing unit 912 of the terminal device 900 . As shown in FIG. 9 , the terminal device 900 includes a transceiver unit 911 and a processing unit 912. The transceiver unit may also be referred to as a transceiver, a transceiver, a transceiver device, and the like. Optionally, the device used to realize the receiving function in the transceiver unit 911 can be regarded as a receiving unit, and the device used to realize the sending function in the transceiver unit 911 can be regarded as a sending unit, that is, the transceiver unit 911 includes a receiving unit and a sending unit. Exemplarily, the receiving unit may also be called a receiver, receiver, receiving circuit, etc., and the sending unit may be called a transmitter, transmitter, or transmitting circuit, etc. Optionally, the above-mentioned receiving unit and sending unit may be one integrated unit, or may be multiple independent units. The above-mentioned receiving unit and sending unit may be located in one geographic location, or may be dispersed in multiple geographic locations.

As shown in FIG. 10 , another embodiment of the present application provides a device 1000 . The device may be a terminal, network device, server or centralized controller, and may also be a component (such as an integrated circuit, chip, etc.) of the terminal, network device, server or centralized controller. The device may also be another communication module, which is used to implement the method in the method embodiment of the present application. The apparatus 1000 may include: a processing module 1002 (or referred to as a processing unit). Optionally, an interface module 1001 (or called a transceiver unit or a transceiver module) and a storage module 1003 (or called a storage unit) may also be included. The interface module 1001 is used to implement communication with other devices. The interface module 1001 may be, for example, a transceiver module or an input/output module.

In a possible design, one or more modules in Figure 10 may be implemented by one or more processors, or by one or more processors and memory; or by one or more processors and a transceiver; or by one or more processors, memories, and a transceiver, which is not limited in this embodiment of the present application. The processor, memory, and transceiver can be set independently or integrated.

The device has the function of implementing the terminal described in the embodiment of this application. For example, the device includes a module or unit or means (means) corresponding to the terminal performing the steps related to the terminal described in the embodiment of this application. The function or unit or The means (means) can be implemented by software, or by hardware, or by executing corresponding software by hardware, or by a combination of software and hardware. For details, further reference may be made to the corresponding descriptions in the aforementioned corresponding method embodiments. Alternatively, the device has the function of implementing the network device described in the embodiment of the present application, for example, the device includes a module or unit or means (means) corresponding to the network device performing the steps involved in the network device described in the embodiment of the present application , the function or unit or means (means) may be implemented by software, or by hardware, or by executing corresponding software by hardware, or by a combination of software and hardware. For details, further reference may be made to the corresponding descriptions in the aforementioned corresponding method embodiments.

Optionally, each module in the apparatus 1000 in the embodiment of the present application can be used to execute the method described in Figure 4 in the embodiment of the present application.

In a possible design, an apparatus 1000 may include: a processing module 1002 and an interface module 1001 . The processing module 1002 is used to encode M first original data to obtain N first encoded data, where M is a positive integer and N is a positive integer. The interface module 1001 is configured to send M pieces of first original data and N pieces of first coded data, wherein the number of transmission opportunities for transmitting M pieces of first original data is P, and includes the first transmission opportunity, and is used for The transmission opportunity for transmitting the N first coded data is delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the M first original data, X is a non-negative integer, P is a positive integer and satisfies P≧2.

In some possible implementations of the above device 1000, the first transmission opportunity is also used to transmit other original data except the first original data.

In some possible implementations of the above device 1000, the N pieces of first coded data include the first coded data A, the third transmission opportunity is used to transmit the first coded data A and the third transmission opportunity is also used to transmit One or more items of other coded data other than the coded data or other raw data except the first raw data, this embodiment also includes:

The processing module 1002 is further configured to encode other coded data on the third transmission opportunity, one or more items of the first original data and other original data, and the first coded data A to obtain second coded data.

In some possible implementation manners of the foregoing apparatus 1000, the third transmission opportunity is also used to transmit the second coded data.

In some possible implementations of the above-mentioned device 1000, the transmission opportunity for transmitting the second coded data is delayed by Z transmission opportunities compared with the third transmission opportunity, and Z is a non-negative integer.

In some possible implementations of the above-mentioned device 1000, the transmission opportunity for transmitting the N first encoded data is delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the M first original data, including one of the following :

The transmission opportunity for transmitting the N first encoded data is delayed by at least X transmission opportunities than the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and X≥P-1 is satisfied;

The transmission opportunity for transmitting the N first encoded data is delayed by at most X transmission opportunities than the first transmission opportunity in the P transmission opportunities for transmitting the M first original data, and X≥P-1 is satisfied;

the transmission opportunity for transmitting the N first encoded data is delayed by at least X transmission opportunities than the last transmission opportunity of the P transmission opportunities for transmitting the M first original data; or

The transmission opportunity for transmitting the N first encoded data is delayed by at most X transmission opportunities from the last transmission opportunity of the P transmission opportunities for transmitting the M first original data.

In some possible implementations of the above-mentioned device 1000, a possibility that the transmission opportunity for transmitting the N first coded data is delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the M first original data In the embodiment, this embodiment also includes: the transmission opportunity for transmitting the above-mentioned N first coded data is delayed by no more than Y transmission opportunities than the P transmission opportunities for transmitting the above-mentioned M first original data, and Y is not negative integer. The method includes one of the following:

The transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity of the P transmission opportunities for transmitting the above-mentioned M first original data, And satisfy Y≥X≥P-1;

The transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at least X transmission opportunities than the first transmission opportunity of the P transmission opportunities for transmitting the above-mentioned M first original data, and is delayed by at least X transmission opportunities than the first one of the P transmission opportunities for transmitting the above-mentioned M first original data. The last transmission opportunity among the P transmission opportunities of the first raw data is delayed by at most Y transmission opportunities, and Y≥(X-P+1) and X≥P-1 are satisfied;

The transmission opportunity for transmitting the above-mentioned N first coded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the last transmission opportunity among the P transmission opportunities for transmitting the above-mentioned M first original data, and satisfy Y ≥ X; or

The transmission opportunity for transmitting the above-mentioned N first encoded data is delayed by at least X transmission opportunities than the last transmission opportunity among the P transmission opportunities for transmitting the above-mentioned M first original data, and is delayed by at least X transmission opportunities than the last one of the P transmission opportunities for transmitting the above-mentioned M first original data. The first transmission opportunity among P transmission opportunities of an original data delays at most Y transmission opportunities, and satisfies Y≥X+P-1

In some possible implementations of the above device 1000, the interface module 1001 is also configured to send indication information; the indication information is used to indicate one or more of the following:

The sliding window information of the M first original data, where the sliding window information indicates the identification information of the M first original data corresponding to the N first encoded data; or

A group number corresponding to the M pieces of first raw data.

In some possible implementations of the above-mentioned device 1000, the indication information is encapsulated in a data packet header of the first encoded data.

Optionally, each module in the apparatus 1000 in the embodiment of the present application can also be used to execute the method described in Figure 7 in the embodiment of the present application.

In a possible design, an apparatus 1000 may include: a processing module 1002 and an interface module 1001 . The interface module 1001 is used for receiving M' pieces of first original data and N' pieces of first coded data, wherein M' is a positive integer and N' is a positive integer. The processing module 1002 is configured to decode the M' first original data and the N' first coded data to obtain M first original data, wherein the number of transmission opportunities for the M first original data is P , including the first transmission opportunity, and the transmission opportunity for the N' first encoded data is delayed by X transmission opportunities compared with the P transmission opportunities for the M first original data, X is a non-negative integer, and P is a positive integer And satisfy P≥2, M is a positive integer and satisfy M^'+N'≥M, M≥M'.

In some possible implementation manners of the above-mentioned apparatus 1000, the first transmission opportunity is also used for other original data except the first original data.

In some possible implementation manners of the above-mentioned apparatus 1000, the interface module 1001 is further configured to receive the second coded data.

In some possible implementations of the above device 1000, the N' pieces of first coded data include the first coded data A, the third transmission opportunity is used for the transmission of the first coded data A and the third transmission opportunity is also used for all but the first coded data A The transmission of one or more items of encoded data other than encoded data or other original data other than the first original data, this embodiment also includes:

The processing module 1002 is further configured to decode the received data on the third transmission opportunity to obtain the first coded data A, and the data received on the third transmission opportunity includes one or more of the following:

First encoded data A, other encoded data, first original data, other original data and second encoded data.

In some possible implementations of the above device 1000, the transmission opportunity for the second coded data is delayed by Z' transmission opportunities compared with the third transmission opportunity, and Z' is a non-negative integer.

In some possible implementations of the above-mentioned device 1000, the transmission opportunities for the above-mentioned N' first encoded data are delayed by X transmission opportunities than the P transmission opportunities for the above-mentioned M first original data include one of the following kind:

The transmission opportunity for the above-mentioned N' first coded data is delayed by at least X transmission opportunities than the first transmission opportunity in the P transmission opportunities for the above-mentioned M first original data, and X≥P-1 is satisfied;

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at most X transmission opportunities than the first transmission opportunity in the P transmission opportunities for the above-mentioned M first original data, and X≥P-1 is satisfied;

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at least X transmission opportunities than the last transmission opportunity among the P transmission opportunities for the above-mentioned M first original data; or

The transmission opportunity for the N' first encoded data is delayed by at most X transmission opportunities than the last transmission opportunity among the P transmission opportunities for the M first original data.

In some possible implementations of the above-mentioned device 1000, the transmission opportunities for the above-mentioned N' first encoded data are delayed by no more than Y transmission opportunities than the P transmission opportunities for the above-mentioned M first original data, and Y is A nonnegative integer; the method also includes one of the following:

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity of the P transmission opportunities for the above-mentioned M first original data, and Satisfy Y≥X≥P-1;

The transmission opportunity for the above-mentioned N' first coded data is delayed by at least X transmission opportunities than the first transmission opportunity of the P transmission opportunities for the above-mentioned M first original data, The last transmission opportunity among the P transmission opportunities of the original data is delayed by at most Y transmission opportunities, and Y≥(X-P+1) and X≥P-1 are satisfied;

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the last transmission opportunity of the P transmission opportunities for the above-mentioned M first original data, and satisfies Y≥X; or

The transmission opportunity for the above-mentioned N' first encoded data is delayed by at least X transmission opportunities than the last transmission opportunity among the P transmission opportunities for the above-mentioned M first original data, The first transmission opportunity among the P transmission opportunities of data is delayed by at most Y transmission opportunities, and Y≥X+P-1 is satisfied.

In some possible implementations of the above device 1000, the interface module 1001 is also configured to receive indication information; the indication information is used to indicate one or more of the following:

The sliding window information of the M first original data, where the sliding window information indicates the identification information of the M first original data corresponding to the N' first encoded data; or

A group number corresponding to the M pieces of first raw data.

It can be understood that, in some scenarios, some optional features in the embodiments of the present application may be implemented independently without depending on other features, such as the current solution on which they are based, to solve corresponding technical problems and achieve corresponding The effect can also be combined with other features according to requirements in some scenarios. Correspondingly, the devices given in the embodiments of this application can also implement these features or functions correspondingly, which will not be repeated here.

Those skilled in the art can also understand that various illustrative logical blocks and steps listed in the embodiments of the present application can be implemented by electronic hardware, computer software, or a combination of both. Whether such functionality is implemented as hardware or software depends upon the particular application and overall system design requirements. For corresponding applications, those skilled in the art can use various methods to implement the described functions, but such implementation should not be understood as exceeding the protection scope of the embodiments of the present application.

It can be understood that the processor in the embodiment of the present application may be an integrated circuit chip having a signal processing capability. In the implementation process, each step of the above-mentioned method embodiment can be completed by an integrated logic circuit of hardware in a processor or an instruction in the form of software. The above-mentioned processor may be a general-purpose processor, a digital signal processor (digital signal processor, DSP), an application specific integrated circuit (application specific integrated circuit, ASIC), a field programmable gate array (field programmable gate array, FPGA) or other programmable Logic devices, discrete gate or transistor logic devices, discrete hardware components.

The solutions described in this application can be implemented in various ways. For example, these techniques can be implemented in hardware, software, or a combination of hardware. For a hardware implementation, a processing unit for performing these techniques at a communication device may be implemented in one or more general purpose processors, DSPs, digital signal processing devices, ASICs, programmable logic devices, FPGAs, or other programmable logic devices , discrete gate or transistor logic, discrete hardware components, or any combination of the above. A general-purpose processor can be a microprocessor, and a processor can also be realized by a combination of computing devices, such as a digital signal processor and a microprocessor, multiple microprocessors, one or more microprocessors combined with a digital signal processor core, or any other similar configuration.

It can be understood that 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. Wherein, 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. 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 datarate 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, DR RAM). 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 present application also provides a computer-readable medium, on which a computer program is stored, and when the computer program is executed by a computer, the functions of any of the above method embodiments are realized.

The present application also provides a computer program product, which realizes the functions of any one of the above method embodiments when executed by a computer.

The solutions described in the above embodiments may be fully or partially implemented 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 includes one or more computer instructions. When the computer 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 can 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 (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.). 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, a data center, etc. integrated with one or more available media. The available medium may be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a high-density digital video disc (digital video disc, DVD)), or a semiconductor medium (for example, a solid state disk (solid state disk, SSD)) etc.

It is to be understood that references to "an embodiment" throughout the specification mean that a particular feature, structure, or characteristic related to the embodiment is included in at least one embodiment of the present application. Thus, various embodiments throughout the specification are not necessarily referring to the same embodiment. Furthermore, the particular features, structures or characteristics may be combined in any suitable manner in one or more embodiments. It can be understood that in various embodiments of the present application, the size of the sequence numbers of the above-mentioned processes does not mean the order of execution, and the execution order of the processes should be determined by their functions and internal logic, and should not be used in the embodiments of the present application. The implementation process constitutes any limitation.

It can be understood that in this application, "when", "if" and "if" all mean that the device will make corresponding processing under certain objective circumstances, and it is not a time limit, and it is not required that the device implements a certain The act of judgment does not mean that there are other limitations.

"Simultaneously" in this application can be understood as at the same point in time, or within a period of time, or within the same period, and can be specifically understood in conjunction with the context.

Those skilled in the art can understand that: the first, second and other numbers involved in this application are only for the convenience of description, and are not used to limit the scope of the embodiments of this application. The specific values of the numbers (also referred to as indexes), the specific values of the quantities, and the positions in this application are only for illustrative purposes, not the only form of expression, and are not used to limit the scope of the embodiments of the present application . The various numbers such as the first one and the second number involved in this application are only for the convenience of description to distinguish, and are not used to limit the scope of the embodiments of the present application.

The use of the singular in this application is intended to mean "one or more" rather than "one and only one", unless otherwise specified. In the present application, unless otherwise specified, "at least one" is intended to mean "one or more", and "plurality" is intended to mean "two or more".

Additionally, the terms "system" and "network" are often used herein interchangeably. The term "and/or" in this article is just an association relationship describing associated objects, which means that there can be three relationships, for example, A and/or B can mean: A exists alone, A and B exist simultaneously, and there exists alone The three cases of B, where A can be singular or plural, and B can be singular or plural. The character "/" generally indicates that the contextual objects are an "or" relationship.

Herein, the term "at least one of" or "at least one of" means all or any combination of the listed items, for example, "at least one of A, B and C", It can mean: A alone exists, B exists alone, C exists alone, A and B exist at the same time, B and C exist at the same time, and A, B and C exist at the same time, where A can be singular or plural, and B can be Singular or plural, C can be singular or plural.

It can be understood that in each embodiment of the present application, "B corresponding to A" means that B is associated with A, and B can be determined according to A. But it should also be understood that determining B based on A does not mean determining B only based on A, and that B can also be determined based on A and/or other information.

Predefinition in this application can be understood as definition, predefinition, storage, prestorage, prenegotiation, preconfiguration, curing, or prefiring.

Those skilled in the art can understand 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 implemented 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 understand that for the convenience and brevity of description, the specific working process of the above-described system, device and unit can refer to the corresponding process in the foregoing method embodiment, and will not be repeated here.

It can be understood that the systems, devices and methods described in this application can also 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 displayed 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 medium includes: U disk, mobile hard disk, read-only memory (read-only memory, ROM), random access memory (random access memory, RAM), magnetic disk or optical disk and other various media that can store program codes. .

The same or similar parts among the various embodiments in this application can be referred to each other. In the various embodiments in this application, and the various implementation methods/implementation methods/implementation methods in each embodiment, if there is no special description and logical conflict, different embodiments, and each implementation method/implementation method in each embodiment The terms and/or descriptions between implementation methods/implementation methods are consistent and can be referred to each other. Different embodiments, and the technical features in each implementation manner/implementation method/implementation method in each embodiment are based on their inherent Logical relationships can be combined to form new embodiments, implementation modes, implementation methods, or implementation methods. The embodiments of the present application described above are not intended to limit the scope of protection of the present application.

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.

Claims (23)

1. A data transmission method, characterized in that, comprising: Encoding the M first raw data to obtain N first encoded data, where M is a positive integer and N is a positive integer; sending the M first original data and the N first encoded data, where the number of transmission opportunities used to transmit the M first original data is P, and includes the first transmission opportunity, and is used The transmission opportunity for transmitting the N first encoded data is delayed by X transmission opportunities compared with the P transmission opportunities for transmitting the M first original data, X is a non-negative integer, P is a positive integer and satisfies P≥ 2. 2. The method according to claim 1, wherein the first transmission opportunity is also used to transmit other original data except the first original data. 3. The method according to claim 1 or 2, wherein the N first coded data comprise first coded data A, the third transmission opportunity is used to transmit the first coded data A, and the third transmission opportunity Also for transmitting one or more of encoded data other than the first encoded data or raw data other than the first raw data, the method further comprising: Encoding the other coded data, one or more items of the first original data and the other original data, and the first coded data A at a third transmission opportunity to obtain second coded data. 4. The method according to claim 3, wherein the third transmission opportunity is also used to transmit the second coded data. 5. The method according to claim 3, wherein the transmission opportunity for transmitting the second coded data is delayed by Z transmission opportunities compared with the third transmission opportunity, and Z is a non-negative integer. 6. The method according to any one of claims 1-5, wherein the transmission opportunities for transmitting the N first coded data are more than the P chances for transmitting the M first original data Transmission opportunities delayed by X transmission opportunities include one of the following: The transmission opportunity used to transmit the N first encoded data is delayed by at least X transmission opportunities compared with the first transmission opportunity among the P transmission opportunities used to transmit the M first original data, and X≥P -1; The transmission opportunity for transmitting the N first encoded data is delayed by at most X transmission opportunities compared with the first transmission opportunity of the P transmission opportunities for transmitting the M first original data, and X≥P -1; the transmission opportunity for transmitting the N first encoded data is delayed by at least X transmission opportunities than the last transmission opportunity of the P transmission opportunities for transmitting the M first original data; or The transmission opportunity for transmitting the N first coded data is delayed by at most X transmission opportunities than the last transmission opportunity among the P transmission opportunities for transmitting the M first original data. 7. The method according to any one of claims 1-5, characterized in that, the transmission opportunities for transmitting the N first coded data are less than the P chances for transmitting the M first original data The transmission opportunity delay does not exceed Y transmission opportunities, and Y is a non-negative integer; the method also includes one of the following: The transmission opportunity for transmitting the N first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity of the P transmission opportunities for transmitting the M first original data chance, and satisfy Y≥X≥P-1; The transmission opportunity used to transmit the N first encoded data is delayed by at least X transmission opportunities compared with the first transmission opportunity among the P transmission opportunities used to transmit the M first original data, and is delayed by at least X transmission opportunities compared with the transmission opportunity used to transmit the The last transmission opportunity among the P transmission opportunities of the M first raw data is delayed by at most Y transmission opportunities, and Y≥(X-P+1) and X≥P-1 are satisfied; The transmission opportunity for transmitting the N first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the last transmission opportunity among the P transmission opportunities for transmitting the M first original data , and satisfy Y≥X; or The transmission opportunity for transmitting the N first coded data is delayed by at least X transmission opportunities compared with the last transmission opportunity among the P transmission opportunities for transmitting the M first original data, and is delayed by at least X transmission opportunities compared with the transmission opportunity for transmitting the The first transmission opportunity among the P transmission opportunities of the M first original data is delayed by at most Y transmission opportunities, and Y≧X+P−1 is satisfied. 8. The method according to any one of claims 1-7, further comprising, sending indication information; the indication information is used to indicate one or more of the following: The sliding window information of the M first original data, the sliding window information indicating the identification information of the M first original data corresponding to the N first encoded data; or A group number corresponding to the M pieces of first raw data. 9. The method according to claim 8, wherein the indication information is encapsulated in a data packet header of the first encoded data. 10. A data receiving method, characterized in that, comprising: Receive M' first original data and N' first coded data, where M' is a positive integer and N' is a positive integer; Decoding the M' first original data and the N' first encoded data to obtain M first original data, where the number of transmission opportunities used in the M first original data is P, including the first transmission opportunity, and the transmission opportunity for the N' first encoded data is delayed by X transmission opportunities compared with the P transmission opportunities for the M first original data, and X is a non-negative integer , P is a positive integer and satisfies P≥2, M is a positive integer and satisfies M'+N'≥M, M≥M'. 11. The method according to claim 10, wherein the first transmission opportunity is also used for other original data except the first original data. 12. The method according to claim 10 or 11, further comprising: Receive second encoded data. 13. The method according to claim 12, wherein the N' first coded data comprise first coded data A, the third transmission opportunity is used for the transmission of the first coded data A and the third transmission opportunity Also for the transmission of one or more of encoded data other than the first encoded data or raw data other than the first raw data, the method further comprising: Decoding the received data on the third transmission opportunity to obtain the first coded data A, the data received on the third transmission opportunity includes one or more of the following: The first encoded data A, the other encoded data, the first original data, the other original data and the second encoded data. 14. The method according to claim 13, wherein the transmission opportunity for the second coded data is delayed by Z' transmission opportunities compared with the third transmission opportunity, and Z' is a non-negative integer. 15. The method according to any one of claims 10-14, characterized in that, the transmission opportunities for the N' first coded data are greater than the P transmission opportunities for the M first original data Opportunities delay X transmission opportunities include one of the following: The transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities compared with the first transmission opportunity of the P transmission opportunities for the M first original data, and X≥P- 1; The transmission opportunity for the N' first encoded data is delayed by at most X transmission opportunities compared with the first transmission opportunity of the P transmission opportunities for the M first original data, and X≥P- 1; the transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities from the last of the P transmission opportunities for the M first original data; or The transmission opportunity for the N' first encoded data is delayed by at most X transmission opportunities than the last transmission opportunity among the P transmission opportunities for the M first original data. 16. The method according to any one of claims 10-14, characterized in that, the transmission opportunities for the N' first coded data are greater than the P transmission opportunities for the M first original data The opportunity delay does not exceed Y transmission opportunities, and Y is a non-negative integer; the method also includes one of the following: The transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the first transmission opportunity of the P transmission opportunities for the M first original data , and satisfy Y≥X≥P-1; The transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities compared with the first transmission opportunity of the P transmission opportunities for the M first original data, which is longer than that for the M The last transmission opportunity among the P transmission opportunities of the first original data is delayed by at most Y transmission opportunities, and Y≥(X-P+1) and X≥P-1 are satisfied; The transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities and at most Y transmission opportunities compared with the last transmission opportunity among the P transmission opportunities for the M first original data, and satisfy Y≥X; or The transmission opportunity for the N' first encoded data is delayed by at least X transmission opportunities compared with the last transmission opportunity among the P transmission opportunities for the M first original data, and is delayed by at least X transmission opportunities compared with the M The first transmission opportunity among the P transmission opportunities of the first original data is delayed by at most Y transmission opportunities, and Y≧X+P−1 is satisfied. 17. The method according to any one of claims 10-16, the method further comprising receiving indication information; the indication information is used to indicate one or more of the following: The sliding window information of the M first original data, the sliding window information indicating the identification information of the M first original data corresponding to the N' first encoded data; or A group number corresponding to the M pieces of first raw data. 18. A communication device, comprising: a processing module and an interface module; The processing module is used to encode M first raw data to obtain N first encoded data, where M is a positive integer and N is a positive integer; The interface module is configured to send the M first original data and the N first coded data, wherein the number of transmission opportunities for transmitting the M first original data is P, and includes the first One transmission opportunity, and the transmission opportunity used to transmit the N first encoded data is delayed by X transmission opportunities than the P transmission opportunities used to transmit the M first original data, X is a non-negative integer, and P is It is a positive integer and satisfies P≥2. 19. A communication device, comprising: a processing module and an interface module; The interface module is used to receive M' first original data and N' first encoded data, wherein M' is a positive integer and N' is a positive integer; The processing module is configured to decode the M' first original data and the N' first coded data to obtain M first original data, wherein, for the M first original data The number of transmission opportunities is P, including the first transmission opportunity, and the transmission opportunities for the N' first encoded data are delayed by X transmission opportunities compared with the P transmission opportunities for the M first original data , X is a non-negative integer, P is a positive integer and satisfies P≥2, M is a positive integer and satisfies M'+N'≥M, M≥M'. 20. A communication device, characterized by comprising: a processor, the processor is coupled with a memory, and the memory is used to store a program or an instruction, and when the program or instruction is executed by the processor, the The device executes the method according to any one of claims 1 to 9, or claims 10 to 17. 21. A computer-readable storage medium, on which are stored computer programs or instructions, characterized in that, when the computer programs or instructions are executed, the computer executes the computer according to claims 1 to 9, or claims 10 to 17. any one of the methods described. 22. A computer program product containing instructions, characterized in that, when it is run on a computer, it causes the computer to execute the method according to any one of claims 1 to 9, or any one of claims 10 to 17. 23. A communication system, comprising the device according to claim 18, and the device according to claim 19.

Images