WO2022027661A1

WO2022027661A1 - Communication method, apparatus and system

Info

Publication number: WO2022027661A1
Application number: PCT/CN2020/107973
Authority: WO
Inventors: 谭志远; 董朋朋; 祝慧颖
Original assignee: 华为技术有限公司
Priority date: 2020-08-07
Filing date: 2020-08-07
Publication date: 2022-02-10
Also published as: CN115668828A

Abstract

The embodiments of the present application provide a communication method, apparatus and system. The method comprises: coding first original data to obtain first coded data; transmitting the first coded data to a first communication device; receiving indication information from the first communication device; according to the indication information, acquiring second original data and coding rate information, wherein the second original data comprises part or all of the first original data; performing joint coding on third original data and the second original data according to the coding rate information to obtain second coded data, the first original data being not included in the third original data; and sending the second coded data to the first communication device. The solution, on one hand, guides next coding on the basis of a feedback mechanism, thus achieving self-adaptive adjustment of relevant coding parameters, and improving coding performance and data transmission efficiency and quality; and the solution, on the other hand, can joint code new and old data, thus increasing the success rate that a first communication device on the receiving side decodes correctly and obtain original data.

Description

Communication method, device and system

technical field

The embodiments of the present application relate to the field of communication technologies, and in particular, to a communication method, apparatus, and system.

Background technique

Network coding can maximize the throughput of the entire network and effectively improve the transmission of wireless communication systems by combining different information streams at the routing node and transmitting, that is, the intermediate nodes in the network encode and transmit the received data packets with random coefficients. performance.

How to further improve coding performance, such as improving spectral efficiency and error correction capability, reducing packet error rate and coding and decoding complexity, etc., need to be solved at present.

SUMMARY OF THE INVENTION

Embodiments of the present application provide a communication method, device, and system, so as to improve encoding performance, thereby improving data transmission efficiency and quality.

In a first aspect, an embodiment of the present application provides a communication method, which may be executed by a terminal or a network device, or may be executed by a component of the terminal or network device (for example, a processor, a chip, or a chip system, etc.), including: The first original data is encoded to obtain the first encoded data; the first encoded data is sent to the first communication device; the indication information from the first communication device is received; the second original data and the encoding bit rate information are obtained according to the indication information, The second original data includes part or all of the first original data; according to the encoding rate information, the third original data and the second original data are jointly encoded to obtain second encoded data, the third original data does not include the first original data; sending the second encoded data to the first communication device.

Based on this solution, after sending the first encoded data to the first communication device, the indication information can be received, and then based on the indication information, the second original data in the encoded original data and the currently encoded encoding rate information are acquired, Further, the third original data that has not participated in encoding and the second original data that have participated in encoding are jointly encoded according to the encoding bit rate information to obtain second encoded data, and the second encoded data is sent to the first communication device. This solution, on the one hand, is based on the feedback mechanism to guide the next encoding, which can realize adaptive adjustment of relevant encoding parameters, thereby improving spectral efficiency, error correction capability, and reducing packet error rate and encoding and decoding complexity, thereby improving encoding performance. , thereby improving the efficiency and quality of data transmission. On the other hand, joint coding of new and old data is realized, which can improve the success rate of the first communication device on the receiving side to correctly decode the original data.

In a possible implementation method, the second original data includes one or more first original data packets in the first original data, the indication information indicates the number of the first original data packets; the first original data packet is obtained according to the indication information Two original data, including: acquiring the second original data according to the number of the first original data packets.

In this solution, the number of the first original data packets is indicated by the indication information, which facilitates the acquisition of the second original data from the first original data that has already participated in the encoding, enables the realization of the joint encoding of the old and new data, and thus enables the improvement of the encoding ability .

The first original data packet in the embodiment of the present application is one or more original data packets contained in the first original data. The number of the first original data packets may be understood as the number of original data packets related to the second original data in the first original data. Alternatively, it can be understood that the number of the first original data packets is the number of original data packets used to determine the second original data in the first original data.

The definition of the first original data package here is applicable to the whole text, that is, for the meaning of the first original data package appearing in the whole text, reference may be made to the above description.

In a possible implementation method, the second original data includes one or more first original data blocks in the first original data, and the indication information indicates the number of the first original data blocks; the first original data block is obtained according to the indication information. Two original data, including: acquiring the second original data according to the number of the first original data blocks.

In this solution, the number of the first original data blocks is indicated by the indication information, which facilitates the acquisition of the second original data from the first original data that has already participated in the encoding, enables the realization of the joint encoding of the old and new data, and thus enables the improvement of the encoding ability .

In a possible implementation method, the indication information indicates a rank corresponding to the first encoded data; the second original data includes one or more first original data packets in the first original data; the first original data packet is obtained according to the indication information 2. Original data, including: determining the number of the first original data packets according to the rank corresponding to the first encoded data; and acquiring the second original data according to the number of the first original data packets.

In this solution, the rank corresponding to the first coded data reflects the number of equivalent correct original data packets obtained by the first communication device decoding the first coded data, so that the rank corresponding to the first coded data is indicated by the indication information, which is convenient for Determining the number of the first original data packets facilitates obtaining the second original data from the first original data that has already participated in encoding, enabling the realization of joint encoding of new and old data, thereby enabling the improvement of encoding capability.

In this embodiment of the present application, the number of equivalent correct original data packets can be understood as the sum of the number of actual decoded correct original data packets and the number of valid (linearly independent) redundant data packets, and can also be understood as the number of correctly received Number of valid encoded packets. There is a corresponding relationship between the number of equivalent correct original data packets and the rank corresponding to the first encoded data. A unified description is made here, and will not be repeated in the future.

In a possible implementation method, the indication information indicates a rank corresponding to the first encoded data, and the second original data includes one or more first original data blocks in the first original data; the first original data block is obtained according to the indication information. 2. Original data, including: determining the number of the first original data blocks according to the rank corresponding to the first encoded data; and acquiring the second original data according to the number of the first original data blocks.

In this solution, the rank corresponding to the first coded data reflects the number of equivalent correct original data packets obtained by the first communication device decoding the first coded data, so that the rank corresponding to the first coded data is indicated by the indication information, which is convenient for Determining the number of the first original data blocks facilitates obtaining the second original data from the first original data that has already participated in encoding, enabling the realization of joint encoding, thereby enabling the improvement of encoding capability.

The first original data block in the embodiment of the present application is one or more original data blocks included in the first original data. The number of the first original data blocks may be understood as the number of original data blocks related to the second original data in the first original data. Alternatively, it can be understood that the number of the first original data blocks is the number of original data blocks used to determine the second original data in the first original data.

The definition of the first original data block here is applicable to the whole text, that is, for the meaning of the first original data block appearing in the whole text, reference may be made to the above description.

In a possible implementation method, the indication information indicates the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data; the second original data includes one or more first original data in the first original data. original data packets; obtaining the second original data according to the indication information includes: determining the number of the first original data packets according to the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data; The number of the first original data packets, and the second original data is obtained.

In this solution, the reception situation of the system data packets corresponding to the first coded data and the reception situation of the redundant data packets reflect the number of equivalent correct original data packets obtained by the first communication device decoding the first coded data, so that by indicating The information indicates the reception situation of the system data packets corresponding to the first encoded data and the reception situation of the redundant data packets, which is convenient for determining the number of the first original data packets, thereby facilitating the acquisition of the second original data from the first original data that has participated in the encoding, The realization of joint coding of new and old data is enabled, thereby enabling the improvement of coding capability.

In a possible implementation method, the indication information indicates the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data; the second original data includes one or more first original data in the first original data. original data blocks; obtaining the second original data according to the indication information includes: determining the number of the first original data blocks according to the reception conditions of the system data packets and the redundant data packets corresponding to the first encoded data; The number of first original data blocks, and the second original data is obtained.

In this solution, the reception situation of the system data packets corresponding to the first coded data and the reception situation of the redundant data packets reflect the number of equivalent correct original data packets obtained by the first communication device decoding the first coded data, so that by indicating The information indicates the reception status of the system data packets and the redundant data packet reception status corresponding to the first encoded data, so as to facilitate the determination of the number of the first original data blocks, thereby facilitating the acquisition of the second original data from the first original data that has participated in the encoding, The realization of joint coding of new and old data is enabled, thereby enabling the improvement of coding capability.

In a possible implementation method, the indication information indicates the encoded first association depth; the second original data includes one or more first original data packets in the first original data; the second original data is obtained according to the indication information The data includes: determining the number of the first original data packets according to the first association depth; and acquiring the second original data according to the number of the first original data packets.

In this solution, the first associated depth of encoding is used to indicate the number of original data packets that need to be acquired in the next encoding that have participated in encoding, and the acquired original data packets will participate in the next encoding, so that the encoded The first correlation depth is convenient for determining the number of the first original data packets, which in turn facilitates obtaining the second original data from the first original data that has already participated in the encoding, enabling the realization of the joint encoding of the new and old data, thereby enabling the encoding capability. promote.

In a possible implementation method, the indication information indicates the encoded first associated depth; the second original data includes one or more first original data blocks in the first original data; the second original data is obtained according to the indication information The data includes: determining the number of the first original data blocks according to the first association depth; and acquiring the second original data according to the number of the first original data blocks.

In this solution, the first associated depth of encoding is used to indicate the number of original data blocks that need to be acquired in the next encoding that have participated in encoding, and the acquired original data blocks will participate in the next encoding, thereby indicating the encoded The first correlation depth is convenient for determining the number of the first original data blocks, which in turn facilitates obtaining the second original data from the first original data that has already participated in the encoding, enabling the realization of joint encoding of new and old data, thereby enabling the improvement of encoding capabilities. promote.

In a possible implementation method, the encoding rate information indicates the number of redundant data packets corresponding to the second encoded data, the number of encoded data packets corresponding to the second encoded data, or the encoding code corresponding to the second encoded data Rate.

Based on this solution, it is convenient to determine the coding rate information, optimize the coding parameters and performance, and improve the reliability and accuracy of data transmission.

In a possible implementation method, the indication information indicates a rank corresponding to the first coded data; and acquiring the coding rate information according to the indication information includes: according to the rank corresponding to the first coded data, determining that the second coded data corresponds to The number of redundant data packets; the encoding code rate is determined according to the number of redundant data packets corresponding to the second encoded data.

Based on this solution, the rank corresponding to the first coded data reflects the number of equivalent correct original data packets obtained by decoding the first coded data by the first communication device, and the rank corresponding to the first coded data is indicated by the indication information, It is convenient to determine the coding rate, optimize coding parameters and performance, and improve the reliability and accuracy of data transmission.

In a possible implementation method, acquiring the coding rate information according to the indication information includes: determining the number of redundant data packets corresponding to the second coded data according to the rank corresponding to the first coded data; according to the second coding The number of redundant data packets corresponding to the data determines the coding rate.

Based on this solution, it is convenient to determine the coding rate, optimize the coding parameters and performance, and improve the reliability and accuracy of data transmission.

In a possible implementation method, the indication information indicates the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data; and acquiring encoding bit rate information according to the indication information includes: according to the first encoded data Corresponding system data packet reception conditions and redundant data packet reception conditions determine the number of redundant data packets corresponding to the second encoded data; determine the encoding code rate according to the number of redundant data packets corresponding to the second encoded data.

Based on this solution, the reception status of the system data packets and the redundant data packet reception statuses corresponding to the first encoded data reflect the number of equivalent correct original data packets obtained by the first communication device decoding the first encoded data, so that through the The indication information indicates the reception status of the system data packets and the redundant data packets corresponding to the first encoded data, which facilitates the determination of the encoding bit rate, optimizes encoding parameters and performance, and improves the reliability and accuracy of data transmission.

In a possible implementation method, acquiring the encoding bit rate information according to the indication information includes: determining the redundant data packet corresponding to the second encoded data according to the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data. The number of redundant data packets; the encoding code rate is determined according to the number of redundant data packets corresponding to the second encoded data.

In a possible implementation method, the indication information indicates one or more of the following: the number of original data packets corresponding to the third original data; the number of original data blocks corresponding to the third original data; or the available decoding window Window length or decoding window used window length.

In one possible implementation, the second encoded data includes header information, the header information indicating the second association depth.

Based on this solution, the header information carries the second association depth, which facilitates correct decoding by the first communication device, and can improve the decoding success rate.

In a possible implementation method, the header information further indicates one or more of the following: the number of original data packets corresponding to the third original data; the identifier of the original data block corresponding to the second encoded data; or the second encoded data The coding coefficients corresponding to the coded data.

In a possible implementation method, the coding coefficients are local codebook coefficients or global codebook coefficients.

Based on this solution, the header information carries one or more of the number of original data packets corresponding to the third original data, the identifier of the original data block corresponding to the second encoded data, or the encoding coefficients corresponding to the second encoded data, The first communication device can decode the second encoded data according to the above information carried in the header information, which can improve the decoding success rate.

In a possible implementation method, receiving the indication information from the first communication device includes: receiving a feedback message from the first communication device, where the feedback message includes header information and data information, and the data information includes the indication information.

In a possible implementation method, the feedback message is carried in downlink control information DCI or uplink control information UCI.

In a possible implementation method, the header information is PDCP layer header information or MAC layer header information, and the header information carries one or more of a header indication field, a data block number or a process number, wherein the header indication field uses In order to indicate that the feedback message carries the indication information of network coding, the data block number is used to indicate the encoded data block corresponding to the indication information, and the process number is used to indicate the sender process number corresponding to the indication information.

In a possible implementation method, the header information is RLC layer header information, and the header information carries one or more of control information, a data block number or a process number, wherein the control information is used to indicate the information carried in the feedback message. is the indication information of network coding, the data block number is used to indicate the encoded data block corresponding to the indication information, and the process number is used to indicate the sender process number corresponding to the indication information.

In a second aspect, an embodiment of the present application provides a communication method, which may be executed by a terminal or a network device, or may be executed by a component of the terminal or network device (for example, a processor, a chip, or a chip system, etc.), including: receiving First encoded data corresponding to the first original data from the second communication device; sending indication information to the second communication device, where the indication information is used to obtain the second original data and the encoding rate information, the second original data includes Part or all of the first original data; receiving the second encoded data corresponding to the encoded bit rate information, the third original data and the second original data from the second communication device, the third original data does not include the first original data Raw data.

Based on this solution, after receiving the first encoded data from the second communication device, the second communication device sends indication information to the second communication device, and the second communication device can obtain the second original data from the first original data that has participated in encoding according to the indication information. data, and obtain the currently encoded encoding rate information according to the instruction information, and then jointly encode the third original data that has not participated in encoding and the second original data that has participated in encoding according to the encoding rate information to obtain the second encoded data, and send the second encoded data. This solution, on the one hand, is based on the feedback mechanism to guide the next encoding, which can realize adaptive adjustment of relevant encoding parameters, thereby improving spectral efficiency, error correction capability, and reducing packet error rate and encoding and decoding complexity, thereby improving encoding performance. , thereby improving the efficiency and quality of data transmission. On the other hand, joint coding of new and old data is realized, which can improve the success rate of the first communication device on the receiving side to correctly decode the original data.

In a possible implementation method, the second original data includes one or more first original data packets in the first original data; the indication information indicates any one of the following: the number of the first original data packets, the first original data packet The rank corresponding to a coded data, the reception situation of the system data packet and the redundant data packet corresponding to the first coded data, or the first correlation depth of the encoding.

In this solution, the rank corresponding to the first encoded data reflects the number of equivalent correct original data packets obtained by decoding the first encoded data by the first communication device, the reception status and redundancy of the system data packets corresponding to the first encoded data The data packet reception status reflects the number of equivalent correct original data packets obtained by the first communication device decoding the first encoded data, and the first associated depth of the encoding is used to indicate that the encoding has participated in the encoding that needs to be acquired in the next encoding. The number of original data packets or original data blocks, and the above-mentioned information is indicated by the indication information, which is convenient to obtain the second original data from the first original data that has participated in the encoding, and enables the realization of joint encoding of new and old data, thereby enabling encoding ability enhancement.

In a possible implementation method, the second original data includes one or more first original data blocks in the first original data; the indication information indicates any one of the following: the number of the first original data blocks, the first original data block The rank corresponding to a coded data, the reception situation of the system data packet and the redundant data packet corresponding to the first coded data, or the first correlation depth of the encoding.

In a possible implementation method, the encoding bit rate information indicates any one of the following: the number of redundant data packets corresponding to the second encoded data, the number of encoded data packets corresponding to the second encoded data, the second encoding The encoding code rate corresponding to the data, or the receiving conditions of the system data packets and the redundant data packets corresponding to the first encoded data.

Based on this scheme, it is convenient to determine the coding rate information, so that redundant coding can be realized, and the correctness of data transmission is improved.

In a possible implementation method, sending the indication information to the second communication device includes: sending a feedback message to the second communication device, where the feedback message includes header information and data information, and the data information includes the indication information.

In a third aspect, an embodiment of the present application provides a communication apparatus, and the apparatus may be a second communication device or a chip used for the second communication device. The apparatus has the function of implementing the above-mentioned first aspect or each possible implementation method based on the first aspect. This function can be implemented by hardware or by executing corresponding software by hardware. The hardware or software includes one or more modules corresponding to the above functions.

In a fourth aspect, an embodiment of the present application provides a communication apparatus, and the apparatus may be a first communication device or a chip used for the first communication device. The apparatus has the function of implementing the above-mentioned second aspect or each possible implementation method based on the second aspect. This function can be implemented by hardware or by executing corresponding software by hardware. The hardware or software includes one or more modules corresponding to the above functions.

In a fifth aspect, an embodiment of the present application provides a communication device, including a processor, where 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, the device implements the above-mentioned first aspect , the second aspect, each possible implementation method based on the first aspect, or a method based on each possible implementation method of the second aspect. The memory may be located within the device or external to the device. And the processor includes one or more.

In a sixth aspect, an embodiment of the present application provides a communication apparatus, including a method for implementing the above-mentioned first aspect, or the second aspect, or each possible implementation method based on the first aspect, or each possible implementation based on the second aspect The units or means of the individual steps of the method.

In a seventh aspect, an embodiment of the present application provides a communication device, including a processor and an interface circuit, where the processor is configured to control the interface circuit to communicate with other devices, and execute the above-mentioned first aspect, or the second aspect, or based on the first aspect Possible implementation methods of the aspect, or possible implementation methods based on the second aspect. The processor includes one or more.

In an eighth aspect, an embodiment of the present application further provides a computer-readable storage medium, including instructions, which, when executed on a computer, cause the computer to execute the above-mentioned first aspect, or the second aspect, or various possibilities based on the first aspect. implementation method, or each possible implementation method based on the second aspect.

In a ninth aspect, an embodiment of the present application further provides a computer program product, which, when run on a computer, enables the computer to execute the above-mentioned first aspect, or the second aspect, or each possible implementation method based on the first aspect, or Various possible implementation methods based on the second aspect.

In a tenth aspect, an embodiment of the present application further provides a chip system, including a processor, the processor is coupled to a memory, and the memory is used to store programs or instructions, when the program or instructions are executed by the processor, the chip system enables the above-mentioned first One aspect, the second aspect, each possible implementation method based on the first aspect, or a method based on each possible implementation method of the second aspect. The memory may be located within the system-on-chip, or may be located outside the system-on-chip. And the processor includes one or more.

In an eleventh aspect, an embodiment of the present application further provides a communication system, including a second communication device for implementing the above-mentioned first aspect or any possible implementation method based on the first aspect, and a second communication device for implementing the above-mentioned second aspect Or a first communication device based on any possible implementation method of the second aspect.

Description of drawings

Fig. 1 is a schematic diagram of random linear network coding;

Fig. 2 is a schematic diagram of convolutional network coding;

FIG. 3 is a schematic diagram of a scenario to which an embodiment of the present application is applicable;

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

Figure 5(a) is a schematic diagram of a feedback-based convolutional network coding scheme;

Figure 5(b) is a schematic diagram of the feedback scheme of the single-process stop equation;

FIG. 6 is a schematic diagram of a single-process filled feedback scheme;

7 is a schematic diagram of a feedback scheme based on multiple processes;

Fig. 8-Fig. 9 are two example diagrams of the coded data block after interleaving;

10-11 are two schematic diagrams of a multi-process encoder;

12-13 are two schematic diagrams of a multi-process decoder;

14 is a schematic diagram of the format of feedback information;

FIG. 15 is a schematic diagram of the PDCP layer bearing of the feedback message;

16 is a schematic diagram of the RLC layer bearing of the feedback message;

17 is a schematic diagram of the MAC layer bearing of the feedback message;

Figure 18 is a schematic diagram of a packet header information field;

19 is a schematic diagram of a local codebook;

20 is a schematic diagram of partial codebook selection;

21 is a schematic diagram of a local codebook generation matrix;

22 is a schematic diagram of a global codebook;

Figure 23 is a schematic diagram of global codebook selection;

24 is a schematic flowchart of a feedback-based coding scheme;

25-26 are two schematic diagrams of feedback-based adaptive non-systematic code schemes;

