WO2021208674A1 - 一种数据处理方法、装置及设备 - Google Patents

一种数据处理方法、装置及设备 Download PDF

Info

Publication number
WO2021208674A1
WO2021208674A1 PCT/CN2021/082192 CN2021082192W WO2021208674A1 WO 2021208674 A1 WO2021208674 A1 WO 2021208674A1 CN 2021082192 W CN2021082192 W CN 2021082192W WO 2021208674 A1 WO2021208674 A1 WO 2021208674A1
Authority
WO
WIPO (PCT)
Prior art keywords
blocks
block
information bit
coded
coding
Prior art date
Application number
PCT/CN2021/082192
Other languages
English (en)
French (fr)
Inventor
李斌
顾佳琦
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2021208674A1 publication Critical patent/WO2021208674A1/zh
Priority to US18/046,255 priority Critical patent/US11936476B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1893—Physical mapping arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607—Details of the supervisory signal
    • H04L1/1621—Group acknowledgement, i.e. the acknowledgement message defining a range of identifiers, e.g. of sequence numbers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044—Arrangements for allocating sub-channels of the transmission path allocation of payload
    • H04L5/0046—Determination of how many bits are transmitted on different sub-channels

Definitions

  • This application relates to the field of communication technology, and in particular to a data processing method, device and equipment.
  • Hybrid automatic repeat request (HARQ) technology is a technology that combines forward error correction (FEC) and automatic repeat request (ARQ).
  • FEC forward error correction
  • ARQ automatic repeat request
  • the working principle of traditional HARQ is: when the receiving end cannot decode the received information correctly, the receiving end will retain the received data and request the sending end to resend the previously transmitted information. After receiving the retransmitted information, the receiving end combines the retransmitted information with the previously received information before decoding. It can be seen that for the receiving end to correctly decode all the bits sent by the transmitting end, multiple retransmissions may be required. However, the transmission efficiency of traditional HARQ is low when multiple retransmissions are performed.
  • the embodiments of the present application provide a data processing method, device, and equipment.
  • the data processing method enables transmission close to the channel capacity as long as the condition that the sum of the channel capacity of multiple transmissions is greater than or equal to the information transmission rate is met.
  • an embodiment of the present application provides a data processing method, which may be executed by a first communication device.
  • the first communication device may be the sender of the encoded data.
  • the first communication device may obtain X information bit blocks, where one information bit block includes K information bits, and one information bit block is divided into Q information bit sub-blocks. Among them, one information bit sub-block is a binary sequence with a length of K/Q.
  • the first communication device places the Q information bit sub-blocks of each information bit block in the Q first to-be-coded blocks in the M first to-be-coded blocks in a first order.
  • the first communication device performs polar code encoding on the M first to-be-encoded blocks respectively, obtains M first encoding blocks, and sends the M first encoding blocks to the second communication device.
  • the first communication device When retransmission is required, the first communication device places the Q information bit sub-blocks of each information bit block in the Q second blocks to be coded among the M second blocks to be coded in the second order. Meet the mapping relationship with the first order.
  • the first communication device performs polar code encoding on the M second to-be-encoded blocks respectively, obtains M second encoding blocks, and sends the M second encoding blocks to the second communication device.
  • the first communication device when the first communication device initially transmits M first coding blocks to the second communication device, the multiple information bit sub-blocks in the M first coding blocks are arranged in the first order, which is beneficial for the second communication device to decode correctly . If the decoding by the second communication device fails, the first communication device may retransmit M second coding blocks to the second communication device, the multiple information bit sub-blocks in the M second coding blocks are arranged in the second order, and the first communication device The second order satisfies the mapping relationship with the first order, which facilitates the correct decoding of the second communication device according to the first coding block and the second coding block. As long as the condition that the sum of the channel capacity of multiple transmissions is greater than or equal to the information transmission rate is satisfied, the first communication device can realize transmission close to the channel capacity.
  • the second order is that the qth information bit sub-block of each information bit block is located in the (Qq)*K/Q+1 to (Q-q+)th block of the second to-be-coded block. 1) *K/Q reliable location. It can be seen that, for the information bit sub-blocks in each information bit block, the second order is the reverse order of the first order.
  • the information bit sub-blocks in the second block to be coded are arranged in the second order, which facilitates correct decoding by the second communication device.
  • the first order and the second order satisfy the following mapping relationship:
  • a q is any arbitrary Q information bit sub-block information bit blocks in one information bit sub-blocks
  • F is the polar code generation Matrix
  • P is a positive integer and satisfies 2 P-1 ⁇ Q ⁇ 2 P
  • t satisfies 1 ⁇ t ⁇ 2 P.
  • the second order is obtained by mapping in the first order according to the mapping relationship.
  • the mapping relationship may be obtained by mapping according to the generator matrix of the polar code in the first order, which is beneficial to the correct decoding by the second communication device.
  • the first communication device places the Q information bit sub-blocks of each information bit block in the Q third of the M third blocks to be coded in the second order.
  • the second order adopted by the third block to be coded is different from the second order adopted by the second block to be coded.
  • the first communication device performs polar code encoding on the M third to-be-encoded blocks respectively, obtains M third encoding blocks, and sends the M third encoding blocks to the second communication device.
  • the multiple information bit sub-blocks in the M third coding blocks can also be arranged in the second order, which is beneficial to the second communication device according to the first coding block.
  • the second coding block and the third coding block are correctly decoded.
  • the first communication device maps the Q information bit sub-blocks of each information bit block from the binary domain to the 2w base domain, and obtains any information bit after the mapping.
  • the first communication device converts the Q information bit sub-blocks of each mapped information bit block, wherein the Q information bit sub-blocks of any mapped information bit block and the corresponding Q information bit sub-blocks after conversion are The following relationships are satisfied between the blocks:
  • H n is the universal decoding matrix UDM of K/w ⁇ K/w in the 2 w system domain, n is used to indicate the nth transmission; n satisfies n ⁇ [1,2 ,...,N], N is the total number of transmissions by the first communication device, and N is a positive integer greater than 3;
  • the first communication device will Perform de-mapping to obtain The corresponding information bit block after de-mapping is [A n,1 ,A n,2 ,...,A n,Q ]; where A n,Q is a binary sequence of length K/Q;
  • the first communication device places the Q information bit sub-blocks of any information bit block after de-mapping into the M n-th to-be-coded blocks in the first order.
  • the first communication device performs polar code encoding on the M n-th to-be-encoded blocks respectively, obtains M n-th encoding blocks, and sends M n-th encoding blocks to the second communication device.
  • the first communication device needs to transfer multiple information bits in the M n-th block to be coded.
  • the blocks are processed accordingly, and then M blocks to be coded are coded.
  • any code block carries at least one information bit sub-block and at most Q information bit sub-blocks; wherein, the code block includes a first code block and a second code block.
  • each code block is arranged in sequence according to the identifier of the code block, where the first code block carries a sub-block of information bits; the number of information bit blocks carried by the first to Qth code blocks According to the sequence of coding blocks, one is added in sequence, and the Q-th coding block carries Q sub-blocks of information bits.
  • the number of sub-blocks carrying information bits from the Q+1 encoding block to the M-th encoding block is sequentially reduced by one according to the sequence of the encoding blocks; the M-th encoding block carries one information bit sub-block.
  • Q is the quantization order of the code rate R, and Q is a positive integer.
  • an embodiment of the present application provides a data processing method, which may be executed by a second communication device.
  • the second communication device may be the receiving end of the encoded data.
  • the second communication device receives the M first coding blocks initially transmitted by the first communication device, where the M first coding blocks are obtained by performing polar code coding on the M first to-be-coded blocks.
  • the M first to-be-coded blocks carry X information bit blocks, and each information bit block is divided into Q information bit sub-blocks.
  • the Q information bit sub-blocks of each information bit block are placed in the Q first to be coded blocks among the M first to be coded blocks in a first order.
  • the second communication device again receives the M second coding blocks retransmitted by the first communication device, where the M second coding blocks are obtained by performing polar code coding on the M second to-be-coded blocks.
  • the Q information bit sub-blocks of each information bit block are placed in the Q second to-be-coded blocks of the M second to-be-coded blocks in a second order, and the second order and the first order satisfy the mapping relationship.
  • the second communication device may combine and decode the M first code blocks and M second code blocks to obtain decoded data.
  • the second communication device when the second communication device receives the M first coding blocks initially transmitted by the first communication device, the multiple information bit sub-blocks in the M first coding blocks are arranged in the first order, which is beneficial to the correct interpretation by the second communication device. code. If the decoding by the second communication device fails, the second communication device can receive M second coding blocks retransmitted by the first communication device, and the multiple information bit sub-blocks in the M second coding blocks are arranged in the second order, and The second order satisfies the mapping relationship with the first order, which facilitates the correct decoding of the second communication device according to the first coding block and the second coding block.
  • the second order is that the qth information bit sub-block of each information bit block is located in the (Qq)*K/Q+1 to (Q-q+)th block of the second to-be-coded block. 1) *K/Q reliable location.
  • the first order and the second order satisfy the following mapping relationship:
  • a q is any arbitrary Q information bit sub-block information bit blocks in one information bit sub-blocks
  • F is the polar code generation Matrix
  • P is a positive integer and satisfies 2 P-1 ⁇ Q ⁇ 2 P
  • t satisfies 1 ⁇ t ⁇ 2 P.
  • the second communication device combines and decodes M first code blocks and M second code blocks to obtain decoded data, including:
  • the second communication device decodes to obtain k 1 information bit sub-blocks included in an information bit block carried by the first block to be coded k 1 satisfies 1 ⁇ k 1 ⁇ Q;
  • the second communication device decodes and obtains k 2 information bit sub-blocks included in the information bit block carried by the second block to be coded k 2 satisfies 1 ⁇ k 2 ⁇ Q, k 1 +k 2 ⁇ Q;
  • the Q information bit sub-blocks included in the information bit block acquired by the second communication device are [a 1 , a 2 ,..., a Q ].
  • the second communication device receives M third coding blocks retransmitted by the first communication device, and the M third coding blocks are M third to-be-coded Blocks are obtained by polar code encoding.
  • the Q information bit sub-blocks of each information bit block are placed in Q third to-be-coded blocks in the M third to-be-coded blocks in the second order.
  • the second order adopted by the third block to be coded is different from the second order adopted by the second block to be coded.
  • the second communication device decodes to obtain the first to-be-coded block bearer K 1 information bit sub-blocks included in one information bit block And k 2 information bit sub-blocks included in the information bit block carried by the second block to be coded Among them, k 1 and k 2 satisfy k 1 +k 2 ⁇ Q;
  • the second communication device decodes and obtains k 3 information bit sub-blocks included in the information bit block carried by the third block to be coded k 3 satisfies 1 ⁇ k 3 ⁇ Q, and k 1 , k 2 and k 3 satisfies k 1 +k 2 +k 3 ⁇ Q;
  • the second communication device obtains the corresponding k 3 information bit sub-blocks before the mapping of the k 3 information bit sub-blocks as Then, the second communication device may obtain the Q information bit sub-blocks included in the information bit block as [a 1 , a 2 ,..., a Q ].
  • the second communication device fails to decode, the second communication device receives M n-th code blocks retransmitted by the first communication device, and the M n-th code blocks are M n-th to-be-coded Blocks are obtained by polar code encoding.
  • the Q information bit sub-blocks of each processed information bit block are placed in Q of the n-th to-be-coded blocks in the first order.
  • the second communication device combines and decodes the M first coded blocks up to the M nth coded blocks to obtain decoded data. Wherein, the processing of each information bit block satisfies the following conditions:
  • the Q information bit sub-blocks of each information bit block are mapped from the binary domain to the 2 w binary domain, and any information bit block after mapping satisfies in, Is any information bit sub-block in any information bit block after mapping, Is a 2 w base sequence of length K/wQ, where w is a positive integer greater than 1;
  • H n is the universal decoding matrix UDM of K/w ⁇ K/w in the 2 w system domain, n is used to indicate the nth transmission; n satisfies n ⁇ [1,2 ,...,N], N is the total number of transmissions by the first communication device, and N is a positive integer greater than 3;
  • the corresponding information bit block satisfies [A n,1 ,A n,2 ,...,A n,Q ]; where A n,Q is a binary sequence of length K/Q.
  • the second communication device can receive the coded block retransmitted multiple times by the first communication device. And when the number of transmissions of the first communication device exceeds three times, since three or more retransmissions are performed in the multi-ary domain, the first communication device needs to transfer multiple information bit sub-blocks in the M n-th block to be coded. Perform corresponding processing, and then encode the M n-th to-be-encoded blocks.
  • any code block carries at least one information bit sub-block and at most Q information bit sub-blocks; wherein, the code block includes a first code block and a second code block.
  • each code block is arranged in sequence according to the identifier of the code block, where the first code block carries a sub-block of information bits; the number of information bit blocks carried by the first to Qth code blocks According to the order of the coding blocks, one is added in turn.
  • the Q-th coding block carries Q information bit sub-blocks; the number of Q+1-th coding blocks to the M-th coding block carries information bit sub-blocks according to the order of the coding blocks , Decrease by one in turn; the M-th coded block carries a sub-block of information bits.
  • Q is the quantization order of the code rate R, and Q is a positive integer.
  • an embodiment of the present application provides a communication device, which includes a transceiver and a processor;
  • the transceiver is used to obtain X information bit blocks, and one information bit block includes K information bits.
  • One information bit block is divided into Q information bit sub-blocks, and one information bit sub-block is a binary sequence with a length of K/Q.
  • the processor is configured to place the Q information bit sub-blocks of each information bit block in the Q first to-be-coded blocks in the M first to-be-coded blocks in a first order.
  • the processor is further configured to perform polar code encoding on the M first to-be-encoded blocks, respectively, to obtain M first encoding blocks.
  • the transceiver is also used to send M first coding blocks to the second communication device.
  • the processor is further configured to place the Q information bit sub-blocks of each information bit block in the Q second to-be-coded blocks of the M second to-be-coded blocks in the second order, and the second The order and the first order satisfy the mapping relationship.
  • the processor is further configured to perform polar code encoding on the M second to-be-encoded blocks, respectively, to obtain M second encoding blocks.
  • the transceiver is also used to send M second coding blocks to the second communication device.
  • the second order is that the qth information bit sub-block of each information bit block is located in the (Qq)*K/Q+1 to (Q-q+)th block of the second to-be-coded block. 1) *K/Q reliable location.
  • the first order and the second order satisfy the following mapping relationship:
  • a q is any arbitrary Q information bit sub-block information bit blocks in one information bit sub-blocks
  • F is the polar code generation Matrix
  • P is a positive integer and satisfies 2 P-1 ⁇ Q ⁇ 2 P
  • t satisfies 1 ⁇ t ⁇ 2 P.
  • the processor is also used to:
  • the Q information bit sub-blocks of each information bit block are placed in the Q third to be coded blocks among the M third to be coded blocks in the second order;
  • the second order is different from the second order adopted by the second block to be coded;
  • the transceiver is also used to send M third coding blocks to the second communication device.
  • the processor is also used to:
  • the Q information bit sub-blocks of each information bit block are mapped from the binary domain to the 2 w binary domain, and any information bit block after mapping is obtained as in, Is any information bit sub-block in any information bit block after mapping, Is a sequence of length K/wQ, w is a positive integer greater than 1;
  • the Q information bit sub-blocks of each mapped information bit block are converted, wherein the Q information bit sub-blocks of any mapped information bit block and the corresponding Q information bit sub-blocks after conversion satisfy the requirement.
  • H n is the universal decoding matrix UDM of K/w ⁇ K/w in the 2 w system domain, n is used to indicate the nth transmission, and n satisfies n ⁇ [1,2 ,...,N], N is the total number of transmissions by the first communication device, and N is a positive integer greater than 3;
  • the corresponding information bit block after de-mapping is [A n,1 ,A n,2 ,...,A n,Q ]; where A n,Q is a binary sequence of length K/Q;
  • the Q information bit sub-blocks of any information bit block after de-mapping are placed in M n-th to-be-coded blocks in the first order; n satisfies 3 ⁇ n ⁇ N, and N is a positive integer greater than 3.
  • the transceiver is also used to send M n-th code blocks to the second communication device.
  • any code block carries at least one information bit sub-block and at most Q information bit sub-blocks; wherein, the code block includes a first code block and a second code block.
  • each code block is arranged in sequence according to the identifier of the code block, where the first code block carries a sub-block of information bits; the number of information bit blocks carried by the first to Qth code blocks According to the sequence of coding blocks, one is added in sequence, and the Q-th coding block carries Q sub-blocks of information bits.
  • the number of sub-blocks carrying information bits from the Q+1 encoding block to the M-th encoding block is sequentially reduced by one according to the sequence of the encoding blocks; the M-th encoding block carries one information bit sub-block.
  • Q is the quantization order of the code rate R, and Q is a positive integer.
  • an embodiment of the present application provides a communication device, which includes a transceiver and a processor;
  • the transceiver is configured to receive M first coding blocks initially transmitted by the first communication device, where the M first coding blocks are obtained by performing polar code coding on the M first to-be-coded blocks.
  • the M first to-be-coded blocks carry X information bit blocks, and each information bit block is divided into Q information bit sub-blocks.
  • the Q information bit sub-blocks of each information bit block are placed in the Q first to be coded blocks among the M first to be coded blocks in a first order.
  • the transceiver is also configured to receive M second coding blocks retransmitted by the first communication device, where the M second coding blocks are obtained by polar code coding of the M second to-be-coded blocks.
  • the Q information bit sub-blocks of each information bit block are placed in the Q second to-be-coded blocks of the M second to-be-coded blocks in a second order, and the second order and the first order satisfy the mapping relationship.
  • the processor is used to combine and decode the M first coded blocks and M second coded blocks to obtain decoded data.
  • the second order is that the qth information bit sub-block of each information bit block is located in the (Qq)*K/Q+1 to (Q-q+)th block of the second to-be-coded block. 1) *K/Q reliable location.
  • the first order and the second order satisfy the following mapping relationship:
  • a q is any arbitrary Q information bit sub-block information bit blocks in one information bit sub-blocks
  • F is the polar code generation Matrix
  • P is a positive integer and satisfies 2 P-1 ⁇ Q ⁇ 2 P
  • t satisfies 1 ⁇ t ⁇ 2 P.
  • the processor is used to combine and decode M first code blocks and M second code blocks to obtain decoded data, which is specifically used for:
  • Decoding to obtain k 2 information bit sub-blocks included in the information bit block carried by the second block to be coded k 2 satisfies 1 ⁇ k 2 ⁇ Q, k 1 +k 2 ⁇ Q;
  • the Q information bit sub-blocks included in the acquired information bit block are [a 1 , a 2 ,..., a Q ].
  • the transceiver is further configured to receive M third coding blocks retransmitted by the first communication device, where the M third coding blocks are obtained by polar code coding of the M third to-be-coded blocks.
  • the Q information bit sub-blocks of each information bit block are placed in Q third to-be-coded blocks in the M third to-be-coded blocks in the second order.
  • the second order adopted by the third block to be coded is different from the second order adopted by the second block to be coded.
  • the processor is further configured to:
  • the k 3 information bit sub-blocks corresponding to the k 3 information bit sub-blocks before mapping are obtained as
  • the Q information bit sub-blocks included in the acquired information bit block are [a 1 , a 2 ,..., a Q ].
  • the transceiver is further configured to receive M n-th coding blocks retransmitted by the first communication device, where the M n-th coding blocks are obtained by polar code coding of M n-th to-be-coded blocks.
  • the Q information bit sub-blocks of each processed information bit block are placed in the Q n-th to-be-coded blocks in the M n-th to-be-coded blocks in the first order.
  • the processor is also used to combine and decode the M first coded blocks up to the M nth coded block to obtain decoded data.
  • each information bit block satisfies the following conditions:
  • the Q information bit sub-blocks of each information bit block are mapped from the binary domain to the 2 w binary domain, and any information bit block after mapping satisfies in, Is any information bit sub-block in any information bit block after mapping, It is a 2 w base sequence of length K/wQ, and w is a positive integer greater than 1.
  • any information bit block after mapping and the corresponding information bit block after conversion satisfy the following relationship:
  • H n is the universal decoding matrix UDM of K/w ⁇ K/w in the 2 w hexadecimal domain, and n is used to indicate the nth transmission.
  • n satisfies n ⁇ [1,2,...,N], N is the total number of transmissions by the first communication device, and N is a positive integer greater than 3.
  • the corresponding information bit block satisfies [A n,1 ,A n,2 ,...,A n,Q ]; where A n,Q is a binary sequence of length K/Q.
  • any code block carries at least one information bit sub-block and at most Q information bit sub-blocks; wherein, the code block includes a first code block and a second code block.
  • each code block is arranged in sequence according to the identifier of the code block, where the first code block carries a sub-block of information bits; the number of information bit blocks carried by the first to Qth code blocks According to the order of the coding blocks, one is added in turn, the Q-th coding block carries Q information bit sub-blocks; the number of Q+1 to M-th coding blocks carrying information bit sub-blocks is in sequence according to the order of the coding blocks Reduce by one; the M-th coded block carries a sub-block of information bits.
  • Q is the quantization order of the code rate R, and Q is a positive integer.
  • an embodiment of the present application provides a communication device that has a function of implementing the data processing method provided in the first aspect.
  • This function can be realized by hardware, or by hardware executing corresponding software.
  • the hardware or software includes one or more modules corresponding to the above-mentioned functions.
  • an embodiment of the present application provides a communication device that has the function of implementing the data processing method provided in the second aspect.
  • This function can be realized by hardware, or by hardware executing corresponding software.
  • the hardware or software includes one or more modules corresponding to the above-mentioned functions.
  • an embodiment of the present application provides a communication system, which includes the communication device provided in the second or fifth aspect and the communication device provided in the third or sixth aspect.
  • an embodiment of the present application provides a computer-readable storage medium.
  • the readable storage medium includes a program or instruction.
  • the program or instruction runs on a computer, the computer executes the first aspect or the first aspect. Any one of the possible implementation methods.
  • an embodiment of the present application provides a computer-readable storage medium, which includes a program or instruction.
  • the program or instruction runs on a computer, the computer executes the second aspect or the second aspect. Any one of the possible implementation methods.
  • an embodiment of the present application provides a chip or a chip system.
  • the chip or chip system includes at least one processor and an interface.
  • the interface and the at least one processor are interconnected by wires, and the at least one processor is used to run computer programs or instructions, To perform the method described in the first aspect or any one of the possible implementation manners of the first aspect.
  • an embodiment of the present application provides a chip or chip system.
  • the chip or chip system includes at least one processor and an interface.
  • the interface and the at least one processor are interconnected through a wire, and the at least one processor is used to run computer programs or instructions.
  • the interface in the chip can be an input/output interface, a pin, or a circuit.
  • the chip system in the above aspect may be a system on chip (SOC), or a baseband chip, etc., where the baseband chip may include a processor, a channel encoder, a digital signal processor, a modem, and an interface module.
  • SOC system on chip
  • baseband chip may include a processor, a channel encoder, a digital signal processor, a modem, and an interface module.
  • the chip or chip system described above in this application further includes at least one memory, and instructions are stored in the at least one memory.
  • the memory may be a storage unit inside the chip, for example, a register, a cache, etc., or a storage unit of the chip (for example, a read-only memory, a random access memory, etc.).
  • the embodiments of the present application provide a computer program or computer program product, including code or instructions.
  • the code or instructions run on a computer, the computer can execute the first aspect or any one of the first aspects. The method in the way.
  • the embodiments of the present application provide a computer program or computer program product, including code or instructions.
  • the code or instructions When the code or instructions are run on a computer, the computer can execute the second aspect or any one of the possible implementations of the second aspect. The method in the way.
  • Figure 1 is a schematic diagram of an 8 ⁇ 8 polar code encoding
  • FIG. 2 is a schematic diagram of a communication system provided by an embodiment of this application.
  • FIG. 3 is a schematic flowchart of a data processing method provided by an embodiment of this application.
  • 4a and 4b are schematic diagrams of a relationship between an information bit block and an information bit sub-block provided by an embodiment of this application;
  • 5a to 5e are schematic diagrams of the first to-be-coded block under different code rate quantization steps provided by embodiments of this application;
  • FIG. 6 is a schematic diagram of an arrangement of information bit sub-blocks in a block to be coded according to an embodiment of the application
  • FIGS. 7a to 7d are schematic diagrams of the first coding block under different quantization steps of the code rate provided by the embodiments of the application;
  • FIG. 8a is a schematic diagram of a first block to be coded and a second block to be coded according to an embodiment of this application;
  • FIG. 8b is a schematic diagram of another first block to be coded and a second block to be coded according to an embodiment of this application;
  • FIG. 8c is a schematic diagram of a first coding block and a second coding block provided by an embodiment of this application;
  • FIG. 9 is a schematic diagram of a region where two transmissions can be successfully decoded and a code rate loss region provided by an embodiment of the application;
  • FIG. 10 is a schematic flowchart of another data processing method provided by an embodiment of this application.
  • FIG. 11a is a schematic diagram of a block to be coded in three transmissions according to an embodiment of the application.
  • FIG. 11b is a schematic diagram of another block to be coded during three-time transmission according to an embodiment of this application.
  • 12a to 12c are schematic diagrams of coding blocks in three transmissions under different quantization steps of bit rates provided by an embodiment of the application;
  • FIG. 13 is a schematic flowchart of another data processing method provided by an embodiment of the application.
  • FIG. 14 is a schematic diagram of a coding block for four transmissions according to an embodiment of this application.
  • 15 is a schematic structural diagram of a communication device provided by an embodiment of this application.
  • FIG. 16 is a schematic structural diagram of another communication device provided by an embodiment of this application.
  • FIG. 17 is a schematic structural diagram of another communication device provided by an embodiment of this application.
  • FIG. 18 is a schematic structural diagram of another communication device provided by an embodiment of this application.
  • Polar code is a channel coding scheme that can be strictly proven to achieve channel capacity. Polar code has the characteristics of high performance, low complexity, and flexible matching methods. Currently polar code has been determined as a fifth generation mobile communication (the 5 th generation, 5G) channel enhancement mobile broadband (enhanced mobile broadband, eMBB) scene uplink and / or downlink channel coding scheme.
  • 5G fifth generation mobile communication
  • eMBB enhanced mobile broadband
  • FIG. 1 is a schematic diagram of an 8 ⁇ 8 polar code encoding, in which the bits to be encoded are sorted according to their respective reliability, and are arranged in different positions in the block to be encoded.
  • bits with higher reliability are set as information bits (data)
  • bits with lower reliability are set as fixed bits (frozen).
  • the value of the fixed bit is usually set to 0, which is known to both the sending end and the receiving end in actual transmission.
  • u 7 , u 6 , u 5 , u 3 are the first four bits of reliability, which are respectively set as information bits;
  • u 4 , u 2 , u 1 , u 0 are the lower reliability bits Four bits are set as fixed bits respectively.
  • FIG. 2 is a communication system provided by an embodiment of the application, and the communication system includes a first communication device and a second communication device.
  • the first communication device is a sender of encoded data, and is used to send downlink data to the second communication device or receive uplink data from the second communication device.
  • the first communication device may perform polar code encoding on the information bits to be encoded, and the channel-encoded data can be sent to the second communication device through the downlink data channel after being modulated by the constellation.
  • the second communication device is a receiving end of the encoded data, and is used to send uplink data to the first communication device or receive downlink data from the first communication device. For example, when the second communication device sends uplink data to the first communication device, it can perform polar code encoding on the information bits to be encoded, and the channel-encoded data can be sent to the first communication device through the uplink data channel after being modulated by the constellation.
  • the first communication device may be any device with a wireless transceiving function, which provides wireless communication services for the second communication device in the coverage area.
  • the access network equipment may include, but is not limited to: an evolved base station (NodeB or eNB or e-NodeB, evolutional NodeB) in a long term evolution (LTE) system, and a new generation of radio access technology (new radio access technology, NR) in the base station (gNodeB or gNB) or the transmission receiving point/transmission reception point (TRP), the base station of the subsequent evolution of 3GPP, the access node in the WiFi system, the wireless relay node, the wireless backhaul node, the vehicle Equipment that undertakes base station functions in networking, D2D communication, and machine communication, satellites, etc.
  • NodeB or eNB or e-NodeB, evolutional NodeB in a long term evolution (LTE) system
  • NR new generation of radio access technology
  • gNodeB or gNB base station
  • TRP transmission
  • the second communication device may be a terminal device with a wireless transceiving function, or the second communication device may also be a chip.
  • the terminal device may be a user equipment (UE), a mobile phone (mobile phone), a tablet computer (Pad), a computer with a wireless transceiver function, a virtual reality (VR) terminal device, an augmented reality (augmented reality) , AR) terminal equipment, in-vehicle terminal equipment, wireless terminal in remote medical, wireless terminal in smart grid, wearable terminal equipment, etc.
  • Hybrid automatic repeat request (HARQ) technology is a technology that combines forward error correction (FEC) and automatic repeat request (ARQ).
  • FEC forward error correction
  • ARQ automatic repeat request
  • the working principle of traditional HARQ is: when the receiving end cannot decode the received information correctly, the receiving end will retain the received data and request the sending end to resend the previously transmitted information. After receiving the retransmitted information, the receiving end combines the retransmitted information with the previously received information before decoding.
  • an embodiment of the present application provides a data processing method, and the data processing method may be executed by a first communication device. As long as the condition that the sum of the channel capacity of multiple transmissions is greater than or equal to the information transmission rate is satisfied, the first communication device can achieve transmission close to the channel capacity.
  • the embodiment of the present application provides a data processing method, please refer to FIG. 3.
  • the data processing method can be executed interactively by the first communication device and the second communication device, and includes the following steps:
  • the first communication device obtains X information bit blocks, and one information bit block is divided into Q information bit sub-blocks.
  • the first communication device places the Q information bit sub-blocks of each information bit block in the Q first to be coded blocks in the M first to be coded blocks in a first order.
  • the first communication device may divide the multiple information bits to be encoded into different information bit blocks.
  • one information bit block includes multiple information bits.
  • the first communication device divides every K information bits into one information bit block, that is, one information bit block includes K information bits, as shown in FIG. 4a.
  • Each information bit block can be divided into Q information bit sub-blocks, that is, K information bits are divided into Q information bit sub-blocks, as shown in Fig. 4a.
  • a q represents any sub-block of information bits
  • a q is a binary sequence of length K/Q
  • q satisfies 1 ⁇ q ⁇ Q.
  • Q represents the quantization order of the code rate
  • Q is a positive integer.
  • K/Q is not an integer
  • the first communication device may place the X information bit blocks in the M first to-be-coded blocks.
  • the to-be-coded block is used to carry the to-be-coded data transmitted from the first communication device to the second communication device.
  • the first block to be coded indicates the block to be coded used when the first communication device transmits to the second communication device for the first time
  • the second block to be coded indicates that the first communication device transmits to the second communication device for the second time.
  • the block to be coded used at the time, and so on.
  • any first block to be coded carries at least one information bit sub-block, and at most Q information bit sub-blocks.
  • FIG. 5a is a schematic diagram of a first block to be coded according to an embodiment of the application.
  • each information bit block includes Q information bit sub-blocks. It should be noted that the Q information bit sub-blocks of the same information bit block are respectively located in different Q first to-be-coded, as shown in FIG. 5a.
  • each first to-be-coded block is arranged in order, and the first first to-be-coded block carries a sub-block of information bits; the number of information bit blocks carried by the first to Q-th first to-be-coded blocks is in the order of arrangement, One is sequentially added, and the Q-th first to-be-coded block carries Q sub-blocks of information bits.
  • the number of sub-blocks carrying information bits from the Q+1 to the M-th first to-be-coded block is sequentially reduced by one according to the order of arrangement, and the M-th first to-be-coded block carries one information bit sub-block.
  • the first first block to be encoded carries 1 sub-block of information bits
  • the second first block to be encoded carries 2 sub-blocks of information bits
  • the third first block to be encoded carries 3 information.
  • Bit sub-block the fourth first to-be-coded block carries 2 information bit sub-blocks
  • the fifth first to-be-coded block carries 1 information bit sub-block.
  • each first to-be-coded block is arranged in sequence, and the first first to-be-coded block carries a sub-block of information bits; the number of information bit blocks carried by the first to M-th first to-be-coded blocks is in the order of arrangement, One is sequentially added, and the Q-th to M-th first to-be-coded blocks respectively carry Q sub-blocks of information bits.
  • FIG. 5b is a schematic diagram of another first block to be coded according to an embodiment of this application.
  • the first to fourth information bit blocks respectively include 3 information bit sub-blocks.
  • the fifth information bit block includes 2 information bit sub-blocks, and the sixth information bit block includes 1 information bit sub-block, that is, the fifth and sixth information bit blocks are processed separately.
  • the first first block to be coded carries 1 sub-block of information bits
  • the second first block to be coded carries 2 sub-blocks of information bits
  • the third to sixth first blocks to be coded are respectively Carry 3 information bit sub-blocks.
  • FIG. 5c is a schematic diagram of another first block to be coded according to an embodiment of this application.
  • the quantization order of the code rate in Fig. 5c is 2, and the number of information bit blocks and the first block to be coded is the same.
  • the sixth information bit block in FIG. 5c adopts special processing, so that the sixth information bit block includes only one information bit sub-block.
  • the first communication device places the above-mentioned 6 information bit blocks into 6 first to-be-coded blocks respectively, as shown in FIG. 5c.
  • FIG. 5d is a schematic diagram of another first block to be coded according to an embodiment of this application.
  • the quantization order of the code rate in FIG. 5d is 4, and the number of information bit blocks and the first block to be coded are the same.
  • the fourth to sixth information bit blocks in Fig. 5d adopt special processing, so that the fourth information bit block includes 3 information bit sub-blocks, and the fifth information bit block includes 2 information bit sub-blocks.
  • the sixth information bit block includes 1 information bit sub-block.
  • the first communication device places the above-mentioned 6 information bit blocks into 6 first to-be-coded blocks respectively, as shown in FIG. 5d.
  • first to-be-coded block shown in Figure 5a and Figure 5b is the first to-be-coded block of two basics, and the first to-be-coded block can also be between the first to-be-coded blocks of the above two basics. .
  • FIG. 5e is a schematic diagram of another first block to be coded.
  • the 4 information bit blocks to be transmitted shown in FIG. 5e are all complete information bit blocks.
  • the above-mentioned 4 information bit blocks are placed in the 6 first blocks to be coded.
  • the first and sixth first to-be-coded blocks carry 1 information bit sub-block
  • the second and fifth first to-be-coded blocks carry 2 information bit sub-blocks
  • the third and fourth A block to be coded carries 3 sub-blocks of information bits, as shown in Fig. 5e.
  • the first block to be coded may also adopt other similar special processing, which is not limited in this embodiment.
  • any first block to be coded further includes one or more fixed bits, as shown by the shaded area of the information bit block in FIG. 5a.
  • the value of the fixed bit is usually set to 0, which is known to both the sending end and the receiving end in actual transmission.
  • the above description of the first block to be coded is only an example, and the number of the first block to be coded may also be other values.
  • the number of the first to-be-coded blocks can approach infinity in theory, that is, M approaches infinity, which is not limited in this embodiment.
  • the Q information bit sub-blocks included in the information bit block may be respectively placed in the Q first to-be-coded blocks in a first order.
  • the first order is that the q-th information bit sub-block of each information bit block is located at a reliable position from (q-1)*K/Q+1 to q*K/Q of the first block to be coded.
  • the information bit block in FIG. 6, includes 256 information bits.
  • the first communication device can acquire that a 1 , a 2 , a 3 and a 4 respectively include 64 information bits.
  • a 1 will be placed in the first to the 64th reliable position of the first first to be coded block, and a 2 will be placed in the 65th to the 128th reliable position of the second first to be coded block Position, a 3 will be placed in the 129th to 192th reliable positions of the third first block to be coded, and a 4 will be placed in the 193rd to 256th reliable positions of the fourth first block to be coded, as shown in the figure 6 shown. It should be noted that the reliability of the position of each first block to be coded gradually increases from left to right, that is, the rightmost position is the first reliable position, and the reliability to the left decreases sequentially.
  • the information bit block also includes 256 information bits.
  • the first communication device may acquire that b 1 , b 2 , b 3 and b 4 respectively include 64 information bits.
  • b 1 will be placed in the first to 64th reliable positions of the second first block to be coded
  • b 2 will be placed in the 65th to 128th reliable positions of the third first block to be coded
  • Position, b 3 will be placed at the 129th to 192th reliable positions of the fourth first block to be coded
  • b 4 will be placed at the 193rd to 256th reliable positions of the fifth first block to be coded, as shown in the figure 6 shown.
  • the arrangement of the 256 information bits in the third to sixth information bit blocks is also similar, and will not be repeated here.
  • the first communication device performs polar code encoding on the M first to-be-encoded blocks, respectively, to obtain M first encoding blocks;
  • the first communication device sends M first coding blocks to the second communication device; correspondingly, the second communication device receives M first coding blocks sent by the first communication device.
  • the first communication device may perform polar code encoding on the M first to-be-encoded blocks, respectively, to obtain M first encoding blocks.
  • the output M first coding blocks after polar code coding are multiple coding blocks combined in stages. For example, when the first communication device transmits for the first time, the first block to be coded is the first block to be coded as shown in FIG. 5a. Then the order of the five first to-be-coded blocks and the information bit sub-blocks in each first to-be-coded block is as shown in Fig. 7a.
  • the first block to be coded is the first block to be coded as shown in FIG. 5b. Then the order of the six first to-be-coded blocks and the information bit sub-blocks in each first to-be-coded block is as shown in Fig. 7b.
  • the first block to be coded is the first block to be coded as shown in FIG. 5c. Then the order of the six first to-be-coded blocks and the information bit sub-blocks in each first to-be-coded block is as shown in Fig. 7c.
  • the first block to be coded is the first block to be coded as shown in FIG. 5d. Then the order of the six first to-be-coded blocks and the information bit sub-blocks in each first to-be-coded block is as shown in Fig. 7d.
  • the code rate of the first coding block is analyzed below.
  • the 6 first to-be-coded blocks as shown in FIG. 7c are encoded into 6 polar code blocks.
  • the 6 first to-be-coded blocks as shown in FIG. 7d are encoded into 6 polar code blocks.
  • the first communication device After the first communication device encodes the information bits, it may perform constellation modulation on the M first coding block channels, and then send the data after the constellation modulation to the second communication device through the downlink data channel.
  • the second communication device will receive the coded and modulated data, and demodulate and then decode the received coded and modulated data to obtain the original data transmitted by the first communication device.
  • the original data transmitted by the first communication device is a plurality of information bits carried by the M first blocks to be coded.
  • the use of a suitable channel coding method can achieve arbitrarily high transmission reliability, but if the information transmission rate exceeds the channel capacity, no It is possible to achieve reliable transmission.
  • one transmission cannot guarantee the reliable transmission of all information bits, that is, it cannot ensure that the channel capacity is greater than or equal to the code rate of each first coding block. Then the first communication device can retransmit the data to the second communication device.
  • the first communication device places the Q information bit sub-blocks of each information bit block in the Q second to-be-coded blocks in the second order in the M second to-be-coded blocks.
  • the second communication device may request a retransmission.
  • the first communication device may relocate the X information bit blocks into the M second to-be-coded blocks.
  • the second block to be coded is used to carry the data to be coded that the first communication device sends to the second communication device for the second time.
  • any second block to be coded carries at least one information bit sub-block, and at most Q information bit sub-blocks.
  • the second block to be coded and the multiple information bit sub-blocks carried by the second block to be coded are arranged in a second order, and the second order and the first order satisfy the mapping relationship.
  • the second order is that the qth information bit sub-block of each information bit block is located in the (Qq)*K/Q+1 to (Q-q+1)th of the second block to be coded. *K/Q reliable location.
  • FIG. 8a is a schematic diagram of a first block to be coded and a second block to be coded according to an embodiment of the application.
  • the arrangement order of the information bit sub-blocks in the second to-be-coded block shown in FIG. 8a is that of the first to-be-coded block shown in FIG. 5d
  • the order of the information bit sub-blocks in the block is reversed, as shown in Fig. 8a.
  • the information bit sub-block a 1 of the information bit block is located from the 193rd to the 256th of the fourth second block to be coded.
  • the position is the position corresponding to a 4 in the first transmission.
  • a 2 is located at the 129th to 192th reliable positions of the third second block to be coded, that is, at the position corresponding to a 3 in the first transmission.
  • a 3 is located at the 65th to 128th reliable positions of the second second block to be coded, that is, at the position corresponding to a 2 in the first transmission.
  • a 4 is located at the first to 64th reliable positions of the first second block to be coded, that is, at the position corresponding to a 1 in the first transmission. It can be seen that for the first information bit block, the order of the 4 information bit sub-blocks of the first information bit block in the second to-be-coded block is that the 4 information bit sub-blocks of the information bit block are in the first to-be-coded block. The reverse order of the arrangement order in the block.
  • the information bit sub-block b 1 of the information bit block is located from the 193rd to the 256th of the fifth first block to be coded
  • the reliable position is the position corresponding to b 4 in the first transmission.
  • b 2 is located at the 129th to 192nd reliable positions of the fourth first block to be coded, that is, at the position corresponding to b 3 in the first transmission.
  • b 3 is located at the 65th to 128th reliable positions of the third first block to be coded, that is, at the position corresponding to b 2 in the first transmission.
  • b 4 is located at the first to 64th reliable positions of the second first block to be coded, that is, at the position corresponding to b 1 in the first transmission. It can be seen that for the second information bit block, the order of the 4 information bit sub-blocks of the second information bit block in the second to-be-coded block is also that the 4 information bit sub-blocks of the information bit block are in the first to-be-coded block. The reverse order of the arrangement order in the coding block. It can be understood that the arrangement of the 256 information bits in the third to sixth information bit blocks is also similar, and will not be repeated here.
  • rate matching is also required. It should be pointed out that the scheme in this application has little to do with which rate matching scheme is adopted, so a general rate matching scheme can be used.
  • the first order and the second order satisfy the following mapping relationship:
  • a q is any arbitrary Q information bit sub-block information bit blocks in one information bit sub-blocks
  • F is the polar code generation Matrix
  • P is a positive integer and satisfies 2 P-1 ⁇ Q ⁇ 2 P
  • t satisfies 1 ⁇ t ⁇ 2 P.
  • FIG. 8b is a schematic diagram of a second block to be coded according to an embodiment of the application.
  • the arrangement order of the information bit sub-blocks in the second to-be-coded block shown in Fig. 8b is the same as that of the first to-be-coded block shown in Fig. 5d.
  • the arrangement order of the information bit sub-blocks in the block is the same, but each information bit sub-block is a mapped information bit sub-block, as shown in Fig. 8b.
  • the six information bit blocks in Figure 8b are (a 1 , a 2 , a 3 , a 4 ), (b 1 , b 2 , b 3 , b 4 ), (c 1 , c 2 , c 3 , c 4 ), (d 1 , d 2 , d 3 ), (e 1 , e 2 ) and (f 1 ).
  • the number of information bit sub-blocks in each information bit block is not a power of 2, when processing the information bit block, zero-padded processing is required to make the information bit block complete when it is mapped.
  • the polar code generator matrix It should be noted that if zero padding is not performed on the information bit block, then the information bit block uses a sub-matrix of the polar code generation matrix when mapping.
  • the three information bit blocks after mapping each include four information bit sub-blocks, and the relationship between the information bit block after mapping and the information bit block before mapping satisfies the following relationship:
  • the first communication device places the four information bit sub-blocks in each mapped information bit block in the Q second to-be-coded blocks in a first order, as shown in FIG. 8b.
  • the first communication device performs polar code encoding on the M second to-be-encoded blocks, respectively, to obtain M second encoding blocks.
  • the first communication device sends M second coding blocks to the second communication device; the corresponding second communication device receives M second coding blocks sent by the first communication device.
  • the first communication device may perform polar code encoding on the M second to-be-encoded blocks, respectively, to obtain M second encoding blocks.
  • the first communication device may perform constellation modulation on the M second coded block channels, and then send the constellation-modulated data to the second communication device through the downlink data channel.
  • the second communication device will receive the coded and modulated data, and perform data demodulation on the received coded and modulated data.
  • the second communication device may combine and decode the received M first code blocks and M second code blocks to obtain the original data transmitted by the first communication device.
  • the original data transmitted by the first communication device is a plurality of information bits carried by the M first blocks to be coded.
  • the second communication device combines and decodes the M first coded blocks and M second coded blocks to obtain decoded data.
  • the second communication device may combine and decode the two received data.
  • the combined decoding described in this embodiment is an interactive process: the second communication device first decodes the first code block and may decode some parts; then decodes the second code block, and When decoding the second code block, some parts that were decoded during the previous decoding of the first code block may be used; and vice versa.
  • the second communication device can always decode through the combination described in this embodiment In this way, reliable decoding of the first coding block and the second coding block is realized.
  • the second communication device decodes and obtains k 1 information bit sub-blocks included in an information bit block carried by the first block to be coded k 1 satisfies 1 ⁇ k 1 ⁇ Q;
  • the second communication device decodes and obtains k 2 information bit sub-blocks included in the information bit block carried by the second block to be coded k 2 satisfies 1 ⁇ k 2 ⁇ Q, k 1 +k 2 ⁇ Q;
  • the Q information bit sub-blocks included in the information bit block acquired by the second communication device are [a 1 , a 2 ,..., a Q ].
  • the channel capacity of the first transmission by the first communication device is greater than or equal to R/3, and the channel capacity of the second transmission is greater than or equal to 2R/3. Then the sum of the channel capacity of the two transmissions of the first communication device is greater than or equal to the code rate R, that is, correct decoding can be realized in two transmissions.
  • the first coding block and the second coding block of the first transmission and the second transmission of the first communication device are shown in FIG. 8c.
  • the code rate of the first and fifth first coding blocks transmitted by the first communication device for the first time is R/3
  • the code rate of the second and fourth first coding blocks is 2R/3
  • the code rate of the second and fourth first coding blocks is 2R/3.
  • the code rate of the three first coding blocks is R. According to Shannon’s second theorem, the code rate R/3 of the first and fifth first coding blocks is less than or equal to the channel capacity R/3 of the first transmission, then the first and fifth first coding blocks can be Decode it, that is, a 1 and c 3 can be decoded. However, the remaining information bits cannot be guaranteed to be successfully decoded.
  • the code rate of the first and fifth second coded blocks transmitted by the first communication device for the second time is R/3
  • the code rate of the second and fourth second coded blocks is 2R/3
  • the code rate of the second and fourth second coded blocks is 2R/3.
  • the code rate of the three second coding blocks is R. According to Shannon’s second theorem, the code rate R/3 of the first and fifth second coding blocks is less than or equal to the channel capacity of the second transmission 2R/3, then the first and fifth second coding blocks can be Decode it, that is, a 3 and c 1 can be decoded.
  • the code rate of the second and fourth second coded blocks is 2R/3, which is less than or equal to the channel capacity of the second transmission 2R/3, then the second and fourth second coded blocks can also be decoded , That is, a 2 , b 3 , b 1 and c 2 can be decoded. However, the remaining information bits cannot be guaranteed to be successfully decoded.
  • the code rate of the third first coding block in the first transmission is reduced to R/3.
  • the third first coding block can also be decoded, that is, b 2 can be decoded.
  • the combined decoding described in this application may also include the following special combined decoding: when the first communication device transmits for the first time, the channel capacity is zero, then the second communication device cannot decode any data . During the second transmission by the first communication device, the channel capacity is greater than or equal to the code rate R, then after the second transmission, the second communication device can decode all the original data. It can be seen that, in the above special case, the sum of the channel capacity of the two transmissions is greater than or equal to the code rate R, which also meets the conditions of combined decoding, and finally achieves correct decoding.
  • the abscissa represents the channel capacity of the first transmission
  • the ordinate represents the channel capacity of the second retransmission
  • the slash-shaded area indicates that the sum of the channel capacity of the two transmissions in this area is less than the code rate R, and reliability cannot be achieved.
  • the area outside the shaded area with diagonal lines is the area where reliable transmission can be achieved, and the shaded area with horizontal lines represents the area where the bit rate is lost.
  • the embodiment of the present application provides a data processing method, which is implemented by interaction between a first communication device and a second communication device.
  • the first communication device initially transmits M first coded blocks to the second communication device
  • the multiple information bit sub-blocks in the M first coded blocks are arranged in a first order, which is beneficial for the second communication device to decode correctly .
  • the first communication device may retransmit M second coding blocks to the second communication device, the multiple information bit sub-blocks in the M second coding blocks are arranged in the second order, and the first communication device The second order and the first order satisfy the mapping relationship.
  • the above-mentioned ordering manner of the multiple information bit sub-blocks is beneficial for the second communication device to correctly decode according to the first code block and the second code block, that is, it can be decoded correctly after two transmissions. As long as the condition that the sum of the channel capacity of multiple transmissions is greater than or equal to the information transmission rate is satisfied, the first communication device can achieve transmission close to the channel capacity.
  • FIG. 10 is another data processing method provided by an embodiment of the application.
  • the data processing method may be interactively executed between the first communication device and the second communication device, including S1001 to S1011.
  • S1001 to S1007 are similar to the specific implementation manners of S301 to S307 in the embodiment of FIG. 3, and details are not described herein again.
  • S1008 to S1011 specifically include:
  • the first communication device places the Q information bit sub-blocks of each information bit block in Q third to-be-coded blocks in the second order.
  • the second order and the first order satisfy the mapping relationship.
  • the second order is that the qth information bit sub-block of each information bit block is located in (Qq)*K/Q+1 to (Q-q+1)*Kth of the second block to be coded. /Q Reliable location.
  • the first order and the second order satisfy the following mapping relationship:
  • the first communication device when the first communication device transmits for the third time, the first communication device also places the Q information bit sub-blocks of each information bit block in the second order in the Q third to-be-coded blocks. Encoding block.
  • FIG. 11a is a schematic diagram of a block to be coded in three transmissions according to an embodiment of the application.
  • the second order adopted by the first communication device during the second transmission is the reverse order
  • the second order adopted by the first communication device during the third transmission is that the mapped information bit block is placed in the first order.
  • the third block to be coded is the reverse order
  • FIG. 11b is a schematic diagram of another block to be coded during three-time transmission according to an embodiment of this application.
  • the second order adopted by the first communication device in the second transmission is that the mapped information bit block is placed in the second block to be coded in the first order, and the first communication device adopts the method in the third transmission.
  • the second order is the reverse order.
  • the first communication device performs polar code encoding on the M third to-be-encoded blocks, respectively, to obtain M third encoding blocks;
  • the first communication device sends M third coding blocks to the second communication device.
  • the first communication device may perform polar code encoding on the M third to-be-encoded blocks, respectively, to obtain M third encoding blocks.
  • M third to-be-encoded blocks For the process of performing polar code encoding on the third encoding block, reference may be made to the description of the specific implementation manner of performing polar code encoding on the first encoding block in the embodiment of FIG. 3, which will not be repeated here. It can be understood that the code rate analysis of the third coding block can also refer to the code rate analysis of the first coding block in the above embodiment, which will not be repeated here.
  • the first communication device may perform constellation modulation on the M third coding block channels, and then send the constellation-modulated data to the second communication device through the downlink data channel.
  • the second communication device will receive the coded and modulated data, and perform data demodulation on the received coded and modulated data.
  • the second communication device may decode the received M first code blocks, M second code blocks, and M third code blocks to obtain the original data transmitted by the first communication device.
  • the original data transmitted by the first communication device is a plurality of information bits carried by the M first blocks to be coded.
  • the second communication device combines and decodes the M first coded blocks, M second coded blocks, and M third coded blocks to obtain decoded data.
  • the second communication device may combine and decode the data received three times.
  • the combined decoding after three transmissions is also an interactive process: the second communication device first decodes the first code block and may decode some parts; then The second code block is decoded, and when the second code block is decoded, some parts that were decoded during the previous decoding of the first code block may be used; finally, the third code block is decoded, and the first code block is decoded.
  • the decoding of the three-coded block may use some parts that were previously decoded during the decoding of the first and second coded blocks; vice versa.
  • the second communication device can always use the combined decoding method described in this embodiment to decode The first coding block, the second coding block and the third coding block realize reliable decoding.
  • the second communication device decodes and obtains k 1 information bit sub-blocks included in an information bit block carried by the first block to be coded k 1 satisfies 1 ⁇ k 1 ⁇ Q;
  • the second communication device decodes and obtains k 2 information bit sub-blocks included in the information bit block carried by the second block to be coded k 1 and k 2 satisfy 1 ⁇ k 2 ⁇ Q, k 1 +k 2 ⁇ Q;
  • the second communication device decodes and obtains k 3 information bit sub-blocks included in the information bit block carried by the third block to be coded k 3 satisfies 1 ⁇ k 3 ⁇ Q, k 1 , k 2 and k 3 satisfies k 1 +k 2 +k 3 ⁇ Q;
  • the second communication device obtains the k 3 information bit sub-blocks corresponding to the k 3 information bit sub-blocks before mapping as
  • the Q information bit sub-blocks included in the information bit block acquired by the second communication device are [a 1 , a 2 ,..., a Q ].
  • the channel capacity of the first transmission of the first communication device is greater than or equal to R/3
  • the channel capacity of the second transmission is greater than or equal to R/3
  • the channel capacity of the third transmission is greater than or equal to R/3.
  • the sum of the channel capacity of the three transmissions of the first communication device is greater than or equal to the code rate R, that is, correct decoding can be achieved with three transmissions.
  • FIG. 12a is a diagram of a first code block transmitted by a first communication device for the first time, a second code block transmitted for the second time, and a third coded block transmitted for the third time according to an embodiment of the application.
  • Q 3.
  • the ordering of the first coding block in Fig. 12a is consistent with the ordering of the first coding block in Fig. 7b.
  • the order of the information bit sub-blocks in the second coding block in Fig. 12a is the order of the information bit sub-blocks in the first coding block in Fig. 7b
  • the information bit sub-blocks in the third coding block are mapped to the information bit sub-blocks in the first coding block in FIG. 7b, and the information bit sub-blocks are arranged in the first order.
  • mapping relationship in Figure 12a since the number of information bit sub-blocks included in each information bit block is not a power of 2, when processing the information bit sub-block, zero padding is required to make The information bit block uses a complete polar code generating matrix when mapping. It should be noted that if zero padding is not performed on the information bit block, then the information bit block uses a sub-matrix of the polar code generation matrix when mapping.
  • the code rate of the first first coding block transmitted by the first communication device for the first time is R/3
  • the code rate of the second first coding block is 2R/3
  • the third to sixth first coding blocks are The code rate.
  • the code rate R/3 of the first first coding block is less than or equal to the channel capacity of the first transmission, then the first first coding block can be decoded, that is, a 1 can be decoded. .
  • the remaining information bits cannot be guaranteed to be successfully decoded.
  • the code rate of the first second coding block transmitted by the first communication device for the second time is R/3
  • the code rate of the second second coding block is 2R/3
  • the third to sixth second coding blocks are The code rate.
  • the code rate R/3 of the first second code block is less than or equal to the channel capacity of the second transmission, then the first second code block can be decoded, that is, a 3 can be decoded. .
  • the remaining information bits cannot be guaranteed to be successfully decoded.
  • the code rate of the first third code block transmitted by the first communication device for the third time is R/3
  • the code rate of the second third code block is 2R/3
  • the third to sixth third code blocks are The code rate is R.
  • the code rate R/3 of the first third code block is less than or equal to the channel capacity of the third transmission, then the first third code block can be decoded, that is, A 1 can be decoded. .
  • the remaining information bits cannot be guaranteed to be successfully decoded.
  • the code rate of the second first coding block in Fig. 12a is reduced to R/3.
  • the code rate R/3 of the second first coding block is less than or equal to the channel capacity of the first transmission, then the second first coding block can be decoded, that is, b 1 can be decoded.
  • the code rate of the second second coding block is reduced to R/3, and the code rate of the second third coding block is reduced to R/3. Then b 3 and B 1 can also be decoded.
  • the code rate of the third first coding block in Fig. 12a is reduced to R/3.
  • the code rate R/3 of the third first coding block is less than or equal to the channel capacity of the first transmission, then the third first coding block can be decoded, that is, c 1 can be decoded.
  • the code rate of the third second coding block is reduced to R/3, and the code rate of the third third coding block is reduced to R/3. Then c 3 and C 1 can also be decoded.
  • the first communication device C 2 , C 2 , C 3 and C 4 can be decoded.
  • the code rate of the fourth first coding block in Fig. 12a is reduced to R/3.
  • the coding rate R/3 of the fourth first coding block is less than or equal to the channel capacity of the first transmission, then the fourth first coding block can be decoded, that is, d 1 can be decoded.
  • the code rate of the fourth second coding block is reduced to R/3, and the code rate of the fourth third coding block is reduced to R/3. Then d 3 and D 1 can also be decoded.
  • the code rate of the fifth first coding block in Fig. 12a is reduced to R/3.
  • the coding rate R/3 of the fifth first coding block is less than or equal to the channel capacity of the first transmission, then the fifth first coding block can be decoded, that is, e 1 can be decoded.
  • the code rate of the fifth second coding block is reduced to R/3, and the code rate of the fifth third coding block is reduced to R/3. Then e 2 and E 1 can also be decoded.
  • the first communication device can Decode and get E 2 .
  • the code rate of the sixth first coding block in Fig. 12a is reduced to R/3.
  • the coding rate R/3 of the sixth first coding block is less than or equal to the channel capacity of the first transmission, then the sixth first coding block can be decoded, that is, f 1 can be decoded. .
  • FIG. 12b is another first coding block transmitted by the first communication device for the first time, the second coding block transmitted for the second time, and the second coding block transmitted for the third time provided by another embodiment of this application.
  • Schematic diagram of three coding blocks. Among them, Q 2.
  • the ordering of the first coding block in Fig. 12b is consistent with the ordering of the first coding block in Fig. 7c.
  • the arrangement order of the information bit sub-blocks in the second coding block in Fig. 12b is the order of the information bit sub-blocks in the first coding block in Fig. 7c.
  • the information bit sub-blocks in the third coding block are mapped to the information bit sub-blocks in the first coding block in FIG. 7c, and the information bit sub-blocks are arranged in the first order.
  • mapping relationship in FIG. 12b the relationship between each mapped information bit block and the information bit block before mapping satisfies the following relationship:
  • FIG. 12c is the first code block for the first transmission, the second code block for the second transmission, and the first code block for the third transmission provided by another embodiment of the application.
  • Schematic diagram of three coding blocks. Among them, Q 4.
  • the ordering of the first coding block in Fig. 12b is consistent with the ordering of the first coding block in Fig. 7c.
  • the arrangement order of the information bit sub-blocks in the second block to be coded in Fig. 12b is the order of the information bit sub-blocks in the first block to be coded in Fig.
  • Fig. 12c since Fig. 12c includes a special processed information bit block, the number of information bit sub-blocks included in the information bit block is not a power of 2, then the information bit sub-block During processing, zero padding needs to be performed, so that the information bit block uses a complete polar code generation matrix when mapping. It should be noted that if zero padding is not performed on the information bit block, then the information bit block uses a sub-matrix of the polar code generation matrix when mapping.
  • the condition that the three transmissions shown in Figure 12b and Figure 12c can be decoded correctly is also that the sum of the channel capacity of the three transmissions is greater than or equal to the code rate R, then the second communication device can always pass the method described in this embodiment.
  • the aforementioned combined decoding method realizes reliable decoding of the first code block, the second code block and the third code block.
  • the embodiment of the present application provides a data processing method, which is implemented by interaction between a first communication device and a second communication device.
  • the first communication device initially transmits M first coded blocks to the second communication device
  • the multiple information bit sub-blocks in the M first coded blocks are arranged in a first order, which is beneficial for the second communication device to decode correctly .
  • the first communication device may retransmit M second coding blocks to the second communication device, the multiple information bit sub-blocks in the M second coding blocks are arranged in the second order, and the first communication device The second order and the first order satisfy the mapping relationship.
  • the first communication device can also retransmit M third coding blocks to the second communication device.
  • the arrangement of multiple information bit sub-blocks in the third coding block is the same as that of the second coding block.
  • the arrangement of multiple information bit sub-blocks in is related.
  • the above-mentioned ordering manner of the multiple information bit sub-blocks is beneficial for the second communication device to correctly decode according to the first coding block, the second coding block and the third coding block, that is, it can be correctly decoded after three transmissions. As long as the condition that the sum of the channel capacity of multiple transmissions is greater than or equal to the information transmission rate is satisfied, the first communication device can achieve transmission close to the channel capacity.
  • the following describes in detail the situation that the first communication device needs to perform four or more transmissions to perform correct decoding.
  • the following example uses the first communication device to perform four transmissions as an example. It can be understood that when the first communication device needs to perform more than four transmissions, the specific implementation manner of four transmissions can be referred to.
  • the data processing method can be executed interactively between the first communication device and the second communication device, and specifically includes the following steps:
  • the first communication device obtains X information bit blocks, and one information bit block is divided into Q information bit sub-blocks.
  • the processing of the information bit sub-block by the first communication device cannot be performed in the binary domain.
  • the first communication device can map each information bit block [a 1 , a 2 ,..., a Q ] from the binary domain to the 2 w base domain, and the mapping Any block of information bits after that satisfies in, Is any information bit sub-block in any information bit block after mapping from the binary domain to the 2w base domain, It is a 2 w base sequence of length K/wQ, and w is a positive integer greater than 1.
  • the first communication device maps the mapped A universal decoding matrix (UDM) is used for conversion.
  • UDM universal decoding matrix
  • H n is the UDM of K/w ⁇ K/w in the 2 w hexadecimal domain, n is used to indicate the nth transmission; n satisfies n ⁇ [1,2,.. .,N], N is the total number of transmissions by the first communication device, and N is a positive integer greater than 3.
  • the first communication device will Perform inverse mapping, and obtain the corresponding information bit block after the inverse mapping satisfies [A n,1 ,A n,2 ,...,A n,Q ].
  • a n, Q after de-mapping is a binary sequence of length K/Q.
  • the first communication device can process the information bit sub-blocks and then perform the subsequent ordering and coding when transmitting four or more times.
  • the first communication device places the processed information bit sub-blocks of each information bit block in the M first to-be-coded blocks in a first order;
  • the first communication device performs polar code encoding on the M first to-be-encoded blocks, respectively, to obtain M first encoding blocks;
  • the first communication device sends M first coding blocks to the second communication device.
  • the first communication device places the processed information bit sub-blocks of each information bit block in the M second to-be-coded blocks in the first order;
  • the first communication device performs polar code encoding on the M second to-be-encoded blocks, respectively, to obtain M second encoding blocks;
  • the first communication device sends M second coding blocks to the second communication device.
  • the first communication device places the processed information bit sub-blocks of each information bit block in the M third blocks to be coded in the first order;
  • the first communication device performs polar code encoding on the M first to-be-encoded blocks, respectively, to obtain M third encoding blocks;
  • the first communication device sends M third coding blocks to the second communication device.
  • the first communication device places the processed information bit sub-blocks of each information bit block in M fourth blocks to be coded in a first order;
  • the first communication device performs polar code encoding on the M fourth to-be-encoded blocks, respectively, to obtain M fourth encoding blocks;
  • the first communication device sends M fourth coding blocks to the second communication device.
  • FIG. 14 is a first coding block for the first transmission by a first communication device, a second coding block for the second transmission, a third coding block for the third transmission, and Schematic diagram of the fourth coding block for the fourth transmission.
  • the information bit sub-blocks in the first coding block transmitted for the first time are arranged in the first order.
  • a 1,1 , A 1,2 , and A 1,3 respectively represent the information bit sub-block in the first coding block carried by the first data stream, and the above-mentioned information bit sub-block is a 1 in the original information bit sub-block.
  • a 2 ,a 3 are processed information bit sub-blocks.
  • the first communication device After the first coding block for the first transmission is determined, the first communication device sends the M first coding blocks to the second communication device for the first time.
  • the information bit sub-blocks in the second coding block transmitted for the second time are arranged in the first order.
  • a 2,1 , A 2,2 , and A 2,3 respectively represent the information bit sub-block in the second coding block carried by the second data stream, and the above-mentioned information bit sub-block is a 1 in the original information bit sub-block.
  • a 2 ,a 3 are processed and are different from the information bit sub-blocks of A 1,1 , A 1,2 and A 1,3.
  • the first communication device After the second coding block for the second transmission is determined, the first communication device sends the M second coding blocks to the second communication device for the second time.
  • the information bit sub-blocks in the third coding block transmitted for the third time are arranged in the first order.
  • a 3,1 , A 3,2 , and A 3,3 respectively represent information bit sub-blocks in the third coding block carried by the third data stream.
  • the above information bit sub-block is a 1 , a 2 , and a 3 in the original information bit sub-block after processing, and is different from A 1,1 , A 1,2 ,A 1,3 and A 2,1 ,A 2 ,2 ,A 2,3 sub-blocks of information bits.
  • the first communication device After the third coding block for the third transmission is determined, the first communication device sends the M third coding blocks to the second communication device for the third time.
  • the information bit sub-blocks in the fourth coding block transmitted for the fourth time are arranged in the first order.
  • a 4,1 , A 4,2 , and A 4,3 respectively represent information bit sub-blocks in the fourth coding block carried by the fourth data stream.
  • the above information bit sub-block is a 1 , a 2 , and a 3 in the original information bit sub-block after processing, and is different from A 1,1 , A 1 , 2, A 1,3 , A 2,1 , A 2 ,2 ,A 2,3 and A 3,1 ,A 3,2 ,A 3,3 information bit sub-blocks.
  • the first communication device After the fourth coding block for the fourth transmission is determined, the first communication device sends the M fourth coding blocks to the second communication device for the first time.
  • S1315 The second communication device combines and decodes the first code block to the fourth code block to obtain decoded data.
  • the second communication device can combine and decode the data received four times. Among them, similar to the combined decoding after two transmissions and three transmissions, the combined decoding after four transmissions is also an interactive process.
  • the second communication device decodes and obtains k 1 information bit sub-blocks included in the processed information bit block k 1 satisfies 1 ⁇ k 1 ⁇ Q;
  • the second communication device can be based on Obtain
  • the second communication device decodes and acquires k 2 information bit sub-blocks included in the processed information bit block k 1 and k 2 satisfy 1 ⁇ k 2 ⁇ Q, k 1 +k 2 ⁇ Q;
  • the second communication device can be based on Obtain
  • the second communication device decodes and acquires k 3 information bit sub-blocks included in the processed information bit block k 3 satisfies 1 ⁇ k 3 ⁇ Q, k 1 , k 2 and k 3 satisfies k 1 +k 2 +k 3 ⁇ Q;
  • the second communication device can be based on Obtain
  • the second communication device decodes and acquires k 4 information bit sub-blocks included in the processed information bit block k 4 satisfies 1 ⁇ k 4 ⁇ Q, k 1 , k 2 , k 3 and k 4 satisfies k 1 +k 2 +k 3 +k 4 ⁇ Q;
  • the second communication device can be based on Obtain
  • the second communication device can be based on And the nature of UDM, you can get
  • the second communication device is right again Perform reverse mapping to obtain the Q information bit sub-blocks included in the information bit block as [a 1 , a 2 ,..., a Q ].
  • the channel capacity of the first transmission of the first communication device is greater than or equal to R/4
  • the channel capacity of the second transmission is greater than or equal to R/4
  • the channel capacity of the third transmission is greater than or equal to R/4
  • the channel capacity of the fourth transmission is greater than or equal to R/4.
  • the sum of the channel capacity of the four transmissions of the first communication device is greater than or equal to the code rate R, that is, the four transmissions can achieve correct decoding.
  • the embodiment of the present application provides a data processing method, which is implemented by interaction between a first communication device and a second communication device.
  • the first communication device initially transmits M first coded blocks to the second communication device
  • the multiple information bit sub-blocks in the M first coded blocks are arranged in a first order, which is beneficial for the second communication device to decode correctly .
  • the first communication device can retransmit M n-th code blocks to the second communication device, and multiple information bits in the n-th code block
  • the arrangement of the blocks is related to the arrangement of the multiple information bit sub-blocks in the first coding block.
  • the above-mentioned ordering manner of the multiple information bit sub-blocks facilitates the correct decoding of the second communication device according to the first coding block to the n-th coding block. As long as the condition that the sum of the channel capacity of multiple transmissions is greater than or equal to the information transmission rate is satisfied, the first communication device can achieve transmission close to the channel capacity.
  • An embodiment of the present application provides a communication device.
  • the communication device is configured to implement the method executed by the first communication device in the foregoing method embodiment, which specifically includes:
  • the transceiver unit 1501 is used to obtain X information bit blocks, one information bit block includes K information bits; one information bit block is divided into Q information bit sub-blocks, and one information bit sub-block is binary with a length of K/Q sequence;
  • the processing unit 1502 is configured to place the Q information bit sub-blocks of each information bit block in the Q first to be coded blocks of the M first to be coded blocks in a first order, and the first order is for each piece of information
  • the processing unit 1502 is further configured to perform polar code encoding on the M first to-be-encoded blocks, respectively, to obtain M first encoding blocks;
  • the transceiver unit 1501 is further configured to send M first coding blocks to the second communication device;
  • the processing unit 1502 is further configured to place the Q information bit sub-blocks of each information bit block in the Q second to-be-coded blocks of the M second to-be-coded blocks in the second order when retransmission is required.
  • the second order and the first order satisfy the mapping relationship;
  • the processing unit 1502 is further configured to perform polar code encoding on the M second to-be-encoded blocks, respectively, to obtain M second encoding blocks;
  • the transceiver unit 1501 is further configured to send M second coding blocks to the second communication device.
  • the second order is that the qth information bit sub-block of each information bit block is located in the (Qq)*K/Q+1th to (Q-q+1)th block of the second to-be-coded block. )*K/Q reliable location.
  • the first order and the second order satisfy the following mapping relationship:
  • a q is any arbitrary Q information bit sub-block information bit blocks in one information bit sub-blocks
  • F is the polar code generation Matrix
  • P is a positive integer and satisfies 2 P-1 ⁇ Q ⁇ 2 P
  • t satisfies 1 ⁇ t ⁇ 2 P.
  • the processing unit 1502 is further configured to place the Q information bit sub-blocks of each information bit block in the Q-th of the M third to-be-coded blocks in the second order.
  • the second order adopted by the third block to be coded is different from the second order adopted by the second block to be coded;
  • the processing unit 1502 is further configured to perform polar code encoding on the M third to-be-encoded blocks, respectively, to obtain M third encoding blocks;
  • the transceiver unit 1501 is further configured to send M third coding blocks to the second communication device.
  • the processing unit 1502 is further configured to map the Q information bit sub-blocks of each information bit block from the binary domain to the 2w base domain to obtain any piece of information after the mapping.
  • the bit block is in, Is any information bit sub-block in any information bit block after mapping, Is a sequence of length K/wQ, w is a positive integer greater than 1;
  • the processing unit 1502 is further configured to convert the Q information bit sub-blocks of each mapped information bit block, where the Q information bit sub-blocks of any mapped information bit block and the corresponding Q information bit sub-blocks after the conversion are The following relationships are satisfied between bit sub-blocks:
  • H n is the universal decoding matrix UDM of K/w ⁇ K/w in the 2 w system domain, n is used to indicate the nth transmission; n satisfies n ⁇ [1,2 ,...,N], N is the total number of transmissions by the first communication device, and N is a positive integer greater than 3;
  • the processing unit 1502 is also used to Perform de-mapping to obtain The corresponding information bit block after de-mapping is [A n,1 ,A n,2 ,...,A n,Q ]; where A n,Q is a binary sequence of length K/Q;
  • the processing unit 1502 is further configured to place the Q information bit sub-blocks of any information bit block after de-mapping into the M n-th to-be-coded blocks in the first order;
  • the processing unit 1502 is further configured to perform polar code encoding on the M n-th to-be-encoded blocks, respectively, to obtain M n-th encoding blocks;
  • the transceiver unit 1501 is further configured to send M n-th code blocks to the second communication device.
  • any coding block carries at least one information bit sub-block and at most Q information bit sub-blocks; wherein, the coding block includes the first coding block to the n-th coding block.
  • each coding block is arranged in sequence according to the identifier of the coding block, wherein the first coding block carries a sub-block of information bits; the number of information bit blocks carried by the first to Qth coding blocks is according to The sequence of coding blocks is increased by one sequentially.
  • the Q-th coding block carries Q sub-blocks of information bits; the number of sub-blocks carrying information bits from the Q+1-th coding block to the M-th coding block is in accordance with the sequence of the coding blocks. Decrease by one in turn; the M-th coded block carries a sub-block of information bits.
  • Q is the quantization order of the code rate R, and Q is a positive integer;
  • the coding rate of the coding block r j (M-j+1) ⁇ R/Q, and j satisfies Q+1 ⁇ j ⁇ M.
  • FIG. 16 is a schematic structural diagram of a communication device provided by an embodiment of the present application.
  • the communication device may be a device (for example, a chip) capable of performing the data processing function described in the embodiment of the present application.
  • the communication device 1600 may include a transceiver 1601, at least one processor 1602, and a memory 1603.
  • the transceiver 1601, the processor 1602, and the memory 1603 may be connected to each other through one or more communication buses, or may be connected in other ways.
  • the transceiver 1601 can be used to send data or receive data. It can be understood that the transceiver 1601 is a general term and may include a receiver and a transmitter. For example, the receiver is used to obtain blocks of information bits. For another example, the transmitter is used to transmit the first coding block.
  • the processor 1602 may be used to process data of the communication device, or process information to be sent by the transceiver 1601. For example, the processor 1602 may call the program code stored in the memory 1603 to realize the sorting of the information bit sub-blocks in the first block to be coded.
  • the processor 1602 may include one or more processors.
  • the processor 1602 may be one or more central processing units (CPUs), network processors (NPs), hardware chips, or any combination thereof .
  • the processor 1602 is a CPU
  • the CPU may be a single-core CPU or a multi-core CPU.
  • the memory 1603 is used to store program codes and the like.
  • the memory 1603 may include volatile memory (volatile memory), such as random access memory (random access memory, RAM); the memory 1603 may also include non-volatile memory (non-volatile memory), such as read-only memory (read-only memory). Only memory (ROM), flash memory (flash memory), hard disk drive (HDD), or solid-state drive (SSD); the memory 1603 may also include a combination of the foregoing types of memories.
  • processor 1602 and memory 1603 may be coupled through an interface, or may be integrated together, which is not limited in this embodiment.
  • transceiver 1601 and processor 1602 may be used to implement the data processing method in the embodiment of the present application, where the specific implementation manner is as follows:
  • the transceiver 1601 is used to obtain X information bit blocks, one information bit block includes K information bits; one information bit block is divided into Q information bit sub-blocks, and one information bit sub-block is binary with a length of K/Q sequence;
  • the processor 1602 is configured to place the Q information bit sub-blocks of each information bit block in the Q first to-be-coded blocks of the M first to-be-coded blocks in a first order, where the first order is for each piece of information
  • the processor 1602 is further configured to perform polar code encoding on the M first to-be-encoded blocks, respectively, to obtain M first encoding blocks;
  • the transceiver 1601 is further configured to send M first coding blocks to the second communication device;
  • the processor 1602 is further configured to place the Q information bit sub-blocks of each information bit block in the Q second to-be-coded blocks of the M second to-be-coded blocks in the second order, and the first The second order and the first order satisfy the mapping relationship;
  • the processor 1602 is further configured to perform polar code encoding on the M second to-be-encoded blocks, respectively, to obtain M second encoding blocks;
  • the transceiver 1601 is also used to send M second coding blocks to the second communication device.
  • the second order is that the qth information bit sub-block of each information bit block is located in the (Qq)*K/Q+1th to (Q-q+1)th block of the second to-be-coded block. )*K/Q reliable location.
  • the first order and the second order satisfy the following mapping relationship:
  • a q is any arbitrary Q information bit sub-block information bit blocks in one information bit sub-blocks
  • F is the polar code generation Matrix
  • P is a positive integer and satisfies 2 P-1 ⁇ Q ⁇ 2 P
  • t satisfies 1 ⁇ t ⁇ 2 P.
  • processor 1602 is further configured to:
  • the Q information bit sub-blocks of each information bit block are placed in Q third blocks to be coded among the M third blocks to be coded in the second order; the third block to be coded
  • the second order adopted is different from the second order adopted for the second block to be coded;
  • the transceiver 1601 is also used to send M third coding blocks to the second communication device.
  • processor 1602 is further configured to:
  • the Q information bit sub-blocks of each information bit block are mapped from the binary domain to the 2 w binary domain, and any information bit block after mapping is obtained as in, Is any information bit sub-block in any information bit block after mapping, Is a sequence of length K/wQ, w is a positive integer greater than 1;
  • the Q information bit sub-blocks of each mapped information bit block are converted, wherein the Q information bit sub-blocks of any mapped information bit block and the corresponding Q information bit sub-blocks after conversion satisfy the requirement.
  • H n is the universal decoding matrix UDM of K/w ⁇ K/w in the 2 w system domain, n is used to indicate the nth transmission; n satisfies n ⁇ [1,2 ,...,N], N is the total number of transmissions by the first communication device, and N is a positive integer greater than 3;
  • the corresponding information bit block after de-mapping is [A n,1 ,A n,2 ,...,A n,Q ]; where A n,Q is a binary sequence of length K/Q;
  • the transceiver 1601 is also used to send M n-th code blocks to the second communication device.
  • any coded block carries at least one information bit sub-block and at most Q information bit sub-blocks; wherein, the coded block includes a first coded block and a second coded block.
  • each coding block is arranged in sequence according to the identifier of the coding block, wherein the first coding block carries a sub-block of information bits; the number of information bit blocks carried by the first to Qth coding blocks is according to The sequence of coding blocks is increased by one sequentially, and the Q-th coding block carries Q sub-blocks of information bits.
  • the number of sub-blocks carrying information bits from the Q+1 encoding block to the M-th encoding block is sequentially reduced by one according to the sequence of the encoding blocks; the M-th encoding block carries one information bit sub-block.
  • Q is the quantization order of the code rate R, and Q is a positive integer.
  • An embodiment of the present application provides a communication device. As shown in FIG. 17, the communication device is configured to execute the method executed by the second communication device in the foregoing method embodiment, which specifically includes:
  • the transceiving unit 1701 is configured to receive M first coding blocks initially transmitted by the first communication device, where the M first coding blocks are obtained by performing polar code coding on the M first to-be-coded blocks; the M first to-be-coded blocks carry X information bit blocks, each information bit block is divided into Q information bit sub-blocks, and Q information bit sub-blocks of each information bit block are placed in Q of the M first to-be-coded blocks in the first order In the first block to be coded, the first order is that the qth information bit sub-block of each information bit block is located in the (q-1)*K/Q+1 to q*Kth block of the first block to be coded.
  • the transceiving unit 1701 is also configured to receive M second coding blocks retransmitted by the first communication device.
  • the M second coding blocks are obtained by polar code coding of the M second blocks to be coded;
  • Q of each information bit block The information bit sub-blocks are placed in Q second to-be-coded blocks of the M second to-be-coded blocks according to the second order, and the second order and the first order satisfy the mapping relationship;
  • the processing unit 1702 is configured to combine and decode the M first coded blocks and M second coded blocks to obtain decoded data.
  • the second order is that the qth information bit sub-block of each information bit block is located in the (Qq)*K/Q+1th to (Q-q+1)th block of the second to-be-coded block. )*K/Q reliable location.
  • the first order and the second order satisfy the following mapping relationship:
  • a q is any arbitrary Q information bit sub-block information bit blocks in one information bit sub-blocks
  • F is the polar code generation Matrix
  • P is a positive integer and satisfies 2 P-1 ⁇ Q ⁇ 2 P
  • t satisfies 1 ⁇ t ⁇ 2 P.
  • the processing unit 1702 is configured to combine and decode M first code blocks and M second code blocks to obtain decoded data, which specifically includes:
  • Decoding to obtain k 2 information bit sub-blocks included in the information bit block carried by the second block to be coded k 2 satisfies 1 ⁇ k 2 ⁇ Q, k 1 +k 2 ⁇ Q;
  • the Q information bit sub-blocks included in the acquired information bit block are [a 1 , a 2 ,..., a Q ].
  • the transceiving unit 1701 is further configured to receive M third coding blocks retransmitted by the first communication device, where the M third coding blocks are obtained by polar code coding of the M third to-be-coded blocks.
  • the Q information bit sub-blocks of each information bit block are placed in Q third to-be-coded blocks in the M third to-be-coded blocks in the second order.
  • the second order adopted by the third block to be coded is different from the second order adopted by the second block to be coded.
  • the processing unit 1702 is further configured to Decoding to obtain k 1 information bit sub-blocks included in one information bit block carried by the first block to be coded And k 2 information bit sub-blocks included in the information bit block carried by the second block to be coded k 1 and k 2 satisfy k 1 +k 2 ⁇ Q.
  • the processing unit 1702 is further configured to decode and obtain k 3 information bit sub-blocks included in the information bit block carried by the third block to be coded k 3 satisfies 1 ⁇ k 3 ⁇ Q, and k 1 , k 2 and k 3 satisfies k 1 +k 2 +k 3 ⁇ Q.
  • the processing unit 1702 is further configured to obtain the k 3 information bit sub-blocks corresponding to the k 3 information bit sub-blocks before mapping according to the mapping relationship between the first order and the second order as
  • the processing unit 1702 is further configured to obtain the Q information bit sub-blocks included in the information bit block as [a 1 , a 2 ,..., a Q ].
  • the transceiving unit 1701 is further configured to receive M n-th encoding blocks retransmitted by the first communication device, where the M n-th encoding blocks are obtained by polar code encoding of M n-th to-be-encoded blocks.
  • the Q information bit sub-blocks of each processed information bit block are placed in the Q n-th to-be-coded blocks in the M n-th to-be-coded blocks in the first order.
  • the processing unit 1702 is further configured to combine and decode the M first coded blocks up to the M nth coded block to obtain decoded data.
  • each information bit block satisfies the following conditions:
  • the Q information bit sub-blocks of each information bit block are mapped from the binary domain to the 2 w binary domain, and any information bit block after mapping satisfies in, Is any information bit sub-block in any information bit block after mapping, It is a 2 w base sequence of length K/wQ, and w is a positive integer greater than 1.
  • any information bit block after mapping and the corresponding information bit block after conversion satisfy the following relationship:
  • H n is the universal decoding matrix UDM of K/w ⁇ K/w in the 2 w hexadecimal domain, and n is used to indicate the nth transmission.
  • n satisfies n ⁇ [1,2,...,N], N is the total number of transmissions by the first communication device, and N is a positive integer greater than 3.
  • the corresponding information bit block satisfies [A n,1 ,A n,2 ,...,A n,Q ]; where A n,Q is a binary sequence of length K/Q.
  • any coded block carries at least one information bit sub-block and at most Q information bit sub-blocks; wherein, the coded block includes a first coded block and a second coded block.
  • each coding block is arranged in sequence according to the identifier of the coding block, wherein the first coding block carries a sub-block of information bits; the number of information bit blocks carried by the first to Qth coding blocks is according to The sequence of coding blocks is increased by one, the Q-th coding block carries Q information bit sub-blocks; the number of Q+1 to M-th coding blocks carrying information bit sub-blocks decreases in sequence according to the sequence of the coding blocks One; the M-th coded block carries a sub-block of information bits.
  • Q is the quantization order of the code rate R, and Q is a positive integer.
  • FIG. 18 is a schematic structural diagram of a communication device provided by an embodiment of the present application.
  • the communication device may be a device (for example, a chip) that has the data processing function described in the embodiment of the present application.
  • the communication device 1800 may include a transceiver 1801, at least one processor 1802, and a memory 1803. Among them, the transceiver 1801, the processor 1802, and the memory 1803 may be connected to each other through one or more communication buses, or may be connected in other ways.
  • the transceiver 1801 can be used to send data or receive data. It can be understood that the transceiver 1801 is a general term and may include a receiver and a transmitter. For example, the receiver is used to obtain blocks of information bits. For another example, the transmitter is used to transmit the first coding block.
  • the processor 1802 may be used to process data of the communication device, or process data received by the transceiver 1801. For example, the processor 1802 may call the program code stored in the memory 1803 to realize the combined decoding of the received data.
  • the processor 1802 may include one or more processors.
  • the processor 1802 may be one or more central processing units (CPU), network processors (NP), hardware chips, or any combination thereof .
  • the processor 1802 is a CPU
  • the CPU may be a single-core CPU or a multi-core CPU.
  • the memory 1803 is used to store program codes and the like.
  • the memory 1803 may include a volatile memory (volatile memory), such as a random access memory (random access memory, RAM); the memory 1803 may also include a non-volatile memory (non-volatile memory), such as a read-only memory (read-only memory).
  • volatile memory volatile memory
  • non-volatile memory non-volatile memory
  • read-only memory read-only memory
  • the memory 1803 may also include a combination of the foregoing types of memories.
  • processor 1802 and memory 1803 may be coupled through an interface, or may be integrated together, which is not limited in this embodiment.
  • transceiver 1801 and processor 1802 may be used to implement the data processing method in the embodiment of the present application, where the specific implementation manner is as follows:
  • the transceiver 1801 is configured to receive M first coding blocks initially transmitted by the first communication device, where the M first coding blocks are obtained by performing polar code coding on the M first to-be-coded blocks.
  • the M first to-be-coded blocks carry X information bit blocks, and each information bit block is divided into Q information bit sub-blocks.
  • the Q information bit sub-blocks of each information bit block are placed in the Q first to be coded blocks among the M first to be coded blocks in a first order.
  • the transceiver 1801 is further configured to receive M second coding blocks retransmitted by the first communication device, where the M second coding blocks are obtained by polar code coding of the M second to-be-coded blocks.
  • the Q information bit sub-blocks of each information bit block are placed in the Q second to-be-coded blocks of the M second to-be-coded blocks in a second order, and the second order and the first order satisfy the mapping relationship.
  • the processor 1802 is configured to combine and decode the M first coded blocks and M second coded blocks to obtain decoded data.
  • the processor 1802 is configured to combine and decode M first code blocks and M second code blocks to obtain decoded data, which is specifically used for:
  • Decoding to obtain k 2 information bit sub-blocks included in the information bit block carried by the second block to be coded k 2 satisfies 1 ⁇ k 2 ⁇ Q, k 1 +k 2 ⁇ Q;
  • the Q information bit sub-blocks included in the acquired information bit block are [a 1 , a 2 ,..., a Q ].
  • the transceiver is further configured to receive M third coding blocks retransmitted by the first communication device, where the M third coding blocks are obtained by polar code coding of M third to-be-coded blocks.
  • the Q information bit sub-blocks of each information bit block are placed in Q third to-be-coded blocks in the M third to-be-coded blocks in the second order.
  • the second order adopted by the third block to be coded is different from the second order adopted by the second block to be coded.
  • the processor 1802 is further configured to:
  • the k 3 information bit sub-blocks corresponding to the k 3 information bit sub-blocks before mapping are obtained as
  • the Q information bit sub-blocks included in the acquired information bit block are [a 1 , a 2 ,..., a Q ].
  • the transceiver 1801 is further configured to receive M n-th coding blocks retransmitted by the first communication device, where the M n-th coding blocks are obtained by polar code coding of M n-th to-be-coded blocks.
  • the Q information bit sub-blocks of each processed information bit block are placed in the Q n-th to-be-coded blocks in the M n-th to-be-coded blocks in the first order.
  • the processor 1802 is further configured to combine and decode the M first coded blocks up to the M nth coded blocks to obtain decoded data.
  • each information bit block satisfies the following conditions:
  • the Q information bit sub-blocks of each information bit block are mapped from the binary domain to the 2 w binary domain, and any information bit block after mapping satisfies in, Is any information bit sub-block in any information bit block after mapping, It is a 2 w base sequence of length K/wQ, and w is a positive integer greater than 1.
  • any information bit block after mapping and the corresponding information bit block after conversion satisfy the following relationship:
  • H n is the universal decoding matrix UDM of K/w ⁇ K/w in the 2w constellation domain, and n is used to indicate the nth transmission.
  • n satisfies n ⁇ [1,2,...,N], N is the total number of transmissions by the first communication device, and N is a positive integer greater than 3.
  • the corresponding information bit block satisfies [A n,1 ,A n,2 ,...,A n,Q ]; where A n,Q is a binary sequence of length K/Q.
  • any coded block carries at least one information bit sub-block and at most Q information bit sub-blocks; wherein, the coded block includes a first coded block and a second coded block.
  • each coding block is arranged in sequence according to the identifier of the coding block, wherein the first coding block carries a sub-block of information bits; the number of information bit blocks carried by the first to Qth coding blocks is according to The sequence of coding blocks is increased by one, the Q-th coding block carries Q information bit sub-blocks; the number of Q+1 to M-th coding blocks carrying information bit sub-blocks decreases in sequence according to the sequence of the coding blocks One; the M-th coded block carries a sub-block of information bits.
  • Q is the quantization order of the code rate R, and Q is a positive integer.
  • the embodiment of the present application provides a communication device, which is composed of an input interface, an output interface, and a logic circuit.
  • the input interface is used to input the data to be processed;
  • the logic circuit processes the data to be processed according to the method of the foregoing method embodiment to obtain the processed data;
  • the output interface is used to output the processed data.
  • the to-be-processed data input by the input interface includes the to-be-coded block in the foregoing method embodiment and the information bit sub-blocks in each to-be-coded block; wherein, the to-be-coded block includes the first to-be-coded block and the first to-be-coded block. Two blocks to be coded up to the nth block to be coded.
  • the logic circuit processes the data to be processed according to the method of the foregoing method embodiment, and obtains the processed data, which specifically includes:
  • the logic circuit sorts the information bit sub-blocks in the block to be coded according to the method of the foregoing method embodiment, and encodes the block to be coded, and obtains the code block corresponding to each block to be coded.
  • the processed data output by the output interface includes the encoding block in the foregoing method embodiment; wherein, the encoding block includes the first encoding block, the second encoding block, and the n-th encoding block.
  • the to-be-processed data input by the input interface includes the encoding block in the foregoing method embodiment; wherein, the encoding block includes the first encoding block, the second encoding block, and the n-th encoding block.
  • the logic circuit processes the data to be processed according to the method of the foregoing method embodiment, and obtains the processed data, which specifically includes:
  • the logic circuit merges and decodes the coded blocks according to the method of the foregoing method embodiment, and obtains the to-be-coded block corresponding to each coded block.
  • the processed data output by the output interface includes the block to be coded in the foregoing method embodiment and the information bit sub-blocks in each block to be coded; wherein the block to be coded includes the first block to be coded and the first block to be coded. Two blocks to be coded up to the nth block to be coded.
  • An embodiment of the present application provides a communication system, which includes the first communication device and the second communication device described in the foregoing embodiment.
  • the embodiment of the present application provides a computer-readable storage medium that stores a program or instruction, and when the program or instruction runs on a computer, the computer executes the data processing method in the embodiment of the present application.
  • the embodiment of the application provides a chip or a chip system.
  • the chip or chip system includes at least one processor and an interface.
  • the interface and the at least one processor are interconnected through a wire, and the at least one processor is used to run a computer program or instruction to perform the application.
  • the data processing method in the embodiment is not limited to:
  • the interface in the chip can be an input/output interface, a pin, or a circuit.
  • the chip system in the above aspect may be a system on chip (SOC), or a baseband chip, etc., where the baseband chip may include a processor, a channel encoder, a digital signal processor, a modem, and an interface module.
  • SOC system on chip
  • baseband chip may include a processor, a channel encoder, a digital signal processor, a modem, and an interface module.
  • the chip or chip system described above in this application further includes at least one memory, and instructions are stored in the at least one memory.
  • the memory may be a storage unit inside the chip, for example, a register, a cache, etc., or a storage unit of the chip (for example, a read-only memory, a random access memory, etc.).
  • the above embodiments it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof.
  • software it can be implemented in the form of a computer program product in whole or in part.
  • the computer program product includes one or more computer instructions.
  • the computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices.
  • Computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium.
  • computer instructions may be transmitted from a website, computer, server, or data center through a cable (such as Coaxial cable, optical fiber, Digital Subscriber Line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) to transmit to another website, computer, server or data center.
  • the computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or a data center integrated with one or more available media.
  • the usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a high-density digital video disc (Digital Video Disc, DVD)), or a semiconductor medium (for example, a solid state disk (Solid State Disk, SSD)) etc.
  • a magnetic medium for example, a floppy disk, a hard disk, a magnetic tape
  • an optical medium for example, a high-density digital video disc (Digital Video Disc, DVD)
  • a semiconductor medium for example, a solid state disk (Solid State Disk, SSD)

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Error Detection And Correction (AREA)