27 is a schematic diagram of a feedback-based average redundant non-systematic code scheme;

28-30 are three schematic diagrams of feedback-based systematic code schemes;

FIG. 31 is a schematic diagram of a communication device according to an embodiment of the present application;

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

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

FIG. 34 is a schematic structural diagram of a terminal according to an embodiment of the present application.

detailed description

In this embodiment of the present application, the data block before encoding may be referred to as an original data block, an original data block, or an original block, and the like, and a data block after encoding may be referred to as an encoded data block or an encoded block, or the like. A pre-encoded data block includes one or more pre-encoded data packets, wherein the pre-encoded data packets may also be referred to as original data packets, original data packets, or original packets. An encoded data block contains one or more encoded data packets, wherein the encoded data packets may also be referred to as encoded data packets or encoded packets. In the following description of the present 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 this embodiment of the present application, "next encoding" refers to the most recent encoding to be performed, and "next encoding" corresponds to "last encoding". "Last encoding" refers to the most recent encoding that has been done. In the implementation of this application, after the last encoding is completed and the encoded data is sent to the receiving end, the transmitting end receives indication information (also referred to as feedback information) from the receiving end, and then determines the encoding for the next encoding based on the indication information. parameters, the original data involved in encoding, etc., and perform the next encoding based on these contents to obtain encoded data and send it to the receiving end. In this embodiment of the present application, "next encoding" may also be referred to as "current encoding".

In the communication system, the feedback retransmission mechanism can realize effective error control. For example, the hybrid automatic repeat request (HARQ) retransmission mechanism of the medium access control (MAC) layer and the automatic repeat request (automatic) of the radio link control (RLC) layer repeat request, ARQ) retransmission mechanism jointly ensures the reliability of transmission. With the evolution and development of communication technologies, new radio (NR) has put forward higher requirements for the reliability and effectiveness of the system. 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 continuous error scenarios, dual-connection or multi-connection congestion scenarios, etc. Network coding technology, as a forward error correction technology, reduces the feedback overhead by encoding the original data packet (also known as the pre-encoding data packet) and adding redundancy to combat problems such as packet loss or performance loss in wireless transmission . Network coding schemes include random linear network coding (RLNC), convolutional network coding (CNC), etc.

The RLNC and CNC will be introduced and explained below.

1. RLNC

The RLNC technology takes a data block as a unit (a data block includes one or more data packets), and obtains a set of encoded data packets by encoding the original data packets by constructing a coding coefficient matrix. Usually, the coefficients in the coding matrix are randomly selected in a finite field, such as a Galois field (GF).

As shown in Figure 1, it is a schematic diagram of random linear network coding. The coefficients in the coding matrix are randomly selected in the Galois field, and the size of the coding matrix is (N+R)*N, that is, the number of rows is N+R, and the number of columns is N. By performing network coding on an original data block containing N original data packets, an encoded data block containing N+R encoded data packets is obtained, and the corresponding code rate is expressed as N/(N+R). In the RLNC scheme, there is no association between different encoded data blocks, that is, the encoding operation is performed on independent original data blocks, and the redundancy (code rate) of different encoded data blocks may be the same or different. The generated N+R encoded data packets are sent to the receiving end. As long as the receiving end receives any N linearly independent encoded data packets in the N+R encoded data packets, it can be correctly decoded and recovered. original packet.

Due to factors such as interference and noise, when the number of linearly independent correctly encoded data packets received by the receiver is less than N, the receiver cannot perform decoding. The receiving end can feed back the number of encoded data packets needed for correct decoding to the transmitting end, and the transmitting end sends the corresponding number of encoded data packets according to the feedback content, and the encoded data packets have nothing to do with the encoding of the next data block. Since the linear correlation of coding coefficients needs to be avoided in the RLNC scheme, a larger Galois threshold value is usually selected and the number of data packets in the data block is larger, but this will lead to increased computational complexity and overhead. In addition, because there is no correlation between data blocks, the ability of network coding to resist channel burst errors is limited to a certain extent. In the case of considering feedback, the large number of packets in the data block will lead to increased communication delay.

2. CNC

As shown in Figure 2, it is a schematic diagram of convolutional network coding. The coding coefficient matrix of convolutional network coding includes μ+1 convolutional coding kernel matrices, namely G ⁽⁰⁾ ˜G ^(μ) , which performs convolutional network coding on multiple original data blocks to generate coded data blocks. Among them, the i-th convolutional coding kernel (which can be referred to as convolution kernel for short) can be expressed as

That is, G ⁽ⁱ⁾ is a matrix whose upper half is denoted as G ^(i,0) and the lower half is denoted as G ^(i,1) . When G ^(i,0) =0 or G ^(i,1) =0, it means that part of the original data packets of the i-th original data block participate in the network coding of the current original data block. In other words, the number of original data packets participating in the encoding of the current original data block in the i-th original data block is less than the number of lines of G ⁽ⁱ⁾ . Wherein, μ is an integer greater than or equal to 0.

In CNC, when a new original data block is added, the original data package currently participating in encoding contains one or more of the newly added original data blocks (also called new original data blocks, new data blocks or new blocks) The original data packet (also referred to as a new original data packet, a new data packet or a new packet, etc.), optionally, may also include the original data block before the newly added original data block (also referred to as the old original data block) , old data block or old block) one or more original data packets (may also be referred to as old original data packets, old data packets or old packets, etc.).

It can be seen from FIG. 2 that the encoded data block c1 is obtained by encoding the original data block b1, that is, the original data packet currently participating in encoding includes all the data packets in b1, which are all new packets. The encoded data block c2 is obtained by encoding the original data blocks b1 and b2, that is, the original data packets currently participating in the encoding include all the data packets in b2 (both are new packets) and all the original data packets in b1 (both are new packets). old package). The encoded data block c3 is obtained by encoding the original data blocks b1, b2 and b3, that is, the original data packets currently participating in the encoding include all data packets in b3 (all new packets), all original data packets in b2 ( are both old packages) and all original packets in b1 (all are old packages). By analogy, the encoded data block is obtained by encoding at most μ+1 original data blocks, wherein the μ+1 original data block contains μ old original data blocks (which may be referred to as old blocks for short) and 1 new original data block. The original data block (may be referred to simply as the new block).

In convolutional network coding, the number of encoded data packets in the encoded data block can be smaller than that of RLNC, and the convolutional form ensures that some or all of the original data in the current original data block and several previous original data blocks or all of the original data. The packets are jointly encoded, which can better combat burst continuous errors and improve performance such as throughput.

Usually, convolutional network coding always uses μ+1 convolutional coding kernels, that is, the correlation depth is μ+1, and the size of different convolutional coding kernels is the same, and there is no certain row or certain number of convolutional coding kernels. When the coefficient of the row is 0, the number of corresponding coded data packets cannot be adjusted flexibly. The association depth is used to indicate the number of original data packets or original data blocks that need to be acquired in the next encoding, and the acquired original data packets or original data blocks will participate in the next encoding.

For the above convolutional network coding, although the problem of packet loss caused by continuous burst errors in the channel can be better overcome, the performance of convolutional network coding is related to the correlation depth, the design of the convolutional coding kernel, and the number of redundant packets (code rate). ) and other factors. Since the convolutional network coding cannot adjust the relevant parameters adaptively, the performance of spectral efficiency, error correction capability, packet error rate, coding and decoding complexity, etc. will be reduced.

In order to solve the above problems, the embodiments of the present application provide a feedback-based network coding method and device, which mainly involve:

First, single-process and multi-process feedback-based network coding schemes are designed to solve the problem of performance degradation caused by the delay caused by feedback, and the structure design of the transmitter encoder and receiver decoder is given.

Second, in the feedback-based network coding scheme, the receiving end decodes the received encoded data, forms feedback information according to the decoding situation, and transmits it to the transmitting end. The present application designs various forms of feedback information, and designs different ways of carrying the feedback information.

Third, the transmitting end obtains the feedback information from the receiving end, and optimizes the parameters of the next encoding according to the feedback information, including but not limited to: correlation depth, convolutional encoding kernel, and the number of encoded data packets. On this basis, the network coding codebook and the codebook or coefficient indication methods are designed. The sender performs network coding to generate a coded data packet, and carries the corresponding parameter or parameter index in the packet header of the coded data packet to ensure that the receiver can Encoded packets are processed and decoded correctly.

Fourth, it provides a complete feedback-based network coding scheme of non-systematic codes and systematic codes, such as code pattern design, and performs specific parameter design and matching for different network coding schemes to optimize the system performance of network coding.

The embodiments of this application are aimed at protocol frameworks such as long term evolution (LTE) or NR, and can be applied to various mobile communication scenarios, such as between a network device and a terminal device, or point-to-point transmission between terminal devices, or a network device and a terminal device. Scenarios such as multi-hop/relay transmission between terminal devices, or dual connectivity (DC) or multi-connection transmission between multiple network devices and terminal devices.

The terminal device involved in the embodiments of this application may also be referred to as a terminal, which may be a device with a wireless transceiver function, which may be deployed on land, including indoor or outdoor, handheld or vehicle-mounted; it may also be deployed on water (such as ships, etc.); can also be deployed in the air (such as on airplanes, balloons, satellites, etc.). The terminal device may be a user equipment (user equipment, UE), wherein the UE includes a handheld device, a vehicle-mounted device, a wearable device or a computing device with a wireless communication function. Exemplarily, the UE may be a mobile phone, a tablet computer, or a computer with a wireless transceiver function. The terminal device may also be a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in telemedicine, intelligent Wireless terminals in power grids, wireless terminals in smart cities, wireless terminals in smart homes, and so on. In this embodiment of the present application, the device for realizing the function of the terminal may be a terminal; it may also be a device capable of supporting the terminal to realize the function, such as a chip system, and the device may be installed in the terminal. In this embodiment of the present application, the chip system may be composed of chips, or may include chips and other discrete devices.

The network devices involved in the embodiments of the present application include access network devices, such as a base station (base station, BS). The base station may be a device deployed in a wireless access network and capable of wirelessly communicating with a terminal. The base station may have various forms, such as a macro base station, a micro base station, a relay station, and an access point. Exemplarily, the base station involved in the embodiments of the present application may be a base station in 5G or an evolved base station (evolved node B, eNB) in LTE, where the base station in 5G may also be referred to as a transmission reception point (transmission reception point). , TRP) or 5G base station (next-generation node B, gNB). In this embodiment of the present application, the apparatus for implementing the function of the network device may be a network device; it may also be an apparatus capable of supporting the network device to implement the function, such as a chip system, and the apparatus may be installed in the network device.

The technical solutions provided in the embodiments of the present application can be applied to wireless communication between communication devices. The wireless communication between communication devices may include: wireless communication between a network device and a terminal device, wireless communication between a network device and a network device, and wireless communication between a terminal and a terminal. Wherein, in this embodiment of the present application, the term "wireless communication" may also be referred to as "communication" for short, and the term "communication" may also be described as "data transmission", "information transmission" or "transmission".

In this embodiment of the present application, a device serving as a sender may be referred to as a sending device or a sending end, and a device serving as a receiving party may be referred to as a receiving device or a receiving end. For example, when a terminal device sends data to a network device, the terminal device is called a sending device or a sending end, and the network device is called a receiving device or a receiving end. For another example, when a network device sends data to a terminal device, the network device is called a sending device or a sending end, and the terminal device is called a receiving device or a receiving end. For another example, when the first network device sends data to the second network device, the first network device is called a sending device or a sending end, and the second network device is called a receiving device or a receiving end. For another example, when the first terminal device sends data to the second terminal device, the first terminal device is called a sending device or a sending end, and the second terminal device is called a receiving device or a receiving end.

As shown in FIG. 3 , it is a schematic diagram of a scenario to which this embodiment of the present application is applied. It can be understood that FIG. 3 is only exemplary, and does not limit the network architecture applicable to the embodiments of the present application. Moreover, the embodiments of the present application do not limit the transmission of uplink, downlink, access link, backhaul (backhaul) link, sidelink (sidelink) and the like. From the perspective of service scenarios, the embodiments of the present application are applicable to many scenarios, including but not limited to hierarchical data coding in extended reality (Extended Reality, XR) services. Among them, the XR business includes but is not limited to a virtual reality (Virtual Reality, VR) business, an augmented reality (Augmented Reality, AR) business, and a mixed reality (Mixed Reality, MR) business.

In the following, the method provided by the embodiments of the present application is first introduced and described with reference to the accompanying drawings, and then each part of the content involved in the method is described with reference to specific embodiments (ie, the first embodiment to the fifth embodiment).

As shown in FIG. 4 , a schematic diagram of a communication method provided by an embodiment of the present application can be performed by a first communication device (or a chip of the first communication device) and a second communication device (or a chip of the second communication device). . The first communication device may be a terminal or a network device, and the second communication device may be a network device or a terminal. The following description will be given by taking the first communication device and the second communication device executing the method as an example.

The method includes the following steps:

Step 401, the second communication device encodes the first original data to obtain the first encoded data.

Here, the second communication device, as a sending end, may be referred to as a sending device, a sending end device or a sending end.

The second communication device encodes the original data to obtain encoded data and sends the encoded data to the first communication device, so as to improve the reliability of data transmission. Here, the first communication device, as a receiving end, may be referred to as a receiving device, a receiving end device or a receiving end.

The first original data corresponds to the first encoded data. The first original data may be part or all of all the original data involved in encoding to obtain the first encoded data.

The first original data can be either an original data block or an original data packet.

The first encoded data may be either an encoded data block or an encoded data packet.

Step 402, the second communication device sends the first encoded data to the first communication device. Accordingly, the first communication device can receive the first encoded data.

Step 403, the first communication device sends indication information to the second communication device. Correspondingly, the second communication device can receive the indication information.

Optionally, after receiving the first encoded data, the first communication device generates indication information according to the first encoded data, where the indication information is used to feed back the reception status of the first encoded data and/or to instruct the second communication device to next time Reference information when encoding.

In this embodiment of the present application, the indication information may also be referred to as feedback information.

Step 404, the second communication device acquires the second original data and the encoding bit rate information according to the indication information.

The indication information is used to obtain the second original data and the coding rate information. That is, after the second communication device receives the indication information, it can obtain the second original data participating in the next encoding according to the indication information, where the second original data is part or all of the above-mentioned first original data, and also According to the indication information, the coding rate information for the next coding is obtained.

Step 405, the second communication device performs joint encoding on the third original data and the second original data according to the encoding bit rate information to obtain the second encoded data.

The second encoded data is encoded data corresponding to the encoded bit rate information, the third original data and the second original data.

The third original data is newly added data that has not participated in encoding during the current encoding, and the third original data does not include the first original data. It can be understood that the third original data also does not include data that has participated in encoding before the first original data.

That is, the second communication device performs joint encoding on the newly added data that has not participated in encoding (ie, the third original data) and some or all of the original data in the data that has participated in the encoding (ie, the second original data), so as to improve the coding efficiency.

Step 406, the second communication device sends the second encoded data to the first communication device. Accordingly, the first communication device can receive the second encoded data.

Based on the above implementation solution, after sending the first encoded data to the first communication device, the second communication device may receive the indication information, and then obtain the second original data and the currently encoded original data in the encoded original data based on the indication information. encoding bit rate information, and then jointly encoding the third original data and the second original data according to the encoding bit rate information to obtain second encoded data, and sending the second encoded data to the first communication device. This solution, on the one hand, is based on the feedback mechanism to guide the next coding, and can adjust the relevant coding parameters adaptively, thereby improving the spectral efficiency, error correction ability, and reducing the packet error rate and coding and decoding complexity. The joint encoding of the data can improve the success rate of the first communication device on the receiving side to correctly decode the original data.

The following describes different implementation methods for the second communication device to acquire the second original data according to the indication information in the foregoing step 404 . Two cases are described below.

In case 1, the above-mentioned second original data includes one or more first original data packets in the first original data.

In this case, the method for the second communication device to obtain the second original data according to the indication information includes but is not limited to:

In method 1, when the above-mentioned indication information indicates the number of the first original data packets included in the second original data, the second communication device obtains the second original data according to the number of the first original data packets.

That is, when the indication information indicates the number of the first original data packets, the second communication device will obtain the number of original data packets from the first original data that has participated in the encoding as the second original data. Participate in the next coding. As an implementation method, the number of original data packets whose time sequence is closest to the third original data in the first original data may be used as the second original data. As another implementation method, the number of original data packets randomly selected from the first original data may be used as the second original data. This embodiment of the present application does not limit the specific implementation method for obtaining the number of original data packets from the first original data as the second original data.

The first original data packet in the embodiment of the present application is one or more original data packets contained in the first original data. The number of the first original data packets may be understood as the number of original data packets related to the second original data in the first original data. Alternatively, it can be understood that the number of the first original data packets is the number of original data packets used to determine the second original data in the first original data. The definition of the first original data package here is applicable to the whole text, that is, for the meaning of the first original data package appearing in the whole text, reference may be made to the above description.

Method 2, when the above indication information indicates the rank corresponding to the first encoded data, the second communication device determines the number of first original data packets included in the second original data according to the rank corresponding to the first encoded data, and then according to the The number of one original data packet obtains the second original data.

The rank corresponding to the first coded data refers to the rank of the coding matrix corresponding to the coded data received by the first communication device (may also be referred to as the rank corresponding to the coded data), and is used to reflect the rank of the first communication device with respect to the first coded data. reception. When the rank is full, it indicates that the first communication device receives the first coded data correctly, and when the rank is not satisfied, it indicates that the first coded data has packet loss.

The second communication device may determine the number of the first original data packets included in the second original data according to the rank corresponding to the first encoded data indicated by the indication information. In a possible implementation manner, the number of first original data packets included in the second original data is the difference between the number of original data packets corresponding to the first encoded data and the rank corresponding to the first encoded data indicated by the indication information. For example, the number of original data packets corresponding to the first encoded data is 4, and when the rank corresponding to the first encoded data indicated by the indication information is 3, it is determined that the number of first original data packets included in the second original data is 1. When the rank corresponding to the first encoded data indicated by the indication information is 2, it is determined that the number of first original data packets included in the second original data is 2. When the rank corresponding to the first encoded data indicated by the indication information is 1, it is determined that the number of first original data packets included in the second original data is 3. Further, the second communication device obtains the second original data according to the number of the first original data packets, that is, the second communication device obtains the number of original data packets from the first original data that has participated in the encoding as the second original data, and the second original data 2. The original data participates in the next encoding.

Method 3, when the above-mentioned indication information indicates the reception situation of the system data packet corresponding to the first encoded data and the reception situation of the redundant data packet, then the second communication device receives the reception situation of the system data packet and the redundant data packet corresponding to the first encoded data. The number of the first original data packets included in the second original data is determined according to the situation, and then the second original data is acquired according to the number of the first original data packets.

The system data packet refers to the data packet in the encoded data that is the same as the original data packet, and its encoding coefficient may also be considered to be 1. Redundant data packets refer to redundant encoded data packets added to improve decoding success rate. The reception of system data packets refers to the number or proportion of correct reception of system data packets, or the number or proportion of incorrect reception of system data packets. The redundant data packet reception condition refers to the correct number or proportion of redundant data packets received, or the wrong number or proportion of redundant data packets received.

The second communication device may determine the number of the first original data packets according to the reception conditions of the system data packets and the reception conditions of the redundant data packets corresponding to the first encoded data indicated by the indication information. In a possible implementation manner, the number of the first original data packets included in the second original data is the number of original data packets included in the K original data blocks that are closest to the third original data in terms of time sequence and have participated in encoding , where K is the larger value of the number of error receptions of system data packets corresponding to the first encoded data determined according to the indication information and the number of error receptions of redundant data packets corresponding to the first encoded data. For example, when the reception situation of the system data packets corresponding to the first encoded data indicated by the indication information: the number of error receptions of system data packets is 1, and the reception situation of redundant data packets: the number of error receptions of redundant data packets is 0, then it is determined that the number of error receptions of the system data packets is 1. The number of an original data packet is the number of original data packets contained in an original data block that is closest to the third original data in terms of time sequence and has participated in encoding. For another example, when the reception situation of the system data packets corresponding to the first encoded data indicated by the indication information: the number of error receptions of system data packets is 1, and the reception situation of redundant data packets: the number of error receptions of redundant data packets is 1, for the error It can be determined that the number of the first original data packet is the number of original data packets contained in the original data block that is closest to the third original data in terms of time sequence and has participated in the encoding. A data block corresponding to the system data packet in the encoded data; for the erroneous redundant data packet, according to the number of original data blocks corresponding to the redundant data packet (represented as 0), determine that the number of the first original data packet is the same as that in time sequence. The number of original data packets contained in the most recent O original data blocks that have participated in the encoding of the third original data, and the number of original data blocks corresponding to redundant data packets can also be understood as generating the original data blocks related to the redundant data packet quantity. In addition, for the case where both the system data packet and the redundant data packet are erroneous/lost, the number of first original data packets determined according to the erroneous system data packet may be the same as the number of first original data packets determined according to the erroneous redundant data packet number remains the same. Further, the second communication device obtains the second original data according to the number of the first original data packets, that is, the second communication device obtains the number of original data packets from the first original data that has participated in the encoding as the second original data, and the second original data 2. The original data participates in the next encoding.

Method 4, when the above-mentioned indication information indicates the encoded first association depth, the second communication device determines the number of first original data packets contained in the second original data according to the first association depth, and then obtains according to the number of the first original data packets. The second raw data.

Wherein, the association depth is used to indicate the number of original data packets (or original data blocks) that participate in the next encoding in the original data packets (or original data blocks) that have participated in the encoding. Therefore, when the indication information indicates the encoded first association depth, the second communication device may determine the number of the first original data packets according to the first association depth, and then obtain the second original data according to the number of the first original data packets, that is, The second communication device obtains the number of original data packets from the first original data that has participated in the encoding as the second original data, and the second original data participates in the next encoding.

In case 2, the above-mentioned second original data includes one or more first original data blocks in the first original data.

In the second situation, the method for the second communication device to obtain the second original data according to the indication information includes but is not limited to:

In method 1, when the above-mentioned indication information indicates the number of first original data blocks included in the second original data, the second communication device acquires the second original data according to the number of the first original data blocks.

That is, when the indication information indicates the number of first original data blocks, the second communication device will obtain the number of original data blocks from the first original data that has participated in the encoding as the second original data. Participate in the next coding. As an implementation method, the number of original data blocks in the first original data that are closest in time series to the third original data may be used as the second original data. As an implementation method, the number of raw data blocks randomly selected from the first raw data may be used as the second raw data. This embodiment of the present application does not limit the specific implementation method for obtaining the number of original data blocks from the first original data as the second original data.

The first original data block in the embodiment of the present application is one or more original data packets contained in the first original data. The number of the first original data blocks may be understood as the number of original data blocks related to the second original data in the first original data. Alternatively, it can be understood that the number of the first original data blocks is the number of original data blocks used to determine the second original data in the first original data. The definition of the first original data block here is applicable to the whole text, that is, for the meaning of the first original data block appearing in the whole text, reference may be made to the above description.

Method 2, when the above-mentioned indication information indicates the rank corresponding to the first encoded data, the second communication device determines the number of first original data blocks included in the second original data according to the rank corresponding to the first encoded data, and then according to the first original data The number of blocks gets the second raw data.

The rank corresponding to the first coded data refers to the rank of the coding matrix corresponding to the coded data received by the first communication device, and is used to reflect the reception of the first coded data by the first communication device. When the rank is full, it indicates that the first communication device receives the first coded data correctly, and when the rank is not satisfied, it indicates that the first coded data has packet loss.

The second communication device may determine the number of the first original data blocks according to the rank corresponding to the first encoded data indicated by the indication information, and then obtain the second original data according to the number of the first original data blocks, that is, the second communication device receives the The number of original data blocks is obtained from the over-encoded first original data as the second original data, and the second original data participates in the next encoding.

Method 3, when the above-mentioned indication information indicates the reception situation of the system data packet corresponding to the first encoded data and the reception situation of the redundant data packet, then the second communication device receives the reception situation of the system data packet and the redundant data packet corresponding to the first encoded data. The number of the first original data blocks included in the second original data is determined according to the situation, and then the second original data is acquired according to the number of the first original data blocks.

The system data packet refers to the same data packet as the original data packet in the encoded data. Redundant data packets refer to redundant encoded data packets added to improve decoding success rate.

Wherein, the reception status of system data packets refers to the correct number or proportion of system data packets received, or the number or proportion of system data packets received incorrectly. The redundant data packet reception condition refers to the correct number or proportion of redundant data packets received, or the wrong number or proportion of redundant data packets received.

The second communication device may determine the number of the first original data blocks according to the reception situation of the system data packets and the reception situation of the redundant data packets corresponding to the first encoded data indicated by the indication information. In a possible implementation manner, the number of the first original data blocks included in the second original data is the redundancy between the number of error receptions of the system data packets corresponding to the first encoded data determined according to the indication information and the corresponding first encoded data The larger of the number of incorrectly received packets. For example, when the reception situation of the system data packets corresponding to the first encoded data indicated by the indication information: the number of error receptions of system data packets is 1, and the reception situation of redundant data packets: the number of error receptions of redundant data packets is 0, then it is determined that the number of error receptions of the system data packets is 1. The number of one original data block is one original data block that is closest to the third original data in terms of time sequence and has participated in encoding. For another example, when the reception situation of the system data packets corresponding to the first encoded data indicated by the indication information: the number of error receptions of system data packets is 1, and the reception situation of redundant data packets: the number of error receptions of redundant data packets is 1, for the error It can be determined that the number of the first original data block is the original data block that has participated in the encoding closest to the third original data in time sequence, and the original data block is also the system data packet in the first encoded data. Corresponding data block; for the wrong redundant data packet, according to the number of original data blocks corresponding to the redundant data packet (represented by 0), determine that the number of the first original data block is 0 that is closest to the third original data in time series. The number of original data blocks corresponding to the redundant data packets can also be understood as the number of original data blocks related to the generation of the redundant data packets. In addition, for the case where both the system data packet and the redundant data packet are erroneous/lost, the number of the first original data block determined according to the erroneous system packet may be the same as the number of the first original data block determined according to the erroneous redundant data packet. The number remains the same. Further, the second communication device obtains the second original data according to the number of the first original data blocks, that is, the second communication device obtains the number of original data blocks from the first original data that has participated in the encoding as the second original data, and the second original data is used as the second original data. 2. The original data participates in the next encoding.

Method 4, when the above-mentioned indication information indicates the encoded first association depth, the second communication device determines the number of the first original data blocks contained in the second original data according to the first association depth, and then obtains according to the number of the first original data blocks. The second raw data.

Wherein, the association depth is used to indicate the number of original data packets (or original data blocks) that participate in the next encoding in the original data packets (or original data blocks) that have participated in the encoding. Therefore, when the indication information indicates the encoded first association depth, the second communication device may determine the number of the first original data blocks according to the first association depth, and then obtain the second original data according to the number of the first original data blocks, that is, The second communication device obtains the number of original data blocks from the first original data that has participated in the encoding as the second original data, and the second original data participates in the current encoding.

Through any one of the methods 1 to 4 in the above situation 1, or any one of the methods 1 to 4 in the situation 2, the second communication device can obtain the second original data, and the second original data participates in the next encoding .

The following describes different implementation methods in which the second communication device acquires the coding rate information according to the indication information in the foregoing step 404 . The encoding bit rate information indicates the number of redundant data packets corresponding to the second encoded data, the number of encoded data packets corresponding to the second encoded data, or the encoding bit rate corresponding to the second encoded data. Wherein, the coding rate corresponding to the second coded data=(the number of coded data packets corresponding to the second coded data-the number of redundant data packets corresponding to the second coded data)/the number of coded data packets corresponding to the second coded data . The number of encoded data packets corresponding to the second encoded data is the total number of data packets in the second encoded data, and the total number includes the number of redundant data packets.

The method for the second communication device to obtain the coding rate information according to the indication information includes but is not limited to:

Method 1, when the indication information indicates the rank corresponding to the first coded data, the second communication device determines the number of redundant data packets corresponding to the second coded data according to the rank corresponding to the first coded data, and then determines the number of redundant data packets corresponding to the second coded data according to the rank corresponding to the first coded data. The number of redundant data packets determines the coding rate.

The rank corresponding to the first coded data refers to the rank of the coded data received by the first communication device, and is used to reflect the reception situation of the first coded data by the first communication device. When the rank is full, it indicates that the first communication device receives the first coded data correctly, and when the rank is not satisfied, it indicates that the first coded data has packet loss.

The second communication device may determine the number of redundant data packets corresponding to the next encoding according to the rank corresponding to the first encoded data indicated by the indication information, that is, the number of redundant data packets corresponding to the second encoded data obtained by the next encoding . In a possible implementation manner, without considering additional redundant data packets, the number of redundant data packets corresponding to the next encoding is equal to the original data packets corresponding to the first encoded data that have not been correctly decoded before. The difference between the number and the rank corresponding to the first encoded data indicated by the indication information. For example, the number of original data packets corresponding to the first encoded data that have not been correctly decoded before is 4, and when the rank corresponding to the first encoded data indicated by the indication information is 3, the number of redundant data packets corresponding to the next encoding can be determined. The number is 1. When the rank corresponding to the first encoded data indicated by the indication information that has not been correctly decoded before is 2, it can be determined that the number of redundant data packets corresponding to the next encoding is 2, and so on. Further, the second communication device determines the encoding code rate according to the number of redundant data packets corresponding to the second encoded data.

Method 2, when the indication information indicates the reception situation of the system data packets and the reception situation of the redundant data packets corresponding to the first encoded data, the second communication device will receive the system data packets and the redundant data packets corresponding to the first encoded data according to the reception situation. The number of redundant data packets corresponding to the second encoded data is determined, and then the encoding code rate is determined according to the number of redundant data packets corresponding to the second encoded data.

The system data packet refers to the same data packet as the original data packet in the encoded data. Redundant data packets refer to redundant encoded data packets added to improve decoding success rate. The reception of system data packets refers to the number or proportion of correct reception of system data packets, or the number or proportion of incorrect reception of system data packets. The redundant data packet reception condition refers to the correct number or proportion of redundant data packets received, or the wrong number or proportion of redundant data packets received.

The second communication device may determine the number of redundant data packets corresponding to the next encoding, that is, the number of redundant data packets corresponding to the next encoding, according to the receiving conditions of the system data packets and the redundant data packets corresponding to the first encoded data indicated by the indication information, that is, the first encoding obtained by the next encoding. The number of redundant data packets corresponding to the second encoded data. In a possible implementation manner, without considering additional redundant data packets, the number of redundant data packets corresponding to the next encoding is the erroneous reception of the system data packets corresponding to the first encoded data determined according to the indication information The sum of the number of error reception numbers of redundant data packets corresponding to the first encoded data. For example, when the reception situation of the system data packets corresponding to the first encoded data indicated by the indication information: the number of error receptions of system data packets is 1, and the reception situation of redundant data packets: the number of error receptions of redundant data packets is 0, it can be determined as follows: The number of redundant data packets corresponding to the secondary encoding is 1. For another example, when the reception situation of the system data packets corresponding to the first encoded data indicated by the indication information: the number of error receptions of system data packets is 1, and the reception situation of redundant data packets: the number of error receptions of redundant data packets is 1, it can be determined that The number of redundant data packets corresponding to the next encoding is 2. Further, the second communication device determines the encoding code rate according to the number of redundant data packets corresponding to the second encoded data.

Through the above method 1 or method 2, the second communication device can determine the coding rate, so as to obtain the second coded data by jointly coding the third original data and the second original data according to the coding rate.

As an implementation method, the above-mentioned indication information, in addition to the above-described information, may also indicate one or more of the following:

1) The number of original data packets corresponding to the third original data.

That is, the indication information indicates the number of newly added original data packets that have not participated in the encoding used in the next encoding.

2) The number of original data blocks corresponding to the third original data.

That is, the indication information indicates the number of newly added original data blocks that have not participated in the encoding to be used in the next encoding.

3) The available window length of the decoding window or the used window length of the decoding window.

The decoding window corresponds to a maximum window length, and the maximum window length refers to the maximum data length involved in decoding, which can also be understood as the maximum number of encoded data blocks that can be decoded. Therefore, the indication information may indicate the available window length of the decoding window, that is, the number of remaining encoded data blocks that can participate in decoding. Alternatively, the indication information can indicate the used window length of the decoding window, so that the available window length of the decoding window can be determined according to the used window length of the decoding window and the maximum window length of the decoding window, thereby determining the remaining coded data blocks that can be decoded. quantity.

As an implementation method, the above-mentioned second encoded data may include header information and data information, wherein the data information is used to carry the encoded data. The header information is used to indicate encoding parameter information corresponding to the second encoded data, so that the first communication device can correctly decode the original data before encoding after receiving the second encoded data.

The header information indicates the second association depth, and the second association depth may be determined according to the indication information, or may be jointly determined according to the indication information and other system information (eg, channel state information, etc.). If the above indication information indicates the first association depth (which may be an explicit indication or an implicit indication), the second association depth may be the same as or different from the first association depth.

Optionally, the header information may also indicate one or more of the following:

2) The identifier of the original data block corresponding to the second encoded data.

3) Coding coefficients corresponding to the second coded data.

The coding coefficients may also be referred to as coding codebook coefficients, codebook coefficients, or the like.

The communication method shown in FIG. 4 above will be described in detail from different aspects in conjunction with the specific examples of the first embodiment to the fifth embodiment below. It can be understood that, in the various embodiments in this application and each implementation manner/implementation method in each embodiment, if there is no special description or logical conflict, different embodiments and various implementation manners/implementation methods in each embodiment The technical features in the implementation method can be combined to form new embodiments, implementation manners, or implementation methods according to their inherent logical relationships.

It can be understood that the above-mentioned indication information is referred to as feedback information in the following embodiments, the above-mentioned first communication device is referred to as a receiving end in the following embodiments, the above-mentioned second communication device is referred to as a transmitting end in the following embodiments, the above-mentioned The second original data may be old original data packets or old original data blocks in the following embodiments, and the above-mentioned third original data may be new original data packets or new original data blocks in the following embodiments.

Example 1

This embodiment provides the overall design and flow of the feedback-based convolutional network coding scheme, and provides single-process and multi-process feedback solutions on this basis.

As shown in Figure 5(a), it is a schematic diagram of a feedback-based convolutional network coding scheme. The program includes the following steps:

Step 1: In the initial state, at the sending end, the original data packet enters the convolutional network encoder at the sending end and is stored in the corresponding storage unit, such as a register unit. The convolutional network encoder determines an initial code generation according to the set initial parameters. Matrix, network coding is performed on the corresponding original data packets according to the coding generation matrix, and header information is added to obtain a set of coded data packets.

In this application, the convolutional network encoder may also be referred to as an encoder, a transmitter encoder or a transmitter encoder for short, which is described in a unified manner here, and will not be repeated hereafter.

Step 2: The sender sends the generated network coding data packet, and transmits it through the channel. Due to the influence of interference, noise and other factors, there will be packet loss and/or packet error. Through a reasonable verification mechanism, such as cyclic redundancy code Check (cyclic redundancy check, CRC) check, the receiver receives a set of correct encoded data packets.

Step 3: After receiving the encoded data packet, the receiving end identifies the packet header information, obtains parameters such as the data block ID, encoding coefficient, correlation depth, etc. and uses the convolutional network decoder to perform the decoding operation, and forms feedback information to characterize the decoding process. condition. If the decoding is correct, output the original data packet obtained by decoding. In addition, the feedback information is sent to the sender through a channel through a corresponding bearer.

In this application, the convolutional network decoder may also be referred to as a decoder, a receiver decoder, or a receiver decoder for short, which is described in a unified manner here, and will not be repeated in the following.

Step 4: The transmitting end receives the feedback information from the receiving end, and determines the encoding parameters of the next convolutional network encoder, such as the correlation depth, the convolutional encoding kernel, and the number of encoded data packets. The coding parameters determined by the sending end may be consistent with the coding parameters corresponding to the feedback information, or the coding parameters may be re-determined by the sending end according to the coding parameters of the feedback information and in combination with other system information. According to the encoding parameters, the new data packet and the old data packet are jointly encoded, and the packet header information is added to obtain a set of encoded data packets. Then go back to step two.

Since there is a delay in the process from sending coded data to receiving feedback information at the sender, such as air interface transmission delay, data processing delay at the receiver, etc., in order to reduce the delay, the system performance, such as throughput and spectral efficiency, decreases. The embodiments of the present application propose a feedback solution based on a single process or multiple processes. They are described below.

(1) Feedback scheme based on single process

In the first single-process feedback scheme, the stop-and-wait method is adopted, that is, after the sender sends a set of coded data packets, it needs to wait for the feedback information from the receiver, during which the sender does not send new coded data.

As shown in Figure 5(b), it is a schematic diagram of the feedback scheme of the single-process stopping equation. There is a time delay T between the first original data block B ₀ and the second original data block B ₁ , and during the time delay T, the sender does not send new encoded data. This way of waiting will cause waste of system resources and performance degradation.

In the second single-process feedback scheme, padding is used. During the time delay T, the sender continues to send encoded data. The encoded data uses the first original data for the original data blocks after the first original data block. The encoding parameters of the block, or the method of semi-statically configuring the encoding parameters, encodes the original data block in the delay T, and realizes the joint encoding of the new original data packet and the old original data packet. With this solution, it can be ensured that resources during the period from when the sender sends the encoded data packet to when the feedback information is received (ie, the above-mentioned time delay T) is not wasted. Optionally, the feedback delay T can be adjusted according to the granularity of the smallest time unit T ₀ , so that T is rounded up to an integer multiple of T ₀ , so that within the feedback delay T, an integer number of original data blocks can be encoded and sent.

As shown in FIG. 6 , it is a schematic diagram of a single-process filled feedback scheme. Suppose that the first original data block B ₀ enters the convolutional network encoder at the sending end, performs network encoding according to the encoding parameters and sends the encoded data block. Within the feedback delay T, three original data blocks (ie, original data blocks B ₁ , B ₂ , B ₃ ) can be encoded and transmitted, that is, B ₁ , B ₂ , and B ₃ enter the convolutional network encoder at the sending end , B ₁ , B ₂ , and B ₃ can be encoded according to the encoding parameter of B ₀ or the encoding parameter of the semi-static configuration. The above operations are performed until the sender receives the feedback information, and the encoding parameter configuration is optimized according to the feedback information, and the original data block B ₄ is encoded according to the optimized encoding parameter configuration within the next unit time after the feedback delay T. The encoding parameters here include, but are not limited to, the associated depth, the number of encoded data packets, encoding coefficients, and the like. Here, the sizes of different original data blocks B _i (i=0, 1, 2, 3) (that is, the number of original data packets included in the original data blocks) may be the same or different.

(2) Feedback scheme based on multi-process

In the above single-process-based feedback scheme, the stop-and-wait scheme is simple to operate, but will cause waste of system resources and performance degradation within the feedback delay. The fill-in scheme improves the resource utilization of the stop-and-wait scheme, but the feedback time The delay leads to hysteresis, that is, the coding parameters of the original data block B ₄ are determined according to the decoding result of the original data block B ₀ , and real-time and accurate feedback cannot be achieved, resulting in increased redundancy or decreased decoding performance. For example, the sender cannot determine the encoding parameters of the original data block B ₁ according to the decoding result of the original data block B ₀ , cannot determine the encoding parameters of the original data block B ₂ according to the decoding result of the original data block B ₁ , and cannot determine the encoding parameters of the original data block B 2 according to the decoding result of the original data block B 1 . _The decoding result of the block B2 determines the encoding parameter of the original data block _B3 , and the encoding parameter of the original data block B4 cannot be determined according to the decoding result of the original data block _B3 _.

(a) In a multi-process based feedback scheme, there is a feedback delay T and at least one process value. The sender can determine the number of activated processes according to the number of original data packets in the original data block, the size of the MAC layer transmission block and the delay requirements, that is, obtain a suitable process value from at least one process value, and activate it. the corresponding number of processes.

As shown in FIG. 7 , it is a schematic diagram of a feedback scheme based on multiple processes. The sender has z processes, where z is 4, that is, the sender includes process 0, process 1, process 2 and process 3. The three original data blocks (B ₁ to B ₃ ) can be encoded and transmitted respectively within the feedback delay T. The original data block B ₁ is encoded and sent under process 1, and the original data block B ₂ is encoded under process 2. And send, the original data block B ₃ is encoded and sent under process 3. During this period, the sender can receive feedback information of the encoded data block corresponding to the original data block B ₀ in process 0. After the process 3 completes the encoding process of the original data block B ₃ , in the process 0, the encoding parameters of the original data block B ₄ are determined according to the feedback information corresponding to B ₀ , and the original data block B ₄ is encoded according to the encoding parameters. sent later. For the generation of feedback information corresponding to the original data block B ₀ , from the perspective of the receiving end, the convolutional network decoder at the receiving end decodes the received encoded data packet corresponding to B ₀ , generates feedback information, and sends it to sender. If the decoding is successful, the decoding result (ie, the original data block B ₀ ) is output. It can be understood that, on the sending end, operations such as encoding in process 1 to process 3 are similar to operations such as encoding in process 0, and will not be described again. At the receiving end, operations such as decoding in process 1 to process 3 are similar to those in process 0, and will not be repeated here.

As can be seen from Figure 7, the sender can determine the encoding parameters of the original data block B ₄ according to the decoding result of the original data block B ₀ in the process 0, and can determine the encoding parameters of the original data block B 1 in the process 1 according to the decoding result of the original data block B ₁ The encoding parameters of the original data block B ₅ can be determined according to the decoding result of the original data block B ₂ in the process 2, and the encoding parameters of the original data block B ₆ can be determined in the process 3 according to the decoding result of the original data block B ₃ . Coding parameters of original data block B ₇ . Each process can independently determine the encoding parameters of the next original data block based on the feedback information (ie the decoding result) of the encoded data block corresponding to the previous original data block, and encode the next original data block based on the encoding parameters, Therefore, it is possible to adjust the coding parameters based on the decoding result fed back in real time, and improve the coding performance.