Abstract

本申请实施例公开了一种数据处理方法、装置及设备，该数据处理方法可以由第一通信设备所执行，第一通信设备为编码数据的发送端。第一通信设备在每一次传输时，将信息比特按照指定的顺序置于编码块中，使得只要满足多次传输的信道容量之和大于或等于信息传输速率的条件，第一通信设备就能实现接近于信道容量的传输。

Description

一种数据处理方法、装置及设备
本申请要求在2020年4月14日提交中国专利局、申请号为202010291987.2、申请名称为“一种数据处理方法、装置及设备”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，尤其涉及一种数据处理方法、装置及设备。
背景技术
在通信系统中，由于无线信道存在信号衰落的问题，无线信号的接收端可能无法对接收到的信息进行正确译码，从而无法获取准确的信息。混合自动重传请求(hybrid automatic repeat request，HARQ)技术是一种将前向纠错编码(forward error correction，FEC)和自动重传请求(automatic repeat request，ARQ)相结合的技术。传统的HARQ的工作原理为：当接收端无法对接收到的信息进行正确译码时，接收端会保留接收到的数据，并要求发送端重新发送之前传输的信息。接收端收到重传的信息后，将重传的信息和之前接收到的信息进行合并后再译码。可见，接收端要正确译码出发送端发出的所有比特，可能需要进行多次重传。但是传统的HARQ在多次重传时，传输效率较低。
发明内容
本申请实施例提供一种数据处理方法、装置及设备，该数据处理方法使得只要满足多次传输的信道容量之和大于或等于信息传输速率的条件，就能实现接近于信道容量的传输。
第一方面，本申请实施例提供一种数据处理方法，该方法可以由第一通信设备所执行。其中，第一通信设备可以是编码数据的发送端。第一通信设备可以获取X个信息比特块，其中，一个信息比特块包括K个信息比特，并且一个信息比特块被划分为Q个信息比特子块。其中，一个信息比特子块为长度为K/Q的二进制序列。第一通信设备将每一个信息比特块的Q个信息比特子块按照第一顺序置于M个第一待编码块中的Q个第一待编码块中。其中，第一顺序为每一个信息比特块的第q个信息比特子块位于所在第一待编码块的第(q-1)*K/Q+1至第q*K/Q可靠的位置，q满足1≤q≤Q，M满足M＝X+Q-1。第一通信设备对M个第一待编码块分别进行polar码编码，获取M个第一编码块，并且向第二通信设备发送所述M个第一编码块。
当需要重传时，第一通信设备将每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第二待编码块中的Q个第二待编码块中，第二顺序与第一顺序满足映射关系。第一通信设备对M个第二待编码块分别进行polar码编码，获取M个第二编码块，并且向第二通信设备发送M个第二编码块。
可见，第一通信设备向第二通信设备初传M个第一编码块时，M个第一编码块中的多个信息比特子块按照第一顺序排列，有利于第二通信设备正确译码。若第二通信设备译码失败，第一通信设备可以向第二通信设备重传M个第二编码块，M个第二编码块中的多个信息比特子块按照第二顺序排列，且第二顺序与第一顺序满足映射关系，有利于第二 通信设备根据第一编码块和第二编码块正确译码。只要满足多次传输的信道容量之和大于或等于信息传输速率的条件，第一通信设备就能实现接近于信道容量的传输。
在一种可能的设计中，第二顺序为每一个信息比特块的第q个信息比特子块位于所在第二待编码块的第(Q-q)*K/Q+1至第(Q-q+1)*K/Q可靠的位置。可见，对于每一个信息比特块中的信息比特子块而言，第二顺序为第一顺序的反序。第二待编码块中的信息比特子块按照第二顺序排列，有利于第二通信设备正确译码。
在一种可能的设计中，第一顺序和第二顺序满足以下映射关系：
Figure PCTCN2021082192-appb-000001
其中，a q为任意一个信息比特块的Q个信息比特子块中的任意一个信息比特子块，A t为任意一个信息比特子块映射后对应的信息比特子块，F为polar码的生成矩阵，J为正整数且满足K/Q＝2 J，P为正整数且满足2 P-1≤Q≤2 P，t满足1≤t≤2 P。
可见，对于每一个信息比特块中的信息比特子块的排序，第二顺序为第一顺序按照映射关系映射得到的。其中，该映射关系可以是第一顺序按照polar码的生成矩阵映射得到，有利于第二通信设备正确译码。
在一种可能的设计中，当需要重传时，第一通信设备将每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第三待编码块中的Q个第三待编码块中。其中，第三待编码块采用的第二顺序与第二待编码块采用的第二顺序不同。第一通信设备对M个第三待编码块分别进行polar码编码，获取M个第三编码块，并且向第二通信设备发送M个第三编码块。
可见，第一通信设备再次重传M个第三编码块时，M个第三编码块中的多个信息比特子块也可以按照第二顺序排列，有利于第二通信设备根据第一编码块、第二编码块和第三编码块正确译码。
在一种可能的设计中，当需要重传时，第一通信设备将每一个信息比特块的Q个信息比特子块从二进制域映射至2 w进制域，获取映射后的任意一个信息比特块为
Figure PCTCN2021082192-appb-000002
其中，
Figure PCTCN2021082192-appb-000003
为映射后的任意一个信息比特块中的任意一个信息比特子块，
Figure PCTCN2021082192-appb-000004
为长度为K/wQ的2 w进制序列，w为大于1的正整数；
第一通信设备将每一个映射后的信息比特块的Q个信息比特子块进行转换，其中，任意一个映射后的信息比特块的Q个信息比特子块与转换后对应的Q个信息比特子块之间满足以下关系：
Figure PCTCN2021082192-appb-000005
其中，
Figure PCTCN2021082192-appb-000006
为
Figure PCTCN2021082192-appb-000007
转换后对应的信息比特子块，H n为在2 w进制域上的K/w×K/w的通用解码矩阵UDM，n用于指示第n次传输；n满足n∈[1,2,...,N]，N为第一通信设备传输的总次数，且N为大于3的正整数；
第一通信设备将
Figure PCTCN2021082192-appb-000008
进行反映射，获取
Figure PCTCN2021082192-appb-000009
反映射后对应的信息比特块为[A n,1,A n,2,...,A n,Q]；其中，A n,Q为长度为K/Q的二进制序列；
第一通信设备将反映射后的任意一个信息比特块的Q个信息比特子块按照第一顺序置于M个第n待编码块中。
第一通信设备对M个第n待编码块分别进行polar码编码，获取M个第n编码块，并且向第二通信设备发送M个第n编码块。
可见，当第一通信设备的传输次数超过三次时，由于三次或三次以上的重传在多进制 域进行，那么第一通信设备需要将M个第n待编码块中的多个信息比特子块进行相应的处理，再对M个第n待编码块进行编码。
在一种可能的设计中，任意一个编码块至少承载一个信息比特子块，至多承载Q个信息比特子块；其中，编码块包括第一编码块和第二编码块。
在一种可能的设计中，每个编码块按照编码块的标识依次排列，其中，第一个编码块承载一个信息比特子块；第一个至第Q个编码块承载的信息比特块的数量按照编码块的排列顺序，依次增加一个，第Q个编码块承载Q个信息比特子块。第Q+1个编码块至第M个编码块承载信息比特子块的数量按照编码块的排列顺序，依次减少一个；第M个编码块承载一个信息比特子块。
可见，在不考虑码率损失的情况下，编码块承载的信息比特子块的数量从1个依次增加至Q个，然后再从Q个依次减少至1个。采用该排列方式可以使M个编码块承载完整的X个信息比特块。
在一种可能的设计中，Q为码率R的量化阶数，Q为正整数。第i个编码块的码率r i＝i×R/Q，i满足1≤i≤Q。第j个编码块的码率r j＝(M-j+1)×R/Q，j满足Q+1≤j≤M。可见，在不考虑码率损失的情况下，编码块的码率从R/Q逐渐增加至R，然后再从R逐渐降低至R/Q。
第二方面，本申请实施例提供一种数据处理方法，该方法可以由第二通信设备所执行。其中，第二通信设备可以是编码数据的接收端。第二通信设备接收第一通信设备初传的M个第一编码块，该M个第一编码块是M个第一待编码块进行polar码编码得到的。其中，M个第一待编码块承载X个信息比特块，每一个信息比特块被划分为Q个信息比特子块。每一个信息比特块的Q个信息比特子块按照第一顺序置于M个第一待编码块中的Q个第一待编码块中。其中，第一顺序为每一个信息比特块的第q个信息比特子块位于所在第一待编码块的第(q-1)*K/Q+1至第q*K/Q可靠的位置，q满足1≤q≤Q，M满足M＝X+Q-1。
第二通信设备再次接收第一通信设备重传的M个第二编码块，该M个第二编码块是M个第二待编码块进行polar码编码得到的。每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第二待编码块中的Q个第二待编码块中，第二顺序与第一顺序满足映射关系。第二通信设备可以将M个第一编码块和M个第二编码块进行合并译码，获取译码数据。
可见，第二通信设备接收第一通信设备初传的M个第一编码块时，M个第一编码块中的多个信息比特子块按照第一顺序排列，有利于第二通信设备正确译码。若第二通信设备译码失败，第二通信设备可以接收第一通信设备重传的M个第二编码块，M个第二编码块中的多个信息比特子块按照第二顺序排列，且第二顺序与第一顺序满足映射关系，有利于第二通信设备根据第一编码块和第二编码块正确译码。
在一种可能的设计中，第二顺序为每一个信息比特块的第q个信息比特子块位于所在第二待编码块的第(Q-q)*K/Q+1至第(Q-q+1)*K/Q可靠的位置。
在一种可能的设计中，第一顺序和第二顺序满足以下映射关系：
Figure PCTCN2021082192-appb-000010
其中，a q为任意一个信息比特块的Q个信息比特子块中的任意一个信息比特子块，A t为任意一个信息比特子块映射后对应的信息比特子块，F为polar码的生成矩阵，J为正整数且满足K/Q＝2 J，P为正整数且满足2 P-1≤Q≤2 P；t满足1≤t≤2 P。
在一种可能的设计中，第二通信设备将M个第一编码块和M个第二编码块进行合并 译码，获取译码数据，包括：
若第一通信设备两次传输的信道容量之和大于或等于码率R，第二通信设备译码获取第一待编码块承载的一个信息比特块包括的k 1个信息比特子块
Figure PCTCN2021082192-appb-000011
k 1满足1≤k 1≤Q；
第二通信设备译码获取第二待编码块承载的该信息比特块包括的k 2个信息比特子块
Figure PCTCN2021082192-appb-000012
k 2满足1≤k 2≤Q，k 1+k 2≥Q；
第二通信设备获取该信息比特块包括的Q个信息比特子块为[a 1,a 2,...,a Q]。
可见，若第一通信设备两次传输的信道容量之和大于或等于码率R，由于第一编码块和第二编码块的排列方式按照上述第一顺序和第二顺序，第二通信设备通过两次译码可以实现正确译码。
在一种可能的设计中，若第二通信设备译码失败，第二通信设备接收第一通信设备重传的M个第三编码块，该M个第三编码块是M个第三待编码块进行polar码编码得到的。每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第三待编码块中的Q个第三待编码块中。其中，第三待编码块采用的第二顺序与第二待编码块采用的第二顺序不同。
若第一通信设备两次传输的信道容量之和小于码率R，且第一通信设备三次传输的信道容量之和大于或等于码率R，第二通信设备译码获取第一待编码块承载的一个信息比特块包括的k 1个信息比特子块
Figure PCTCN2021082192-appb-000013
以及第二待编码块承载的该信息比特块包括的k 2个信息比特子块
Figure PCTCN2021082192-appb-000014
其中，k 1和k 2满足k 1+k 2<Q；
第二通信设备译码获取第三待编码块承载的该信息比特块包括的k 3个信息比特子块
Figure PCTCN2021082192-appb-000015
k 3满足1≤k 3≤Q，并且k 1、k 2和k 3满足k 1+k 2+k 3≥Q；
第二通信设备根据第一顺序和第二顺序的映射关系，获取k 3个信息比特子块映射前对应的k 3个信息比特子块为
Figure PCTCN2021082192-appb-000016
那么，第二通信设备可以获取该信息比特块包括的Q个信息比特子块为[a 1,a 2,...,a Q]。
可见，若第一通信设备两次传输的信道容量之和小于码率R，且第一通信设备三次传输的信道容量之和大于或等于码率R，由于第一编码块、第二编码块以及第三编码块的排列方式按照上述第一顺序和第二顺序，第二通信设备通过三次译码可以实现正确译码。
在一种可能的设计中，若第二通信设备译码失败，第二通信设备接收第一通信设备重传的M个第n编码块，该M个第n编码块是M个第n待编码块进行polar码编码得到的。每一个处理后的信息比特块的Q个信息比特子块按照第一顺序置于M个第n待编码块中的Q个所述第n待编码块中。第二通信设备将M个第一编码块直至M个第n编码块进行合并译码，获取译码数据。其中，对每一个所述信息比特块的处理满足以下条件：
每一个信息比特块的Q个信息比特子块从二进制域映射至2 w进制域，且映射后的任意一个信息比特块满足
Figure PCTCN2021082192-appb-000017
其中，
Figure PCTCN2021082192-appb-000018
为映射后的任意一个信息比特块中的任意一个信息比特子块，
Figure PCTCN2021082192-appb-000019
为长度为K/wQ的2 w进制序列，所述w为大于1的正整数；
所述映射后的任意一个信息比特块与转换后对应的信息比特块之间满足以下关系：
Figure PCTCN2021082192-appb-000020
其中，
Figure PCTCN2021082192-appb-000021
为
Figure PCTCN2021082192-appb-000022
转换后对应的信息比特子块，H n为在2 w进制域上的K/w×K/w的通用解码矩阵UDM，n用于指示第n次传输；n满足n∈[1,2,...,N]，N为第一通信设备传输的 总次数，且N为大于3的正整数；
Figure PCTCN2021082192-appb-000023
进行反映射后对应的信息比特块满足[A n,1,A n,2,...,A n,Q]；其中，A n,Q为长度为K/Q的二进制序列。
可见，若第二通信设备译码失败，第二通信设备可以接收第一通信设备多次重传的编码块。并且当第一通信设备的传输次数超过三次时，由于三次或三次以上的重传在多进制域进行，那么第一通信设备需要将M个第n待编码块中的多个信息比特子块进行相应的处理，再对M个第n待编码块进行编码。
在一种可能的设计中，任意一个编码块至少承载一个信息比特子块，至多承载Q个信息比特子块；其中，编码块包括第一编码块和第二编码块。
在一种可能的设计中，每个编码块按照编码块的标识依次排列，其中，第一个编码块承载一个信息比特子块；第一个至第Q个编码块承载的信息比特块的数量按照编码块的排列顺序，依次增加一个，第Q个编码块承载Q个信息比特子块；第Q+1个编码块至第M个编码块承载信息比特子块的数量按照编码块的排列顺序，依次减少一个；第M个编码块承载一个信息比特子块。
在一种可能的设计中，Q为码率R的量化阶数，Q为正整数。第i个编码块的码率r i＝i×R/Q，i满足1≤i≤Q。第j个编码块的码率r j＝(M-j+1)×R/Q，j满足Q+1≤j≤M。
第三方面，本申请实施例提供一种通信设备，该通信设备包括收发器和处理器；
收发器，用于获取X个信息比特块，一个信息比特块包括K个信息比特。一个信息比特块被划分为Q个信息比特子块，一个信息比特子块为长度为K/Q的二进制序列。
处理器，用于将每一个信息比特块的Q个信息比特子块按照第一顺序置于M个第一待编码块中的Q个第一待编码块中。其中，第一顺序为每一个信息比特块的第q个信息比特子块位于所在第一待编码块的第(q-1)*K/Q+1至第q*K/Q可靠的位置，q满足1≤q≤Q，M满足M＝X+Q-1。
处理器还用于对M个第一待编码块分别进行polar码编码，获取M个第一编码块。
收发器还用于向第二通信设备发送M个第一编码块。
当需要重传时，处理器还用于将每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第二待编码块中的Q个第二待编码块中，第二顺序与第一顺序满足映射关系。
处理器还用于对M个第二待编码块分别进行polar码编码，获取M个第二编码块。
收发器还用于向第二通信设备发送M个第二编码块。
在一种可能的设计中，第二顺序为每一个信息比特块的第q个信息比特子块位于所在第二待编码块的第(Q-q)*K/Q+1至第(Q-q+1)*K/Q可靠的位置。
在一种可能的设计中，第一顺序和第二顺序满足以下映射关系：
Figure PCTCN2021082192-appb-000024
其中，a q为任意一个信息比特块的Q个信息比特子块中的任意一个信息比特子块，A t为任意一个信息比特子块映射后对应的信息比特子块，F为polar码的生成矩阵，J为正整数且满足K/Q＝2 J，P为正整数且满足2 P-1≤Q≤2 P，t满足1≤t≤2 P。
在一种可能的设计中，处理器还用于：
当需要重传时，将每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第三待编码块中的Q个第三待编码块中；第三待编码块采用的第二顺序与第二待编码块采用的第二顺序不同；
对M个第三待编码块分别进行polar码编码，获取M个第三编码块；
收发器还用于向第二通信设备发送M个第三编码块。
在一种可能的设计中，处理器还用于：
当需要重传时，将每一个信息比特块的Q个信息比特子块从二进制域映射至2 w进制域，获取映射后的任意一个信息比特块为
Figure PCTCN2021082192-appb-000025
其中，
Figure PCTCN2021082192-appb-000026
为映射后的任意一个信息比特块中的任意一个信息比特子块，
Figure PCTCN2021082192-appb-000027
为长度为K/wQ的序列，w为大于1的正整数；
将每一个映射后的信息比特块的Q个信息比特子块进行转换，其中，任意一个映射后的信息比特块的Q个信息比特子块与转换后对应的Q个信息比特子块之间满足以下关系：
Figure PCTCN2021082192-appb-000028
其中，
Figure PCTCN2021082192-appb-000029
为
Figure PCTCN2021082192-appb-000030
转换后对应的信息比特子块，H n为在2 w进制域上的K/w×K/w的通用解码矩阵UDM，n用于指示第n次传输，n满足n∈[1,2,...,N]，N为第一通信设备传输的总次数，且N为大于3的正整数；
将
Figure PCTCN2021082192-appb-000031
进行反映射，获取
Figure PCTCN2021082192-appb-000032
反映射后对应的信息比特块为[A n,1,A n,2,...,A n,Q]；其中，A n,Q为长度为K/Q的二进制序列；
将反映射后的任意一个信息比特块的Q个信息比特子块按照第一顺序置于M个第n待编码块中；n满足3<n≤N，N为大于3的正整数。
对M个第n待编码块分别进行polar码编码，获取M个第n编码块；
收发器还用于向第二通信设备发送M个第n编码块。
在一种可能的设计中，任意一个编码块至少承载一个信息比特子块，至多承载Q个信息比特子块；其中，编码块包括第一编码块和第二编码块。
在一种可能的设计中，每个编码块按照编码块的标识依次排列，其中，第一个编码块承载一个信息比特子块；第一个至第Q个编码块承载的信息比特块的数量按照编码块的排列顺序，依次增加一个，第Q个编码块承载Q个信息比特子块。第Q+1个编码块至第M个编码块承载信息比特子块的数量按照编码块的排列顺序，依次减少一个；第M个编码块承载一个信息比特子块。
在一种可能的设计中，Q为码率R的量化阶数，Q为正整数。第i个编码块的码率r i＝i×R/Q，i满足1≤i≤Q。第j个编码块的码率r j＝(M-j+1)×R/Q，j满足Q+1≤j≤M。
第四方面，本申请实施例提供一种通信设备，该通信设备包括收发器和处理器；
收发器，用于接收第一通信设备初传的M个第一编码块，该M个第一编码块是M个第一待编码块进行polar码编码得到的。M个第一待编码块承载X个信息比特块，每一个信息比特块被划分为Q个信息比特子块。每一个信息比特块的Q个信息比特子块按照第一顺序置于M个第一待编码块中的Q个第一待编码块中。其中，第一顺序为每一个信息比特块的第q个信息比特子块位于所在第一待编码块的第(q-1)*K/Q+1至第q*K/Q可靠的位置；q满足1≤q≤Q，M满足M＝X+Q-1。
收发器还用于接收第一通信设备重传的M个第二编码块，该M个第二编码块是M个第二待编码块进行polar码编码得到的。每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第二待编码块中的Q个第二待编码块中，第二顺序与所述第一顺序满足映射关系。
处理器，用于将M个第一编码块和M个第二编码块进行合并译码，获取译码数据。
在一种可能的设计中，第二顺序为每一个信息比特块的第q个信息比特子块位于所在 第二待编码块的第(Q-q)*K/Q+1至第(Q-q+1)*K/Q可靠的位置。
在一种可能的设计中，第一顺序和第二顺序满足以下映射关系：
Figure PCTCN2021082192-appb-000033
其中，a q为任意一个信息比特块的Q个信息比特子块中的任意一个信息比特子块，A t为任意一个信息比特子块映射后对应的信息比特子块，F为polar码的生成矩阵，J为正整数且满足K/Q＝2 J，P为正整数且满足2 P-1≤Q≤2 P；t满足1≤t≤2 P。
在一种可能的设计中，处理器用于将M个第一编码块和M个第二编码块进行合并译码，获取译码数据，具体用于：
若第一通信设备两次传输的信道容量之和大于或等于码率R，译码获取第一待编码块承载的一个信息比特块包括的k 1个信息比特子块
Figure PCTCN2021082192-appb-000034
k 1满足1≤k 1≤Q；
译码获取第二待编码块承载的信息比特块包括的k 2个信息比特子块
Figure PCTCN2021082192-appb-000035
k 2满足1≤k 2≤Q，k 1+k 2≥Q；
获取信息比特块包括的Q个信息比特子块为[a 1,a 2,...,a Q]。
在一种可能的设计中，收发器还用于接收第一通信设备重传的M个第三编码块，该M个第三编码块是M个第三待编码块进行polar码编码得到的。每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第三待编码块中的Q个第三待编码块中。其中，第三待编码块采用的第二顺序与第二待编码块采用的第二顺序不同。
若第一通信设备两次传输的信道容量之和小于码率R，且第一通信设备三次传输的信道容量之和大于或等于码率R，处理器还用于：
译码获取第一待编码块承载的一个信息比特块包括的k 1个信息比特子块
Figure PCTCN2021082192-appb-000036
以及第二待编码块承载的该信息比特块包括的k 2个信息比特子块
Figure PCTCN2021082192-appb-000037
k 1和k 2满足k 1+k 2<Q。
译码获取所述第三待编码块承载的信息比特块包括的k 3个信息比特子块
Figure PCTCN2021082192-appb-000038
k 3满足1≤k 3≤Q，k 1、k 2和k 3满足k 1+k 2+k 3≥Q。
根据第一顺序和第二顺序的映射关系，获取k 3个信息比特子块映射前对应的k 3个信息比特子块为
Figure PCTCN2021082192-appb-000039
获取信息比特块包括的Q个信息比特子块为[a 1,a 2,...,a Q]。
在一种可能的设计中，收发器还用于接收第一通信设备重传的M个第n编码块，该M个第n编码块是M个第n待编码块进行polar码编码得到的。每一个处理后的信息比特块的Q个信息比特子块按照第一顺序置于M个第n待编码块中的Q个第n待编码块中。
处理器还用于将M个第一编码块直至M个第n编码块进行合并译码，获取译码数据。
其中，对每一个信息比特块的处理满足以下条件：
每一个信息比特块的Q个信息比特子块从二进制域映射至2 w进制域，且映射后的任意一个信息比特块满足
Figure PCTCN2021082192-appb-000040
其中，
Figure PCTCN2021082192-appb-000041
为映射后的任意一个信息比特块中的任意一个信息比特子块，
Figure PCTCN2021082192-appb-000042
为长度为K/wQ的2 w进制序列，w为大于1的正整数。
其中，映射后的任意一个信息比特块与转换后对应的信息比特块之间满足以下关系：
Figure PCTCN2021082192-appb-000043
Figure PCTCN2021082192-appb-000044
为
Figure PCTCN2021082192-appb-000045
转换后对应的信息比特子块，H n为在2 w进制域上的K/w×K/w的通用解码矩 阵UDM，n用于指示第n次传输。n满足n∈[1,2,...,N]，N为第一通信设备传输的总次数，且N为大于3的正整数。
Figure PCTCN2021082192-appb-000046
进行反映射后对应的信息比特块满足[A n,1,A n,2,...,A n,Q]；其中，A n,Q为长度为K/Q的二进制序列。
在一种可能的设计中，任意一个编码块至少承载一个信息比特子块，至多承载Q个信息比特子块；其中，编码块包括第一编码块和第二编码块。
在一种可能的设计中，每个编码块按照编码块的标识依次排列，其中，第一个编码块承载一个信息比特子块；第一个至第Q个编码块承载的信息比特块的数量按照编码块的排列顺序，依次增加一个，第Q个编码块承载Q个信息比特子块；第Q+1个至第M个编码块承载信息比特子块的数量按照编码块的排列顺序，依次减少一个；第M个编码块承载一个信息比特子块。
在一种可能的设计中，Q为码率R的量化阶数，Q为正整数。第i个编码块的码率r i＝i×R/Q，i满足1≤i≤Q。第j个编码块的码率r j＝(M-j+1)×R/Q，j满足Q+1≤j≤M。
第五方面，本申请实施例提供一种通信设备，该设备具有实现第一方面所提供的数据处理方法的功能。该功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。该硬件或软件包括一个或多个与上述功能相对应的模块。
第六方面，本申请实施例提供一种通信设备，该设备具有实现第二方面所提供的数据处理方法的功能。该功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。该硬件或软件包括一个或多个与上述功能相对应的模块。
第七方面，本申请实施例提供一种通信系统，该通信系统包括上述第二方面或第五方面提供的通信设备以及第三方面或第六方面提供的通信设备。
第八方面，本申请实施例提供一种计算机可读存储介质，该可读存储介质包括程序或指令，当所述程序或指令在计算机上运行时，使得计算机执行第一方面或第一方面中任一种可能实现方式中的方法。
第九方面，本申请实施例提供一种计算机可读存储介质，该可读存储介质包括程序或指令，当所述程序或指令在计算机上运行时，使得计算机执行第二方面或第二方面中任一种可能实现方式中的方法。
第十方面，本申请实施例提供一种芯片或者芯片系统，该芯片或者芯片系统包括至少一个处理器和接口，接口和至少一个处理器通过线路互联，至少一个处理器用于运行计算机程序或指令，以进行第一方面或第一方面的任一种可能的实现方式中任一项所描述的方法。
第十一方面，本申请实施例提供一种芯片或者芯片系统，该芯片或者芯片系统包括至少一个处理器和接口，接口和至少一个处理器通过线路互联，至少一个处理器用于运行计算机程序或指令，以进行第二方面或第二方面的任一种可能的实现方式中任一项所描述的方法。
其中，芯片中的接口可以为输入/输出接口、管脚或电路等。
上述方面中的芯片系统可以是片上系统(system on chip，SOC)，也可以是基带芯片等，其中基带芯片可以包括处理器、信道编码器、数字信号处理器、调制解调器和接口模块等。
在一种可能的实现中，本申请中上述描述的芯片或者芯片系统还包括至少一个存储器，该至少一个存储器中存储有指令。该存储器可以为芯片内部的存储单元，例如，寄存器、 缓存等，也可以是该芯片的存储单元(例如，只读存储器、随机存取存储器等)。
第十二方面，本申请实施例提供一种计算机程序或计算机程序产品，包括代码或指令，当代码或指令在计算机上运行时，使得计算机执行第一方面或第一方面中任一种可能实现方式中的方法。
第十三方面，本申请实施例提供一种计算机程序或计算机程序产品，包括代码或指令，当代码或指令在计算机上运行时，使得计算机执行第二方面或第二方面中任一种可能实现方式中的方法。
附图说明
图1为一种8×8的polar码编码示意图；
图2为本申请实施例提供的一种通信系统的示意图；
图3为本申请实施例提供的一种数据处理方法的流程示意图；
图4a和图4b为本申请实施例提供的一种信息比特块和信息比特子块的关系示意图；
图5a至图5e为本申请实施例提供的不同码率量化阶数下的第一待编码块的示意图；
图6为本申请实施例提供的一种信息比特子块在待编码块中的排列方式的示意图；
图7a至图7d为本申请实施例提供的不同码率量化阶数下的第一编码块的示意图；
图8a为本申请实施例提供的一种第一待编码块和第二待编码块的示意图；
图8b为本申请实施例提供的另一种第一待编码块和第二待编码块的示意图；
图8c为本申请实施例提供的一种第一编码块和第二编码块的示意图；
图9为本申请实施例提供的一种两次传输可以成功译码的区域以及码率损失区域的示意图；
图10为本申请实施例提供的另一种数据处理方法的流程示意图；
图11a为本申请实施例提供的一种三次传输时待编码块的示意图；
图11b为本申请实施例提供的另一种三次传输时待编码块的示意图；
图12a至图12c为本申请实施例提供的不同码率量化阶数下的三次传输时编码块的示意图；
图13为本申请实施例提供的另一种数据处理方法的流程示意图；
图14为本申请实施例提供的一种四次传输时编码块的示意图；
图15为本申请实施例提供的一种通信设备的结构示意图；
图16为本申请实施例提供的另一种通信设备的结构示意图；
图17为本申请实施例提供的另一种通信设备的结构示意图；
图18为本申请实施例提供的另一种通信设备的结构示意图。
具体实施方式
下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行描述。
Polar码是一种能够被严格证明达到信道容量的信道编码方案，polar码具有高性能，低复杂度，匹配方式灵活等特点。目前polar码已经被确定为第五代移动通信(the 5 thgeneration，5G)控制信道增强移动宽带(enhanced mobile broadband，eMBB)场景的上行和/或下行控制信道编码方案。
请参见图1，图1为一种8×8的polar码编码示意图，其中，待编码比特按照各自的可靠度进行排序，依次排列在待编码块中的不同位置。通常来说，可靠度较高的比特被设置为信息比特(data)，可靠度较低的比特被设置为固定比特(frozen)。固定比特的值通常设置为0，在实际传输中发送端和接收端都已知。如图1所示，u 7,u 6,u 5,u 3为可靠度靠前的四位比特，分别设置为信息比特；u 4,u 2,u 1,u 0为可靠度靠后的四位比特，分别设置为固定比特。
请参见图2，图2为本申请实施例提供的一种通信系统，该通信系统包括第一通信设备和第二通信设备。其中，第一通信设备为编码数据的发送端，用于向第二通信设备发送下行数据，或者接收来自第二通信设备的上行数据。例如，第一通信设备在向第二通信设备发送下行数据时，可以对待编码的信息比特进行polar码编码，信道编码后的数据经过星座调制后，可以通过下行数据信道发送给第二通信设备。
第二通信设备为编码数据的接收端，用于向第一通信设备发送上行数据，或者接收来自第一通信设备的下行数据。例如，第二通信设备在向第一通信设备发送上行数据时，可以对待编码的信息比特进行polar码编码，信道编码后的数据经过星座调制后，可以通过上行数据信道发送给第一通信设备。
其中，第一通信设备可以是任意一种具有无线收发功能的设备，为覆盖范围内的第二通信设备提供无线通信服务。接入网设备可以包括但不限于：长期演进(long term evolution，LTE)系统中的演进型基站(NodeB或eNB或e-NodeB，evolutional NodeB)，新一代无线接入技术(new radio access technology，NR)中的基站(gNodeB或gNB)或收发点(transmission receiving point/transmission reception point，TRP)，3GPP后续演进的基站，WiFi系统中的接入节点，无线中继节点，无线回传节点，车联网、D2D通信、机器通信中承担基站功能的设备，卫星等。
其中，第二通信设备可以是一种具有无线收发功能的终端设备，或者第二通信设备也可以是一种芯片。所述终端设备可以是用户设备(user equipment，UE)、手机(mobile phone)、平板电脑(Pad)、带无线收发功能的电脑、虚拟现实(virtual reality，VR)终端设备、增强现实(augmented reality，AR)终端设备、车载终端设备、远程医疗(remote medical)中的无线终端、智能电网(smart grid)中的无线终端、可穿戴终端设备等。
在图2所示的通信系统中，由于无线信道存在信号衰落的问题，无线信号的接收端可能无法对接收到的信息进行正确译码，从而无法获取准确的信息。混合自动重传请求(hybrid automatic repeat request，HARQ)技术是一种将前向纠错编码(forward error correction，FEC)和自动重传请求(automatic repeat request，ARQ)相结合的技术。传统的HARQ的工作原理为：当接收端无法对接收到的信息进行正确译码时，接收端会保留接收到的数据，并要求发送端重新发送之前传输的信息。接收端收到重传的信息后，将重传的信息和之前接收到的信息进行合并后再译码。
可见，接收端要正确译码出发送端发出的所有比特，可能需要进行多次重传，带来额外的时延。为了解决上述问题，本申请实施例提供一种数据处理方法，该数据处理方法可以由第一通信设备所执行。只要满足多次传输的信道容量之和大于或等于信息传输速率的条件，第一通信设备就能实现接近于信道容量的传输。
下面将结合具体的实施例进行描述。
本申请实施例提供一种数据处理方法，请参见图3。该数据处理方法可以由第一通信 设备和第二通信设备交互执行，包括以下步骤：
S301，第一通信设备获取X个信息比特块，一个信息比特块被划分为Q个信息比特子块；
S302，第一通信设备将每一个信息比特块的Q个信息比特子块按照第一顺序置于M个第一待编码块中的Q个第一待编码块中。
第一通信设备在对多个待编码的信息比特进行处理时，可以将多个待编码的信息比特划分到不同的信息比特块中。其中，一个信息比特块包括多个信息比特。例如，第一通信设备将每K个信息比特划分到一个信息比特块中，即一个信息比特块包括K个信息比特，如图4a所示。
每一个信息比特块可以被划分为Q个信息比特子块，即把K个信息比特划分到Q个信息比特子块，如图4a所示。其中，a q表示任意一个信息比特子块，a q为长度为K/Q的二进制序列，q满足1≤q≤Q。Q代表码率的量化阶数，Q为正整数。例如，如图4b所示的信息比特块和信息比特子块，码率的量化阶数为3，即Q＝3。
需要注意的是，若K/Q不是整数，本实施例在确定K/Q时可以最多补充Q-1个填充比特，以确保K/Q为整数。例如，若K＝100，Q＝3，此时K/Q不为整数。补充2个填充比特后，K/Q＝34，即a 1和a 2分别包括34个信息比特；a 3包括32个信息比特(另外两个为填充比特)。后续第一通信设备中的polar码编码器在对信息比特子块进行编码处理时，仅对每一个信息比特子块中的信息比特进行处理，填充比特将不作处理。
第一通信设备获取X个信息比特块后，可以将X个信息比特块置于M个第一待编码块中。其中，待编码块用于承载第一通信设备向第二通信设备传输的待编码数据。可以理解的是，第一待编码块表示第一通信设备第一次向第二通信设备传输时采用的待编码块，第二待编码块表示第一通信设备第二次向第二通信设备传输时采用的待编码块，以此类推。在一种可能的情况下，第一待编码块的数量M满足M＝X+Q-1。其中，任意一个第一待编码块至少承载一个信息比特子块，至多承载Q个信息比特子块。
请参见图5a，图5a为本申请实施例提供的一种第一待编码块的示意图。若不考虑码率损失，一种第一待编码块中的信息比特子块的排列方式如图5a所示。例如，图5a中包括3个信息比特块，即X＝3；包括5个第一待编码块，即M＝5；码率的量化阶数为3，即Q＝3。其中，每一个信息比特块都包括Q个信息比特子块。需要注意的是，同一个信息比特块的Q个信息比特子块分别位于不同的Q个第一待编码中，如图5a所示。
其中，每一个第一待编码块依次排列，第一个第一待编码块承载一个信息比特子块；第一个至第Q个第一待编码块承载的信息比特块的数量按照排列顺序，依次增加一个，第Q个第一待编码块承载Q个信息比特子块。第Q+1个至第M个第一待编码块承载信息比特子块的数量按照排列顺序，依次减少一个，第M个第一待编码块承载一个信息比特子块。
例如，图5a中，第一个第一待编码块承载1个信息比特子块，第二个第一待编码块承载2个信息比特子块，第三个第一待编码块承载3个信息比特子块，第四个第一待编码块承载2个信息比特子块，第五个第一待编码块承载1个信息比特子块。
可选的，为了降低码率损失，第一通信设备将信息数据分成X个信息比特块时，可以进行特别的处理。其中，每一个第一待编码块依次排列，第一个第一待编码块承载一个信息比特子块；第一个至第M个第一待编码块承载的信息比特块的数量按照排列顺序，依次增加一个，第Q个至第M个第一待编码块分别承载Q个信息比特子块。
例如，请参见图5b，图5b为本申请实施例提供的另一种第一待编码块的示意图。其 中，图5b中包括6个信息比特块，6个第一待编码块，码率的量化阶数Q＝3。第一个至第四个信息比特块分别包括3个信息比特子块。第五个信息比特块包括2个信息比特子块，第六个信息比特块包括1个信息比特子块，即第五个和第六个信息比特块分别进行特别的处理。在图5b中，第一个第一待编码块承载1个信息比特子块，第二个第一待编码块承载2个信息比特子块，第三个至第六个第一待编码块分别承载3个信息比特子块。
又例如，请参见图5c，图5c为本申请实施例提供的另一种第一待编码块的示意图。其中，图5c中包括6个信息比特块，6个第一待编码块，码率的量化阶数Q＝2。相较于图5b中的示例，图5c中的码率的量化阶数为2，信息比特块和第一待编码块的数量相同。其中，图5c中的第六个信息比特块采用特别的处理，使得第六个信息比特块仅包括一个信息比特子块。第一通信设备将上述6个信息比特块分别置于6个第一待编码块中，如图5c所示。
再例如，请参见图5d，图5d为本申请实施例提供的另一种第一待编码块的示意图。其中，图5d中包括6个信息比特块，6个第一待编码块，码率的量化阶数Q＝4。相较于图5b中的示例，图5d中的码率的量化阶数为4，信息比特块和第一待编码块的数量相同。其中，图5d中的第四个至第六个信息比特块采用特别的处理，使得第四个信息比特块包括3个信息比特子块，第五个信息比特块包括2个信息比特子块，第六个信息比特块包括1个信息比特子块。第一通信设备将上述6个信息比特块分别置于6个第一待编码块中，如图5d所示。
需要注意的是，图5a和图5b所示的第一待编码块为两种基础的第一待编码块，第一待编码块还可以介于上述两种基础的第一待编码块之间。
例如，请参见图5e，图5e为另一种第一待编码块的示意图。其中，M＝6表示一共有6个第一待编码块，X＝4表示一共传输4个信息比特块。图5e所示的待传输的4个信息比特块均为完整的信息比特块。将上述4个信息比特块置于6个第一待编码块中。其中，第一个和第六个第一待编码块承载1个信息比特子块，第二个和第五个第一待编码块承载2个信息比特子块，第三个和第四个第一待编码块承载3个信息比特子块，如图5e所示。第一待编码块还可以采用其他类似的特别的处理，本实施例不作限定。
其中，任意一个第一待编码块还包括一个或多个固定比特，如图5a中的信息比特块的阴影区域所示。固定比特的值通常设置为0，在实际传输中发送端和接收端都已知。
需要注意的是，上述对第一待编码块的说明仅为示例，第一待编码块的数量还可以是其它值。例如，采用图5b所示的第一待编码块时，理论上第一待编码块的数量可以趋近于无限大，即M趋近于无限大，本实施例不作限定。
下面对任意一个信息比特块的Q个信息比特子块的排列方式进行详细的说明。对于任意一个信息比特块，该信息比特块包括的Q个信息比特子块可以按照第一顺序分别置于Q个第一待编码块中。第一顺序为每一个信息比特块的第q个信息比特子块位于所在第一待编码块的第(q-1)*K/Q+1至第q*K/Q可靠的位置。
下面以第一待编码块采用如图5d中的第一待编码块为例进行说明。请参见图6，假设K＝256，Q＝4，M＝6。对于图6中的第一个信息比特块，该信息比特块包括256个信息比特。根据上文实施例的描述，第一通信设备可以获取a 1、a 2、a 3和a 4分别包括64个信息比特。那么按照第一顺序，a 1将置于第一个第一待编码块的第1至第64可靠的位置，a 2将置于第二个第一待编码块的第65至第128可靠的位置，a 3将置于第三个第一待编码块的第129至第192可靠的位置，a 4将置于第四个第一待编码块的第193至第256可靠的位置， 如图6所示。需要注意的是，每一个第一待编码块的位置从左向右可靠度逐渐增加，即最右的位置为第1可靠的位置，向左可靠度依次降低。
又例如，对于图6中的第二个信息比特块，该信息比特块也包括256个信息比特。类似的，第一通信设备可以获取b 1、b 2、b 3和b 4分别包括64个信息比特。那么按照第一顺序，b 1将置于第二个第一待编码块的第1至第64可靠的位置，b 2将置于第三个第一待编码块的第65至第128可靠的位置，b 3将置于第四个第一待编码块的第129至第192可靠的位置，b 4将置于第五个第一待编码块的第193至第256可靠的位置，如图6所示。可以理解的是，第三个至第六个信息比特块中的256个信息比特的排列方式也类似，在此不再赘述。
S303，第一通信设备对M个第一待编码块分别进行polar码编码，获取M个第一编码块；
S304，第一通信设备向第二通信设备发送M个第一编码块；对应的，第二通信设备接收第一通信设备发送的M个第一编码块。
第一通信设备可以对M个第一待编码块分别进行polar码编码，得到M个第一编码块。其中，polar码编码后的输出的M个第一编码块为级联合并在一起的多个编码块。例如，第一通信设备第一次传输时，第一待编码块采用如图5a中的第一待编码块。那么5个第一待编码块以及各个第一待编码块中的信息比特子块的排序如图7a所示。
又例如，第一通信设备第一次传输时，第一待编码块采用如图5b中的第一待编码块。那么6个第一待编码块以及各个第一待编码块中的信息比特子块的排序如图7b所示。类似的，若第一通信设备第一次传输时，第一待编码块采用如图5c中的第一待编码块。那么6个第一待编码块以及各个第一待编码块中的信息比特子块的排序如图7c所示。若第一通信设备第一次传输时，第一待编码块采用如图5d中的第一待编码块。那么6个第一待编码块以及各个第一待编码块中的信息比特子块的排序如图7d所示。
下面对第一编码块的码率进行分析。例如，如图7a所示的5个第一待编码块编码后为5个polar码块，其中，M＝5，Q＝3。其总码率为(R/3+2R/3+R+2R/3+R/3)/5＝3R/5。又例如，如图7b所示的6个第一待编码块编码后为6个polar码块。其中，M＝6，Q＝3。总码率为(R/3+2R/3+R+R+R+R)/6＝5R/6。可见，相较于图7a，图7b中的第一待编码块的总码率更大，即更接近于码率R。
又例如，如图7c所示的6个第一待编码块编码后为6个polar码块。其中，M＝6，Q＝2。总码率为(R/2+R+R+R+R+R)/6＝11R/12。可见，相较于图7b，图7c中的第一待编码块的总码率更大，即M/Q的比值越大时，总码率越接近于R。
再例如，如图7d所示的6个第一待编码块编码后为6个polar码块。其中，M＝6，Q＝4。总码率为(R/4+R/2+3R/4+R+R+R)/6＝3R/4。可见，相较于图7a，图7d中的第一待编码块的总码率更大，即更接近于码率R。
第一通信设备对信息比特编码完成后，可以将M个第一编码块信道经过星座调制，然后将经过星座调制后的数据通过下行数据信道发送给第二通信设备。对应的，第二通信设备将接收编码调制后的数据，并对接收到的编码调制后的数据先解调再解码，以获取第一通信设备传输的原始数据。其中，第一通信设备传输的原始数据即M个第一待编码块承载的多个信息比特。
需要注意的是，根据香农第二定理，当信道的信息传输率不超过信道容量时，采用合适的信道编码方法可以实现任意高的传输可靠性，但若信息传输率超过了信道容量，就不 可能实现可靠的传输。通常情况下，一次传输不能保证所有的信息比特的可靠传输，即不能确保信道容量大于或等于每一个第一编码块的码率。那么第一通信设备可以向第二通信设备重传数据。
S305，当需要重传时，第一通信设备将每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第二待编码块中的Q个第二待编码块中。
第一通信设备向第二通信设备第一次传输M个第一编码块后，若第二通信设备无法正确译码，第二通信设备可以请求重传。对应的，当需要重传时，第一通信设备可以重新将X个信息比特块置于M个第二待编码块中。其中，第二待编码块用于承载第一通信设备第二次向第二通信设备发送的待编码数据。类似的，第二待编码块的数量M满足M＝X+Q-1。其中，任意一个第二待编码块至少承载一个信息比特子块，至多承载Q个信息比特子块。
需要注意的是，第二待编码块以及第二待编码块承载的多个信息比特子块的排列按照第二顺序，第二顺序与第一顺序满足映射关系。可选的，第二顺序为每一个所述信息比特块的第q个信息比特子块位于所在第二待编码块的第(Q-q)*K/Q+1至第(Q-q+1)*K/Q可靠的位置。
请参见图8a，图8a为本申请实施例提供的一种第一待编码块和第二待编码块的示意图。其中，对于每一个信息比特块中的Q个信息比特子块，图8a所示的一种第二待编码块中的信息比特子块的排列顺序为图5d所示的一种第一待编码块中的信息比特子块的排列顺序的反序，如图8a所示。其中，K＝256，M＝6，Q＝4。
例如，对于第一个信息比特块(a 1,a 2,a 3,a 4)，该信息比特块的信息比特子块a 1位于第四个第二待编码块的第193至第256可靠的位置，即位于第一次传输时a 4对应的位置。a 2位于第三个第二待编码块的第129至第192可靠的位置，即位于第一次传输时a 3对应的位置。a 3位于第二个第二待编码块的第65至第128可靠的位置，即位于第一次传输时a 2对应的位置。a 4位于第一个第二待编码块的第1至第64可靠的位置，即位于第一次传输时a 1对应的位置。可见，对于第一个信息比特块，第一个信息比特块的4个信息比特子块在第二待编码块中的排列顺序为该信息比特块的4个信息比特子块在第一待编码块中的排列顺序的反序。
又例如，对于第二个信息比特块(b 1,b 2,b 3,b 4)，该信息比特块的信息比特子块b 1位于第五个第一待编码块的第193至第256可靠的位置，即位于第一次传输时b 4对应的位置。b 2位于第四个第一待编码块的第129至第192可靠的位置，即位于第一次传输时b 3对应的位置。b 3位于第三个第一待编码块的第65至第128可靠的位置，即位于第一次传输时b 2对应的位置。b 4位于第二个第一待编码块的第1至第64可靠的位置，即位于第一次传输时b 1对应的位置。可见，对于第二个信息比特块，第二个信息比特块的4个信息比特子块在第二待编码块中的排列顺序也为该信息比特块的4个信息比特子块在第一待编码块中的排列顺序的反序。可以理解的是，第三个至第六个信息比特块中的256个信息比特的排列方式也类似，在此不再赘述。
可选的，若K/Q的值不为整数或者不为2的次幂，则还需要进行速率匹配。需要指出的是，本申请中的方案与到底采用何种速率匹配方案关系不大，因此采用通用的速率匹配方案即可。
可选的，第一顺序和第二顺序满足以下映射关系：
Figure PCTCN2021082192-appb-000047
其中，a q为任意一个信息比特块的Q个信息比特子块中的任意一个信息比特子块，A t为任意一个信息比特子块映射后对应的信息比特子块，F为polar码的生成矩阵，J为正整数且满足K/Q＝2 J，P为正整数且满足2 P-1≤Q≤2 P；t满足1≤t≤2 P。
请参见图8b，图8b为本申请实施例提供的一种第二待编码块的示意图。其中，对于每一个信息比特块中的Q个信息比特子块，图8b所示的一种第二待编码块中的信息比特子块的排列顺序与图5d所示的一种第一待编码块中的信息比特子块的排列顺序一致，但是每一个信息比特子块为映射后的信息比特子块，如图8b所示。其中，M＝6，Q＝4。
例如，对于图8b中的六个信息比特块分别为(a 1,a 2,a 3,a 4)，(b 1,b 2,b 3,b 4)，(c 1,c 2,c 3,c 4)，(d 1,d 2,d 3)，(e 1,e 2)和(f 1)。由于每一个信息比特块中的信息比特子块的数量不为2的次幂，则对该信息比特块进行处理时，需要进行补零的处理，以使信息比特块在映射时采用的是完整的polar码生成矩阵。需要注意的是，若不对该信息比特块进行补零的处理，那么该信息比特块在映射时采用的是polar码生成矩阵的子矩阵。
其中，由于2 P-1≤Q≤2 P，可以确定P＝2。那么映射后的三个信息比特块分别都包括四个信息比特子块，且映射后的信息比特块与映射前的信息比特块的关系满足以下关系：
[A 1,A 2,A 3,A 4]＝[a 1,a 2,a 3,a 4]*F
[B 1,B 2,B 3,B 4]＝[b 1,b 2,b 3,b 4]*F
[C 1,C 2,C 3,C 4]＝[c 1,c 2,c 3,c 4]*F
[D 1,D 2,D 3,D 4]＝[0,d 1,d 2,d 3]*F
[E 1,E 2,E 3,E 4]＝[0,0,e 1,e 2]*F
其中，第一通信设备将每一个映射后的信息比特块中的四个信息比特子块按照第一顺序置于Q个第二待编码块中，如图8b所示。
S306，第一通信设备对M个第二待编码块分别进行polar码编码，获取M个第二编码块；
S307，第一通信设备向第二通信设备发送M个第二编码块；对应的第二通信设备接收第一通信设备发送的M个第二编码块。
第一通信设备可以对M个第二待编码块分别进行polar码编码，得到M个第二编码块。
可以理解的是，对第二编码块的码率分析可以参考上文实施例中对第一编码块的码率分析，在此不再赘述。
类似的，第一通信设备对信息比特编码完成后，可以将M个第二编码块信道经过星座调制，然后将经过星座调制后的数据通过下行数据信道发送给第二通信设备。对应的，第二通信设备将接收编码调制后的数据，并对接收到的编码调制后的数据进行数据解调。第二通信设备可以将接收到的M个第一编码块和M个第二编码块进行合并译码，以获取第一通信设备传输的原始数据。其中，第一通信设备传输的原始数据即M个第一待编码块承载的多个信息比特。
S308，第二通信设备将M个第一编码块和M个第二编码块进行合并译码，获取译码数据。
第二通信设备在收到第一通信设备第一次和第二次传输的数据后，可以将两次接收到的数据进行合并译码。其中，本实施例所述的合并译码是一种交互的流程：第二通信设备首先对第一编码块译码，可能译出某些部分；然后再对第二编码块进行译码，并且对第二编码块译码时可能会用到之前第一编码块译码时译出的某些部分；反之亦然。
其中，根据香农第二定理，对于两次传输的情况，当两次传输的信道容量之和大于或等于码率R时，第二通信设备总是可以通过本实施例所述的合并译码的方式对第一编码块和第二编码块实现可靠译码。
具体的，若第一通信设备两次传输的信道容量之和大于或等于码率R，第二通信设备译码获取第一待编码块承载的一个信息比特块包括的k 1个信息比特子块
Figure PCTCN2021082192-appb-000048
k 1满足1≤k 1≤Q；
第二通信设备译码获取第二待编码块承载的该信息比特块包括的k 2个信息比特子块
Figure PCTCN2021082192-appb-000049
k 2满足1≤k 2≤Q，k 1+k 2≥Q；
第二通信设备获取该信息比特块包括的Q个信息比特子块为[a 1,a 2,...,a Q]。
举例来说，假设第一通信设备第一次传输的信道容量大于或等于R/3，第二次传输的信道容量大于或等于2R/3。那么第一通信设备两次传输的信道容量之和大于或等于码率R，即两次传输即可实现正确译码。
第一通信设备第一次传输和第二次传输的第一编码块和第二编码块如图8c所示。其中，第一通信设备第一次传输的第一个和第五个第一编码块的码率为R/3，第二个和第四个第一编码块的码率为2R/3，第三个第一编码块的码率为R。根据香农第二定理，第一个和第五个第一编码块的码率R/3小于或等于第一次传输的信道容量R/3，那么第一个和第五个第一编码块可以译码出来，即a 1和c 3可以译码出来。但是，剩余的信息比特不能确保被成功译码。
其中，第一通信设备第二次传输的第一个和第五个第二编码块的码率为R/3，第二个和第四个第二编码块的码率为2R/3，第三个第二编码块的码率为R。根据香农第二定理，第一个和第五个第二编码块的码率R/3小于或等于第二次传输的信道容量2R/3，那么第一个和第五个第二编码块可以译码出来，即a 3和c 1可以译码出来。第二个和第四个第二编码块的码率为2R/3，小于或等于第二次传输的信道容量2R/3，那么第二个和第四个第二编码块也可以译码出来，即a 2，b 3，b 1和c 2可以译码出来。但是，剩余的信息比特不能确保被成功译码。
在获取a 3和c 1后，第一次传输时的第三个第一编码块的码率降为R/3。根据香农第二定理，由于第一次传输的信道容量大于或等于R/3，那么第三个第一编码块也可以译码出来，即b 2可以译码出来。
综上所述，第一通信设备两次传输的信道容量之和大于或等于码率R时，第一通信设备第两次传输的所有信息比特a 1,a 2,a 3,b 1,b 2,b 3,c 1,c 2,c 3均可以被解出，即实现所有信息比特的可靠传输。
需要注意的是，本申请所述的合并译码还可以包括以下一种特殊的合并译码：第一通信设备第一次传输时，信道容量为零，那么第二通信设备无法译码任何数据。第一通信设备第二次传输时，信道容量大于或等于码率R，那么第二次传输后，第二通信设备可以将所有的原始数据译码出来。可见，上述特殊的情况下，两次传输的信道容量之和大于或等于码率R，也满足合并译码的条件，最终也实现了正确译码。
下面对第一通信设备两次传输可以成功译码的区域以及码率损失区域进行分析说明。请参见图9，图9为Q＝3时，第一通信设备两次传输可以成功译码的区域以及码率损失区域的示意图。其中，横坐标表示第一次传输的信道容量，纵坐标表示第二次重传的信道容量，斜线阴影区域表示在此区域内两次传输的信道容量之和小于码率R，无法实现可靠传输。斜线阴影区域以外的部分是可以实现可靠传输的区域，其中，横线阴影区域代表码率 损失的区域。
本申请实施例提供一种数据处理方法，该方法由第一通信设备和第二通信设备之间的交互实现。其中，第一通信设备向第二通信设备初传M个第一编码块时，M个第一编码块中的多个信息比特子块按照第一顺序排列，有利于第二通信设备正确译码。若第二通信设备译码失败，第一通信设备可以向第二通信设备重传M个第二编码块，M个第二编码块中的多个信息比特子块按照第二顺序排列，且第二顺序与第一顺序满足映射关系。上述多个信息比特子块的排序方式有利于第二通信设备根据第一编码块和第二编码块正确译码，即两次传输即可正确译码。只要满足多次传输的信道容量之和大于或等于信息传输速率的条件，第一通信设备就能实现接近于信道容量的传输。
基于图3所示的实施例中的描述，下面对第一通信设备需要进行三次传输才能进行正确译码的情况进行详细的描述。请参见图10，图10为本申请实施例提供的另一种数据处理方法，该数据处理方法可以由第一通信设备和第二通信设备之间交互执行，包括S1001至S1011。其中，S1001至S1007与上述图3实施例中的S301至S307的具体实现方式相似，在此不再赘述。其中S1008至S1011具体包括：
S1008，当需要重传时，第一通信设备将每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第三待编码块中的Q个第三待编码块中。
根据S305中的描述，第二顺序与第一顺序满足映射关系。其中，第二顺序为每一个所述信息比特块的第q个信息比特子块位于所在第二待编码块的第(Q-q)*K/Q+1至第(Q-q+1)*K/Q可靠的位置。或者，第一顺序和第二顺序满足以下映射关系：
Figure PCTCN2021082192-appb-000050
那么第一通信设备在第三次传输时，第一通信设备将每一个信息比特块的Q个信息比特子块也按照第二顺序置于M个第三待编码块中的Q个第三待编码块中。
需要注意的是，为了提高成功译码的概率，第一通信设备在第二次传输时采用的第二顺序与在第三次传输时采用的第二顺序是不相同的。请参见图11a，图11a为本申请实施例提供的一种三次传输时待编码块的示意图。其中，第一通信设备在第二次传输时采用的第二顺序为反序，则第一通信设备在第三次传输时采用的第二顺序为映射后的信息比特块按照第一顺序置于第三待编码块中。
可选的，请参见图11b，图11b为本申请实施例提供的另一种三次传输时的待编码块的示意图。其中，第一通信设备在第二次传输时采用的第二顺序为映射后的信息比特块按照第一顺序置于第二待编码块中，则第一通信设备在第三次传输时采用的第二顺序为反序。
S1009，第一通信设备对M个第三待编码块分别进行polar码编码，获取M个第三编码块；
S1010，第一通信设备向第二通信设备发送M个第三编码块。
第一通信设备可以对M个第三待编码块分别进行polar码编码，得到M个第三编码块。其中，对第三编码块进行polar码编码的过程可以参考图3实施例中对第一编码块进行polar码编码的具体实现方式的描述，在此不再赘述。可以理解的是，对第三编码块的码率分析也可以参考上文实施例中对第一编码块的码率分析，在此不再赘述。
可选的，第一通信设备对信息比特编码完成后，可以将M个第三编码块信道经过星座调制，然后将经过星座调制后的数据通过下行数据信道发送给第二通信设备。对应的，第二通信设备将接收编码调制后的数据，并对接收到的编码调制后的数据进行数据解调。第 二通信设备可以将接收到的M个第一编码块、M个第二编码块以及M个第三编码块进行译码，以获取第一通信设备传输的原始数据。其中，第一通信设备传输的原始数据即M个第一待编码块承载的多个信息比特。
S1011，第二通信设备将M个第一编码块、M个第二编码块和M个第三编码块进行合并译码，获取译码数据。
第二通信设备在收到第一通信设备第一次、第二次和第三次传输的数据后，可以将三次接收到的数据进行合并译码。其中，与两次传输后的合并译码类似，三次传输后的合并译码也是一种交互的流程：第二通信设备首先对第一编码块译码，可能译出某些部分；然后再对第二编码块进行译码，并且对第二编码块译码时可能会用到之前第一编码块译码时译出的某些部分；最后再对第三编码块进行译码，并且对第三编码块译码时可能会用到之前第一编码块和第二编码块译码时译出的某些部分；反之亦然。
其中，根据香农第二定理，对于三次传输的情况，当三次传输的信道容量之和大于或等于码率R时，第二通信设备总是可以通过本实施例所述的合并译码的方式对第一编码块、第二编码块和第三编码块实现可靠译码。
具体的，若第一通信设备三次传输的信道容量之和大于或等于码率R，第二通信设备译码获取第一待编码块承载的一个信息比特块包括的k 1个信息比特子块
Figure PCTCN2021082192-appb-000051
k 1满足1≤k 1≤Q；
第二通信设备译码获取第二待编码块承载的该信息比特块包括的k 2个信息比特子块
Figure PCTCN2021082192-appb-000052
k 1和k 2满足1≤k 2≤Q，k 1+k 2<Q；
第二通信设备译码获取第三待编码块承载的该信息比特块包括的k 3个信息比特子块
Figure PCTCN2021082192-appb-000053
k 3满足1≤k 3≤Q，k 1、k 2和k 3满足k 1+k 2+k 3≥Q；
根据第一顺序和第二顺序的映射关系，第二通信设备获取k 3个信息比特子块映射前对应的k 3个信息比特子块为
Figure PCTCN2021082192-appb-000054
第二通信设备获取该信息比特块包括的Q个信息比特子块为[a 1,a 2,...,a Q]。
举例来说，假设第一通信设备第一次传输的信道容量大于或等于R/3，第二次传输的信道容量大于或等于R/3，第三次传输的信道容量大于或等于R/3，那么第一通信设备三次传输的信道容量之和大于或等于码率R，即三次传输即可实现正确译码。
请参见图12a，图12a为本申请实施例提出的一种第一通信设备第一次传输的第一编码块、第二次传输的第二编码块和第三次传输的第三编码块的示意图。其中，Q＝3。图12a中的第一编码块的排序与图7b中的第一编码块的排序一致。其中，对于每一个信息比特块中的Q个信息比特子块，图12a中的第二编码块中的信息比特子块的排列顺序为图7b中的第一编码块中的信息比特子块的排列顺序的反序，第三编码块中的信息比特子块为图7b中的第一编码块中的信息比特子块映射后的信息比特子块按照第一顺序排列。
其中，对于图12a中的映射关系，由于各个信息比特块包括的信息比特子块的数量不为2的次幂，则对该信息比特子块进行处理时，需要进行补零的处理，以使信息比特块在映射时采用的是完整的polar码生成矩阵。需要注意的是，若不对该信息比特块进行补零的处理，那么该信息比特块在映射时采用的是polar码生成矩阵的子矩阵。
其中，由于2 P-1≤Q≤2 P，可以确定P＝2。那么映射后的信息比特块与映射前的信息比特块的关系满足以下关系：
[A 1,A 2,A 3,A 4]＝[0,a 1,a 2,a 3]*F
[B 1,B 2,B 3,B 4]＝[0,b 1,b 2,b 3]*F
[C 1,C 2,C 3,C 4]＝[0,c 1,c 2,c 3]*F
[D 1,D 2,D 3,D 4]＝[0,d 1,d 2,d 3]*F
[E 1,E 2,E 3,E 4]＝[0,0,e 1,e 2]*F
第一通信设备第一次传输的第一个第一编码块的码率为R/3，第二个第一编码块的码率为2R/3，第三个至第六个第一编码块的码率为R。根据香农第二定理，第一个第一编码块的码率R/3小于或等于第一次传输的信道容量，那么第一个第一编码块可以译码出来，即a 1可以译码出来。但是，剩余的信息比特不能确保被成功译码。
第一通信设备第二次传输的第一个第二编码块的码率为R/3，第二个第二编码块的码率为2R/3，第三个至第六个第二编码块的码率为R。根据香农第二定理，第一个第二编码块的码率R/3小于或等于第二次传输的信道容量，那么第一个第二编码块可以译码出来，即a 3可以译码出来。但是，剩余的信息比特不能确保被成功译码。
第一通信设备第三次传输的第一个第三编码块的码率为R/3，第二个第三编码块的码率为2R/3，第三个至第六个第三编码块的码率为R。根据香农第二定理，第一个第三编码块的码率R/3小于或等于第三次传输的信道容量，那么第一个第三编码块可以译码出来，即A 1可以译码出来。但是，剩余的信息比特不能确保被成功译码。
在获取a 1，a 3和A 1后，根据比特间关系式[A 1,A 2,A 3,A 4]＝[0,a 1,a 2,a 3]*F，第一通信设备可以译码得到a 2，A 2和A 4。译码得到a 2后，A 3也可以译码出来。
在获取a 2和A 2后，图12a中的第二个第一编码块的码率降低为R/3。根据香农第二定理，第二个第一编码块的码率R/3小于或等于第一次传输的信道容量，那么第二个第一编码块可以译码出来，即b 1可以译码出来。类似的，第二个第二编码块的码率降低为R/3，第二个第三编码块的码率降低为R/3。那么b 3和B 1也可以译码出来。
在获取b 1，b 3和B 1后，根据比特间关系式[B 1,B 2,B 3,B 4]＝[0,b 1,b 2,b 3]*F，第一通信设备可以译码得到b 2，B 2，B 3和B 4。
在获取a 1，a 3，A 3，b 2和B 2后，图12a中的第三个第一编码块的码率降低为R/3。根据香农第二定理，第三个第一编码块的码率R/3小于或等于第一次传输的信道容量，那么第三个第一编码块可以译码出来，即c 1可以译码出来。类似的，第三个第二编码块的码率降低为R/3，第三个第三编码块的码率降低为R/3。那么c 3和C 1也可以译码出来。
在获取c 1，c 3和C 1后，根据比特间关系式[C 1,C 2,C 3,C 4]＝[0,c 1,c 2,c 3]*F，第一通信设备可以译码得到c 2，C 2，C 3和C 4。
在获取b 1，b 3，B 3，c 2和C 2后，图12a中的第四个第一编码块的码率降低为R/3。根据香农第二定理，第四个第一编码块的码率R/3小于或等于第一次传输的信道容量，那么第四个第一编码块可以译码出来，即d 1可以译码出来。类似的，第四个第二编码块的码率降低为R/3，第四个第三编码块的码率降低为R/3。那么d 3和D 1也可以译码出来。
在获取d 1，d 3和D 1后，根据比特间关系式[D 1,D 2,D 3,D 4]＝[0,d 1,d 2,d 3]*F，第一通信设备可以译码得到d 2，D 2，D 3和D 4。
在获取c 1，c 3，C 3，d 2和D 2后，图12a中的第五个第一编码块的码率降低为R/3。根据香农第二定理，第五个第一编码块的码率R/3小于或等于第一次传输的信道容量，那么第五个第一编码块可以译码出来，即e 1可以译码出来。类似的，第五个第二编码块的码率 降低为R/3，第五个第三编码块的码率降低为R/3。那么e 2和E 1也可以译码出来。
在获取e 1，e 2和E 1后，根据比特间关系式[E 1,E 2,E 3,E 4]＝[0,0,e 1,e 2]*F，第一通信设备可以译码得到E 2。在获取d 3和e 2后，图12a中的第六个第一编码块的码率降低为R/3。根据香农第二定理，第六个第一编码块的码率R/3小于或等于第一次传输的信道容量，那么第六个第一编码块可以译码出来，即f 1可以译码出来。
综上所述，第一通信设备三次传输的信道容量之和大于或等于码率R时，第一通信设备第三次传输的所有信息比特a 1,a 2,a 3,b 1,b 2,b 3,c 1,c 2,c 3,d 1,d 2,d 3,e 1,e 2,f 1均可以被解出，即实现所有信息比特的可靠传输。
又例如，请参见图12b，图12b为本申请实施例提供的另一种第一通信设备第一次传输的第一编码块、第二次传输的第二编码块和第三次传输的第三编码块的示意图。其中，Q＝2。图12b中的第一编码块的排序与图7c中的第一编码块的排序一致。其中，对于每一个信息比特块中的Q个信息比特子块，图12b中的第二编码块中的信息比特子块的排列顺序为图7c中的第一编码块中的信息比特子块的排列顺序的反序，第三编码块中的信息比特子块为图7c中的第一编码块中的信息比特子块映射后的信息比特子块按照第一顺序排列。
其中，对于图12b中的映射关系，各个映射后的信息比特块与映射前的信息比特块的关系满足以下关系：
[A 1,A 2]＝[a 1,a 2]*F
[B 1,B 2]＝[b 1,b 2]*F
[C 1,C 2]＝[c 1,c 2]*F
[D 1,D 2]＝[d 1,d 2]*F
[E 1,E 2]＝[e 1,e 2]*F
又例如，请参见图12c，图12c为本申请实施例提供的另一种第一通信设备第一次传输的第一编码块、第二次传输的第二编码块和第三次传输的第三编码块的示意图。其中，Q＝4。图12b中的第一编码块的排序与图7c中的第一编码块的排序一致。其中，对于每一个信息比特块中的Q个信息比特子块，图12b中的第二待编码块中的信息比特子块的排列顺序为图7c中的第一待编码块中的信息比特子块的排列顺序的反序，第三待编码块中的信息比特子块为图7c中的第一待编码块中的信息比特子块映射后的信息比特子块按照第一顺序排列。
其中，对于图12c中的映射关系，由于图12c中包括进行特殊的处理的信息比特块，该信息比特块包括的信息比特子块的数量不为2的次幂，则对该信息比特子块进行处理时，需要进行补零的处理，以使信息比特块在映射时采用的是完整的polar码生成矩阵。需要注意的是，若不对该信息比特块进行补零的处理，那么该信息比特块在映射时采用的是polar码生成矩阵的子矩阵。
其中，由于2 P-1≤Q≤2 P，可以确定P＝2。那么映射后的信息比特块与映射前的信息比特块的关系满足以下关系：
[A 1,A 2,A 3,A 4]＝[a 1,a 2,a 3,a 4]*F
[B 1,B 2,B 3,B 4]＝[b 1,b 2,b 3,b 4]*F
[C 1,C 2,C 3,C 4]＝[c 1,c 2,c 3,c 4]*F
[D 1,D 2,D 3,D 4]＝[0,d 1,d 2,d 3]*F
[E 1,E 2,E 3,E 4]＝[0,0,e 1,e 2]*F
可以理解的是，图12b和图12c所示的三次传输可以正确译码的条件也为三次传输的信道容量之和大于或等于码率R，那么第二通信设备总是可以通过本实施例所述的合并译码的方式对第一编码块、第二编码块和第三编码块实现可靠译码。其中，图12b和图12c所示的三次传输的译码过程请参考图12a所示的实施例中的具体实现方式的描述，在此不再赘述。
本申请实施例提供一种数据处理方法，该方法由第一通信设备和第二通信设备之间的交互实现。其中，第一通信设备向第二通信设备初传M个第一编码块时，M个第一编码块中的多个信息比特子块按照第一顺序排列，有利于第二通信设备正确译码。若第二通信设备译码失败，第一通信设备可以向第二通信设备重传M个第二编码块，M个第二编码块中的多个信息比特子块按照第二顺序排列，且第二顺序与第一顺序满足映射关系。若第二通信设备仍然译码失败，第一通信设备还可以向第二通信设备重传M个第三编码块，第三编码块中的多个信息比特子块的排列方式与第二编码块中的多个信息比特子块的排列方式相关联。上述多个信息比特子块的排序方式有利于第二通信设备根据第一编码块、第二编码块和第三编码块正确译码，即三次传输即可正确译码。只要满足多次传输的信道容量之和大于或等于信息传输速率的条件，第一通信设备就能实现接近于信道容量的传输。
基于图3所示的实施例中的描述，下面对第一通信设备需要进行四次或四次以上传输才能进行正确译码的情况进行详细的描述。为了便于描述，以下示例以第一通信设备需要进行四次传输为例进行说明。可以理解的是，当第一通信设备需要进行四次以上传输时，可以参考四次传输的具体实现方式。
请参见图13，图13所示的示例中假设第一通信设备总的传输次数为四次，该数据处理方法可以由第一通信设备和第二通信设备之间交互执行，具体包括以下步骤：
S1301，第一通信设备获取X个信息比特块，一个信息比特块被划分为Q个信息比特子块；
S1302，当需要重传且第一通信设备传输的总次数为四次时，第一通信设备将每一个信息比特块的Q个信息比特子块进行处理。
当第一通信设备的传输次数为四次时，由于不存在二进制域上的UDM矩阵，第一通信设备对信息比特子块的处理无法在二进制域中进行。那么第一通信设备在对每一个信息比特块进行处理时，可以将每一个信息比特块[a 1,a 2,...,a Q]从二进制域映射至2 w进制域，且映射后的任意一个信息比特块满足
Figure PCTCN2021082192-appb-000055
其中，
Figure PCTCN2021082192-appb-000056
为从二进制域映射至2 w进制域后的任意一个信息比特块中的任意一个信息比特子块，
Figure PCTCN2021082192-appb-000057
为长度为K/wQ的2 w进制序列，w为大于1的正整数。
第一通信设备再将映射后的
Figure PCTCN2021082192-appb-000058
采用通用解码矩阵(universal decoding matrix，UDM)进行转换。其中，映射后的任意一个信息比特块与转换后对应的信息比特块之间满足以下关系：
Figure PCTCN2021082192-appb-000059
其中，
Figure PCTCN2021082192-appb-000060
为
Figure PCTCN2021082192-appb-000061
转换后对应的信息比特子块，H n为在2 w进制域上的K/w×K/w的UDM，n用于指示第n次传输；n满足n∈[1,2,...,N]，N为第一通信设备传输的总次数，N为大于3的正整数。
第一通信设备再将
Figure PCTCN2021082192-appb-000062
进行反映射，得到反映射后的对应的信息比特块满足[A n,1,A n,2,...,A n,Q]。其中，反映射后的A n,Q为长度为K/Q的二进制序列。
可见，通过上述处理流程，第一通信设备在四次或者四次以上传输时，可以将信息比特子块进行处理后，再进行后续的排序编码。
S1303，第一通信设备将处理后的每一个信息比特块的信息比特子块按照第一顺序置于M个第一待编码块中；
S1304，第一通信设备对M个第一待编码块分别进行polar码编码，获取M个第一编码块；
S1305，第一通信设备向第二通信设备发送M个第一编码块；
S1306，当需要重传时，第一通信设备将处理后的每一个信息比特块的信息比特子块按照第一顺序置于M个第二待编码块中；
S1307，第一通信设备对M个第二待编码块分别进行polar码编码，获取M个第二编码块；
S1308，第一通信设备向第二通信设备发送M个第二编码块；
S1309，当需要重传时，第一通信设备将处理后的每一个信息比特块的信息比特子块按照第一顺序置于M个第三待编码块中；
S1310，第一通信设备对M个第一待编码块分别进行polar码编码，获取M个第三编码块；
S1311，第一通信设备向第二通信设备发送M个第三编码块；
S1312，当需要重传时，第一通信设备将处理后的每一个信息比特块的信息比特子块按照第一顺序置于M个第四待编码块中；
S1313，第一通信设备对M个第四待编码块分别进行polar码编码，获取M个第四编码块；
S1314，第一通信设备向第二通信设备发送M个第四编码块。
请参见图14，图14为本申请实施例提供的一种第一通信设备第一次传输的第一编码块、第二次传输的第二编码块、第三次传输的第三编码块和第四次传输的第四编码块的示意图。其中，Q＝3，M＝5。其中，第一次传输的第一编码块中的信息比特子块采用第一顺序排列。例如，A 1，1,A 1,2,A 1,3分别表示第一数据流承载的第一编码块中的信息比特子块，上述信息比特子块为原始信息比特子块中的a 1,a 2,a 3进行处理后的信息比特子块。
第一次传输的第一编码块确定后，第一通信设备第一次向第二通信设备发送该M个第一编码块。
第二次传输的第二编码块中的信息比特子块按照第一顺序排列。例如，A 2，1,A 2,2,A 2,3分别表示第二数据流承载的第二编码块中的信息比特子块，上述信息比特子块为原始信息比特子块中的a 1,a 2,a 3进行处理后，并且不同于A 1，1,A 1,2,A 1,3的信息比特子块。
第二次传输的第二编码块确定后，第一通信设备第二次向第二通信设备发送该M个第二编码块。
第三次传输的第三编码块中的信息比特子块按照第一顺序排列。例如，A 3，1,A 3,2,A 3,3分别表示第三数据流承载的第三编码块中的信息比特子块。上述信息比特子块为原始信息比特子块中的a 1,a 2,a 3进行处理后，并且不同于A 1，1,A 1,2,A 1,3和A 2，1,A 2,2,A 2,3的信息比特子块。
第三次传输的第三编码块确定后，第一通信设备第三次向第二通信设备发送该M个第三编码块。
第四次传输的第四编码块中的信息比特子块按照第一顺序排列。例如，A 4，1,A 4,2,A 4,3分别表示第四数据流承载的第四编码块中的信息比特子块。上述信息比特子块为原始信息比特子块中的a 1,a 2,a 3进行处理后，并且不同于A 1，1,A 1,2,A 1,3、A 2，1,A 2,2,A 2,3和A 3，1,A 3,2,A 3,3的信息比特子块。
第四次传输的第四编码块确定后，第一通信设备第一次向第二通信设备发送该M个第四编码块。
S1315，第二通信设备将第一编码块至第四编码块进行合并译码，获取译码数据。
第二通信设备可以将四次接收到的数据进行合并译码。其中，与两次传输以及三次传输后的合并译码类似，四次传输后的合并译码也是一种交互的流程。
示例性的，若第一通信设备四次传输的信道容量之和大于或等于码率R，第二通信设备译码获取处理后的一个信息比特块包括的k 1个信息比特子块
Figure PCTCN2021082192-appb-000063
k 1满足1≤k 1≤Q；
第二通信设备可以根据
Figure PCTCN2021082192-appb-000064
获取
Figure PCTCN2021082192-appb-000065
第二通信设备译码获取处理后的该信息比特块包括的k 2个信息比特子块
Figure PCTCN2021082192-appb-000066
k 1和k 2满足1≤k 2≤Q，k 1+k 2<Q；
第二通信设备可以根据
Figure PCTCN2021082192-appb-000067
获取
Figure PCTCN2021082192-appb-000068
第二通信设备译码获取处理后的该信息比特块包括的k 3个信息比特子块
Figure PCTCN2021082192-appb-000069
k 3满足1≤k 3≤Q，k 1、k 2和k 3满足k 1+k 2+k 3<Q；
第二通信设备可以根据
Figure PCTCN2021082192-appb-000070
获取
Figure PCTCN2021082192-appb-000071
第二通信设备译码获取处理后的该信息比特块包括的k 4个信息比特子块
Figure PCTCN2021082192-appb-000072
k 4满足1≤k 4≤Q，k 1、k 2、k 3和k 4满足k 1+k 2+k 3+k 4≥Q；
第二通信设备可以根据
Figure PCTCN2021082192-appb-000073
获取
Figure PCTCN2021082192-appb-000074
第二通信设备可以根据
Figure PCTCN2021082192-appb-000075
Figure PCTCN2021082192-appb-000076
以及UDM的性质，可以获取
Figure PCTCN2021082192-appb-000077
第二通信设备再对
Figure PCTCN2021082192-appb-000078
进行反映射得到该信息比特块包括的Q个信息比特子块为[a 1，a 2，...，a Q]。
举例来说，假设第一通信设备第一次传输的信道容量大于或等于R/4，第二次传输的信道容量大于或等于R/4，第三次传输的信道容量大于或等于R/4，第四次传输的信道容量大于或等于R/4。那么第一通信设备四次传输的信道容量之和大于或等于码率R，即四次传输可实现正确译码。
本申请实施例提供一种数据处理方法，该方法由第一通信设备和第二通信设备之间的交互实现。其中，第一通信设备向第二通信设备初传M个第一编码块时，M个第一编码块中的多个信息比特子块按照第一顺序排列，有利于第二通信设备正确译码。若第二次传 输和第三次传输后第二通信设备仍然译码失败，第一通信设备可以向第二通信设备重传M个第n编码块，第n编码块中的多个信息比特子块的排列方式与第一编码块中的多个信息比特子块的排列方式相关联。上述多个信息比特子块的排序方式有利于第二通信设备根据第一编码块至第n编码块正确译码。只要满足多次传输的信道容量之和大于或等于信息传输速率的条件，第一通信设备就能实现接近于信道容量的传输。
以下结合图15至图18详细说明本申请实施例的装置及设备。
本申请实施例提供一种通信设备，如图15所示，该通信设备用于实现上述方法实施例中第一通信设备所执行的方法，具体包括：
收发单元1501，用于获取X个信息比特块，一个信息比特块包括K个信息比特；一个信息比特块被划分为Q个信息比特子块，一个信息比特子块为长度为K/Q的二进制序列；
处理单元1502，用于将每一个信息比特块的Q个信息比特子块按照第一顺序置于M个第一待编码块中的Q个第一待编码块中，第一顺序为每一个信息比特块的第q个信息比特子块位于所在第一待编码块的第(q-1)*K/Q+1至第q*K/Q可靠的位置，q满足1≤q≤Q；M满足M＝X+Q-1；
处理单元1502还用于对M个第一待编码块分别进行polar码编码，获取M个第一编码块；
收发单元1501还用于向第二通信设备发送M个第一编码块；
处理单元1502还用于当需要重传时，将每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第二待编码块中的Q个第二待编码块中，第二顺序与第一顺序满足映射关系；
处理单元1502还用于对M个第二待编码块分别进行polar码编码，获取M个第二编码块；
收发单元1501还用于向第二通信设备发送M个第二编码块。
在一种实现方式中，第二顺序为每一个信息比特块的第q个信息比特子块位于所在第二待编码块的第(Q-q)*K/Q+1至第(Q-q+1)*K/Q可靠的位置。
在一种实现方式中，第一顺序和第二顺序满足以下映射关系：
Figure PCTCN2021082192-appb-000079
其中，a q为任意一个信息比特块的Q个信息比特子块中的任意一个信息比特子块，A t为任意一个信息比特子块映射后对应的信息比特子块，F为polar码的生成矩阵，J为正整数且满足K/Q＝2 J，P为正整数且满足2 P-1≤Q≤2 P，t满足1≤t≤2 P。
在一种实现方式中，当需要重传时，处理单元1502还用于将每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第三待编码块中的Q个第三待编码块中；第三待编码块采用的第二顺序与第二待编码块采用的第二顺序不同；
处理单元1502还用于对M个第三待编码块分别进行polar码编码，获取M个第三编码块；
收发单元1501还用于向第二通信设备发送M个第三编码块。
在一种实现方式中，当需要重传时，处理单元1502还用于将每一个信息比特块的Q个信息比特子块从二进制域映射至2 w进制域，获取映射后的任意一个信息比特块为
Figure PCTCN2021082192-appb-000080
其中，
Figure PCTCN2021082192-appb-000081
为映射后的任意一个信息比特块中的任意一个信息比特子块，
Figure PCTCN2021082192-appb-000082
为长度为K/wQ的序列，w为大于1的正整数；
处理单元1502还用于将每一个映射后的信息比特块的Q个信息比特子块进行转换，其中，任意一个映射后的信息比特块的Q个信息比特子块与转换后对应的Q个信息比特子块之间满足以下关系：
Figure PCTCN2021082192-appb-000083
其中，
Figure PCTCN2021082192-appb-000084
为
Figure PCTCN2021082192-appb-000085
转换后对应的信息比特子块，H n为在2 w进制域上的K/w×K/w的通用解码矩阵UDM，n用于指示第n次传输；n满足n∈[1,2,...,N]，N为第一通信设备传输的总次数，且N为大于3的正整数；
处理单元1502还用于将
Figure PCTCN2021082192-appb-000086
进行反映射，获取
Figure PCTCN2021082192-appb-000087
反映射后对应的信息比特块为[A n,1,A n,2,...,A n,Q]；其中，A n,Q为长度为K/Q的二进制序列；
处理单元1502还用于将反映射后的任意一个信息比特块的Q个信息比特子块按照第一顺序置于M个第n待编码块中；
处理单元1502还用于对M个第n待编码块分别进行polar码编码，获取M个第n编码块；
收发单元1501还用于向第二通信设备发送M个第n编码块。
在一种实现方式中，任意一个编码块至少承载一个信息比特子块，至多承载Q个信息比特子块；其中，编码块包括第一编码块至第n编码块。
在一种实现方式中，每个编码块按照编码块的标识依次排列，其中，第一个编码块承载一个信息比特子块；第一个至第Q个编码块承载的信息比特块的数量按照编码块的排列顺序，依次增加一个，第Q个编码块承载Q个信息比特子块；第Q+1个编码块至第M个编码块承载信息比特子块的数量按照编码块的排列顺序，依次减少一个；第M个编码块承载一个信息比特子块。
在一种实现方式中，Q为码率R的量化阶数，Q为正整数；第i个编码块的码率r i＝i×R/Q，i满足1≤i≤Q；第j个编码块的码率r j＝(M-j+1)×R/Q，j满足Q+1≤j≤M。
在一种实现方式中，图15中的各个单元所实现的相关功能可以通过收发器和处理器来实现。请参见图16，图16是本申请实施例提供的一种通信设备的结构示意图，该通信设备可以为具有执行本申请实施例所述的数据处理功能的设备(例如芯片)。该通信设备1600可以包括收发器1601、至少一个处理器1602和存储器1603。其中，收发器1601、处理器1602和存储器1603可以通过一条或多条通信总线相互连接，也可以通过其它方式相连接。
其中，收发器1601可以用于发送数据，或者接收数据。可以理解的是，收发器1601是统称，可以包括接收器和发送器。例如，接收器用于获取信息比特块。又例如，发送器用于发送第一编码块。
其中，处理器1602可以用于对通信设备的数据进行处理，或者，对收发器1601待发送的信息进行处理。例如，处理器1602可以调用存储器1603中存储的程序代码，实现对第一待编码块中的信息比特子块的排序。处理器1602可以包括一个或多个处理器，例如该处理器1602可以是一个或多个中央处理器(central processing unit，CPU)，网络处理器(network processor，NP)，硬件芯片或者其任意组合。在处理器1602是一个CPU的情况下，该CPU可以是单核CPU，也可以是多核CPU。
其中，存储器1603用于存储程序代码等。存储器1603可以包括易失性存储器(volatile  memory)，例如随机存取存储器(random access memory，RAM)；存储器1603也可以包括非易失性存储器(non-volatile memory)，例如只读存储器(read-only memory，ROM)，快闪存储器(flash memory)，硬盘(hard disk drive，HDD)或固态硬盘(solid-state drive，SSD)；存储器1603还可以包括上述种类的存储器的组合。
其中，上述处理器1602和存储器1603可以通过接口耦合，也可以集成在一起，本实施例不作限定。
上述收发器1601和处理器1602可以用于实现本申请实施例中的数据处理方法，其中，具体实现方式如下：
收发器1601，用于获取X个信息比特块，一个信息比特块包括K个信息比特；一个信息比特块被划分为Q个信息比特子块，一个信息比特子块为长度为K/Q的二进制序列；
处理器1602，用于将每一个信息比特块的Q个信息比特子块按照第一顺序置于M个第一待编码块中的Q个第一待编码块中，第一顺序为每一个信息比特块的第q个信息比特子块位于所在第一待编码块的第(q-1)*K/Q+1至第q*K/Q可靠的位置，q满足1≤q≤Q；M满足M＝X+Q-1；
处理器1602还用于对M个第一待编码块分别进行polar码编码，获取M个第一编码块；
收发器1601还用于向第二通信设备发送M个第一编码块；
当需要重传时，处理器1602还用于将每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第二待编码块中的Q个第二待编码块中，第二顺序与第一顺序满足映射关系；
处理器1602还用于对M个第二待编码块分别进行polar码编码，获取M个第二编码块；
收发器1601还用于向第二通信设备发送M个第二编码块。
在一种实现方式中，第二顺序为每一个信息比特块的第q个信息比特子块位于所在第二待编码块的第(Q-q)*K/Q+1至第(Q-q+1)*K/Q可靠的位置。
在一种实现方式中，第一顺序和第二顺序满足以下映射关系：
Figure PCTCN2021082192-appb-000088
其中，a q为任意一个信息比特块的Q个信息比特子块中的任意一个信息比特子块，A t为任意一个信息比特子块映射后对应的信息比特子块，F为polar码的生成矩阵，J为正整数且满足K/Q＝2 J，P为正整数且满足2 P-1≤Q≤2 P，t满足1≤t≤2 P。
在一种实现方式中，处理器1602还用于：
当需要重传时，将每一个所述信息比特块的Q个信息比特子块按照第二顺序置于M个第三待编码块中的Q个第三待编码块中；第三待编码块采用的第二顺序与第二待编码块采用的第二顺序不同；
对所述M个第三待编码块分别进行polar码编码，获取M个第三编码块；
收发器1601还用于向第二通信设备发送M个第三编码块。
在一种实现方式中，处理器1602还用于：
当需要重传时，将每一个信息比特块的Q个信息比特子块从二进制域映射至2 w进制域，获取映射后的任意一个信息比特块为
Figure PCTCN2021082192-appb-000089
其中，
Figure PCTCN2021082192-appb-000090
为映射后的任意一个信息比特块中的任意一个信息比特子块，
Figure PCTCN2021082192-appb-000091
为长度为K/wQ的序列，w为大于1的正整数；
将每一个映射后的信息比特块的Q个信息比特子块进行转换，其中，任意一个映射后的信息比特块的Q个信息比特子块与转换后对应的Q个信息比特子块之间满足以下关系：
Figure PCTCN2021082192-appb-000092
其中，
Figure PCTCN2021082192-appb-000093
为
Figure PCTCN2021082192-appb-000094
转换后对应的信息比特子块，H n为在2 w进制域上的K/w×K/w的通用解码矩阵UDM，n用于指示第n次传输；n满足n∈[1,2,...,N]，N为第一通信设备传输的总次数，且N为大于3的正整数；
将
Figure PCTCN2021082192-appb-000095
进行反映射，获取
Figure PCTCN2021082192-appb-000096
反映射后对应的信息比特块为[A n,1,A n,2,...,A n,Q]；其中，A n,Q为长度为K/Q的二进制序列；
将反映射后的任意一个信息比特块的Q个信息比特子块按照第一顺序置于M个第n待编码块中；
对M个第n待编码块分别进行polar码编码，获取M个第n编码块；
收发器1601还用于向第二通信设备发送M个第n编码块。
在一种实现方式中，任意一个编码块至少承载一个信息比特子块，至多承载Q个信息比特子块；其中，编码块包括第一编码块和第二编码块。
在一种实现方式中，每个编码块按照编码块的标识依次排列，其中，第一个编码块承载一个信息比特子块；第一个至第Q个编码块承载的信息比特块的数量按照编码块的排列顺序，依次增加一个，第Q个编码块承载Q个信息比特子块。第Q+1个编码块至第M个编码块承载信息比特子块的数量按照编码块的排列顺序，依次减少一个；第M个编码块承载一个信息比特子块。
在一种实现方式中，Q为码率R的量化阶数，Q为正整数。第i个编码块的码率r i＝i×R/Q，i满足1≤i≤Q。第j个编码块的码率r j＝(M-j+1)×R/Q，j满足Q+1≤j≤M。
本申请实施例提供一种通信设备，如图17所示，该通信设备用于执行上述方法实施例中第二通信设备所执行的方法，具体包括：
收发单元1701，用于接收第一通信设备初传的M个第一编码块，M个第一编码块是M个第一待编码块进行polar码编码得到的；M个第一待编码块承载X个信息比特块，每一个信息比特块被划分为Q个信息比特子块，每一个信息比特块的Q个信息比特子块按照第一顺序置于M个第一待编码块中的Q个第一待编码块中，第一顺序为每一个信息比特块的第q个信息比特子块位于所在第一待编码块的第(q-1)*K/Q+1至第q*K/Q可靠的位置，q满足1≤q≤Q；M满足M＝X+Q-1；
收发单元1701还用于接收第一通信设备重传的M个第二编码块，M个第二编码块是M个第二待编码块进行polar码编码得到的；每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第二待编码块中的Q个第二待编码块中，第二顺序与第一顺序满足映射关系；
处理单元1702，用于将M个第一编码块和M个第二编码块进行合并译码，获取译码数据。
在一种实现方式中，第二顺序为每一个信息比特块的第q个信息比特子块位于所在第二待编码块的第(Q-q)*K/Q+1至第(Q-q+1)*K/Q可靠的位置。
在一种实现方式中，第一顺序和第二顺序满足以下映射关系：
Figure PCTCN2021082192-appb-000097
其中，a q为任意一个信息比特块的Q个信息比特子块中的任意一个信息比特子块，A t为任意一个信息比特子块映射后对应的信息比特子块，F为polar码的生成矩阵，J为正整数且满足K/Q＝2 J，P为正整数且满足2 P-1≤Q≤2 P，t满足1≤t≤2 P。
在一种实现方式中，处理单元1702用于将M个第一编码块和M个第二编码块进行合并译码，获取译码数据，具体包括：
若第一通信设备两次传输的信道容量之和大于或等于码率R，译码获取第一待编码块承载的一个信息比特块包括的k 1个信息比特子块
Figure PCTCN2021082192-appb-000098
k 1满足1≤k 1≤Q；
译码获取第二待编码块承载的该信息比特块包括的k 2个信息比特子块
Figure PCTCN2021082192-appb-000099
k 2满足1≤k 2≤Q，k 1+k 2≥Q；
获取该信息比特块包括的Q个信息比特子块为[a 1,a 2,...,a Q]。
在一种实现方式中，收发单元1701还用于接收第一通信设备重传的M个第三编码块，该M个第三编码块是M个第三待编码块进行polar码编码得到的。每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第三待编码块中的Q个第三待编码块中。其中，第三待编码块采用的第二顺序与第二待编码块采用的第二顺序不同。
在一种实现方式中，若第一通信设备两次传输的信道容量之和小于码率R，且第一通信设备三次传输的信道容量之和大于或等于码率R，处理单元1702还用于译码获取第一待编码块承载的一个信息比特块包括的k 1个信息比特子块
Figure PCTCN2021082192-appb-000100
以及第二待编码块承载的该信息比特块包括的k 2个信息比特子块
Figure PCTCN2021082192-appb-000101
k 1和k 2满足k 1+k 2<Q。
处理单元1702还用于译码获取所述第三待编码块承载的信息比特块包括的k 3个信息比特子块
Figure PCTCN2021082192-appb-000102
k 3满足1≤k 3≤Q，k 1、k 2和k 3满足k 1+k 2+k 3≥Q。
处理单元1702还用于根据第一顺序和第二顺序的映射关系，获取k 3个信息比特子块映射前对应的k 3个信息比特子块为
Figure PCTCN2021082192-appb-000103
处理单元1702还用于获取信息比特块包括的Q个信息比特子块为[a 1,a 2,...,a Q]。
在一种实现方式中，收发单元1701还用于接收第一通信设备重传的M个第n编码块，该M个第n编码块是M个第n待编码块进行polar码编码得到的。每一个处理后的信息比特块的Q个信息比特子块按照第一顺序置于M个第n待编码块中的Q个第n待编码块中。
处理单元1702还用于将M个第一编码块直至M个第n编码块进行合并译码，获取译码数据。
其中，对每一个信息比特块的处理满足以下条件：
每一个信息比特块的Q个信息比特子块从二进制域映射至2 w进制域，且映射后的任意一个信息比特块满足
Figure PCTCN2021082192-appb-000104
其中，
Figure PCTCN2021082192-appb-000105
为映射后的任意一个信息比特块中的任意一个信息比特子块，
Figure PCTCN2021082192-appb-000106
为长度为K/wQ的2 w进制序列，w为大于1的正整数。
其中，映射后的任意一个信息比特块与转换后对应的信息比特块之间满足以下关系：
Figure PCTCN2021082192-appb-000107
Figure PCTCN2021082192-appb-000108
为
Figure PCTCN2021082192-appb-000109
转换后对应的信息比特子块，H n为在2 w进制域上的K/w×K/w的通用解码矩阵UDM，n用于指示第n次传输。n满足n∈[1,2,...,N]，N为第一通信设备传输的总次数，且N为大于3的正整数。
Figure PCTCN2021082192-appb-000110
进行反映射后对应的信息比特块满足[A n,1,A n,2,...,A n,Q]；其中，A n,Q为 长度为K/Q的二进制序列。
在一种实现方式中，任意一个编码块至少承载一个信息比特子块，至多承载Q个信息比特子块；其中，编码块包括第一编码块和第二编码块。
在一种实现方式中，每个编码块按照编码块的标识依次排列，其中，第一个编码块承载一个信息比特子块；第一个至第Q个编码块承载的信息比特块的数量按照编码块的排列顺序，依次增加一个，第Q个编码块承载Q个信息比特子块；第Q+1个至第M个编码块承载信息比特子块的数量按照编码块的排列顺序，依次减少一个；第M个编码块承载一个信息比特子块。
在一种实现方式中，Q为码率R的量化阶数，Q为正整数。第i个编码块的码率r i＝i×R/Q，i满足1≤i≤Q。第j个编码块的码率r j＝(M-j+1)×R/Q，j满足Q+1≤j≤M。
在一种实现方式中，图17中的各个单元所实现的相关功能可以通过收发器和处理器来实现。请参见图18，图18是本申请实施例提供的一种通信设备的结构示意图，该通信设备可以为具有执行本申请实施例所述的数据处理功能的设备(例如芯片)。该通信设备1800可以包括收发器1801、至少一个处理器1802和存储器1803。其中，收发器1801、处理器1802和存储器1803可以通过一条或多条通信总线相互连接，也可以通过其它方式相连接。
其中，收发器1801可以用于发送数据，或者接收数据。可以理解的是，收发器1801是统称，可以包括接收器和发送器。例如，接收器用于获取信息比特块。又例如，发送器用于发送第一编码块。
其中，处理器1802可以用于对通信设备的数据进行处理，或者，对收发器1801接收的数据进行处理。例如，处理器1802可以调用存储器1803中存储的程序代码，实现对接收到的数据进行合并译码。处理器1802可以包括一个或多个处理器，例如该处理器1802可以是一个或多个中央处理器(central processing unit，CPU)，网络处理器(network processor，NP)，硬件芯片或者其任意组合。在处理器1802是一个CPU的情况下，该CPU可以是单核CPU，也可以是多核CPU。
其中，存储器1803用于存储程序代码等。存储器1803可以包括易失性存储器(volatile memory)，例如随机存取存储器(random access memory，RAM)；存储器1803也可以包括非易失性存储器(non-volatile memory)，例如只读存储器(read-only memory，ROM)，快闪存储器(flash memory)，硬盘(hard disk drive，HDD)或固态硬盘(solid-state drive，SSD)；存储器1803还可以包括上述种类的存储器的组合。
其中，上述处理器1802和存储器1803可以通过接口耦合，也可以集成在一起，本实施例不作限定。
上述收发器1801和处理器1802可以用于实现本申请实施例中的数据处理方法，其中，具体实现方式如下：
收发器1801，用于接收第一通信设备初传的M个第一编码块，该M个第一编码块是M个第一待编码块进行polar码编码得到的。M个第一待编码块承载X个信息比特块，每一个信息比特块被划分为Q个信息比特子块。每一个信息比特块的Q个信息比特子块按照第一顺序置于M个第一待编码块中的Q个第一待编码块中。其中，第一顺序为每一个信息比特块的第q个信息比特子块位于所在第一待编码块的第(q-1)*K/Q+1至第q*K/Q可靠的位置；q满足1≤q≤Q，M满足M＝X+Q-1。
收发器1801还用于接收第一通信设备重传的M个第二编码块，该M个第二编码块是M个第二待编码块进行polar码编码得到的。每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第二待编码块中的Q个第二待编码块中，第二顺序与所述第一顺序满足映射关系。
处理器1802，用于将M个第一编码块和M个第二编码块进行合并译码，获取译码数据。
在一种实现方式中，处理器1802用于将M个第一编码块和M个第二编码块进行合并译码，获取译码数据，具体用于：
若第一通信设备两次传输的信道容量之和大于或等于码率R，译码获取第一待编码块承载的一个信息比特块包括的k 1个信息比特子块
Figure PCTCN2021082192-appb-000111
k 1满足1≤k 1≤Q；
译码获取第二待编码块承载的信息比特块包括的k 2个信息比特子块
Figure PCTCN2021082192-appb-000112
k 2满足1≤k 2≤Q，k 1+k 2≥Q；
获取信息比特块包括的Q个信息比特子块为[a 1,a 2,...,a Q]。
在一种实现方式中，收发器还用于接收第一通信设备重传的M个第三编码块，该M个第三编码块是M个第三待编码块进行polar码编码得到的。每一个信息比特块的Q个信息比特子块按照第二顺序置于M个第三待编码块中的Q个第三待编码块中。其中，第三待编码块采用的第二顺序与第二待编码块采用的第二顺序不同。
若第一通信设备两次传输的信道容量之和小于码率R，且第一通信设备三次传输的信道容量之和大于或等于码率R，处理器1802还用于：
译码获取第一待编码块承载的一个信息比特块包括的k 1个信息比特子块
Figure PCTCN2021082192-appb-000113
以及第二待编码块承载的该信息比特块包括的k 2个信息比特子块
Figure PCTCN2021082192-appb-000114
k 1和k 2满足k 1+k 2<Q。
译码获取所述第三待编码块承载的信息比特块包括的k 3个信息比特子块
Figure PCTCN2021082192-appb-000115
k 3满足1≤k 3≤Q，k 1、k 2和k 3满足k 1+k 2+k 3≥Q。
根据第一顺序和第二顺序的映射关系，获取k 3个信息比特子块映射前对应的k 3个信息比特子块为
Figure PCTCN2021082192-appb-000116
获取信息比特块包括的Q个信息比特子块为[a 1,a 2,...,a Q]。
在一种实现方式中，收发器1801还用于接收第一通信设备重传的M个第n编码块，该M个第n编码块是M个第n待编码块进行polar码编码得到的。每一个处理后的信息比特块的Q个信息比特子块按照第一顺序置于M个第n待编码块中的Q个第n待编码块中。
处理器1802还用于将M个第一编码块直至M个第n编码块进行合并译码，获取译码数据。
其中，对每一个信息比特块的处理满足以下条件：
每一个信息比特块的Q个信息比特子块从二进制域映射至2 w进制域，且映射后的任意一个信息比特块满足
Figure PCTCN2021082192-appb-000117
其中，
Figure PCTCN2021082192-appb-000118
为映射后的任意一个信息比特块中的任意一个信息比特子块，
Figure PCTCN2021082192-appb-000119
为长度为K/wQ的2 w进制序列，w为大于1的正整数。
其中，映射后的任意一个信息比特块与转换后对应的信息比特块之间满足以下关系：
Figure PCTCN2021082192-appb-000120
Figure PCTCN2021082192-appb-000121
为
Figure PCTCN2021082192-appb-000122
转换后对应的信息比特子块，H n为在2w进制域上的K/w×K/w的通用解码矩阵UDM，n用于指示第n次传输。n满足n∈[1,2,...,N]，N为第一通信设备传输的总次数，且N为大于3的正整数。
Figure PCTCN2021082192-appb-000123
进行反映射后对应的信息比特块满足[A n,1,A n,2,...,A n,Q]；其中，A n,Q为长度为K/Q的二进制序列。
在一种实现方式中，任意一个编码块至少承载一个信息比特子块，至多承载Q个信息比特子块；其中，编码块包括第一编码块和第二编码块。
在一种实现方式中，每个编码块按照编码块的标识依次排列，其中，第一个编码块承载一个信息比特子块；第一个至第Q个编码块承载的信息比特块的数量按照编码块的排列顺序，依次增加一个，第Q个编码块承载Q个信息比特子块；第Q+1个至第M个编码块承载信息比特子块的数量按照编码块的排列顺序，依次减少一个；第M个编码块承载一个信息比特子块。
在一种实现方式中，Q为码率R的量化阶数，Q为正整数。第i个编码块的码率r i＝i×R/Q，i满足1≤i≤Q。第j个编码块的码率r j＝(M-j+1)×R/Q，j满足Q+1≤j≤M。
本申请实施例提供一种通信装置，该通信装置由输入接口、输出接口和逻辑电路组成。其中，输入接口用于输入待处理的数据；逻辑电路按照前述方法实施例的方法对待处理的数据进行处理，获取处理后的数据；输出接口用于输出处理后的数据。
在一种实现方式中，输入接口输入的待处理的数据包括前述方法实施例中的待编码块以及各个待编码块中的信息比特子块；其中，待编码块包括第一待编码块、第二待编码块直至第n待编码块。
在一种实现方式中，逻辑电路按照前述方法实施例的方法对待处理的数据进行处理，获取处理后的数据，具体包括：
逻辑电路按照前述方法实施例的方法对待编码块中的信息比特子块的进行排序，并对待编码块进行编码，获取各个待编码块对应的编码块。
在一种实现方式中，输出接口输出的处理后的数据包括前述方法实施例中的编码块；其中，编码块包括第一编码块、第二编码块直至第n编码块。
在一种实现方式中，输入接口输入的待处理的数据包括前述方法实施例中的编码块；其中，编码块包括第一编码块、第二编码块直至第n编码块。
在一种实现方式中，逻辑电路按照前述方法实施例的方法对待处理的数据进行处理，获取处理后的数据，具体包括：
逻辑电路按照前述方法实施例的方法对编码块进行合并译码，获取各个编码块对应的待编码块。
在一种实现方式中，输出接口输出的处理后的数据包括前述方法实施例中的待编码块以及各个待编码块中的信息比特子块；其中，待编码块包括第一待编码块、第二待编码块直至第n待编码块。
本申请实施例提供一种通信系统，该通信系统包括前述实施例所述的第一通信设备和第二通信设备。
本申请实施例提供一种计算机可读存储介质，该计算机可读存储介质存储有程序或指令，当所述程序或指令在计算机上运行时，使得计算机执行本申请实施例中的数据处理方法。
本申请实施例提供一种芯片或者芯片系统，该芯片或者芯片系统包括至少一个处理器和接口，接口和至少一个处理器通过线路互联，至少一个处理器用于运行计算机程序或指令，以进行本申请实施例中的数据处理方法。
其中，芯片中的接口可以为输入/输出接口、管脚或电路等。
上述方面中的芯片系统可以是片上系统(system on chip，SOC)，也可以是基带芯片等，其中基带芯片可以包括处理器、信道编码器、数字信号处理器、调制解调器和接口模块等。
在一种实现方式中，本申请中上述描述的芯片或者芯片系统还包括至少一个存储器，该至少一个存储器中存储有指令。该存储器可以为芯片内部的存储单元，例如，寄存器、缓存等，也可以是该芯片的存储单元(例如，只读存储器、随机存取存储器等)。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机指令时，全部或部分地产生按照本申请实施例所述的流程或功能。计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(Digital Subscriber Line，DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质(例如，软盘、硬盘、磁带)、光介质(例如，高密度数字视频光盘(Digital Video Disc，DVD))、或者半导体介质(例如，固态硬盘(Solid State Disk，SSD))等。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，能够以电子硬件、计算机软件或者二者的结合来实现，为了清楚地说明硬件和软件的可互换性，在上述说明中已经按照功能一般性地描述了各示例的组成及步骤。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (40)

  1. 一种数据处理方法，其特征在于，应用于第一通信设备，所述方法包括：
    获取X个信息比特块，一个所述信息比特块包括K个信息比特；一个所述信息比特块被划分为Q个信息比特子块，一个所述信息比特子块为长度为K/Q的二进制序列；
    将每一个所述信息比特块的Q个信息比特子块按照第一顺序置于M个第一待编码块中的Q个第一待编码块中，所述第一顺序为每一个所述信息比特块的第q个信息比特子块位于所在第一待编码块的第(q-1)*K/Q+1至第q*K/Q可靠的位置，所述q满足1≤q≤Q；所述M满足M＝X+Q-1；
    对所述M个第一待编码块分别进行polar码编码，获取M个第一编码块；
    向第二通信设备发送所述M个第一编码块；
    当需要重传时，将每一个所述信息比特块的Q个信息比特子块按照第二顺序置于M个第二待编码块中的Q个第二待编码块中，所述第二顺序与所述第一顺序满足映射关系；
    对所述M个第二待编码块分别进行polar码编码，获取M个第二编码块；
    向所述第二通信设备发送所述M个第二编码块。
  2. 根据权利要求1所述的方法，其特征在于，所述第二顺序为每一个所述信息比特块的第q个信息比特子块位于所在第二待编码块的第(Q-q)*K/Q+1至第(Q-q+1)*K/Q可靠的位置。
  3. 根据权利要求1所述的方法，其特征在于，所述第一顺序和所述第二顺序满足以下映射关系：
    Figure PCTCN2021082192-appb-100001
    其中，所述a q为任意一个信息比特块的Q个信息比特子块中的任意一个信息比特子块，所述A t为所述任意一个信息比特子块映射后对应的信息比特子块，所述F为polar码的生成矩阵，所述J为正整数且满足K/Q＝2 J，所述P为正整数且满足2 P-1≤Q≤2 P；所述t满足1≤t≤2 P。
  4. 根据权利要求1至3任一项所述的方法，其特征在于，所述方法还包括：
    当需要重传时，将每一个所述信息比特块的Q个信息比特子块按照第二顺序置于M个第三待编码块中的Q个第三待编码块中；所述第三待编码块采用的第二顺序与所述第二待编码块采用的第二顺序不同；
    对所述M个第三待编码块分别进行polar码编码，获取M个第三编码块；
    向所述第二通信设备发送所述M个第三编码块。
  5. 根据权利要求4所述的方法，其特征在于，所述方法还包括：
    当需要重传时，将每一个所述信息比特块的Q个信息比特子块从二进制域映射至2 w进制域，获取映射后的任意一个信息比特块为
    Figure PCTCN2021082192-appb-100002
    其中，所述
    Figure PCTCN2021082192-appb-100003
    为所述映射后的任意一个信息比特块中的任意一个信息比特子块，所述
    Figure PCTCN2021082192-appb-100004
    为长度为K/wQ的序列，所述w为大于1的正整数；
    将每一个映射后的信息比特块的Q个信息比特子块进行转换，其中，任意一个映射后的信息比特块的Q个信息比特子块与转换后对应的Q个信息比特子块之间满足以下关系：
    Figure PCTCN2021082192-appb-100005
    其中，所述
    Figure PCTCN2021082192-appb-100006
    为所述
    Figure PCTCN2021082192-appb-100007
    转换后对应的信息比特子块，所述H n为在2 w进制域上的 K/w×K/w的通用解码矩阵UDM，所述n用于指示第n次传输；
    将所述
    Figure PCTCN2021082192-appb-100008
    进行反映射，获取所述
    Figure PCTCN2021082192-appb-100009
    反映射后对应的信息比特块为[A n,1,A n,2,...,A n,Q]；其中，所述A n,Q为长度为K/Q的二进制序列；
    将反映射后的任意一个信息比特块的Q个信息比特子块按照所述第一顺序置于M个第n待编码块中；所述n满足n∈[1,2,...,N]，所述N为所述第一通信设备传输的总次数，且所述N为大于3的正整数；
    对所述M个第n待编码块分别进行polar码编码，获取M个第n编码块；
    向所述第二通信设备发送所述M个第n编码块。
  6. 根据权利要求1所述的方法，其特征在于，所述任意一个编码块至少承载一个信息比特子块，至多承载Q个信息比特子块；其中，所述编码块包括所述第一编码块和所述第二编码块。
  7. 根据权利要求6所述的方法，其特征在于，每个所述编码块按照所述编码块的标识依次排列，其中，第一个所述编码块承载一个信息比特子块；第一个至第Q个所述编码块承载的信息比特块的数量按照所述编码块的排列顺序，依次增加一个，第Q个所述编码块承载Q个信息比特子块；第Q+1个至第M个所述编码块承载信息比特子块的数量按照所述编码块的排列顺序，依次减少一个；所述第M个所述编码块承载一个信息比特子块。
  8. 根据权利要求7所述的方法，其特征在于，所述Q为码率R的量化阶数，所述Q为正整数；第i个所述编码块的码率r i＝i×R/Q，所述i满足1≤i≤Q；第j个所述编码块的码率r j＝(M-j+1)×R/Q，所述j满足Q+1≤j≤M。
  9. 一种数据处理方法，其特征在于，应用于第二通信设备，所述方法包括：
    接收第一通信设备初传的M个第一编码块，所述M个第一编码块是M个第一待编码块进行polar码编码得到的；M个所述第一待编码块承载X个信息比特块，每一个所述信息比特块被划分为Q个信息比特子块，每一个所述信息比特块的Q个信息比特子块按照第一顺序置于M个所述第一待编码块中的Q个所述第一待编码块中，所述第一顺序为每一个所述信息比特块的第q个信息比特子块位于所在第一待编码块的第(q-1)*K/Q+1至第q*K/Q可靠的位置，所述q满足1≤q≤Q；所述M满足M＝X+Q-1；
    接收所述第一通信设备重传的M个第二编码块，所述M个第二编码块是M个第二待编码块进行polar码编码得到的；每一个所述信息比特块的Q个信息比特子块按照第二顺序置于M个所述第二待编码块中的Q个所述第二待编码块中，所述第二顺序与所述第一顺序满足映射关系；
    将所述M个第一编码块和所述M个第二编码块进行合并译码，获取译码数据。
  10. 根据权利要求9所述的方法，其特征在于，所述第二顺序为每一个所述信息比特块的第q个信息比特子块位于所在第二待编码块的第(Q-q)*K/Q+1至第(Q-q+1)*K/Q可靠的位置。
  11. 根据权利要求9所述的方法，其特征在于，所述第一顺序和所述第二顺序满足以下映射关系：
    Figure PCTCN2021082192-appb-100010
    其中，所述a q为任意一个信息比特块的Q个信息比特子块中的任意一个信息比特子块，所述A t为所述任意一个信息比特子块映射后对应的信息比特子块，所述F为polar码的生成矩阵，所述J为正整数且满足K/Q＝2 J，所述P为正整数且满足2 P-1≤Q≤ 2P；所述 t满足1≤t≤2 P。
  12. 根据权利要求9至11任一项所述的方法，其特征在于，将所述M个第一编码块和所述M个第二编码块进行合并译码，获取译码数据，包括：
    若所述第一通信设备两次传输的信道容量之和大于或等于码率R，译码获取所述第一待编码块承载的一个信息比特块包括的k 1个信息比特子块
    Figure PCTCN2021082192-appb-100011
    所述k 1满足1≤k 1≤Q；
    译码获取所述第二待编码块承载的所述信息比特块包括的k 2个信息比特子块
    Figure PCTCN2021082192-appb-100012
    所述k 2满足1≤k 2≤Q，k 1+k 2≥Q；
    获取所述信息比特块包括的Q个信息比特子块为[a 1,a 2,...,a Q]。
  13. 根据权利要求12所述的方法，其特征在于，所述方法还包括：
    接收所述第一通信设备重传的M个第三编码块，所述M个第三编码块是M个第三待编码块进行polar码编码得到的；每一个所述信息比特块的Q个信息比特子块按照第二顺序置于M个所述第三待编码块中的Q个所述第三待编码块中；所述第三待编码块采用的第二顺序与所述第二待编码块采用的第二顺序不同；
    若所述第一通信设备两次传输的信道容量之和小于所述码率R，且所述第一通信设备三次传输的信道容量之和大于或等于所述码率R，译码获取所述第一待编码块承载的一个信息比特块包括的k 1个信息比特子块
    Figure PCTCN2021082192-appb-100013
    以及所述第二待编码块承载的所述信息比特块包括的k 2个信息比特子块
    Figure PCTCN2021082192-appb-100014
    所述k 1和k 2满足k 1+k 2<Q；
    译码获取所述第三待编码块承载的所述信息比特块包括的k 3个信息比特子块
    Figure PCTCN2021082192-appb-100015
    所述k 3满足1≤k 3≤Q，所述k 1、k 2和k 3满足k 1+k 2+k 3≥Q；
    根据所述第一顺序和所述第二顺序的映射关系，获取所述k 3个信息比特子块映射前对应的k 3个信息比特子块为
    Figure PCTCN2021082192-appb-100016
    获取所述信息比特块包括的Q个信息比特子块为[a 1,a 2,...,a Q]。
  14. 根据权利要求13所述的方法，其特征在于，所述方法还包括：
    接收所述第一通信设备重传的M个第n编码块，所述M个第n编码块是M个第n待编码块进行polar码编码得到的；每一个处理后的信息比特块的Q个信息比特子块按照所述第一顺序置于M个所述第n待编码块中的Q个所述第n待编码块中；
    将所述M个第一编码块直至所述M个第n编码块进行合并译码，获取译码数据；
    其中，对每一个所述信息比特块的处理满足以下条件：
    每一个所述信息比特块的Q个信息比特子块从二进制域映射至2 w进制域，且映射后的任意一个信息比特块满足
    Figure PCTCN2021082192-appb-100017
    其中，所述
    Figure PCTCN2021082192-appb-100018
    为所述映射后的任意一个信息比特块中的任意一个信息比特子块，所述
    Figure PCTCN2021082192-appb-100019
    为长度为K/wQ的2 w进制序列，所述w为大于1的正整数；
    所述映射后的任意一个信息比特块与转换后对应的信息比特块之间满足以下关系：
    Figure PCTCN2021082192-appb-100020
    其中，所述
    Figure PCTCN2021082192-appb-100021
    为所述
    Figure PCTCN2021082192-appb-100022
    转换后对应的信息比特子块，所述H n为在2 w进制域上的K/w×K/w的通用解码矩阵UDM，所述n用于指示第n次传输；所述n满足n∈[1,2,...,N]，所述N为所述第一通信设备传输的总次数，且所述N为大于3的正整数；
    所述
    Figure PCTCN2021082192-appb-100023
    进行反映射后对应的信息比特块满足[A n,1,A n,2,...,A n,Q]；其中，所述A n,Q为长度为K/Q的二进制序列。
  15. 根据权利要求9所述的方法，其特征在于，所述任意一个编码块至少承载一个信息比特子块，至多承载Q个信息比特子块；其中，所述编码块包括所述第一编码块和所述第二编码块。
  16. 根据权利要求15所述的方法，其特征在于，每个所述编码块按照所述编码块的标识依次排列，其中，第一个所述编码块承载一个信息比特子块；第一个至第Q个所述编码块承载的信息比特块的数量按照所述编码块的排列顺序，依次增加一个，所述第Q个所述编码块承载Q个信息比特子块；所述第Q+1个所述编码块至第M个所述编码块承载信息比特子块的数量按照所述编码块的排列顺序，依次减少一个；所述第M个所述编码块承载一个信息比特子块。
  17. 根据权利要求16所述的方法，其特征在于，所述Q为码率R的量化阶数，所述Q为正整数；第i个所述编码块的码率r i＝i×R/Q，所述i满足1≤i≤Q；第j个所述编码块的码率r j＝(M-j+1)×R/Q，所述j满足Q+1≤j≤M。
  18. 一种通信装置，其特征在于，包括：
    收发单元，用于获取X个信息比特块，一个所述信息比特块包括K个信息比特；一个所述信息比特块被划分为Q个信息比特子块，一个所述信息比特子块为长度为K/Q的二进制序列；
    处理单元，用于将每一个所述信息比特块的Q个信息比特子块按照第一顺序置于M个第一待编码块中的Q个第一待编码块中，所述第一顺序为每一个所述信息比特块的第q个信息比特子块位于所在第一待编码块的第(q-1)*K/Q+1至第q*K/Q可靠的位置，所述q满足1≤q≤Q；所述M满足M＝X+Q-1；
    所述处理单元还用于对所述M个第一待编码块分别进行polar码编码，获取M个第一编码块；
    所述收发单元还用于向第二通信设备发送所述M个第一编码块；
    当需要重传时，所述处理单元还用于将每一个所述信息比特块的Q个信息比特子块按照第二顺序置于M个第二待编码块中的Q个第二待编码块中，所述第二顺序与所述第一顺序满足映射关系；
    所述处理单元还用于对所述M个第二待编码块分别进行polar码编码，获取M个第二编码块；
    所述收发单元还用于向所述第二通信设备发送所述M个第二编码块。
  19. 根据权利要求18所述的装置，其特征在于，所述第二顺序为每一个所述信息比特块的第q个信息比特子块位于所在第二待编码块的第(Q-q)*K/Q+1至第(Q-q+1)*K/Q可靠的位置。
  20. 根据权利要求18所述的装置，其特征在于，所述第一顺序和所述第二顺序满足以下映射关系：
    Figure PCTCN2021082192-appb-100024
    其中，所述a q为任意一个信息比特块的Q个信息比特子块中的任意一个信息比特子块，所述A t为所述任意一个信息比特子块映射后对应的信息比特子块，所述F为polar码的生 成矩阵，所述J为正整数且满足K/Q＝2 J，所述P为正整数且满足2 P-1≤Q≤2 P；所述t满足1≤t≤2 P。
  21. 根据权利要求18至20任一项所述的装置，其特征在于，所述处理单元还用于：
    当需要重传时，将每一个所述信息比特块的Q个信息比特子块按照第二顺序置于M个第三待编码块中的Q个第三待编码块中；所述第三待编码块采用的第二顺序与所述第二待编码块采用的第二顺序不同；
    对所述M个第三待编码块分别进行polar码编码，获取M个第三编码块；
    所述收发单元还用于向所述第二通信设备发送所述M个第三编码块。
  22. 根据权利要求21所述的装置，其特征在于，所述处理单元还用于：
    当需要重传时，将每一个所述信息比特块的Q个信息比特子块从二进制域映射至2 w进制域，获取映射后的任意一个信息比特块为
    Figure PCTCN2021082192-appb-100025
    其中，所述
    Figure PCTCN2021082192-appb-100026
    为所述映射后的任意一个信息比特块中的任意一个信息比特子块，所述
    Figure PCTCN2021082192-appb-100027
    为长度为K/wQ的序列，所述w为大于1的正整数；
    将每一个映射后的信息比特块的Q个信息比特子块进行转换，其中，任意一个映射后的信息比特块的Q个信息比特子块与转换后对应的Q个信息比特子块之间满足以下关系：
    Figure PCTCN2021082192-appb-100028
    其中，所述
    Figure PCTCN2021082192-appb-100029
    为所述
    Figure PCTCN2021082192-appb-100030
    转换后对应的信息比特子块，所述H n为在2 w进制域上的K/w×K/w的通用解码矩阵UDM，所述n用于指示第n次传输；所述n满足n∈[1,2,...,N]，所述N为所述第一通信设备传输的总次数，且所述N为大于3的正整数；
    将所述
    Figure PCTCN2021082192-appb-100031
    进行反映射，获取所述
    Figure PCTCN2021082192-appb-100032
    反映射后对应的信息比特块为[A n,1,A n,2,...,A n,Q]；其中，A n,Q为长度为K/Q的二进制序列；
    将反映射后的任意一个信息比特块的Q个信息比特子块按照所述第一顺序置于M个第n待编码块中；
    对所述M个第n待编码块分别进行polar码编码，获取M个第n编码块；
    所述收发单元还用于向所述第二通信设备发送所述M个第n编码块。
  23. 根据权利要求18所述的装置，其特征在于，所述任意一个编码块至少承载一个信息比特子块，至多承载Q个信息比特子块；其中，所述编码块包括所述第一编码块和所述第二编码块。
  24. 根据权利要求23所述的装置，其特征在于，每个所述编码块按照所述编码块的标识依次排列，其中，第一个所述编码块承载一个信息比特子块；第一个至第Q个所述编码块承载的信息比特块的数量按照所述编码块的排列顺序，依次增加一个，所述第Q个所述编码块承载Q个信息比特子块；所述第Q+1个所述编码块至第M个所述编码块承载信息比特子块的数量按照所述编码块的排列顺序，依次减少一个；所述第M个所述编码块承载一个信息比特子块。
  25. 根据权利要求24所述的装置，其特征在于，所述Q为码率R的量化阶数，所述Q为正整数；第i个所述编码块的码率r i＝i×R/Q，所述i满足1≤i≤Q；第j个所述编码块的码率r j＝(M-j+1)×R/Q，所述j满足Q+1≤j≤M。
  26. 一种通信装置，其特征在于，包括：
    收发单元，用于接收第一通信设备初传的M个第一编码块，所述M个第一编码块是 M个第一待编码块进行polar码编码得到的；M个所述第一待编码块承载X个信息比特块，每一个所述信息比特块被划分为Q个信息比特子块，每一个所述信息比特块的Q个信息比特子块按照第一顺序置于M个所述第一待编码块中的Q个所述第一待编码块中，所述第一顺序为每一个所述信息比特块的第q个信息比特子块位于所在第一待编码块的第(q-1)*K/Q+1至第q*K/Q可靠的位置，所述q满足1≤q≤Q；所述M满足M＝X+Q-1；
    所述收发单元还用于接收所述第一通信设备重传的M个第二编码块，所述M个第二编码块是M个第二待编码块进行polar码编码得到的；每一个所述信息比特块的Q个信息比特子块按照第二顺序置于M个所述第二待编码块中的Q个所述第二待编码块中，所述第二顺序与所述第一顺序满足映射关系；
    处理单元，用于将所述M个第一编码块和所述M个第二编码块进行合并译码，获取译码数据。
  27. 根据权利要求26所述的装置，其特征在于，所述第二顺序为每一个所述信息比特块的第q个信息比特子块位于所在第二待编码块的第(Q-q)*K/Q+1至第(Q-q+1)*K/Q可靠的位置。
  28. 根据权利要求26所述的装置，其特征在于，所述第一顺序和所述第二顺序满足以下映射关系：
    Figure PCTCN2021082192-appb-100033
    其中，所述a q为任意一个信息比特块的Q个信息比特子块中的任意一个信息比特子块，所述A t为所述任意一个信息比特子块映射后对应的信息比特子块，所述F为polar码的生成矩阵，所述J为正整数且满足K/Q＝2 J，所述P为正整数且满足2 P-1≤Q≤2 P；所述t满足1≤t≤2 P。
  29. 根据权利要求26至28所述的装置，其特征在于，所述处理单元用于将所述M个第一编码块和所述M个第二编码块进行合并译码，获取译码数据，具体用于：
    若所述第一通信设备两次传输的信道容量之和大于或等于码率R，译码获取所述第一待编码块承载的一个信息比特块包括的k 1个信息比特子块
    Figure PCTCN2021082192-appb-100034
    所述k 1满足1≤k 1≤Q；
    译码获取所述第二待编码块承载的所述信息比特块包括的k 2个信息比特子块
    Figure PCTCN2021082192-appb-100035
    所述k 2满足1≤k 2≤Q，k 1+k 2≥Q；
    获取所述信息比特块包括的Q个信息比特子块为[a 1,a 2,...,a Q]。
  30. 根据权利要求29所述的装置，其特征在于，所述收发单元还用于：
    接收所述第一通信设备重传的M个第三编码块，所述M个第三编码块是M个第三待编码块进行polar码编码得到的；每一个所述信息比特块的Q个信息比特子块按照第二顺序置于M个所述第三待编码块中的Q个所述第三待编码块中；所述第三待编码块采用的第二顺序与所述第二待编码块采用的第二顺序不同；
    若所述第一通信设备两次传输的信道容量之和小于所述码率R，且所述第一通信设备三次传输的信道容量之和大于或等于所述码率R，所述处理单元还用于译码获取所述第一待编码块承载的一个信息比特块包括的k 1个信息比特子块
    Figure PCTCN2021082192-appb-100036
    以及所述第二待编码块承载的所述信息比特块包括的k 2个信息比特子块
    Figure PCTCN2021082192-appb-100037
    所述k 1和k 2满足k 1+k 2<Q；
    所述处理单元还用于译码获取所述第三待编码块承载的所述信息比特块包括的k 3个信息比特子块
    Figure PCTCN2021082192-appb-100038
    所述k 3满足1≤k 3≤Q，所述k 1、k 2和k 3满足k 1+k 2+k 3≥Q；
    所述处理单元还用于根据所述第一顺序和所述第二顺序的映射关系，获取所述k 3个信息比特子块映射前对应的k 3个信息比特子块为
    Figure PCTCN2021082192-appb-100039
    所述处理单元还用于获取所述信息比特块包括的Q个信息比特子块为[a 1,a 2,...,a Q]。
  31. 根据权利要求30所述的装置，其特征在于，所述收发单元还用于：
    接收所述第一通信设备重传的M个第n编码块，所述M个第n编码块是M个第n待编码块进行polar码编码得到的；每一个处理后的信息比特块的Q个信息比特子块按照所述第一顺序置于M个所述第n待编码块中的Q个所述第n待编码块中；
    所述处理单元还用于将所述M个第一编码块直至所述M个第n编码块进行合并译码，获取译码数据；
    其中，对每一个所述信息比特块的处理满足以下条件：
    每一个所述信息比特块的Q个信息比特子块从二进制域映射至2 w进制域，且映射后的任意一个信息比特块满足
    Figure PCTCN2021082192-appb-100040
    其中，所述
    Figure PCTCN2021082192-appb-100041
    为所述映射后的任意一个信息比特块中的任意一个信息比特子块，所述
    Figure PCTCN2021082192-appb-100042
    为长度为K/wQ的2 w进制序列，所述w为大于1的正整数；
    所述映射后的任意一个信息比特块与转换后对应的信息比特块之间满足以下关系：
    Figure PCTCN2021082192-appb-100043
    其中，所述
    Figure PCTCN2021082192-appb-100044
    为所述
    Figure PCTCN2021082192-appb-100045
    转换后对应的信息比特子块，所述H n为在2 w进制域上的K/w×K/w的通用解码矩阵UDM，所述n用于指示第n次传输；所述n满足n∈[1,2,...,N]，所述N为所述第一通信设备传输的总次数，且所述N为大于3的正整数；
    所述
    Figure PCTCN2021082192-appb-100046
    进行反映射后对应的信息比特块满足[A n,1,A n,2,...,A n,Q]；其中，所述A n,Q为长度为K/Q的二进制序列。
  32. 根据权利要求26所述的装置，其特征在于，所述任意一个编码块至少承载一个信息比特子块，至多承载Q个信息比特子块；其中，所述编码块包括所述第一编码块和所述第二编码块。
  33. 根据权利要求32所述的装置，其特征在于，每个所述编码块按照所述编码块的标识依次排列，其中，第一个所述编码块承载一个信息比特子块；第一个至第Q个所述编码块承载的信息比特块的数量按照所述编码块的排列顺序，依次增加一个，所述第Q个所述编码块承载Q个信息比特子块；所述第Q+1个所述编码块至第M个所述编码块承载信息比特子块的数量按照所述编码块的排列顺序，依次减少一个；所述第M个所述编码块承载一个信息比特子块。
  34. 根据权利要求33所述的装置，其特征在于，所述Q为码率R的量化阶数，所述Q为正整数；第i个所述编码块的码率r i＝i×R/Q，所述i满足1≤i≤Q；第j个所述编码块的码率r j＝(M-j+1)×R/Q，所述j满足Q+1≤j≤M。
  35. 一种通信设备，其特征在于，包括：存储器和处理器；
    所述存储器，用于存储指令；
    所述处理器，用于执行所述指令，使得如权利要求1至8中任一项或权利要求9至17中任一项所述的方法被执行。
  36. 一种通信系统，其特征在于，包括：
    第一通信设备，用于执行如权利要求1至8中任一项所述的方法；
    第二通信设备，用于执行如权利要求9至17中任一项所述的方法。
  37. 一种芯片，其特征在于，包括处理器和接口；
    所述处理器用于读取指令以执行权利要求1至8或9至17中任一项所述的方法。
  38. 一种通信装置，其特征在于，所述通信装置由输入接口、输出接口和逻辑电路组成，所述输入接口用于输入待处理的数据；所述逻辑电路按照如权利要求1至8中任一项所述的方法对待处理的数据进行处理，获取处理后的数据；所述输出接口用于输出处理后的数据。
  39. 一种通信装置，其特征在于，所述通信装置由输入接口、输出接口和逻辑电路组成，所述输入接口用于输入待处理的数据；所述逻辑电路按照如权利要求9至17中任一项所述的方法对待处理的数据进行处理，获取处理后的数据；所述输出接口用于输出处理后的数据。
  40. 一种计算机可读存储介质，其特征在于，包括程序或指令，当所述程序或指令在计算机上运行时，如权利要求1至8或9至17中任一项所述的方法被执行。
PCT/CN2021/082192 2020-04-14 2021-03-22 一种数据处理方法、装置及设备 WO2021208674A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US18/046,255 US11936476B2 (en) 2020-04-14 2022-10-13 Data processing method, apparatus, and device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010291987.2 2020-04-14
CN202010291987.2A CN113541878B (zh) 2020-04-14 2020-04-14 一种数据处理方法、装置及设备

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US18/046,255 Continuation US11936476B2 (en) 2020-04-14 2022-10-13 Data processing method, apparatus, and device

Publications (1)

Publication Number Publication Date
WO2021208674A1 true WO2021208674A1 (zh) 2021-10-21

Family

ID=78084079

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/082192 WO2021208674A1 (zh) 2020-04-14 2021-03-22 一种数据处理方法、装置及设备

Country Status (3)

Country Link
US (1) US11936476B2 (zh)
CN (1) CN113541878B (zh)
WO (1) WO2021208674A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108242968A (zh) * 2016-12-23 2018-07-03 华为技术有限公司 一种信道编码方法及信道编码装置
CN108347300A (zh) * 2017-01-25 2018-07-31 华为技术有限公司 一种调整Polar码的方法、装置及编译码装置
CN109644067A (zh) * 2017-05-05 2019-04-16 捷开通讯(深圳)有限公司 使用极化码传输和接收数据
WO2019152987A1 (en) * 2018-02-05 2019-08-08 Qualcomm Incorporated Mutual information based construction of punctured polar codes

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102164025B (zh) * 2011-04-15 2013-06-05 北京邮电大学 基于重复编码和信道极化的编码器及其编译码方法
CN107026709B (zh) * 2016-02-01 2021-02-12 中兴通讯股份有限公司 一种数据包编码处理方法及装置、基站及用户设备
CN107666369B (zh) * 2016-07-29 2021-02-12 华为技术有限公司 一种重传极化码的方法及其发送设备、接收设备
CN108282247B (zh) * 2017-01-05 2021-11-19 华为技术有限公司 一种控制信息传输方法及装置
US11546929B2 (en) * 2017-01-09 2023-01-03 Huawei Technologies Co., Ltd. Systems and methods for signaling for semi-static configuration in grant-free uplink transmissions
US10686556B2 (en) * 2017-01-17 2020-06-16 Qualcomm Incorporated Robust and universal polar codes
CN112187403B (zh) * 2017-02-04 2022-01-14 华为技术有限公司 信息处理的方法、装置、通信设备和通信系统
CN108631942A (zh) * 2017-03-24 2018-10-09 华为技术有限公司 编码方法、译码方法、装置和设备
CN110061745B (zh) * 2017-06-16 2020-04-28 华为技术有限公司 速率匹配和解速率匹配的方法及装置
CN113541854B (zh) * 2020-04-14 2022-12-13 华为技术有限公司 一种数据处理方法、装置及设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108242968A (zh) * 2016-12-23 2018-07-03 华为技术有限公司 一种信道编码方法及信道编码装置
CN108347300A (zh) * 2017-01-25 2018-07-31 华为技术有限公司 一种调整Polar码的方法、装置及编译码装置
CN109644067A (zh) * 2017-05-05 2019-04-16 捷开通讯(深圳)有限公司 使用极化码传输和接收数据
WO2019152987A1 (en) * 2018-02-05 2019-08-08 Qualcomm Incorporated Mutual information based construction of punctured polar codes

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
HUAWEI; HISILICON: "Polar codes - encoding and decoding", 3GPP DRAFT; R1-164039, vol. RAN WG1, 27 May 2016 (2016-05-27), Nanjing, China, pages 1 - 7, XP051090110 *

Also Published As

Publication number Publication date
CN113541878B (zh) 2022-10-28
US20230113300A1 (en) 2023-04-13
CN113541878A (zh) 2021-10-22
US11936476B2 (en) 2024-03-19

Similar Documents

Publication Publication Date Title
WO2018201831A1 (zh) 通信方法和装置
WO2018045849A1 (zh) 极化码的重传方法及装置
US20190372711A1 (en) Polar code transmission method and apparatus
CN106982172A (zh) 确定极化码传输块大小的方法和通信设备
WO2022161201A1 (zh) 编码调制与解调解码方法及装置
CN111133817B (zh) 通信方法和装置
JP7165954B2 (ja) チャネル符号化に用いるユーザー装置、基地局における方法及び装置
WO2018202140A1 (zh) 编码方法、装置和设备
WO2021254422A1 (zh) Polar码编码方法、Polar码译码方法及其装置
WO2020144899A1 (ja) 基地局、端末、送信方法及び受信方法
WO2018201984A1 (zh) 数据的传输方法和设备
WO2021147103A1 (zh) 一种译码方法、装置及系统
JP2023075199A (ja) 端末装置、送信方法及び集積回路
WO2022095729A1 (zh) 一种无线信道数据处理方法、通信装置及通信设备
WO2019134140A1 (zh) 反馈应答信息发送方法、接收方法、装置及系统
WO2021208674A1 (zh) 一种数据处理方法、装置及设备
WO2021208675A1 (zh) 一种数据处理方法、装置及设备
WO2022228467A1 (zh) 数据传输方法、装置及可读存储介质
US12009836B2 (en) Data processing method, communications apparatus, and communications device
WO2019134071A1 (zh) 反馈信息发送方法、接收方法、装置及系统
WO2018205255A1 (zh) 一种支持混合自动重传请求的用户设备、基站中的方法和装置
WO2024007224A1 (zh) 一种基于反馈的自适应传输方法
WO2024077486A1 (zh) 一种确定循环冗余校验比特的方法、通信方法及装置
CN113812105B (zh) 一种上行控制信息的传输方法、装置及存储介质
WO2024031285A1 (zh) 一种数据处理方法、装置及设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21788161

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21788161

Country of ref document: EP

Kind code of ref document: A1