(b) Further, the interleaving function can also be implemented in the convolutional network encoder at the transmitting end. Optionally, interleaving is performed at the granularity of coded packets.

The original data block is passed through the convolutional network encoder at the sender to generate multi-process coded data blocks, and then the coded data blocks are interleaved in units of coded data packets to form interleaved coded data blocks under different processes.

Two cases are described below.

Case 1, the number of encoded data packets in the encoded data block is not an integral multiple of the number of processes.

As shown in FIG. 8 , it is an example diagram of an interleaved encoded data block. The figure shows 4 processes, and the convolutional network encoder generates encoded data blocks C ₀ to C ₇ corresponding to the four processes. It is assumed that the number of encoded data packets in each encoded data block is 3, which is not an integer multiple of the number of processes (ie, 4).

Figure 8 shows the coded data block form after interleaving, each process number represents a coded data block, for example, the first coded data block after interleaving corresponding to process 0 is the first coded data block by C ₀ ~ C ₂ Composed of data packets, the first coded data block after interleaving corresponding to process 1 is composed of the first coded data packet of C ₃ and the second coded data packets of C ₀ to C ₁ . According to the above rules and so on, an interleaved encoded data block is obtained.

The following shows the interleaved encoded data blocks corresponding to each process.

First, the encoded data packets in the encoded data block C _i (i=0, 1, 2, . . . , 7) are represented as: C _i0 , C _i1 , C _i2 .

C ₀ :C ₀₀ ,C ₀₁ ,C ₀₂

_C1 : _C10 , _C11 , _C12

_C2 : _C20 , _C21 , _C22

_C3 : _C30 , _C31 , _C32

_C4 : _C40 , _C41 , _C42

_C5 : _C50 , _C51 , _C52

_C6 : _C60 , _C61 , _C62

_C7 : _C70 , _C71 , _C72

After interleaving, the interleaved encoded data blocks corresponding to each process are as follows:

Process 0: encoded data block 1 (C ₀₀ , C ₁₀ , C ₂₀ ), encoded data block 2 (C ₄₀ , C ₅₀ , C ₆₀ ).

Process 1: encoded data block 1 (C ₃₀ , C ₀₁ , C ₁₁ ), encoded data block 2 (C ₇₀ , C ₄₁ , C ₅₁ ).

Process 2: encoded data block 1 (C ₂₁ , C ₃₁ , C ₀₂ ), encoded data block 2 (C ₆₁ , C ₇₁ , C ₄₂ ).

Process 3: Encoding data block 1 (C ₁₂ , C ₂₂ , C ₃₂ ), encoding data block 2 (C ₅₂ , C ₆₂ , C ₇₂ ).

In the second case, the number of encoded data packets in the encoded data block is an integer multiple of the number of processes.

As shown in FIG. 9 , it is another example diagram of an interleaved encoded data block. It is assumed that the number of encoded data packets of the encoded data block is 4, which is equal to the number of processes (ie, 4). In this case, it is only necessary to extract and combine the encoded data packets at the same position of each encoded data block to form a new encoded data block. For example, the first encoded data packets of C ₀ to C ₃ are formed into the first encoded data block corresponding to process 0, and the second encoded data packets of C ₀ to C ₃ are formed into the second encoded data block corresponding to process 0 ,And so on. If the number of packets of the encoded data block is n times the number of processes, each interleaving process sequentially extracts n encoded data packets from each encoded data block and combines them into a new encoded data block.

Figure 9 shows the form of the coded data block after interleaving. Each process number represents a coded data block. For example, the first coded data block after interleaving corresponding to process 0 is the first coded data block from C ₀ to C ₃ . The first coded data block after interleaving corresponding to process 1 is composed of the second coded data packets of C ₀ to C ₃ . According to the above rules and so on, an interleaved encoded data block is obtained.

First, the encoded data packets in the encoded data block C _i (i=0, 1, 2, . . . , 7) are represented as: C _i0 , C _i1 , C _i2 , C _i3 .

C ₀ :C ₀₀ ,C ₀₁ ,C ₀₂ ,C ₀₃

C ₁ :C ₁₀ ,C ₁₁ ,C ₁₂ ,C ₁₃

_C2 : _C20 , _C21 , _C22 , _C23

_C3 : _C30 , _C31 , _C32 , _C33

_C4 : _C40 , _C41 , _C42 , _C43

_C5 : _C50 , _C51 , _C52 , _C53

_C6 : _C60 , _C61 , _C62 , _C63

_C7 : _C70 , _C71 , _C72 , _C73

Process 0: encoded data block 1 (C ₀₀ , C ₁₀ , C ₂₀ , C ₃₀ ), encoded data block 2 (C ₄₀ , C ₅₀ , C ₆₀ , C ₇₀ ).

Process 1: encoded data block 1 (C ₀₁ , C ₁₁ , C ₂₁ , C ₃₁ ), encoded data block 2 (C ₄₁ , C ₅₁ , C ₆₁ , C ₇₁ ).

Process 2: encoded data block 1 (C ₀₂ , C ₁₂ , C ₂₂ , C ₃₂ ), encoded data block 2 (C ₄₂ , C ₅₂ , C ₆₂ , C ₇₂ ).

Process 3: Encoded data block 1 (C ₀₃ , C ₁₃ , C ₂₃ , C ₃₃ ), encoded data block 2 (C ₄₃ , C ₅₃ , C ₆₃ , C ₇₃ ).

The structural form of the convolutional network encoder at the transmitting end provided by the embodiment of the present application is given below.

As shown in Figure 10, it is a schematic diagram of a multi-process encoder. The convolutional network encoder set at the sending end has multi-process encoding capability, that is, multiple processes or channels can be distinguished in the convolutional network encoder, and each process is independent of each other and has its own shift buffer module, encoding module, etc. The convolutional network encoder is further provided with a data classification and process management module, which is used for distributing the received original data blocks (or original data packets) to each process, and for managing each process.

As shown in FIG. 11 , it is another schematic diagram of a multi-process encoder. There are multiple single-process encoders inside the convolutional network encoder set at the sending end, and each single-process encoder is independent of each other and has its own shift buffer module, encoding module, and so on. The convolutional network encoder also sets a data classification module for distributing the received raw data blocks (or raw data packets) to each single-process encoder.

The structural form of the convolutional network decoder at the receiving end provided by the embodiment of the present application is given below.

As shown in FIG. 12, it is a schematic diagram of a multi-process decoder. The convolutional network decoder set at the receiving end has multi-process decoding capability, that is, multiple processes or channels can be distinguished in the convolutional network decoder. Each process is independent of each other and has its own shift buffer module. code module, etc. The convolutional network decoder is further provided with a data classification and process management module for distributing the received encoded data blocks (or encoded data packets) to each process, and for managing each process.

As shown in FIG. 13 , it is another schematic diagram of a multi-process decoder. There are multiple single-process decoders inside the convolutional network decoder set at the receiving end, and each single-process decoder is independent of each other, and has its own shift buffer module, decoding module, and so on. The convolutional network decoder is also provided with a data classification module for distributing the received encoded data blocks (or encoded data packets) to each single-process decoder.

The beneficial effects of the above-mentioned first embodiment are as follows: a feedback-based network coding method and device under single-process and multi-process are designed, and by optimizing the operation of single-process and multi-process, it is possible to make full use of the transmitting end to send encoded data to the receiver that receives the feedback information. this time delay. In the case of a single process, the subsequent original data blocks can be convolutionally encoded and transmitted according to the semi-static encoding parameters or the previous encoding parameters based on feedback optimization. After receiving the feedback information, the next original data block Perform encoding parameter optimization. In the case of multiple processes, multiple processes can be added to the feedback delay, and the multiple processes are independent of each other. Each process can provide accurate feedback and optimize the encoding parameters, so as to more efficiently implement the encoding strategy of the sender, and fully Utilize system resources to improve system throughput and other performance. In addition, by means of multi-process interleaving, the ability of network coding to resist burst interference can be further improved.

Embodiment 2

The second embodiment provides the content of the feedback information and the format of the feedback information. They are described below.

1. Content of feedback information

The content of the feedback information determines the depth of association between the next original data block and one or more previous original data blocks (part or all of the data packets) and the number of redundant packets.

The association depth (represented by D below) represents the number of original data blocks and the number of original data packets, and can also represent the number of new data packets (also referred to as new original data packets, or simply referred to as new packets) (hereinafter referred to as the number of new packets). Represented by N) and the number of old data packets (also referred to as old original data packets, or simply referred to as old packets) (represented by letter O hereinafter).

The number of redundant packets may be embodied in information such as the number of encoded data packets (represented by C hereinafter), or the number of redundant encoded data packets (represented by R below). Optionally, when the feedback information includes the decoding window state, the transmitting end may adjust the number of redundant packets in the feedback information. For example, when there is a delay limit in the decoding of the encoded data packet, and the maximum delay is required to be the delay corresponding to the length of the decoding window, the decoding needs to be successful before the encoded data exits the decoding window. The number of redundant packets may be increased on the basis of the number of redundant packets fed back by the receiving end through the feedback information.

In the embodiment of the present application, the feedback information for the encoded data sent by the receiving end to the transmitting end is used to indicate but not limited to the following information: the depth of association D, the number of redundant packets R, the number of new packets participating in encoding N, the number of new packets participating in encoding The number of old packets is 0 or the decoding window state. In different schemes and different semi-static parameter configuration methods, the content of the feedback information may be different.

In this embodiment of the present application, the feedback information may be dynamically indicated through control information at the physical (PHY) layer, or may also be semi-statically configured through related high-level messages such as the MAC layer, the radio resource control (RRC) layer, or the like, or By means of semi-static configuration combined with dynamic indication.

The following divides the network coding scheme into two types: non-systematic codes and systematic codes, and respectively describes the feedback information corresponding to the non-systematic codes and the feedback information corresponding to the systematic codes.

1. Non-system code scheme

For the non-systematic code scheme, when the feedback information is used to indicate one or more of the association depth D, the number of redundant packets R, the number of new packets involved in encoding N, the number of old packets involved in encoding O, or the decoding window state If there are any, the following methods can be used to give instructions.

a) The number of redundant packets R

When the feedback information is used to indicate the number R of redundant packets (also called redundant coded data packets), it can be indicated in any of the following ways:

1) Indicate the number R of redundant packets included in the next encoded data block;

2) indicating the total number of encoded data packets C included in the next encoded data block;

3) Indicate the correct rank value of the currently received encoded data block: Through known parameters or semi-static configuration parameters (the total number of original data packets participating in encoding), the redundant encoded data packets contained in the next encoded data block can be obtained. The number R or the total number C of encoded data packets contained in the next encoded data block;

4) Indicate the error rank value of the currently received encoded data block: Through known parameters or semi-static configuration parameters (the total number of original data packets participating in encoding), the redundant encoded data packets contained in the next encoded data block can be obtained. The number R or the total number C of encoded data packets contained in the next encoded data block.

b) Association depth D

As an implementation method, in the non-systematic code scheme, the association depth D is equivalent to the number O of old packets, that is, the values of the two are the same.

When the feedback information is used to indicate the association depth D, it can be indicated in any of the following ways:

1) Indicate the number of old packets involved in encoding in the next encoded data block, and the number of old blocks (also called old original data blocks, or old data blocks);

2) indicating the bitmap (bitmap) of the old packet participating in the encoding in the next encoded data block, and the bitmap of the old block;

The bitmap of the old packet refers to indicating the number of old packets involved in encoding in the next encoded data block by means of a bitmap. For example, if the bitmap is 8 bits, when the bitmap information is "10000000", it means that the number of old packets involved in encoding in the next encoded data block is 1, and when the bitmap information is "11000000", it means the next The number of old packets involved in encoding in the encoded data block is 2. It should be noted that, in the subsequent description, the bitmap of the old packet has the same meaning, and will not be repeated here.

The bitmap of the old block refers to using a bitmap to indicate the number of old blocks involved in encoding in the next encoded data block. For example, if the bitmap is 8 bits, when the bitmap information is "10000000", it means that the number of old blocks involved in coding in the next encoded data block is 1, and when the bitmap information is "11000000", it means the next The number of old blocks involved in encoding in the encoded data block is 2. It should be noted that, in the subsequent description, the bitmap of the old block has the same meaning and will not be repeated.

3) Indicate the rank value of the newly received encoded data block, and indirectly obtain the association depth D through known parameters or semi-static configuration parameters (the total number of original data packets participating in encoding);

4) any two of the index number of the first original data packet involved in encoding, the index number of the last original data packet or the total number of the first original data packet to the last original data packet;

5) Indicate any two of the starting packet number in the encoding window of the transmitting end, the ending packet number in the encoding window of the transmitting end, and the effective length of the encoding window of the transmitting end participating in the encoding.

c) The number N of new packets involved in encoding in the next original data block

Among them, the number of new packets N is used for the scheme in which the total number of original data packets encoded each time is the same (that is, N+O is a fixed value).

When the feedback information is used to indicate the number N of new packets involved in encoding in the next original data block, it can be indicated in any of the following ways:

1) The N value can be obtained by means of the relevant indication information of the association depth;

This is because the value of the association depth D is the same as that of the old packet O. After pre-configuring the total number of original data packets encoded each time, and determining the association depth D through feedback information, the value of the number N of new packets can be obtained.

2) If the total number of new and old packets involved in encoding is constant (ie, N+O semi-static configuration), the number N of new packets to be encoded next time is indicated;

3) If the total number of new and old packets involved in encoding is constant (ie, N+O semi-static configuration), it indicates the bitmap of the new packet for the next encoding.

d) Decoding window status

The decoding window state includes the length used by the decoding window and/or the remaining length of the decoding window (that is, the unused length), which is used to characterize the usage of the current decoding window, the currently used window length and the maximum window length (using W_max). representation) relationship.

It can be understood that the state of the decoding window will affect the redundancy addition algorithm of the encoder, that is, under the relevant algorithm, the number of encoded data packets generated by the encoding of the next original data block in the convolutional network encoder at the transmitting end not only depends on the receiving end. The number of missing packets in the current coded data block also depends on the used length of the decoding window or on the remaining length of a coded data packet in the window.

2. System code scheme

For the systematic code scheme, when the feedback information is used to indicate one or more of the association depth D, the number of redundant packets R, the number of new packets involved in encoding N, the number of old packets involved in encoding O, or the decoding window state , you can instruct by the following methods.

a) The number of redundant packets R

3) Indicate the correct rank value of the newly received encoded data block: Through known parameters or semi-static configuration parameters (the number of original data packets involved in encoding), the number of redundant encoded data packets contained in the next encoded data block can be obtained. The number R or the total number C of encoded data packets contained in the next encoded data block;

4) Indicates the error rank value of the newly received encoded data block: Through known parameters or semi-static configuration parameters (the number of original data packets involved in encoding), the number of redundant encoded data packets contained in the next encoded data block can be obtained. The number R or the total number C of encoded data packets contained in the next encoded data block;

5) Indicate the correct number of system data packets and the number of redundant data packets in the newly received encoded data block;

6) Indicate the number of erroneous system data packets and the number of redundant data packets in the newly received encoded data block;

7) Indicate the number of correct system packets and the number of erroneous redundant packets in the newly received encoded data block;

8) Indicate the number of wrong system data packets and the number of correct redundant data packets in the newly received encoded data block;

It can be understood that any of the above 5) to 8) can be combined with known parameters or semi-static parameters to obtain the number R of redundant encoded data packets included in the next encoding block, the number of system packets S, etc.

b) Association depth D

1) Indicate the number of old blocks that the next original data block participates in encoding;

2) Indicate the old block bitmap that the next original data block participates in encoding;

3) Indicate the status indicator factor (2bit) of the current original data block system packet and the encoded data packet, and obtain the associated depth through known parameters or semi-static configuration parameters (for example, the number of original data packets participating in encoding);

For example, state 00 means that neither the system packet nor the encoded data packet is lost, and the corresponding association depth is 0; state 11/01 means that the encoded data packet is lost, and the corresponding association depth is the value of the association depth of the previous data block + 1; state 10 Indicates that only system packets are lost, and the corresponding association depth is 2.

5) Indicate any two of the starting packet number in the encoding window of the transmitting end participating in the encoding, the ending packet number of the encoding window of the transmitting end, and the effective length of the encoding window of the transmitting end.

6) Indicate the correct number of system data packets and the number of redundant data packets in the newly received encoded data block;

7) Indicate the number of wrong system data packets and the number of redundant data packets in the newly received encoded data block;

8) Indicate the number of correct system data packets and the number of wrong redundant data packets in the newly received encoded data block;

9) Indicate the number of erroneous system data packets and the number of correct redundant data packets in the newly received encoded data block.

It can be understood that, any of the above 6) to 9) can be combined with known parameters or semi-static parameters to obtain the associated depth of the next encoded data block.

1) Indicate the number of new blocks and the number of new packets N to be encoded next time (it may not be indicated);

2) Indicate the new block bitmap and the new packet bitmap for the next encoding (may not be indicated);

3) Indicate the correct number of system data packets and the number of redundant data packets in the newly received encoded data block;

4) Indicate the number of wrong system data packets and the number of redundant data packets in the newly received encoded data block;

5) Indicate the number of correct system packets and the number of erroneous redundant packets in the newly received encoded data block;

6) Indicate the number of erroneous system data packets and the number of correct redundant data packets in the newly received encoded data block.

It can be understood that, by combining known parameters or semi-static parameters in any of the above 3) to 6), the number N of new packets included in the next encoded data block can be obtained.

d) Decoding window status

The decoding window status includes the length used by the decoding window and/or the remaining length of the decoding window (that is, the unused length), which is used to characterize the usage of the current decoding window, the currently used window length and the maximum window length (using W_max). Representation), or the remaining length of stay in an encoded packet window.

It can be understood that the state of the decoding window will affect the redundancy addition algorithm of the encoder, that is, under the relevant algorithm, the number of encoded data packets generated by the encoding of the next original data block in the convolutional network encoder at the transmitting end not only depends on the receiving end. The number of missing packets in the current coded data block also depends on the used length of the decoding window or on the remaining length of a coded data packet in the window. In addition, the receiving end can jointly decode the window state information when forming the feedback information, instead of directly feeding back the decoding window state information, that is, the number of redundant encoding packets or the total number of encoding packets in the feedback information is determined by considering the decoding The parameters formed by the redundant addition algorithm of the window state information.

2. Format of feedback information

The feedback information can be carried in multiple fields, as shown in FIG. 14 , which is a schematic diagram of the format of the feedback information. Field 1 in the figure indicates the format sequence number, for example, there are 3 bits, and different sequence numbers indicate different schemes and/or situations. One of the 3 bits is used to distinguish the non-systematic code scheme from the systematic code scheme, 1 bit is used to distinguish the two situations where the size of the original data block is the same and the size of the encoded data block is the same, and 1 bit is used to distinguish the consideration of decoding A total of 8 schemes are obtained by combining the window state and the two situations without considering the decoding window state. They are described below.

In the following example, combined with field 1 (3 bits in total) in FIG. 14 , the high-order 1 bit of this field is used to indicate the non-systematic coding scheme and the systematic coding scheme, wherein “0” represents the non-systematic coding scheme, and “1” represents the systematic coding plan. The middle 1 bit of this field is used to distinguish two situations where the original data block size is the same and the encoded data block size is the same, where "0" indicates that the original data block size is the same, and "1" indicates that the encoded data block size is the same. The low-order 1 bit of this field is used to distinguish two situations in which the decoding window state is considered and the decoding window state is not considered, wherein "0" indicates that the decoding window state is not considered, and "1" indicates that the decoding window state is considered. It should be noted that the meanings of the above "0" and "1" can also be used in reverse. In the subsequent description, the meanings of "0" and "1" are only used as examples.

With reference to Figure 14, the specific scheme is as follows:

1) Feedback format (also known as feedback format) 0_0_0: non-systematic code scheme, the size of the original data block is the same, and the decoding window state is not considered (among them, the number of new packets participating in the encoding is N semi-static configuration)

Field 1: Format serial number (also called pattern number) 000, 3bit;

Field 2: The missing rank value of the current coded data block, or other information that can indirectly obtain the missing rank value, such as the rank value of the coded data block, from which the associated depth D and the number of redundant packets of the next block can be obtained R.

Optionally, without using the rank value, any form of the association depth D in the non-systematic code scheme can be used as field 2, and any form of the number of redundant packets R can be used as field 3. By combining , the display indicates feedback information.

2) Feedback format 0_0_1: non-systematic code scheme, the size of the original data block is the same, and the decoding window state is considered (among them, the number of new packets participating in the encoding is N semi-static configuration)

Field 1: pattern number 001, 3bit;

Field 2: The missing rank value of the current coded data block or other information that can indirectly obtain the missing rank value, such as the rank value of the coded data block, from which the association depth D can be obtained.

Field 3: Decoding window status, which represents the effect of the decoding window length on the number of encoded data packets. Combined with field 2, the number of redundant packets R of the next encoded data block can be determined (both the sender and the receiver can be determined according to the algorithm) , when the receiving end executes the relevant algorithm to determine the number R of redundant packets to form a feedback message, then field 3 can be omitted; when the sender executes the relevant algorithm to determine the number R of redundant packets, then field 3 cannot be omitted).

Optionally, field 2 can use any form in the association depth D in the non-systematic code scheme, and field 3 can use any form in 1) and 2) of the number of redundant packets R. By combining, the display indicates Feedback.

3) Feedback format 0_1_0: non-systematic code scheme, the size of the encoded data block is the same, and the decoding window state is not considered (among them, N+O semi-static configuration)

Field 1: pattern number 010, 3bit;

Field 2: The missing rank value of the current coded data block or other information that can indirectly derive the missing rank value, such as the rank value of the coded data block.

Field 2 combines the semi-static configuration information to obtain the association depth D (equal to the number of old packets O), the number of new packets N of the next original data block, and the number of redundant packets of the next encoded data block R (R=O ).

Optionally, any form of the association depth D of the next original data block in the non-systematic code scheme can be used as field 2, the number of redundant packets R of the next encoded data block can be used as field 3, and the number of new packets is N. Any one of the forms as field 4, by combining, displays the feedback information.

4) Feedback format 0_1_1: non-systematic code scheme, the size of the encoded data block is the same, and the decoding window state is considered (among them, N+O semi-static configuration)

Field 1: pattern number 011, 3bit;

Field 2: The missing rank value of the current coded data block or other information that can indirectly derive the missing rank value information, such as the rank value of the coded data block.

Combining the semi-static configuration information in field 2, the association depth D (the number of old packets 0) can be obtained.

Field 3: Decoding window status, which represents the influence of the decoding window length on the number of encoded data packets, combined with field 2 to determine the number of new packets N of the next original data block and the number of redundant packets of the next encoded data block R (both the sender and the receiver can be determined according to the algorithm).

Optionally, any form of the association depth D of the next original data block in the non-systematic code scheme can be used as field 2, any form of the number N of new packets can be used as field 3, and the next encoded data block can be used as field 3. The number R of redundant packets is used as field 4, and by combining, it is displayed to indicate feedback information.

5) Feedback format 1_0_0: The system code scheme, the size of the original data block is the same, and the decoding window state is not considered (among them, the number of new packets participating in the encoding is N semi-static configuration)

Field 1: pattern number 100, 3bit;

Field 2: Indicates the correct number of system packets S or the number of incorrect system packets S' of the current data block;

Field 3: Indicates the number P of correct encoded data packets or the number of incorrect encoded data packets P' of the current data block.

Field 2 and field 3 can be combined with the semi-static configuration information to obtain the association depth D and the number R of redundant packets in the next block.

Optionally, any form of the association depth D in the systematic code scheme can be used as field 2, and any form of the number of redundant packets R can be used as field 3, and through combination, the feedback information is displayed.

6) Feedback format 1_0_1: The system code scheme, the original data block size is the same, and the decoding window state is considered (among them, the number of new packets participating in the encoding is N semi-static configuration)

Field 1: pattern number 101, 3bit;

Field 3: Indicates the correct number of coded packets P or the number of erroneous coded packets P' of the current data block;

The association depth D can be obtained by combining field 2 and field 3 with the semi-static configuration information;

Field 4: Decoding window status, which represents the effect of the decoding window length on the number of encoded data packets. Combining field 2 and field 3, the number of redundant packets R in the next block can be determined (both the sender and receiver can use the algorithm according to the Sure).

7) Feedback format 1_1_0: The system code scheme, the size of the encoded data block is the same, and the decoding window state is not considered (among them, N+O semi-static configuration)

Field 1: pattern number 110, 3bit;

Field 2 and field 3 can be combined with semi-static configuration information to obtain the association depth D, the number of new packets N of the next original data block (equal to the number of correctly received encoded data packets) and the number of redundant packets R (equal to the number of wrongly encoded packets) number of packets);

Optionally, any form of the association depth D of the next original data block in the system code scheme can be used as field 2, any form of the number N of new packets can be used as field 3, and the number of redundant packets R can be used as field 3. Field 4, by combining, displays the feedback information.

8) Feedback format 1_1_1: System code scheme, the size of the encoded data block is the same, and the decoding window state is considered (among them, N+O semi-static configuration)

Field 1: pattern number 111, 3bit;

The association depth D can be obtained by combining field 2 and field 3 with the semi-static configuration information.

Field 4: Decoding window status, which represents the effect of the decoding window length on the number of encoded data packets. Combining field 2 and field 3, the number of redundant packets R in the next block can be determined (both the sender and receiver can use the algorithm according to the OK) and the number of new packets N of the next original data block.

The beneficial effects of the second embodiment above are as follows: the content and possible formats of the feedback information of the receiving end are designed, the receiving end can send different feedback information formats, and the transmitting end obtains different network coding schemes and parameter settings. Further, the transmitting end reasonably configures encoding parameters according to the feedback information and requirements, and performs network encoding on some or all of the data packets in the next original data block and several previous original data blocks to generate encoded data packets. It can effectively ensure the effectiveness of the network coding scheme and the improvement of system performance.

Embodiment 3

The third embodiment is used to provide the bearing method for the above feedback information, that is, in what manner to send the feedback information to the transmitting end.

For example, the feedback information may be sent through a message at the MAC layer or above (including but not limited to the PDCP layer, the RLC layer, etc.). Or define a new network coding layer separately, and then use the message of the new network coding layer as the bearer of the feedback information.

Specifically, in the feedback information, the feedback information given in the second embodiment can be understood as the data of the feedback message. Besides, the feedback message also needs header information. That is, the receiving end sends a feedback message to the transmitting end, and the feedback message carries a message header and data, and the data carries the feedback information.

The header information includes the following content fields:

1) The header indicates the field H_Field;

2) Data block number Block_Num;

3) Process number Process_Num.

Wherein, the header indication field is used to indicate that the current data packet is the feedback information of network coding. The data block number is used to indicate the encoded data block corresponding to the feedback information. The process ID is used to indicate the sender process ID corresponding to the feedback information (used in the multi-process feedback scheme, this field information is optional, and the sender process ID can also be calculated from the data block ID combined with the semi-static information).

Optionally, when the encoding and decoding operation of network coding occurs at the PDCP layer, the feedback message may be carried by a protocol data unit (protocol data unit, PDU) generated by the PDCP layer. As shown in FIG. 15 , it is a schematic diagram of the PDCP layer bearing of the feedback message. The left side is the PDCP data format, including the PDCP header and the PDCP data, wherein the PDCP header includes the header information fields 1), 2), and 3) mentioned above, and the field Others represents other field information.

Optionally, when the encoding/decoding operation of network coding occurs at the RLC layer, the feedback message may be carried by a PDU generated by the RLC layer. As shown in FIG. 16 , it is a schematic diagram of the RLC layer bearing of the feedback message. The header information of the RLC layer PDU implements the functions of the above three fields, in which the existing field D/C=1 represents the control message, and CPT=001 represents the network coding feedback message of the receiving end, so that the H_Field field can be omitted. In addition, it is necessary to The header information fields 2) and 3) are added, and the field Others indicates the remaining field information of the RLC layer packet header. Corresponding to the RLC header is the RLC layer data, including the data (which carries the feedback information) and the PDU packet of the PDCP layer.

Optionally, when the encoding and decoding operations of network coding occur at the MAC layer, the feedback information may be carried by a PDU generated by the MAC layer. As shown in FIG. 17 , it is a schematic diagram of the MAC layer bearing of the feedback message. The header information of the MAC layer PDU implements the functions of the above three fields by adding fields 1) to 3). The MAC layer PDU data includes data (which carries feedback information) and PDU data from the RLC layer.

Another feasible bearer method is to use control information for bearer. Specifically, on the protocol layer corresponding to the network coding at the receiving end, a feedback message is generated by operations such as decoding, and the feedback message is transmitted to the physical layer in the form of PDU, and finally the uplink control information (UCI) or Downlink control information (DCI) is carried and transmitted to the sender. Wherein, new fields can be added or existing fields can be multiplexed in UCI or DCI to carry the above fields 1) to 3) and data (which carry feedback information).

The beneficial effects of the third embodiment are as follows: feedback information can be provided more flexibly, and the existing PDCP, RLC, and MAC layers can provide PDUs corresponding to the feedback information, and only need to make appropriate adjustments on the existing protocol layer PDUs, which is convenient and fast. For the method carried by the physical layer UCI or DCI, the reliability of the feedback information can be better guaranteed.

Embodiment 4

Embodiment 4 provides the design of the control message at the sending end. The sending end jointly determines the coding parameters of the next original data block through the feedback information of the receiving end and other information such as (channel conditions, etc.) Joint encoding with some or all of the data packets of several previous original data blocks. Since the factors affecting the encoding decision of the transmitting end may not be limited to the feedback information of the receiving end, the parameters encoded by the transmitting end may or may not be consistent with the parameters provided by the feedback information. Correspondingly, the header of the encoded data packet carries a control message indicating the corresponding encoding parameter, so that the receiving end can perform operations such as decoding according to the encoding parameter.

As mentioned above, different encoding schemes may correspond to different feedback information formats, and may correspond to different encoded data packet header information. The sender determines the encoding scheme of the next original data packet according to the received feedback information and other system information, and adds a corresponding control message to the packet header of the encoded data packet.

As shown in FIG. 18 , it is a schematic diagram of the header information field of the sender. The header of a coded data packet at the sending end includes a data block ID field, a coefficient field (which may be a coded coefficient field or a coefficient indication information field), a correlation depth (D) field, a data block packet number (N) field, and the like. The representation method of the associated depth field may partially refer to the non-systematic coding scheme or the associated depth representation form of the systematic coding scheme in the second embodiment. The specific representation is as follows: the coefficient field may indicate the coefficient value, or configure the coefficient value in a semi-static manner.

The following describes the association depth field and the number of packets (N) fields of the data block.

1. For non-systematic coding schemes

1. The feedback formats 0_0_0 and 0_0_1 belong to the case where the number of packets (N value) of the next original data block is fixed. The packet count field of the data block is not needed because it is already semi-statically configured.

The implementation of the associated depth field can be any of the following:

1) Indicate the number of old packets involved in the next coded data block, combined with the channel conditions and factors such as the maximum window length of the coding window and the decoding window, a maximum value L is given, using

The bit indicates that the association depth in this case is counted forward in order from the current data block;

2) Indicate the bitmap of the old packet participating in the next encoded data block. The bitmap needs to give a fixed number of bits (represented by L) in combination with the size of the data block, the channel condition, the encoding window length, and the feasibility of the solution;

3) Indicate the total number of original data packets currently involved in encoding Pack_Total, use

Bit representation, calculated by Pack_Total-N to get the number of associated old packets;

4) Divided into two subfields, indicating any of the index number of the first original data packet involved in encoding, the index number of the last original data packet, or the total number of the first original data packet to the last original data packet. two;

5) Divided into two subfields, indicating any two of the starting packet number of the encoding window of the transmitting end participating in the encoding, the ending packet number of the encoding window of the transmitting end and the effective length of the encoding window of the transmitting end.

2. The feedback formats are 0_1_0 and 0_1_1, and the number of encoded packets C of the next encoded data block is a fixed value.

When the decoding window state is not considered, it is equivalent to the sum of the number of new packets N and the number of old packets O is a fixed value, that is, C=N+O, the values of the associated depth D and O are equal, and D or O is known , N can be deduced according to the semi-static information C, optionally, the information of the N field of the number of new packets can also be displayed explicitly, or the information of the N field of the number of new packets can be not carried. The sum of the number N of new packets and the number O of old packets that belong to the next encoded data block is fixed (N+O is a fixed value), the number of packets (N) field of the original data block and the associated depth (D) field You can choose one of two.

The associated depth field D in the header information of the sender is equal to the number of data packets contained in the previous data block (the number of old packets is O), and it can also be implied in the number of new packets N participating in the encoding of the next data block, which can be any of the following options:

1) Indicate the number of old packets involved in the next encoded data block, the maximum value of the range L=N+O, use

The bit indicates that the association depth in this case counts forward from the current data block in turn;

3) Indicate the number N of new packets currently participating in encoding, use

It means that the number of old packets associated with O can be obtained by subtracting N from the total number of data packets N+O;

Optionally, the N field of the number of new packets that the next data block participates in encoding may specifically be any of the following schemes:

1) Indicate the number N of new packets currently participating in encoding, and the maximum value is L, which needs to be used

Represents bit representation;

2) A bitmap indicating the number N of new packets currently participating in coding. The bitmap needs to give a fixed number of bits (with L representing the maximum value) in combination with the size of the data block, the channel condition, the coding window length, and the feasibility of the scheme.

When considering the decoding window state (window length), it is necessary to indicate the associated depth field D and the N field of the number of new packets that the next data block participates in encoding. According to the usage of the window length, the number of redundant packets R'=R+ΔR is defined. Among them, ΔR is related to the number of redundant packets related to the state variable Length_Wind_Decoder of the decoder, which is expressed as ΔR=f(Length_Wind_Decoder), where the function f represents a mapping relationship between the usage of the window length of the decoder and the number of additional redundant packets . At this time, the quantitative relationship satisfies C=N+O+ΔR.

The header information of the sender needs to carry the associated depth field D (equal to the number of data packets contained in the previous data block) and the number of new packets N fields involved in the encoding of the next data block. The associated depth field D field can be any of the following: One option:

2) Indicate the bitmap of the old packet participating in the next encoded data block. The bitmap needs to give a fixed number of bits in combination with the size of the data block, the channel condition, the encoding window length, and the feasibility of the solution (L represents the maximum value);

3) Divided into two subfields, indicating any of the index number of the first original data packet involved in encoding, the index number of the last original data packet, or the total number of the first original data packet to the last original data packet. two;

4) Divided into two subfields, indicating any two of the starting packet number of the encoding window of the transmitting end participating in the encoding, the ending packet number of the encoding window of the transmitting end and the effective length of the encoding window of the transmitting end.

The N field of the number of new packets that the next data block participates in encoding can be any of the following schemes:

1) Indicate the number N of new packets currently participating in encoding, and the maximum value is L, then use

Represents bit representation;

2) A bitmap indicating the number N of new packets currently participating in encoding. The bitmap needs to give a fixed number of bits in combination with the size of the data block, the channel condition, the encoding window length, and the feasibility of the solution (L represents the maximum value);

3) Indicate the number of redundant packets ΔR related to the decoding window currently participating in the encoding, where the maximum value is defined as L, using

bit representation;

4) A bitmap indicating the number of redundant packets ΔR related to the decoding window currently involved in encoding, with a length of L bits.

Second, for the system coding scheme

1. The feedback formats 1_0_0 and 1_0_1 belong to the case where the number of packets (N value) of the next original data block is fixed. The packet count field of the data block is not needed because it is already semi-statically configured.

The implementation of the associated depth field can be any of the following:

1) Indicate the number of old packets involved in the next coded data block, combined with the channel conditions and factors such as the maximum window length of the coding window, give a maximum value L, use

Bit representation.

3) Indicate the number of old blocks Block_Num involved in the next coded data block, and give a maximum value Block_Max in combination with the channel conditions and the maximum window length of the coding window, using

Bit representation, the number of old packets is obtained by multiplying the number of old blocks by the block length N;

4) indicating the bitmap of the old block participating in the next coded data block, the number of packets participating in the coding can be calculated;

5) Indicate the total number of original data packets currently involved in encoding;

6) Indicate any two of the index number of the first original data packet involved in encoding, the index number of the last original data packet or the total number of the first original data packet to the last original data packet;

7) Indicate any two of the starting packet number of the encoding window of the transmitting end participating in the encoding, the ending packet number of the encoding window of the transmitting end, and the effective length of the encoding window of the transmitting end.

It can be understood that the above-mentioned association depth D is only valid for coded data packets, the system packet is the original data packet itself, its own system is 1, the coefficients of other packets are 0, and the association depth D=0.

2. For feedback formats 1_1_0 and 1_1_1, the number C of encoded packets of the next encoded data block is a fixed value. It is necessary to indicate the associated depth field D and the N field of the number of new packets that the next data block participates in encoding, and there is no direct relationship between the two.

The associated depth field D in the header information of the sender is not equal to the number of data packets contained in the previous data block (the number of old packets is 0), which may be any of the following schemes:

1) Indicate the number of old packets involved in the next coded data block, and give a maximum value L in combination with the channel conditions and the maximum window length of the coding window, which can be semi-statically determined by the length of the data block, using

Bit representation.

Bit indicates that the number of old packets is obtained by converting the number of old blocks combined with the block length;

4) indicate the bitmap of the old block participating in the next encoded data block, and can convert the number of packets involved in encoding; 5) indicate the total number of original data packets currently participating in encoding;

It can be understood that the above-mentioned association depth D is only valid for coded data packets, the system packet is the original data packet itself, its own system is 1, the coefficient of other packets is 0, and the association depth D=0.

1) Indicate the number N of new packets currently participating in encoding, use

Express;

2) A bitmap indicating the number N of new packets currently participating in encoding. The bitmap needs to give a fixed number of bits (denoted by C) in combination with the size of the data block, the channel condition, the encoding window length, and the feasibility of the solution;

3) When considering the state of the decoding window, indicate the number of redundant packets ΔR related to the decoding window currently participating in the encoding, and use

4) when considering the decoding window state, indicate the bitmap of the number of redundant packets ΔR related to the decoding window currently participating in the encoding, and the length is C bits;

The coefficient field is described below.

The indication information of the coding coefficients can be carried in the header of the coded data packet. Combined with the correlation depth and the number of redundant packets determined by the feedback information, the original data packet information of the coded data packet and the coefficient corresponding to the original data packet information can be indicated. In addition to the manner of carrying the coding coefficients in the packet header, a semi-static codebook may also be configured and the coding coefficients may be indicated in the semi-static codebook through codebook indication information.

The codebook can be a local codebook or a global codebook.

The advantage of the local codebook is that the range of the GF domain is small, and the number of packets involved in coding (ie, the dimension of a coefficient vector) is usually much smaller than the range of the largest coding window. The position and number of the original data packets to be encoded are located with reference to the information, and the decoder at the receiving end needs to equivalently form a global decoding coefficient matrix for decoding according to the above information.

The global codebook defines a global coefficient matrix with a coding coefficient vector dimension equal to the maximum coding window length of the sender. The value of the value, so that the coding coefficients in the codebook can be used cyclically to ensure that all the coded data packets in the decoding window are linearly independent, and the decoding validity is guaranteed, but the disadvantage is that the size of the GF field needs to be considered larger, and the coding and decoding The computational complexity of the process will be higher. The local codebook and the global codebook are respectively described below.

1. For local codebooks

As shown in FIG. 19 , it is a schematic diagram of a local codebook. The local codebook is a matrix with k rows and n columns (k*n), the codebook contains n coefficient vectors (n columns, which can be used to generate n encoded data packets at most), and the maximum dimension of each coefficient vector is k (that is, it can be used to encode at most k original data packets), and the n coefficient vectors are linearly independent of each other, and the corresponding codebook coefficients that satisfy the characteristics of linear independence include but are not limited to Vandermonde matrix or Cauchy matrix Wait. Here, the values of k and n of the local codebook are smaller or much smaller than the size of the coding window. Optionally, a general local codebook can be defined or configured, from which the encoding process of the encoder at the transmitting end can select a sub-matrix as the encoding coefficient matrix (also referred to as the encoding kernel matrix) of an original data block, which can be determined according to submatrix to complete the encoding of each encoded data block step by step.

The specific operations of different coding schemes are different, and the ways of using the codebook are also different.

1. For non-systematic codes, take the case where the number of data packets encoded each time is the same (that is, the sum of the number of new packets and the number of old packets is a fixed value, and N+O is a fixed value) as an example, due to the depth of association And the number of encoded data packets has been determined, just select a sub-matrix from the local codebook as the encoding coefficient. For example, when N+O=4 and the number of encoded data packets is 6 (the number of redundant packets R=2), (a _i,j ~a _i+3,j ) can be selected as a coefficient vector, where i satisfies ≥1 and i+3≤k, under the condition that the value of i remains unchanged, 6 different coefficient vectors can be randomly selected from the local codebook, where the 6 vectors can be consecutive 6 column vectors on the local codebook , or it can also be 6 discontinuous column vectors on the local codebook, and the 6 vectors form a sub-matrix of a codebook. As shown in Fig. 20, it is a schematic diagram of local codebook selection. Submatrix 1, Submatrix 2, or Submatrix 3 can be selected. Here, you can also choose a smaller codebook to ensure that it can meet the needs of encoding. In addition, if the parameter N+O=4, the maximum number of encoded data packets is 6 (the maximum number of redundant packets R is 2), a minimum local codebook can be given, such as sub-matrix 1, each time by adjusting Correlation depth D (the number of data packets of the current original data block and the data packets of the previous data block), using the existing codebook for encoding, as shown in Figure 21, is a schematic diagram of the local codebook generation matrix, the first generated The matrix uses a 4*4 codebook, the second generator matrix uses a 4*5 codebook, and D=1, and the third generator matrix uses a 4*6 codebook, D=2; the subsequent encoding generator matrix is based on this By analogy, as long as it is within the codebook, it is sufficient that every two coding vectors are linearly independent.

2. For the system code scheme, the default coefficient of the system package is 1, and the other coefficients are 0. There is no need to use a local codebook. For redundant encoded data packets, the local code can be used according to the aforementioned content according to the number of encoded data packets required. Book.

Second, for the global codebook

The global codebook needs to consider the length limitations of the encoder at the sender and the decoder at the receiver. Usually, in order to ensure the decoding capability of the receiver, the length of the coding window of the sender needs to meet the following conditions: the length of the coding window L of the sender is less than or equal to The receiver decoding window length Length_Wind_Decoder. Correspondingly, the length of the coding and decoding window determines the size of the codebook and the size of the corresponding GF field. As shown in FIG. 22 , it is a schematic diagram of the global codebook. The global codebook is a matrix with K rows and N columns (that is, K*N). The codebook contains N coefficient vectors (N columns, which can be used to generate N encoded data packets at most), and the maximum dimension of each coefficient vector. is K (that is, it can be used to encode at most K original data packets), and the N coefficient vectors are linearly independent in pairs, and the corresponding codebook coefficients that satisfy the characteristics of linear independence include but are not limited to Vandermonde matrix or Cauchy matrix, etc. K in the global codebook is greater than or equal to the maximum window length L of the encoder at the sending end, and the value of N is greater than or equal to the maximum window length Length_Wind_Decoder of the decoder at the receiving end. Correspondingly, the GF domain value can be selected according to max{K,N}, that is, for GF(2 ^q ), 2 ^q ≥max{K,N}. In the global codebook, the coded data packet carries packet header information, and the packet header information carries the indication information of the codebook. The indication information of the row codebook includes coefficients in the starting position Para_start of the codebook, the ending position Para_end, and the number of coefficients Para_length any two pieces of information. When the number of coefficients Para_length is semi-statically configured, only the starting position Para_start or the ending position Para_end of the codebook is required. To sum up, the encoder at the transmitting end encodes the original data, and sequentially selects the encoding coefficients from the global codebook in a circular manner. For example, the first coded data packet in the initial stage corresponds to the first group of coding coefficients of the global codebook, and the coding coefficients of the subsequent coded data packets are sequentially selected from the global codebook in a circular manner.

1. For non-system code scheme

As shown in FIG. 23, a schematic diagram of global codebook selection is shown. In a complete global codebook, if each data block has the same number of new packets, the number of old packets varies with the depth of association. The first encoding: Encode 3 new packets to generate 3 encoded data packets, and select coefficient sub-matrix 1 from the global codebook. The second encoding: encoding 3 new packets and 1 old packet to generate 4 encoded data packets, and considering that the correlation depth is 1, therefore, the coefficient sub-matrix 2 is selected from the global codebook. The third encoding: encode 3 new packets and 2 old packets to generate 5 encoded data packets, select coefficient sub-matrix 3 from the global codebook, and so on. If the total number of packets in each coded data block is the same, that is, the total number of new and old packets is the same, and each coded data block contains a total of 3 packets as an example, the encoding generates 3 coded data packets. The first encoding: Encode 3 new packets to generate 3 encoded data packets, and select coefficient sub-matrix 1 from the global codebook. Second encoding: Encode 2 new packets and 1 old packet to generate 3 encoded data packets, and select coefficient sub-matrix 2 from the global codebook. Third encoding: Encode 1 new packet and 2 old packets to generate 3 encoded packets.

As the encoded data block of the transmitting end enters the window, there will also be a decoder window at the receiving end. If the receiving end successfully decodes the current and previous encoded data blocks, the windowing operation is performed on the encoded data blocks in the decoding window (such as Clear the decoding window), and feedback the decoding situation to the sender. Then, the transmitting end determines the successfully decoded coded data block, moves the successfully decoded data block and the data block before the coded data block out of the coding window, and then can reuse the global codebook. When the encoded data block in the window has not been successfully decoded after the encoding window is full, before the next encoded data block enters the window, if the size of the encoding window is fixed, an old encoded data block may exit the window.

2. For the system code scheme

The default coefficient of the system package is 1, and the other coefficients are 0. There is no need to use the global codebook. For the encoded data packets, the global codebook can be used according to the aforementioned content according to the number of encoded data packets required.

The beneficial effects of the fourth embodiment above are as follows: the control message of the sender is completely designed. The control message carried in the header of each coded data packet can indicate the coding decision determined by the sender according to the feedback information of the receiver and other system information, which is embodied as coding parameters. Due to the influence of other system information, the coding parameters of the packet header and the coding parameters corresponding to the feedback information of the receiving end are not always consistent. Therefore, by identifying the header control message of the encoded data packet, the receiving end can obtain specific encoding parameters including the association depth D, the number of redundant packets R, the number of new packets N, and the corresponding encoding coefficient matrix, etc. The terminal can accurately identify the encoding parameters and the corresponding encoded data, so as to achieve accurate decoding. And for the coding coefficient matrix, the semi-static local and global codebook scheme and the corresponding design of the indication information are given, which reduces the overhead caused by the random coefficient carrying in the packet header, ensures the reduction of the complexity of the GF domain operation, and ensures a coded data block. The coded packets are linearly independent between coded packets within and between coded data blocks.

Embodiment 5

Embodiment 5 provides an encoding scheme by combining the erasure situation in the transmission process of the encoded data packet (which can also be understood as data packet loss), the decoding of the receiving end, and the feedback information of the receiving end, including the design under systematic codes and non-systematic codes. scheme, and made different designs according to different parameter configurations.

As shown in FIG. 24 , it is a schematic diagram of the flow chart of the sending end of the feedback-based coding scheme.

Step 2401, the transmitting end determines the type of encoding scheme and initializes encoding parameters in the initialization phase.

The coding scheme includes a systematic code scheme and a non-systematic code scheme.

The initial encoding parameters include the association depth D, the number R of redundant encoded data packets, the number N of new original data packets in the original data block, and the encoding coefficients (which can be randomly generated or selected from the codebook).

Step 2402, the transmitting end performs encoding according to the encoding parameters, generates an encoded data packet, and sends it.

After specifying the coding scheme categories, it is necessary to clarify which parameters in the scheme are semi-statically configured. The parameters that can be semi-statically configured here are: the total number of original data packets to be encoded (including the sum of the original data packets of the new original data block and the original data packets of several old original data blocks), the association depth D, The number N of original data packets (that is, new packets) of the new original data block, and the number R of redundant encoded data packets. In the initialization state, the sender first encodes the original data according to the scheme type, semi-static parameter configuration and initial parameter configuration, generates an encoded data packet (including adding packet header information), and sends the encoded data packet.

Step 2403, the sending end receives the feedback information and other system information.

For the feedback information here, reference may be made to the descriptions of the foregoing embodiments.

Other system information here includes, but is not limited to: channel state information, other indications or system information affecting coding parameters, and the like.

Step 2404: The sender determines whether the feedback information includes decoding success information.

If yes, go to step 2405, if no, go to step 2406.

Step 2405, the sender removes the successfully decoded original data from the encoder.

When the sender receives the feedback information from the receiver, it needs to determine whether the decoding is successful according to the feedback information. If the decoding is successful, the encoder at the sender clears the original data packet, otherwise, no operation is performed. Due to the limited size of the convolutional network encoder, if the convolutional network encoder is full, one unit of old data is cleaned out of the convolutional network encoder, and one unit of new data is put into the convolutional network encoder.

Step 2406, the transmitting end determines the encoding parameters for the next encoding according to the feedback information and other system information.

The sender determines the encoding parameters for the next encoding according to the scheme type, semi-static parameter configuration, and in combination with feedback information and other system information. Optionally, the encoding parameter here may be the same as the encoding parameter indicated by the feedback information, or the encoding parameter may be updated according to other system information on the basis of the feedback information. In addition, the determined encoding parameters of the next encoding need to be carried in the packet header of the encoded data packet generated by the next encoding to ensure that the convolutional network decoder at the receiving end can correctly identify the relevant parameter information, and then accurately decode.

Combining the coding scheme type and semi-static parameter configuration, the following schemes are given below:

It should be noted that in the following FIGS. 25 to 30 , G ₀ , G ₁ , G ₂ , G ₃ , and G ₄ are coding coefficients. The dots in G ₀ represent the coding coefficients of the new packet, the dots in G ₁ , G ₂ , G ₃ , G ₄ represent the coding coefficients of the old packets, the black dots represent the coefficients of the non-redundant coded data packets, and the white The dots represent the coefficients of redundant coded data packets, the blank positions always represent the coefficients as 0, and the values represented by the dots can also be 0.

1. In the feedback-based non-systematic code scheme, the total number of data packets of each encoded data block is a fixed value. When the influence of the decoding window and the corresponding algorithm are not considered, it is equivalent to the total number of original data packets to be encoded. value (N+O semi-static configuration).

As shown in FIG. 25 , it is a schematic diagram of an adaptive non-systematic code scheme based on feedback. The number of data packets in the encoded data block is a fixed value of 4, which is equivalent to a fixed value of the total number of original data packets to be encoded at the transmitting end (N+O), specifically N+O=4. The left side B _i in the figure represents the original data block of the sender, each original data block contains several original data packets, and a _i represents the original data packet. The upper side of the figure represents the coded data block, which is represented by _B'i , each coded data block contains several coded data packets, and the number of coded data packets of each coded data block is the same, which is 4, that is, each time is equivalent to The encoding coefficient matrix is always a 4*4 matrix. Below are the coding coefficients, the dots in G ₀ represent the coding coefficients of the new packet, the dots in G ₁ represent the coding coefficients of the old packet, and the white dots in G ₀ and G ₁ represent the coefficients of the redundant coded data packets. The encoded data packets are denoted _ci and the redundant packets are denoted _pi . The coding coefficients here can be random coefficients, or a semi-static coefficient codebook can be considered. If a local codebook is selected, a 4*4 linearly independent codebook can be selected. If you choose a global codebook, you need to consider a Q*Q codebook, Q≥max(K,N), where K, N are the length of the convolutional network encoder at the sender and the length of the convolutional network decoder at the receiver For details, refer to Embodiment 4 above for details. At the initial moment, a ₁ to a ₄ of the original data block B ₁ are encoded to generate c ₁ to c ₄ of B ₁ ', and c ₂ is erased (corresponding to the coefficient column label "×"), and the receiving end cannot successfully decode it , and then generate feedback information, where the parameters related to the feedback information can be represented as the information in the foregoing second embodiment, such as a rank value, and then send the feedback information to the sender. The sender determines the association depth D=1 data packets according to the parameters of the feedback information, and the number of packets of the next original data block is N=3, and the number of redundant packets is R=1. The generator matrix is composed of encoding kernel matrices G ₀ and G ₁ , where G ₀ is a 3*4 matrix, and G ₁ is a 1*4 matrix, which can correspond to any original data packet in B ₁ . In addition, if the influence of the state of the decoder (window length) on feedback information or coding is considered, according to the usage of the window length, a redundant packet R'=R+ΔR is defined. The function related to ΔR and the state variable Length_Wind_Decoder of the decoder is expressed as ΔR=f(Length_Wind_Decoder), where the function f represents a mapping relationship between the usage of the decoder window length and the number of extra redundant packets. The corresponding algorithm can be considered at the sending end or at the receiving end. The sending end needs to feed back information carrying the parameters of the window length usage. On this basis, the relevant algorithm is executed to add additional redundancy, and the receiving end directly executes the relevant algorithm and sends The result is converted into other parameters, such as the number of redundant data packets, and the feedback information does not need to carry the decoder window length parameter separately. In the figure, the state feedback of the decoder is not considered. The encoded data packets c ₅ and c ₇ of the encoded data block B′ ₂ are erased. According to the feedback information, the associated depth D=2 data packets. Correspondingly, the original data block B ₃ contains a ₈ and a ₉ , which are the same as B ₂ a ₆ and a ₇ in the joint code. By analogy, when the transmitting end participates in encoding the original data packet in the original data block B5, and the receiving end receives c ₁₃ to _c ₁₅ in the corresponding encoded data block B' ₅ and the redundant packet p ₅ is successfully decoded, then All the original data packets in the original data blocks B ₁ to B ₅ are successfully decoded. The receiving end moves the transmitting ends B' ₁ to B' ₅ of the encoded data blocks out of the decoder window. Similarly, the transmitting end moves the original data packets of the original data blocks B ₁ to B ₅ out of the encoder window according to the feedback information of the receiving end.

2. In the feedback-based non-systematic code scheme, the number of packets N of the current original data block is a fixed value (the number of new packets N is semi-statically configured).

As shown in FIG. 26 , it is a schematic diagram of an adaptive non-systematic code scheme based on feedback. Among them, the number of new packets of the original data block of the sender is the same, that is, N is a fixed value. Scheme 2 is consistent with Scheme 1 as a whole, except that the number of new packets N of the original data block of the sender is semi-statically configured to be 3, and the value of N+O will also change accordingly according to the change of the association depth. According to the erasure of the encoded data packets, the number R of redundant packets will also be adjusted accordingly. For example, the original data packet of the original data block _B3 and the original data packet _a6 of the original data block _B2 are jointly encoded to generate encoded data Block _B'3 , in which encoded packets _c8 and _c9 are erased. According to the feedback information, the sender knows that rank=2, so the association depth of the next original data block is D=2 data packets, R=2 data packets, and the corresponding coding coefficient is a matrix of 5*5. In addition, if the influence of the state of the decoder (window length) on the feedback information or coding is considered, according to the usage of the window length, a redundant packet R'=R+ΔR is defined. The function related to ΔR and the state variable Length_Wind_Decoder of the decoder is expressed as ΔR=f(Length_Wind_Decoder), where the function f represents a mapping relationship between the usage of the decoder window length and the number of extra redundant packets. The corresponding algorithm can be considered at the sending end or at the receiving end. The sending end needs to feed back information carrying the parameters of the window length usage. On this basis, the relevant algorithm is executed to add additional redundancy, and the receiving end directly executes the relevant algorithm and sends The result is converted into other parameters, such as the number of redundant data packets, and the feedback information does not need to carry the decoder window length parameter separately. The influence of the state of the decoding window is considered here. The simplified algorithm here is to add an extra redundant packet at the end of the window, that is, to encode the four original data packets a ₁₂ to a ₁₅ of B ₄ to B ₅ to generate five encoded packets. On the basis of the redundant packet p ₅ , an additional redundant packet p ₆ is generated according to the decoding window correlation algorithm f, which can ensure correct decoding even when a data packet is lost in the last encoded data block.

3. In the feedback-based non-systematic code scheme, the number N of the original data packets of the current original data block is a fixed value, and the coded redundancy packet R is a fixed value (the N value and the R value are semi-statically configured).

As shown in FIG. 27 , it is a schematic diagram of a feedback-based average redundancy non-systematic code scheme. The value N of the number of new packets in each original data block is a fixed value, where N=3, and the number of redundant packets in the average redundancy scheme is also a fixed value, where R=1. Therefore, the transmitting end first encodes the data packets a ₁ to a ₃ in the data block B ₁ to generate an encoded data block B′ ₁ , which includes four encoded data packets c ₁ to c ₃ and redundant encoded data packets p ₁ . It can be randomly generated in the GF field and carried in the header of the encoded data packet, or the aforementioned semi-static local or global codebook can also be selected, and the coefficient indication information is carried in the header of the encoded data packet. During transmission at the sender, the encoded data packets c ₂ and c ₃ are erased (corresponding coefficient columns marked "x"). After receiving the encoded data packet, the receiving end performs related operations such as decoding, and generates feedback information, where the parameters related to the feedback information can be represented as rank values, or the information described in the foregoing embodiments, and send the feedback information to the transmitting end. The sender determines the association depth according to the parameters of the feedback information. Since the number of redundant packets is semi-statically configured, no adjustment is required. Because the rank of the encoded data block B' ₁ is 2, the rank is not satisfied, and the decoding fails, so the correlation depth is equal to 1 (ie, the number of original packets - the rank value). Correspondingly, to jointly encode all the data packets of the original data block B ₂ and one data packet (such as a ₃ ) of the original data block B ₁ , the generating matrix is composed of the encoding kernel matrices G ₀ and G ₁ , where G ₀ is a 3 *4 matrix, G ₁ is a 1*4 matrix. c ₅ in the encoded data block B' ₂ is erased, the receiving end jointly decodes the encoded data blocks B' ₂ and B' ₁ , the decoding fails, and the feedback information is generated to the transmitting end. The sender determines that the association depth is 1 data packet according to the feedback, and so on, until the encoded data block B' ₅ is received, and is decoded jointly by B' ₁ to B' ₅ , the decoding is successful, and the decoding window of the receiver is cleared. (B' ₁ to B' ₅ are out of the window), and the decoding information is fed back. The original data blocks B ₁ to B ₅ of the sender are out of the window (the sender's coding window is cleared). Subsequent operations are analogous. On the other hand, if the decoding fails, it will be fed back to the sender. The sender encoder B ₁ is out of the window, B ₆ is in the window and encoded and sent, and the receiver decoder B' ₁ is out of the window and received B' ₆ and into the window for decoding. operation, and so on. In addition, irrespective of the decoder state, the number R of redundant packets in the current coded data block is semi-statically configured by the system information, that is, the average redundancy. When considering the state of the decoder, according to the usage of the window length, define the number of redundant packets R'=R+ΔR, where ΔR is a function related to the state variable Length_Wind_Decoder of the decoder, expressed as ΔR=f(Length_Wind_Decoder) , where the function f represents a mapping relationship between the usage of the decoder window length and the number of extra redundant packets. The corresponding algorithm can be considered at the sending end or at the receiving end. The sending end needs to feed back information carrying the parameters of the window length usage. On this basis, the relevant algorithm is executed to add additional redundancy, and the receiving end directly executes the relevant algorithm and sends The result is converted into other parameters, such as the number of redundant data packets, and the feedback information does not need to carry the decoder window length parameter separately.

4. In the system code scheme based on feedback, the number N of new packets of the current original data block is a fixed value (the number of new packets N is semi-statically configured), and the depth of association is adaptive.

As shown in FIG. 28 , it is a schematic diagram of a feedback-based systematic code scheme. Among them, the number N of new packets of the current original data block is a fixed value (semi-static configuration). Different from the feedback-based non-systematic code scheme, the present systematic code scheme needs to feed back the case of the systematic code and redundant coded data packets respectively. The association depth corresponding to the erasure of the system packet and the encoded data packet is adjusted differently. The association depth D is no longer based on the number of data packets, but in data blocks. Only when the system packet is erased, it is related to the previous original data block, ie D=1. When the encoded data packet is erased, the associated depth D in the next encoding is equal to the associated depth in the previous encoding + 1. In the specific scheme, the receiving end generates feedback information according to the system code scheme in the _second embodiment, respectively indicating the situation of the system packet and the situation of the encoded data packet _. The remaining coded data packet p ₁ is erased, and the feedback information generated by the receiving end indicates that there is one missing system packet and one coded data packet, respectively, and the transmitting end generates two redundant coded data packets R=2 accordingly, because the coded data packet is erased , in order to ensure the decoding characteristics, the association depth D=2 is designed here, which is two encoded data blocks, the generator matrix is composed of G ₀ , G ₁ and G ₂ , and the corresponding encoding coefficients can be randomly generated or selected from the semi-static codebook , which will not be repeated here. Optionally, it is also possible to set the association depth of one redundant packet to D=2, and the association depth of another redundant packet to D=1, that is, for the number of erroneous system packets and redundant encoding packets, respectively set the corresponding Associative depth D, the foregoing scheme only selects the largest association depth, which can reduce header overhead. For the encoded data block B′ ₃ , only the system packet a ₉ is erased, so the associated depth D=1 when encoding the next original data block B ₄ , that is, the associated depth is 1 original data block, and the coefficient matrix consists of G ₀ and It consists of _G1 , and the number of redundant packets is R=1. In addition, when the decoding window of the receiving end is full, the window operation needs to be performed on the earliest encoded data block in the decoding window before the new encoded data block enters the decoding window. The data of a ₁ to a ₃ included in ' ₁ are still included in B' ₂ and B' ₃ , but not included in B' _4. Therefore, windowing is performed on B' ₁ and B' ₂ , and B' ₃ only considers In the system package part, the decoding operation is performed together with the subsequent encoded data blocks and the newly entered encoded data blocks. Once the decoding is successful, the related encoded data blocks can be directly performed on the receiving end decoder. A judgment algorithm for fast windowing. Another optional solution is to perform windowing only on one encoded data block B' _1. Since part of the system packets of B' ₁ are correct, they are regarded as known information, and the encoded data packets in B' ₂ and B' ₃ are regarded as known information. It can be simplified. It can be considered that a ₂ contained in B' ₁ and a ₄ contained in B' ₂ are visible, but cannot be decoded. Through the subsequent encoded data blocks of the new window, if the decoding is successful, the previous The encoded data block of A is also successfully decoded, that is, although B' ₁ is out of the window, the original data packet a ₂ in it is also successfully decoded; if the new encoded data block is successfully decoded, all the encoded data in the decoding window will be decoded successfully. Blocks perform windowing operations, and new encoded data blocks enter the window. It should be noted that, when the encoded data of the decoder of the receiving end is out of the window, the transmitting end will also perform the windowing operation of the old original data synchronously according to the feedback information of the receiving end. In other words, for the encoded data block that is windowed at the receiving end, the relevant original data block at the transmitting end will also perform the relevant windowing operation, that is, the encoding process will not include encoding of the relevant original data block.

Correspondingly, the above-mentioned second optional solution increases the probability of successful decoding compared with the first optional solution, but the decoding delay of the corresponding encoded data block increases. The above two optional solutions can be considered, and the transmitting end performs encoding in combination with the decoder state information in the feedback information of the receiving end. If the influence of the state of the decoder (window length) on the feedback information or coding is considered, according to the usage of the window length, the number of redundant packets R'=R+ΔR is defined. The function related to ΔR and the state variable Length_Wind_Decoder of the decoder is expressed as ΔR=f(Length_Wind_Decoder), where the function f represents a mapping relationship between the usage of the decoder window length and the number of extra redundant packets. The corresponding algorithm can be considered at the sending end or at the receiving end. The sending end needs to feed back information carrying the parameters of the window length usage. On this basis, the relevant algorithm is executed to add additional redundancy, and the receiving end directly executes the relevant algorithm and sends The result is converted into other parameters, such as the number of redundant data packets, and the feedback information does not need to carry the decoder window length parameter separately. In this way, by combining the decoding window state and adding redundant coded data packets at the end of the window, the current decoding capability can be improved and the delay overhead of successful decoding of the coded data can be reduced.

5. In the feedback-based system code scheme, the number N of original data packets of the current data block is a fixed value (the number of new packets N is semi-statically configured), and the association depth is fixed to a maximum value.

Scheme 5 is similar to Scheme 4, and is also a feedback-based systematic code scheme. The difference is that each encoded data block has the maximum available association depth in the current encoding window. Since the association depth is semi-statically configured, it is not necessary to separately Feedback the situation of the system packet and the encoded data packet (only the condition of the total data packet is fed back). As shown in FIG. 29, it is a schematic diagram of a feedback-based systematic code scheme. Before the receiving end successfully decodes and does not exceed the decoding window length, the association depth of B′ ₂ is D=2 data blocks, the association depth of B′ ₃ is D=3 data blocks, and the association depth of B′ ₄ D=4 data blocks, and the associated depth of B′ ₅ is D=5 data blocks, and decoding is successful at this time. In addition, when the decoding window is full, each time one data block is out of the window, another data block enters the window, and the associated depth of the data block in the window reaches the length of the maximum decoding window. For the following figure, it is assumed that B' ₅ is not successfully decoded due to the erasure of the encoded data packet and reaches the maximum window length. When the next encoded data block arrives, the decoding window operation needs to be performed on the encoded data block B' _{1 first} . . And the receiving end will send the feedback information to the transmitting end, and the transmitting end similarly performs the encoding window operation _on the original data block B1, or when the encoding window length of the transmitting end is longer than the decoding window length of the receiving end (the encoding window of the transmitting end is not full, No windowing operation is performed), and the original data block B ₁ also needs to be excluded during encoding. For the receiving end, the encoded data block _B'1 exits the decoding window, the encoded data block _B'6 enters the decoding window, and the associated depth of the encoded data block B'6 is still the maximum value, that is, D= ₅ , that is, B' The encoded data packets in ₆ are generated by encoding the original data packets of the original data blocks B ₂ to B ₆ . In addition, when the decoder state is not considered, the number of redundant packets R in the current coded data block is equal to the number of lost packets in the previous coded data block; According to the usage of the window length, the number of redundant packets R'=R+ΔR is defined. The function related to ΔR and the state variable Length_Wind_Decoder of the decoder is expressed as ΔR=f(Length_Wind_Decoder), where the function f represents a mapping relationship between the usage of the decoder window length and the number of extra redundant packets. The corresponding algorithm can be considered at the sending end or at the receiving end. The sending end needs to feed back information carrying the parameters of the window length usage. On this basis, the relevant algorithm is executed to add additional redundancy, and the receiving end directly executes the relevant algorithm and sends The result is converted into other parameters, such as the number of redundant data packets, and the feedback information does not need to carry the decoder window length parameter separately.

6. System code scheme based on feedback (the number of data packets in each encoded data block is a fixed value).

As shown in FIG. 30 , it is a schematic diagram of a feedback-based systematic code scheme. This scheme is similar to scheme 4, the difference is that the number of data packets of each original data block is changed, and the number of data packets of each encoded data block is a fixed value, when the influence of the decoding window state on redundant data packets is not considered is equal to the sum of the number of erroneous coded data packets in the previous coded data block and the number of system packets in the current coded data block as a fixed value. According to the feedback information, without considering the state of the decoding window, the number of redundant encoded data packets R is equal to the number of packets lost in the previous encoded data block; if the state of the decoder (window length) is considered, the feedback information Or the influence of coding, according to the usage of the window length, define the number of redundant packets R'=R+ΔR. The function related to ΔR and the state variable Length_Wind_Decoder of the decoder is expressed as ΔR=f(Length_Wind_Decoder), where the function f represents a mapping relationship between the usage of the decoder window length and the number of extra redundant packets. The corresponding algorithm can be considered at the sending end or at the receiving end. The sending end needs to feed back information carrying the parameters of the window length usage. On this basis, the relevant algorithm is executed to add additional redundancy, and the receiving end directly executes the relevant algorithm and sends The result is converted into other parameters, such as the number of redundant data packets, and the feedback information does not need to carry the decoder window length parameter separately.

The beneficial effects of the fifth embodiment above are as follows: schemes based on non-systematic codes and systematic codes are designed, and specific scheme flows under different parameter configurations are given. The complete flow is established on the basis of Embodiment 1 to Embodiment 4. Embodiment 5 of the present invention designs a scheme based on a non-systematic code and a systematic code, and provides a specific scheme flow under different parameter configurations. The complete flow is established on the basis of Embodiment 1 to Embodiment 4. Six coding schemes of adaptive network coding based on feedback are given from the two categories of systematic codes and non-systematic codes, which generally improve the decoding performance of the receiving end and make the original data packets more likely to be decoded The code is correct, while reducing the redundancy overhead and improving the throughput and other performance. Compared with the non-systematic code, the systematic code has a shorter time delay, but the associated depth of the encoding is in units of data blocks, that is, the association depth is longer, and the corresponding storage overhead is larger. Conversely, the non-systematic code has a small association depth and a lower storage cost, but since the coding coefficient matrix is not as sparse as the systematic code scheme, the coding and decoding are more complicated and the computational cost is high.

Referring to FIG. 31 , it is a schematic diagram of a communication apparatus according to an embodiment of the present application. The communication apparatus is used to implement each step corresponding to the second communication device or the transmitting end in the above embodiments. As shown in FIG. 31 , the communication apparatus 3100 includes a transceiver unit 3110 and a processing unit 3120 .

The transceiver unit 3110 is configured to send first encoded data to a first communication device; receive indication information from the first communication device; and send second encoded data to the first communication device. The processing unit 3120 is configured to encode the first original data to obtain the first encoded data; obtain second original data and encoding bit rate information according to the indication information, where the second original data includes part or all of the first encoded data. an original data; according to the encoding rate information, jointly encoding the third original data and the second original data to obtain the second encoded data, the third original data does not include the first original data .

In a possible implementation method, the second original data includes one or more first original data packets in the first original data, and the indication information indicates the number of the first original data packets; the processing Unit 3120, configured to acquire the second original data according to the indication information, specifically includes: to acquire the second original data according to the number of the first original data packets.

In a possible implementation method, the second original data includes one or more first original data blocks in the first original data, and the indication information indicates the number of the first original data blocks; the processing The unit 3120, configured to acquire the second original data according to the indication information, specifically includes: to acquire the second original data according to the number of the first original data blocks.

In a possible implementation method, the indication information indicates a rank corresponding to the first encoded data; the second original data includes one or more first original data packets in the first original data; the processing A unit 3120, configured to acquire the second original data according to the indication information, specifically includes: determining the number of the first original data packets according to the rank corresponding to the first encoded data; The number of the first original data packets, and the second original data is obtained.

In a possible implementation method, the indication information indicates a rank corresponding to the first encoded data, and the second original data includes one or more first original data blocks in the first original data; the processing A unit 3120, configured to acquire the second original data according to the indication information, specifically includes: determining the number of the first original data blocks according to the rank corresponding to the first encoded data; The number of first original data blocks, and the second original data is obtained.

In a possible implementation method, the indication information indicates the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data; the second original data includes one of the first original data or a plurality of first original data packets; the processing unit 3120 is configured to acquire the second original data according to the indication information, specifically including: for receiving the system data packets corresponding to the first encoded data and redundancy The number of the first original data packets is determined according to the receiving conditions of the remaining data packets; and the number of the second original data is obtained according to the number of the first original data packets.

In a possible implementation method, the indication information indicates the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data; the second original data includes one of the first original data or a plurality of first original data blocks; the processing unit 3120 is configured to acquire the second original data according to the indication information, specifically including: for receiving the system data packets corresponding to the first encoded data and redundancy The number of the first original data blocks is determined according to the reception situation of the remaining data packets; the number of the first original data blocks is used to obtain the second original data according to the number of the first original data blocks.

In a possible implementation method, the indication information indicates the encoded first association depth; the second original data includes one or more first original data packets in the first original data; the processing unit 3120, Obtaining the second original data according to the indication information specifically includes: determining the number of the first original data packets according to the first association depth; quantity, and obtain the second original data.

In a possible implementation method, the indication information indicates the encoded first associated depth; the second original data includes one or more first original data blocks in the first original data; the processing unit 3120, Obtaining the second original data according to the indication information specifically includes: determining the number of the first original data blocks according to the first association depth; quantity, and obtain the second original data.

In a possible implementation method, the encoding rate information indicates the number of redundant data packets corresponding to the second encoded data, the number of encoded data packets corresponding to the second encoded data, or the second encoding The encoding bit rate corresponding to the data.

In a possible implementation method, the indication information indicates a rank corresponding to the first encoded data; the processing unit 3120 is configured to acquire encoding bit rate information according to the indication information, specifically including: for The rank corresponding to the first encoded data is used to determine the number of redundant data packets corresponding to the second encoded data; the number of redundant data packets corresponding to the second encoded data is used to determine the encoding code rate.

In a possible implementation method, the processing unit 3120, configured to obtain the encoding bit rate information according to the indication information, specifically includes: determining the second encoding according to the rank corresponding to the first encoded data The number of redundant data packets corresponding to the data; used for determining the encoding code rate according to the number of redundant data packets corresponding to the second encoded data.

In a possible implementation method, the indication information indicates the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data; the processing unit 3120 is configured to obtain the encoding according to the indication information The code rate information specifically includes: for determining the number of redundant data packets corresponding to the second encoded data according to the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data; for determining the number of redundant data packets corresponding to the second encoded data; The number of redundant data packets corresponding to the second encoded data determines the encoding rate.

In a possible implementation method, the processing unit 3120, configured to obtain the coding rate information according to the indication information, specifically includes: according to the system data packet reception situation and redundancy corresponding to the first coded data The data packet reception status is used to determine the number of redundant data packets corresponding to the second encoded data; and is used to determine the encoding code rate according to the number of redundant data packets corresponding to the second encoded data.

In a possible implementation method, the indication information indicates one or more of the following:

the number of original data packets corresponding to the third original data;

the number of raw data blocks corresponding to the third raw data; or

Decoding Window Available Window Length or Decoding Window Used Window Length.

In a possible implementation method, the second encoded data includes header information, and the header information indicates the second association depth.

In a possible implementation method, the header information further indicates one or more of the following:

the number of original data packets corresponding to the third original data;

The identifier of the original data block corresponding to the second encoded data; or

coding coefficients corresponding to the second coded data.

Optionally, the above-mentioned communication device may further include a storage unit, which is used to store data or instructions (also referred to as codes or programs), and each of the above-mentioned units may interact or be coupled with the storage unit to implement corresponding methods or functions. . For example, the processing unit 3120 may read data or instructions in the storage unit, so that the communication apparatus implements the methods in the above embodiments.

It should be understood that the division of units in the above communication apparatus is only a division of logical functions, and in actual implementation, it may be integrated into one physical entity in whole or in part, or may be physically separated. And the units in the communication device can all be implemented in the form of software calling through the processing element; also can all be implemented in the form of hardware; some units can also be implemented in the form of software calling through the processing element, and some units can be implemented in the form of hardware. For example, each unit can be a separately established processing element, or can be integrated in a certain chip of the communication device to realize, in addition, it can also be stored in the memory in the form of a program, which can be called and executed by a certain processing element of the communication device. function of the unit. In addition, all or part of these units can be integrated together, and can also be implemented independently. The processing element described here can also become a processor, which can be an integrated circuit with signal processing capability. In the implementation process, each step of the above method or each of the above units may be implemented by an integrated logic circuit of hardware in the processor element or implemented in the form of software being invoked by the processing element.

In one example, a unit in any of the above communication devices may be one or more integrated circuits configured to implement the above method, such as: one or more application specific integrated circuits (ASICs), or, an or multiple microprocessors (digital singnal processors, DSP), or, one or more field programmable gate arrays (FPGA), or a combination of at least two of these integrated circuit forms. For another example, when a unit in the communication device can be implemented in the form of a processing element scheduler, the processing element can be a general-purpose processor, such as a central processing unit (CPU) or other processors that can invoke programs. For another example, these units can be integrated together and implemented in the form of a system-on-a-chip (SOC).

Referring to FIG. 32 , it is a schematic diagram of a communication apparatus according to an embodiment of the present application. The communication apparatus is used to implement each step corresponding to the first communication device or the receiving end in the above embodiments. As shown in FIG. 32 , the communication apparatus 3200 includes a sending unit 3210 and a receiving unit 3220 .

The receiving unit 3220 is configured to receive the first encoded data corresponding to the first original data from the second communication device; receive the corresponding encoded bit rate information, the third original data and the first encoded data of the second original data from the second communication device. Second encoded data, the third original data does not include the first original data. The sending unit 3210 is configured to send indication information to the second communication device, where the indication information is used to obtain the second original data and the coding rate information, and the second original data includes part or all of all Describe the first raw data.

In a possible implementation method, the second original data includes one or more first original data packets in the first original data; the indication information indicates any of the following:

The number of the first original data packets, the rank corresponding to the first encoded data, the reception situation of the system data packets and the redundant data packet reception situation corresponding to the first encoded data, or the first correlation depth of the encoding.

In a possible implementation method, the second original data includes one or more first original data blocks in the first original data; the indication information indicates any of the following:

The number of the first original data blocks, the rank corresponding to the first encoded data, the reception status of system data packets and redundant data packets corresponding to the first encoded data, or the first associated depth of encoding.

the number of original data packets corresponding to the third original data;

the number of raw data blocks corresponding to the third raw data; or

Decoding Window Available Window Length or Decoding Window Used Window Length.

In a possible implementation method, the coding rate information indicates any of the following:

The number of redundant data packets corresponding to the second encoded data, the number of encoded data packets corresponding to the second encoded data, the encoding bit rate corresponding to the second encoded data, or the encoding rate corresponding to the first encoded data. System packet reception and redundant packet reception.

the number of original data packets corresponding to the third original data;

coding coefficients corresponding to the second coded data.

Optionally, the above-mentioned communication device may further include a storage unit, which is used to store data or instructions (also referred to as codes or programs), and each of the above-mentioned units may interact or be coupled with the storage unit to implement corresponding methods or functions. .

It should be understood that the division of units in the above communication apparatus is only a division of logical functions, and in actual implementation, it may be integrated into one physical entity in whole or in part, or may be physically separated. And the units in the communication device can all be implemented in the form of software calling through the processing element; also all can be implemented in the form of hardware; some units can also be implemented in the form of software calling through the processing element, and some units can be implemented in the form of hardware. For example, each unit can be a separately established processing element, or can be integrated in a certain chip of the communication device to realize, in addition, it can also be stored in the memory in the form of a program, which can be called and executed by a certain processing element of the communication device. function of the unit. In addition, all or part of these units can be integrated together, and can also be implemented independently. The processing element described here can also become a processor, which can be an integrated circuit with signal processing capability. In the implementation process, each step of the above method or each of the above units may be implemented by an integrated logic circuit of hardware in the processor element or implemented in the form of software being invoked by the processing element.

In one example, a unit in any of the above communication devices may be one or more integrated circuits configured to implement the above method, such as: one or more ASICs, or, one or more DSPs, or, one or more an FPGA, or a combination of at least two of these integrated circuit forms. For another example, when a unit in the communication device can be implemented in the form of a processing element scheduler, the processing element can be a general-purpose processor, such as a CPU or other processors that can invoke programs. For another example, these units can be integrated together and implemented in the form of SOC.

Referring to FIG. 33 , a schematic diagram of a communication apparatus provided in an embodiment of the present application is used to implement the operations of the first communication device (ie, the receiving end) and the second communication device (ie, the sending end) in the above embodiments. As shown in FIG. 33 , the communication apparatus includes: a processor 3310 and an interface 3330 , and optionally, the communication apparatus further includes a memory 3320 . The interface 3330 is used to enable communication with other devices.

The method performed by the first communication device or the second communication device in the above embodiment may call the program stored in the memory (which may be the memory 3320 in the first communication device or the second communication device, or an external memory) through the processor 3310 to realise. That is, the first communication device or the second communication device may include a processor 3310, and the processor 3310 executes the method performed by the first communication device or the second communication device in the above method embodiments by invoking a program in the memory. The processor here may be an integrated circuit with signal processing capability, such as a CPU. The first communication device or the second communication device may be implemented by one or more integrated circuits configured to implement the above methods. For example: one or more ASICs, or, one or more microprocessor DSPs, or, one or more FPGAs, etc., or a combination of at least two of these integrated circuit forms. Alternatively, the above implementations may be combined.

Specifically, the functions/implementation process of the transceiver unit 3110 and the processing unit 3120 in FIG. 31 can be implemented by the processor 3310 in the communication apparatus 3300 shown in FIG. 33 calling computer executable instructions stored in the memory 3320 . Alternatively, the function/implementation process of the processing unit 3120 in FIG. 31 may be implemented by the processor 3310 in the communication device 3300 shown in FIG. 33 calling the computer-executed instructions stored in the memory 3320, and the function of the transceiver unit 3110 in FIG. 31 The implementation process can be implemented by the interface 3330 in the communication device 3300 shown in FIG. 33 . Exemplarily, the function/implementation process of the transceiver unit 3110 can be implemented by the processor calling program instructions in the memory to drive the interface 3330 .

Specifically, the functions/implementation process of the sending unit 3210 and the receiving unit 3220 in FIG. 32 can be implemented by the processor 3310 in the communication apparatus 3300 shown in FIG. 33 calling computer executable instructions stored in the memory 3320 . Alternatively, the functions/implementation process of the sending unit 3210 and the receiving unit 3220 in FIG. 32 can be implemented through the interface 3330 in the communication device 3300 shown in FIG. 33 . The implementation process can be implemented by the processor calling program instructions in the memory to drive the interface 3330 .

Figure 34 provides a schematic structural diagram of a terminal device. The terminal device is applicable to the scenario shown in FIG. 3 . For convenience of explanation, FIG. 34 shows only the main components of the terminal device. As shown in FIG. 34, the terminal device 3400 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 the software programs. The memory is mainly 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, and keyboards, are mainly used to receive data input by users and output data to users.

When the terminal device is powered on, the processor can read the software program in the storage unit, parse and execute the instructions of the software program, and process the data of the software program. When data needs to be sent wirelessly, the processor performs baseband processing on the data to be sent, and 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, Figure 34 shows only one memory and processor. In an actual terminal device, there may be multiple processors and memories. The memory may also be referred to as a storage medium or a storage device, etc., which is not limited in this embodiment of the present invention.

As an optional implementation manner, 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 processing unit is mainly used to control the entire terminal device, execute A software program that processes data from the software program. The processor in FIG. 34 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 may also be independent processors, interconnected by 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 the 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 can also be expressed as a central processing circuit or a central processing chip. The function of processing the communication protocol and communication data may be built in the processor, or may be 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 control circuit with a transceiving function can be regarded as the transceiving unit 3411 of the terminal device 3400 , and the processor having a processing function can be regarded as the processing unit 3412 of the terminal device 3400 . As shown in FIG. 34 , the terminal device 3400 includes a transceiver unit 3411 and a processing unit 3412 . The transceiving unit may also be referred to as a transceiver, a transceiver, a transceiving device, or the like. Optionally, the device for implementing the receiving function in the transceiver unit 3411 may be regarded as a receiving unit, and the device for implementing the transmitting function in the transceiver unit 3411 may be regarded as a transmitting unit, that is, the transceiver unit 3411 includes a receiving unit and a transmitting unit. Exemplarily, the receiving unit may also be referred to as a receiver, a receiver, a receiving circuit, and the like, and the transmitting unit may be referred to as a transmitter, a transmitter, or a transmitting circuit, or the like. Optionally, the above-mentioned receiving unit and transmitting unit may be an integrated unit, or may be multiple independent units. The above-mentioned receiving unit and transmitting unit may be located in one geographic location, or may be dispersed in multiple geographic locations.

Those of ordinary skill in the art can understand that the first, second, and other numeral numbers involved in the present application are only for the convenience of description, and are not used to limit the scope of the embodiments of the present application, but also represent the sequence. "And/or", which describes the association relationship of the associated objects, means that there can be three kinds of relationships, for example, A and/or B, which can mean that A exists alone, A and B exist at the same time, and B exists alone. The character "/" generally indicates that the associated objects are an "or" relationship. "At least one" means one or more. At least two means two or more. "At least one", "any one", or similar expressions, refers to any combination of these items, including any combination of single item(s) or plural item(s). For example, at least one item (single, species) of a, b, or c can represent: a, b, c, ab, ac, bc, or abc, where a, b, c can be single or multiple. "Plurality" means two or more, and other quantifiers are similar.

It should be understood that, in the various embodiments of the present application, the size of the sequence numbers of the above-mentioned processes does not mean the sequence of execution, and the execution sequence of each process should be determined by its functions and internal logic, and should not be dealt with in the embodiments of the present invention. implementation constitutes any limitation.

Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the above-described systems, devices and units may refer to the corresponding processes in the foregoing method embodiments, which will not be repeated here.

In the above-mentioned embodiments, it may be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented in software, it can 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 program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of the present application are generated. The computer may be a general purpose computer, special purpose computer, computer network, or other programmable device. 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 downloaded from a website site, computer, server, or data center Transmission to another website site, computer, server, or data center is by wire (eg, coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (eg, infrared, wireless, microwave, etc.). The computer-readable storage medium may be any available medium that a computer can access, or a data storage device such as a server, a data center, or the like that includes an integration of one or more available media. The usable media may be magnetic media (eg, floppy disks, hard disks, magnetic tapes), optical media (eg, DVDs), or semiconductor media (eg, solid state disks (SSDs)), and the like.

The various illustrative logic units and circuits described in the embodiments of this application may be implemented by general purpose processors, digital signal processors, application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs) or other programmable logic devices, Discrete gate or transistor logic, discrete hardware components, or any combination of the above are designed to implement or operate the described functions. A general-purpose processor may be a microprocessor, or alternatively, the general-purpose processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented by a combination of computing devices, such as a digital signal processor and a microprocessor, multiple microprocessors, one or more microprocessors in combination with a digital signal processor core, or any other similar configuration. accomplish.

The steps of the method or algorithm described in the embodiments of this application may be directly embedded in hardware, a software unit executed by a processor, or a combination of the two. Software units can be stored in random access memory (Random Access Memory, RAM), flash memory, read-only memory (Read-Only Memory, ROM), EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM or this. In any other form of storage media in the field. Illustratively, a storage medium may be coupled to the processor such that the processor may read information from, and store information in, the storage medium. Optionally, the storage medium can also be integrated into the processor. The processor and storage medium may be provided in the ASIC.

These computer program instructions can also be loaded on a computer or other programmable data processing device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process such that The instructions provide steps for implementing the functions specified in the flow or blocks of the flowcharts and/or the block or blocks of the block diagrams.

In one or more exemplary designs, the above-described functions described herein may be implemented in hardware, software, firmware, or any combination of the three. If implemented in software, the functions may be stored on, or transmitted over, a computer-readable medium in the form of one or more instructions or code. Computer-readable media includes computer storage media and communication media that facilitate the transfer of a computer program from one place to another. Storage media can be any available media that a general-purpose or special-purpose computer can access. For example, such computer-readable media may include, but are not limited to, RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other device that can be used to carry or store instructions or data structures and Other media in the form of program code that can be read by a general-purpose or special-purpose computer, or a general-purpose or special-purpose processor. In addition, any connection is properly defined as a computer-readable medium, for example, if software is transmitted from a website site, server or other remote source over a coaxial cable, fiber optic computer, twisted pair, digital subscriber line (DSL) Or transmitted by wireless means such as infrared, wireless, and microwave are also included in the definition of computer-readable media. The discs and magnetic discs include compact discs, laser discs, optical discs, digital versatile discs (English: Digital Versatile Disc, DVD for short), floppy discs and Blu-ray discs. Disks usually reproduce data magnetically, while Discs usually use lasers to optically reproduce data. Combinations of the above can also be included in computer readable media.

Those skilled in the art should appreciate that, in one or more of the above examples, the functions described in this application may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage medium can be any available medium that can be accessed by a general purpose or special purpose computer.

The specific embodiments described above further describe the purpose, technical solutions and beneficial effects of the present application in detail. It should be understood that the above descriptions are only specific embodiments of the present application, and are not intended to limit the The protection scope, any modifications, equivalent replacements, improvements, etc. made on the basis of the technical solutions of the present application shall be included within the protection scope of the present application. The above description of the specification of this application can enable any skilled in the art to utilize or realize the content of this application, and any modifications based on the disclosed content should be considered obvious in the art, and the basic principles described in this application can be applied to other modifications without departing from the spirit and scope of the invention of the present application. Thus, the present disclosure is not intended to be limited only to the embodiments and designs described, but can be extended to the fullest extent consistent with the principles of this application and the novel features disclosed.

Although the application has been described in conjunction with specific features and embodiments thereof, it will be apparent that various modifications and combinations can be made therein without departing from the spirit and scope of the application. Accordingly, this specification and drawings are merely exemplary illustrations of the application as defined by the appended claims, and are deemed to cover any and all modifications, variations, combinations or equivalents within the scope of this application. Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

A communication method, comprising:

Encoding the first original data to obtain the first encoded data;

sending the first encoded data to a first communication device;

receiving indication information from the first communication device;

Acquire second original data and coding rate information according to the indication information, where the second original data includes part or all of the first original data;

According to the encoding bit rate information, jointly encoding the third original data and the second original data to obtain second encoded data, the third original data does not include the first original data;

The second encoded data is sent to the first communication device.
The method of claim 1, wherein the second original data comprises one or more first original data packets in the first original data, and the indication information indicates the first original data packets quantity;

Acquiring the second raw data according to the indication information includes:

Acquire the second original data according to the number of the first original data packets.
The method of claim 1, wherein the second original data comprises one or more first original data blocks in the first original data, and the indication information indicates the first original data blocks quantity;

Acquiring the second raw data according to the indication information includes:

The second original data is acquired according to the number of the first original data blocks.
The method of claim 1, wherein the indication information indicates a rank corresponding to the first encoded data; the second original data comprises one or more first original data in the first original data data pack;

Acquiring the second raw data according to the indication information includes:

determining the number of the first original data packets according to the rank corresponding to the first encoded data;

Acquire the second original data according to the number of the first original data packets.
The method of claim 1, wherein the indication information indicates a rank corresponding to the first encoded data, and the second original data comprises one or more first original data in the first original data data block;

Acquiring the second raw data according to the indication information includes:

determining the number of the first original data blocks according to the rank corresponding to the first encoded data;

The second original data is acquired according to the number of the first original data blocks.
The method according to claim 1, wherein the indication information indicates the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data; the second original data includes the first encoded data. one or more first raw data packets in the raw data;

Acquiring the second raw data according to the indication information includes:

Determine the number of the first original data packets according to the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data;

Acquire the second original data according to the number of the first original data packets.
The method according to claim 1, wherein the indication information indicates the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data; the second original data includes the first encoded data. one or more first raw data blocks in the raw data;

Acquiring the second raw data according to the indication information includes:

Determine the quantity of the first original data block according to the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data;

The second original data is acquired according to the number of the first original data blocks.
The method of claim 1, wherein the indication information indicates an encoded first associated depth; the second original data comprises one or more first original data packets in the first original data;

Acquiring the second raw data according to the indication information includes:

determining the number of the first original data packets according to the first association depth;

Acquire the second original data according to the number of the first original data packets.
The method of claim 1, wherein the indication information indicates an encoded first associated depth; the second original data comprises one or more first original data blocks in the first original data;

Acquiring the second raw data according to the indication information includes:

determining the number of the first original data blocks according to the first association depth;

The second original data is acquired according to the number of the first original data blocks.
The method according to any one of claims 1-9, wherein the coding rate information indicates the number of redundant data packets corresponding to the second coded data and the coded data packets corresponding to the second coded data The number or the encoding code rate corresponding to the second encoded data.
The method according to any one of claims 1-3 and 6-9, wherein the indication information indicates a rank corresponding to the first encoded data;

Acquiring encoding bit rate information according to the indication information includes:

determining the number of redundant data packets corresponding to the second encoded data according to the rank corresponding to the first encoded data;

The coding rate is determined according to the number of redundant data packets corresponding to the second coded data.
The method according to claim 4 or 5, wherein acquiring the coding rate information according to the indication information comprises:

determining the number of redundant data packets corresponding to the second encoded data according to the rank corresponding to the first encoded data;

The coding rate is determined according to the number of redundant data packets corresponding to the second coded data.
The method according to any one of claims 1-5 and 8-9, wherein the indication information indicates the reception situation of system data packets and the reception situation of redundant data packets corresponding to the first encoded data;

Acquiring encoding bit rate information according to the indication information includes:

Determine the number of redundant data packets corresponding to the second encoded data according to the reception of the system data packets and the redundant data packets corresponding to the first encoded data;

The coding rate is determined according to the number of redundant data packets corresponding to the second coded data.
The method according to claim 6 or 7, wherein acquiring the coding rate information according to the indication information comprises:

Determine the number of redundant data packets corresponding to the second encoded data according to the reception of the system data packets and the redundant data packets corresponding to the first encoded data;

The coding rate is determined according to the number of redundant data packets corresponding to the second coded data.
The method according to any one of claims 1-14, wherein the indication information indicates one or more of the following:

the number of original data packets corresponding to the third original data;

the number of raw data blocks corresponding to the third raw data; or

Decoding Window Available Window Length or Decoding Window Used Window Length.
The method according to any one of claims 1-15, wherein the second encoded data includes header information, and the header information indicates the second association depth.
The method of claim 16, wherein the header information further indicates one or more of the following:

the number of original data packets corresponding to the third original data;

The identifier of the original data block corresponding to the second encoded data; or

coding coefficients corresponding to the second coded data.
A communication method, comprising:

receiving first encoded data corresponding to the first original data from the second communication device;

Sending indication information to the second communication device, where the indication information is used for acquiring second original data and coding rate information, and the second original data includes part or all of the first original data;

Second encoded data corresponding to the encoded bit rate information, third original data and the second original data from the second communication device is received, the third original data does not include the first original data.
The method of claim 18, wherein the second raw data comprises one or more first raw data packets in the first raw data;

The indication information indicates any of the following:

The number of the first original data packets, the rank corresponding to the first encoded data, the reception situation of the system data packets and the redundant data packet reception situation corresponding to the first encoded data, or the first correlation depth of the encoding.
The method of claim 18, wherein the second raw data comprises one or more first raw data blocks in the first raw data;

The indication information indicates any of the following:

The number of the first original data blocks, the rank corresponding to the first encoded data, the reception situation of the system data packet and the redundant data packet corresponding to the first encoded data, or the first correlation depth of encoding.
The method according to any one of claims 18-20, wherein the indication information indicates one or more of the following:

the number of original data packets corresponding to the third original data;

the number of raw data blocks corresponding to the third raw data; or

Decoding Window Available Window Length or Decoding Window Used Window Length.
The method according to any one of claims 18-21, wherein the coding rate information indicates any one of the following:

The number of redundant data packets corresponding to the second encoded data, the number of encoded data packets corresponding to the second encoded data, the encoding bit rate corresponding to the second encoded data, or the encoding rate corresponding to the first encoded data. System packet reception and redundant packet reception.
The method according to any one of claims 18-22, wherein the second encoded data includes header information, and the header information indicates the second association depth.
The method of claim 23, wherein the header information further indicates one or more of the following:

the number of original data packets corresponding to the third original data;

The identifier of the original data block corresponding to the second encoded data; or

coding coefficients corresponding to the second coded data.
A communication device, comprising:

A transceiver unit, used to send the first encoded data to the first communication device; receive instruction information from the first communication device; send the second encoded data to the first communication device;

a processing unit, configured to encode the first original data to obtain the first encoded data; obtain second original data and encoding bit rate information according to the indication information, where the second original data includes part or all of the first encoded data original data; according to the encoding bit rate information, jointly encoding the third original data and the second original data to obtain the second encoded data, the third original data does not include the first original data.
The apparatus of claim 25, wherein the second original data comprises one or more first original data packets in the first original data, and the indication information indicates the first original data packets quantity;

The processing unit, configured to acquire the second original data according to the indication information, specifically includes:

for acquiring the second original data according to the number of the first original data packets.
The apparatus of claim 25, wherein the second original data comprises one or more first original data blocks in the first original data, and the indication information indicates the first original data blocks quantity;

The processing unit, configured to acquire the second original data according to the indication information, specifically includes:

for acquiring the second original data according to the number of the first original data blocks.
The apparatus of claim 25, wherein the indication information indicates a rank corresponding to the first encoded data; the second original data comprises one or more first original data in the first original data data pack;

The processing unit, configured to acquire the second original data according to the indication information, specifically includes:

for determining the number of the first original data packets according to the rank corresponding to the first encoded data;

for acquiring the second original data according to the number of the first original data packets.
The apparatus of claim 25, wherein the indication information indicates a rank corresponding to the first encoded data, and the second original data includes one or more first original data in the first original data data block;

The processing unit, configured to acquire the second original data according to the indication information, specifically includes:

for determining the number of the first original data blocks according to the rank corresponding to the first encoded data;

for acquiring the second original data according to the number of the first original data blocks.
The apparatus according to claim 25, wherein the indication information indicates the reception status of system data packets and the reception status of redundant data packets corresponding to the first encoded data; the second original data includes the first encoded data one or more first raw data packets in the raw data;

The processing unit, configured to acquire the second original data according to the indication information, specifically includes:

for determining the number of the first original data packets according to the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data;

for acquiring the second original data according to the number of the first original data packets.
The apparatus according to claim 25, wherein the indication information indicates the reception status of system data packets and the reception status of redundant data packets corresponding to the first encoded data; the second original data includes the first encoded data one or more first raw data blocks in the raw data;

The processing unit, configured to acquire the second original data according to the indication information, specifically includes:

for determining the number of the first original data blocks according to the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data;

for acquiring the second original data according to the number of the first original data blocks.
The apparatus of claim 25, wherein the indication information indicates a first associated depth of encoding; the second original data comprises one or more first original data packets in the first original data;

The processing unit, configured to acquire the second original data according to the indication information, specifically includes:

for determining the number of the first original data packets according to the first association depth;

for acquiring the second original data according to the number of the first original data packets.
The apparatus of claim 25, wherein the indication information indicates an encoded first associated depth; the second original data comprises one or more first original data blocks in the first original data;

The processing unit, configured to acquire the second original data according to the indication information, specifically includes:

for determining the number of the first original data blocks according to the first association depth;

for acquiring the second original data according to the number of the first original data blocks.
The apparatus according to any one of claims 25-33, wherein the coding rate information indicates the number of redundant data packets corresponding to the second coded data and the coded data packets corresponding to the second coded data The number or the encoding code rate corresponding to the second encoded data.
The apparatus according to any one of claims 25-27 and 30-33, wherein the indication information indicates a rank corresponding to the first encoded data;

The processing unit is configured to obtain the coding rate information according to the indication information, and specifically includes:

for determining the number of redundant data packets corresponding to the second encoded data according to the rank corresponding to the first encoded data;

for determining the coding rate according to the number of redundant data packets corresponding to the second coded data.
The apparatus according to claim 28 or 29, wherein the processing unit, configured to obtain the coding rate information according to the indication information, specifically includes:

for determining the number of redundant data packets corresponding to the second encoded data according to the rank corresponding to the first encoded data;

for determining the coding rate according to the number of redundant data packets corresponding to the second coded data.
The apparatus according to any one of claims 25-29 and 32-33, wherein the indication information indicates the system data packet reception situation and the redundant data packet reception situation corresponding to the first encoded data;

The processing unit, configured to obtain the coding rate information according to the indication information, specifically includes:

for determining the number of redundant data packets corresponding to the second encoded data according to the reception situation of the system data packets corresponding to the first encoded data and the redundant data packet reception situation;

It is used to determine the coding rate according to the number of redundant data packets corresponding to the second coded data.
The apparatus according to claim 30 or 31, wherein the processing unit, configured to obtain the coding rate information according to the indication information, specifically includes:

for determining the number of redundant data packets corresponding to the second encoded data according to the reception situation of the system data packets corresponding to the first encoded data and the redundant data packet reception situation;

It is used to determine the coding rate according to the number of redundant data packets corresponding to the second coded data.
The apparatus according to any one of claims 25-38, wherein the indication information indicates one or more of the following:

the number of original data packets corresponding to the third original data;

the number of raw data blocks corresponding to the third raw data; or

Decoding Window Available Window Length or Decoding Window Used Window Length.
The apparatus according to any one of claims 25-39, wherein the second encoded data includes header information, and the header information indicates the second association depth.
The apparatus of claim 40, wherein the header information further indicates one or more of the following:

the number of original data packets corresponding to the third original data;

The identifier of the original data block corresponding to the second encoded data; or

coding coefficients corresponding to the second coded data.
A communication device, comprising:

a receiving unit, configured to receive the first encoded data corresponding to the first original data from the second communication device; receive the corresponding encoded bit rate information, the third original data and the second original data from the second communication device encoded data, the third original data does not include the first original data;

a sending unit, configured to send indication information to the second communication device, where the indication information is used for acquiring the second original data and the coding rate information, and the second original data includes part or all of the first raw data.
The apparatus of claim 42, wherein the second raw data comprises one or more first raw data packets of the first raw data;

The indication information indicates any of the following:

The number of the first original data packets, the rank corresponding to the first encoded data, the reception status of the system data packets and the redundant data packet reception status corresponding to the first encoded data, or the encoded first correlation depth.
The apparatus of claim 42, wherein the second raw data comprises one or more first raw data blocks in the first raw data;

The indication information indicates any of the following:

The number of the first original data blocks, the rank corresponding to the first encoded data, the reception situation of the system data packet and the redundant data packet corresponding to the first encoded data, or the first correlation depth of encoding.
The apparatus according to any one of claims 42-44, wherein the indication information indicates one or more of the following:

the number of original data packets corresponding to the third original data;

the number of raw data blocks corresponding to the third raw data; or

Decoding Window Available Window Length or Decoding Window Used Window Length.
The apparatus according to any one of claims 42-45, wherein the coding rate information indicates any one of the following:

The number of redundant data packets corresponding to the second encoded data, the number of encoded data packets corresponding to the second encoded data, the encoding bit rate corresponding to the second encoded data, or the encoding rate corresponding to the first encoded data. System packet reception and redundant packet reception.
The apparatus of any one of claims 42-46, wherein the second encoded data includes header information, the header information indicating the second association depth.
48. The apparatus of claim 47, wherein the header information further indicates one or more of the following:

the number of original data packets corresponding to the third original data;

The identifier of the original data block corresponding to the second encoded data; or

coding coefficients corresponding to the second coded data.
A communication device, characterized in that it comprises: a processor coupled with a memory, the memory is used to store a program or an instruction, when the program or instruction is executed by the processor, the device causes the device A method as claimed in any one of claims 1 to 17 is performed.
A communication device, characterized in that it comprises: a processor coupled with a memory, the memory is used to store a program or an instruction, when the program or instruction is executed by the processor, the device causes the device A method as claimed in any one of claims 18 to 24 is performed.
A chip system, comprising: the chip system includes at least one processor, and an interface circuit, wherein the interface circuit is coupled with the at least one processor, and the processor executes the claims by running instructions The method of any one of 1-17.
A chip system, comprising: the chip system includes at least one processor, and an interface circuit, wherein the interface circuit is coupled with the at least one processor, and the processor executes the claims by running instructions The method of any one of 18-24.
A communication device, characterized by being used for executing the method of any one of claims 1-17.
A communication device, characterized in that it is used for executing the method of any one of claims 18-24.
A computer program product comprising instructions, which, when run on a computer, causes the computer to perform the method of any one of the preceding claims 1-24.
A computer-readable storage medium, characterized by comprising instructions that, when executed on a computer, cause the computer to perform the method of any one of claims 1-24.
A communication system, characterized by comprising the device according to any one of claims 25-41 and the device according to any one of claims 42-48.