WO2023071711A1 - 一种编码方法、译码方法及通信装置 - Google Patents

一种编码方法、译码方法及通信装置 Download PDF

Info

Publication number
WO2023071711A1
WO2023071711A1 PCT/CN2022/123378 CN2022123378W WO2023071711A1 WO 2023071711 A1 WO2023071711 A1 WO 2023071711A1 CN 2022123378 W CN2022123378 W CN 2022123378W WO 2023071711 A1 WO2023071711 A1 WO 2023071711A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit sequence
probability distribution
sequence
information bit
distribution value
Prior art date
Application number
PCT/CN2022/123378
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 WO2023071711A1 publication Critical patent/WO2023071711A1/zh

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/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
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1105—Decoding
    • H03M13/1111—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms
    • 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/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection 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/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/0061—Error detection codes
    • H04L1/0063—Single parity check

Definitions

  • the present application relates to the field of communication technologies, and in particular to an encoding method, a decoding method and a communication device.
  • SSCC source channel coding
  • JSCC Joint Source-Channel Coding
  • Figure 1 is a schematic flow chart of the JSCC scheme based on the system Polar (polarization).
  • the encoding side first obtains the bit sequence to be encoded based on the information bit sequence, then performs systematic polarization encoding on the bit sequence to be encoded, and sends the polarized encoded bit sequence to the decoding side after modulation. And the encoding side sends the probability distribution value of the information bit sequence (that is, the ratio of 0 or 1 in the information bit sequence) to the decoding side through control signaling.
  • the decoding side decodes the sequence to be decoded based on the received probability distribution value and the default frozen bit sequence of all 0s.
  • the sending end when decoding, the sending end needs to send control signaling to inform the receiving end of the probability distribution value of the current information bit sequence, which increases the control signaling overhead. If the encoding side does not send the probability distribution value of the information bit sequence to the decoding side.
  • the decoding side tries different probability distribution values sequentially and combines the default frozen bit sequence of all 0s to decode the sequence to be decoded, which will lead to a high probability of false detection.
  • Error detection probability means that the decoding side uses the wrong probability distribution value to try to decode, and obtains the wrong decoding result, but the wrong decoding result has passed the check, such as cyclic redundancy check (cyclic redundancy check, CRC) ) or parity check (parity check, PC).
  • CRC cyclic redundancy check
  • parity check parity check
  • the present application provides an encoding method, a decoding method and a communication device, which are beneficial to reduce the error detection probability on the decoding side.
  • the present application provides an encoding method applied to a first communication device, the method comprising: acquiring a first information bit sequence; determining a first frozen bit sequence based on a probability distribution value P1 of the first information bit sequence; Determine the check bit sequence based on the second information bit sequence, the second information bit sequence is the first information bit sequence or the sequence obtained after the first information bit sequence undergoes a pre-transformation operation; based on the second information bit sequence, the check bit sequence sequence and the first frozen bit sequence to obtain the first bit sequence, the first bit sequence includes bits in the second information bit sequence, bits in the check bit sequence and bits in the first frozen bit sequence; for the first bit Polar coding is performed on the sequence to obtain a second bit sequence; and the second bit sequence is output.
  • the value of the first frozen bit sequence is determined based on the probability distribution value of the first information bit sequence, instead of setting the value of the first frozen bit sequence to all 0 by default, so that
  • the decoding side can sequentially try different probability distribution values in the probability distribution value set and the frozen bit sequence corresponding to the probability distribution value to decode, and the decoding side can better distinguish between different probability distributions value, reducing the probability of false detection.
  • the first communication device may first perform a pre-transformation operation on the first information bit sequence, and then determine the parity bit sequence based on the second information bit sequence obtained by the pre-transformation operation, so that the decoding side only needs to decode
  • the polarized operation is performed on the third information bit sequence obtained by code and passed the verification to obtain the first information bit sequence sent by the first communication device, which is beneficial to reduce power consumption on the decoding side and improve decoding efficiency.
  • the first communication device first determines the parity bit sequence based on the first information bit sequence, and then performs a pre-transformation operation on the first information bit sequence, the decoding side needs to decode each probability distribution value to obtain the third information bit sequence.
  • the polarizing operation is performed, and then the information bit sequence obtained after the polarizing operation is checked (such as CRC or PC). Such a decoding side consumes a lot of power and the decoding efficiency is low.
  • the first communication device may directly determine the parity bit sequence based on the first information bit sequence, that is, the first communication device may not perform a pre-transformation operation on the first information bit sequence, so the decoding side does not need
  • the decoding side can directly determine the third information bit sequence as the first information bit sequence, which can save the processing overhead of the first communication device and the decoding side.
  • the second information bit sequence is the sequence obtained after the first information bit sequence undergoes a pre-transformation operation; or if the probability distribution value P1 is equally probable Distribution, the second information bit sequence is the first information bit sequence.
  • two implementation manners of performing a pre-transformation operation on the first information bit sequence and not performing a pre-transformation operation on the first information bit sequence can be reasonably compatible in the system.
  • Performing a pre-transformation operation on the first information bit sequence utilizes the sparsity of the first information bit sequence to improve decoding performance.
  • the probability distribution value of the first information bit sequence is far from the equiprobable distribution, it means that the first information bit sequence is very sparse.
  • the probability distribution value of the first information bit sequence is equal probability distribution, it means that the first information bit sequence is not sparse, so when the probability distribution value of the first information bit sequence is equal probability distribution, there is no need to perform a pre-transformation operation on the first information bit sequence , so as to save the processing overhead of the first communication device and the decoding side.
  • the probability distribution value P 1 is an equal probability distribution
  • ⁇ is a preset value.
  • This ⁇ can be a small value, for example, it can be 0.001, 0.01, 0.02, 0.03, 0.04 or 0.05 and so on.
  • the check bit position in the first bit sequence is the bit position corresponding to the row whose sum is 1 in G(a), and G(a) is the row of set a in the polarization matrix G and a matrix composed of columns, the polarization matrix G is a polarization matrix used for polar encoding, and the set a is an information bit set, which includes information bit positions and parity bit positions in the first bit sequence.
  • the pre-transformation operation of the first information bit sequence can be decoupled from the operation of determining the check bit sequence based on the second information bit sequence, so that the pre-transformation operation can be used to determine the check bit sequence. Before the bit sequence, in order to reduce the power consumption of the decoding side and improve the decoding efficiency.
  • At least one check bit in the check bit sequence is located among the bits included in the second information bit sequence.
  • the at least one check bit can be used to check the information bit before its position, which is beneficial to realize the function of early stop in decoding.
  • Decoding early stop means that when the decoding side decodes some information bits of the sequence to be decoded, it can check the decoded part of the information bits through the check bits. If the part of the information bits fails to pass the check, Then the decoding is terminated in advance, thereby saving the power consumption on the decoding side.
  • the decoding order of at least one check bit of the check bit sequence is located in the middle of the decoding order of bits included in the second information bit sequence. In this way, the at least one check bit can be used to check the information bits before the decoding order, so as to realize the function of early stop of decoding and save the power consumption of the decoding side.
  • determining the first frozen bit sequence based on the probability distribution value P1 of the first information bit sequence includes: selecting the probability in the probability distribution value set P according to the probability distribution value P1 of the first information bit sequence
  • the distribution value P 0 , the probability distribution value P 0 is the probability distribution value closest to the probability distribution value P 1 in the probability distribution value set P; a probability distribution value in the probability distribution value set P corresponds to a frozen bit sequence mapping method ; Determine the first frozen bit sequence according to the frozen bit sequence mapping mode corresponding to the probability distribution value P 0 .
  • different probability distribution values in the probability distribution value set P can correspond to different frozen bit sequence mapping methods, so that the decoding side is sequentially trying different probability distribution values and probability distribution values in the probability distribution value set When the corresponding frozen bit sequence is decoded, the decoding side can better distinguish different probability distribution values and reduce the probability of false detection.
  • the first frozen bit sequence is determined based on a basic sequence corresponding to the probability distribution value P 0 , and the basic sequence is determined based on the number of probability distribution values included in the probability distribution value set P.
  • the encoding and decoding side only needs to store several basic sequences and the relationship between the first frozen bit sequence and the basic sequence, which is beneficial to reduce storage overhead, and at the same time ensures that different first frozen bit sequences have a certain degree of orthogonality, reducing the probability of error detection.
  • the first frozen bit sequence is determined based on the m-sequence, Gold sequence or pseudo-random sequence corresponding to the probability distribution value P 0 .
  • the encoding and decoding side only needs to store the mapping relationship between the first frozen bit sequence and the m-sequence or Gold sequence or pseudo-random sequence, which is conducive to reducing storage overhead, and at the same time ensures that different first frozen bit sequences have a certain degree of orthogonality, reducing error detection probability.
  • the probability distribution reference value range or the probability distribution reference value is sent to the second communication device every N information bit sequences, where N is an integer greater than 1. Send the probability distribution reference value range or the probability distribution reference value to the second communication device every N information bit sequences, so that the decoding side can preferentially select the probability distribution reference value range or the probability distribution reference value from the probability distribution value set The corresponding probability distribution value is decoded, which is beneficial to reduce the number of decoding attempts on the decoding side and reduce decoding power consumption.
  • the check bits include cyclic redundancy check CRC bits and/or parity check PC bits.
  • the present application provides a decoding method, which is applied to a second communication device, and the method includes:
  • Step 1 obtaining the sequence to be decoded
  • Step 3 Based on the i-th probability distribution value in the probability distribution value set P and the frozen bit sequence corresponding to the i-th probability distribution value, decode the sequence to be decoded, and obtain the third bit sequence corresponding to the i-th probability distribution value , the third bit sequence includes bits in the third information bit sequence, check bits, and bits in the frozen bit sequence corresponding to the i-th probability distribution value;
  • Step 4 verifying the third information bit sequence
  • Step 5 if the third information bit sequence passes the verification, then obtain the first information bit sequence based on the third information bit sequence, and stop decoding, the first information bit sequence is the third information bit sequence, or, the first information bit sequence
  • An information bit sequence is a sequence obtained by polar encoding the third information bit sequence
  • Step 7 if the third information bit sequence fails the verification and i is equal to x, then stop decoding, or obtain the fourth information bit sequence based on the target information bit sequence, and stop decoding; the target information bit sequence is the probability One of the x third information bit sequences corresponding to the distribution value set P, the fourth information bit sequence is a target information bit sequence or a sequence obtained by polar encoding the target information bit sequence.
  • the decoding side when decoding the sequence to be decoded, can sequentially try different probability distribution values in the probability distribution value set and the frozen bit sequences corresponding to the probability distribution values to decode, and the decoding The side can better distinguish different probability distribution values and reduce the probability of false detection.
  • the decoding side can only perform a polarization operation on the third information bit sequence that has passed the verification obtained through decoding to obtain the first information bit sequence sent by the first communication device, which is beneficial to reduce the Power consumption on the code side and improve decoding efficiency.
  • the second communication device may directly determine the third information bit sequence as the first information bit sequence, that is, the second communication device may not perform polar coding on the third information bit sequence to obtain the first information bit sequence , which can save the processing overhead of the second communication device.
  • the first information bit sequence is a sequence obtained by polar encoding the third information bit sequence; or if the value of the i-th probability distribution is isoprobably distributed, the first information bit sequence is the third information bit sequence. Based on this possible implementation, it can be reasonably compatible in the system to determine the third information bit sequence as the first information bit sequence, and determine the sequence obtained after the third information bit sequence undergoes polarization coding as the first information bit sequence. way of realization.
  • the value of the i-th probability distribution is an equal probability distribution, where ⁇ is a preset value, and the P i,r is the i-th Probability distribution value.
  • This ⁇ can be a small value, for example, it can be 0.001, 0.01, 0.02, 0.03, 0.04 or 0.05.
  • the decoding order of the probability distribution values in the probability distribution value set P is determined based on information entropy corresponding to the probability distribution values in the probability distribution value set.
  • the probability distribution value with larger information entropy is less sparse, and the probability distribution value with smaller information entropy is sparser.
  • the sparsity is the same.
  • the information entropy corresponding to the i-th probability distribution value is greater than or equal to the information entropy corresponding to the i+1-th probability distribution value. That is to say, the second communication device may preferentially use a probability distribution value with a larger information entropy for decoding. Due to the large probability distribution value of information entropy, the prior information that can be used by the decoding side is less. Trying these probability distribution values first can reduce the negative effect on the decoding effect caused by the introduction of wrong prior information on the decoding side. influence and reduce the probability of false detection.
  • the decoding order of the probability distribution values in the probability distribution value set P is determined based on the historical probability distribution values of the sending end. Based on this possible implementation manner, it is beneficial to reduce the number of decoding attempts on the decoding side and reduce decoding power consumption.
  • the decoding order of the distribution values is determined based on the probability distribution reference value range or the probability distribution reference value. Based on this possible implementation manner, it is beneficial to reduce the number of decoding attempts on the decoding side and reduce decoding power consumption.
  • the target information bit sequence is a third information bit sequence corresponding to an equal probability distribution in the probability distribution value set P. Since the second communication device does not know what the real probability distribution value is, when all the third information bit sequences corresponding to the probability distribution values fail to pass the verification, the fourth information bit is obtained based on the third information bit sequence corresponding to the equal probability distribution Sequence is a conservative scheme to avoid negative effects introduced by incorrect use of probability distribution values.
  • the check bit position in the third bit sequence is the bit position corresponding to the row whose sum is 1 in G(a), and G(a) is the row of set a in the polarization matrix G and a matrix composed of columns, the polarization matrix G is a polarization matrix used for polar encoding, the set a is an information bit set, and the information bit set includes information bit positions and parity bit positions in the third bit sequence.
  • the pre-transformation operation of the first information bit sequence can be decoupled from the operation of determining the check bit sequence based on the second information bit sequence, so that the pre-transformation operation can be used to determine the check bit sequence.
  • the bit sequence is performed before, so that the decoding side only needs to perform polarization operation on the third information bit sequence obtained by decoding and passing the check, to obtain the first information bit sequence sent by the encoding side, so as to reduce the power consumption of the decoding side And improve decoding efficiency.
  • At least one of the check bits is located among the bits included in the third information bit sequence.
  • the at least one check bit can be used to check the information bit before its position, which is beneficial to realize the function of early stop in decoding.
  • Decoding early stop means that when the decoding side decodes some information bits of the sequence to be decoded, it can check the decoded part of the information bits through the check bits. If the part of the information bits fails to pass the check, Then the decoding is terminated in advance, thereby saving the power consumption of decoding.
  • the decoding order of at least one of the check bits is located in the middle of the decoding order of the bits included in the third information bit sequence. In this way, the at least one check bit can be used to check the information bits before its decoding sequence, so as to realize the function of early stop in decoding.
  • a probability distribution value in the probability distribution value set P corresponds to a frozen bit sequence mapping method
  • the second communication device may also use the frozen bit sequence mapping method corresponding to the i-th probability distribution value , to determine the frozen bit sequence corresponding to the i-th probability distribution value.
  • different probability distribution values in the probability distribution value set P can correspond to different frozen bit sequence mapping methods, so that the decoding side is sequentially trying different probability distribution values and probability distribution values in the probability distribution value set When the corresponding frozen bit sequence is decoded, the decoding side can better distinguish different probability distribution values and reduce the probability of false detection.
  • the frozen bit sequence corresponding to the i-th probability distribution value is determined based on the base sequence corresponding to the probability distribution value, and the base sequence is determined based on the number of probability distribution values included in the probability distribution value set P.
  • the frozen bit sequence corresponding to the i-th probability distribution value is determined based on the m-sequence, Gold sequence or pseudo-random sequence corresponding to the probability distribution value.
  • the check bits include cyclic redundancy check CRC bits and/or parity check PC bits.
  • the present application provides a communication device, which includes: a processing unit, configured to acquire a first information bit sequence; bit sequence; and also used to determine the check bit sequence based on the second information bit sequence, the second information bit sequence is the first information bit sequence or the sequence obtained after the first information bit sequence undergoes a pre-transformation operation; and is also used Based on the second information bit sequence, the check bit sequence and the first frozen bit sequence, the first bit sequence is obtained, and the first bit sequence includes the bits in the second information bit sequence, the bits in the check bit sequence and the first freezing the bits in the bit sequence; and further performing polar encoding on the first bit sequence to obtain a second bit sequence; and further outputting the second bit sequence.
  • the second information bit sequence is the sequence obtained after the first information bit sequence undergoes a pre-transformation operation; or if the probability distribution value P1 is equally probable distribution, the second information bit sequence is the first information bit sequence.
  • the probability distribution value P 1 is an equal probability distribution
  • ⁇ is a preset value.
  • This ⁇ can be a small value, for example, it can be 0.001, 0.01, 0.02, 0.03, 0.04 or 0.05 and so on.
  • the check bit position in the first bit sequence is the bit position corresponding to the row whose sum is 1 in G(a), and G(a) is the row of set a in the polarization matrix G and a matrix composed of columns, the polarization matrix G is a polarization matrix used for polar encoding, the set a is an information bit set, and the information bit set includes information bit positions and parity bit positions in the first bit sequence.
  • At least one check bit in the check bit sequence is located among the bits included in the second information bit sequence.
  • the manner in which the processing unit determines the first frozen bit sequence based on the probability distribution value P1 of the first information bit sequence is specifically: selecting a probability distribution value set according to the probability distribution value P1 of the first information bit sequence
  • the probability distribution value P 0 in P, the probability distribution value P 0 is the probability distribution value closest to the probability distribution value P 1 in the probability distribution value set P;
  • a probability distribution value in the probability distribution value set P corresponds to a A frozen bit sequence mapping manner; according to the frozen bit sequence mapping manner corresponding to the probability distribution value P 0 , the first frozen bit sequence is determined.
  • the first frozen bit sequence is determined based on a basic sequence corresponding to the probability distribution value P 0 , and the basic sequence is determined based on the number of probability distribution values included in the probability distribution value set P.
  • the first frozen bit sequence is determined based on the m-sequence, Gold sequence or pseudo-random sequence corresponding to the probability distribution value P 0 .
  • the communication device further includes a communication unit configured to send the probability distribution reference value range or the probability distribution reference value to the second communication device every N information bit sequences, where N is greater than 1 integer.
  • the check bits include cyclic redundancy check CRC bits and/or parity check PC bits.
  • the present application provides a communication device, which includes:
  • a processing unit configured to obtain a sequence to be decoded
  • the processing unit is further configured to decode the sequence to be decoded based on the i-th probability distribution value in the probability distribution value set P and the frozen bit sequence corresponding to the i-th probability distribution value, to obtain the i-th probability distribution value corresponding to the i-th probability distribution value
  • a three-bit sequence, the third bit sequence includes bits in the third information bit sequence, check bits, and bits in the frozen bit sequence corresponding to the i-th probability distribution value
  • the processing unit is further configured to check the third information bit sequence
  • the processing unit is further configured to obtain a first information bit sequence based on the third information bit sequence and stop decoding if the third information bit sequence passes the verification, the first information bit sequence is the third information bit sequence, or, The first information bit sequence is a sequence obtained by polar encoding the third information bit sequence;
  • the processing unit is further configured to stop decoding if the third information bit sequence fails the verification and i is equal to x, or obtain a fourth information bit sequence based on the target information bit sequence, and stop decoding; the target information bit sequence
  • the sequence is one of the x third information bit sequences corresponding to the probability distribution value set P, the fourth information bit sequence is the target information bit sequence, or the fourth information bit sequence is the target information bit sequence after polarization coding obtained sequence.
  • the first information bit sequence is a sequence obtained by polar encoding the third information bit sequence; or if the value of the i-th probability distribution is Equal probability distribution, the first information bit sequence is the third information bit sequence.
  • the i-th probability distribution value is an equal probability distribution
  • ⁇ is a preset value
  • P i,r is the i-th probability distribution value.
  • This ⁇ can be a small value, for example, it can be 0.001, 0.01, 0.02, 0.03, 0.04 or 0.05 and so on.
  • the decoding order of the probability distribution values in the probability distribution value set P is determined based on information entropy corresponding to the probability distribution values in the probability distribution value set P.
  • the information entropy corresponding to the i-th probability distribution value is greater than or equal to the information entropy corresponding to the i+1-th probability distribution value.
  • the decoding order of the probability distribution values in the probability distribution value set P is determined based on the historical probability distribution values of the sending end.
  • the communication device further includes a communication unit, configured to receive the probability distribution reference value range or the probability distribution reference value sent by the first communication device every N information bit sequences, where N is greater than 1 is an integer; wherein, the decoding order of the probability distribution values in the probability distribution value set P is determined based on the probability distribution reference value range or the probability distribution reference value.
  • the target information bit sequence is a third information bit sequence corresponding to an equal probability distribution in the probability distribution value set P.
  • the check bit position in the third bit sequence is the bit position corresponding to the row whose sum is 1 in G(a), and G(a) is the row of set a in the polarization matrix G and columns, the polarization matrix G is a polarization matrix used for polar encoding, the set a is an information bit set, and the information bit set includes information bit positions and parity bit positions in the third bit sequence.
  • At least one of the check bits is located among the bits included in the third information bit sequence.
  • a probability distribution value in the probability distribution value set P corresponds to a frozen bit sequence mapping method
  • the processing unit is further configured to use the frozen bit sequence mapping method corresponding to the i-th probability distribution value , to determine the frozen bit sequence corresponding to the i-th probability distribution value.
  • the frozen bit sequence corresponding to the i-th probability distribution value is determined based on a base sequence corresponding to the probability distribution value, and the base sequence is determined based on the number of probability distribution values included in the probability distribution value set P.
  • the frozen bit sequence corresponding to the i-th probability distribution value is determined based on the m-sequence, Gold sequence or pseudo-random sequence corresponding to the probability distribution value.
  • the check bits include cyclic redundancy check CRC bits and/or parity check PC bits.
  • the present application provides a communication device, the communication device includes a processor, and when the processor invokes a computer program in a memory, the method described in the first aspect or the second aspect is executed.
  • the present application provides a communication device, the communication device includes a processor and a memory, and the processor and the memory are coupled; the processor is used to implement the method as described in the first aspect or the second aspect.
  • the present application provides a communication device.
  • the communication device includes a processor, a memory, and a transceiver, and the processor and the memory are coupled; the transceiver is used to send and receive data, and the processor is used to implement the communication described in the first aspect or the second aspect. Methods.
  • the present application provides a communication device, the communication device includes a processor and an interface, the interface is used to receive or output signals, and the processor is used to realize the communication as described in the first aspect or the second aspect through a logic circuit or executing code instructions. described method.
  • the present application provides a computer-readable storage medium, in which computer programs or instructions are stored, and when the computer programs or instructions are executed by the communication device, the method as described in the first aspect or the second aspect is implemented .
  • the present application provides a computer program product including instructions.
  • a computer reads and executes the computer program product, the computer executes the method described in the first aspect or the second aspect.
  • Fig. 1 is a schematic flow chart of an existing encoding and decoding method
  • FIG. 2 is a schematic diagram of a communication system provided by an embodiment of the present application.
  • FIG. 3 is a schematic flowchart of a coding method provided in an embodiment of the present application.
  • FIG. 4 is a schematic flowchart of another encoding and decoding method provided by the embodiment of the present application.
  • FIG. 5 is a schematic diagram of a nesting relationship provided by an embodiment of the present application.
  • FIG. 6 is a schematic flowchart of another encoding and decoding method provided by the embodiment of the present application.
  • FIG. 7 is a schematic structural diagram of a communication device provided by an embodiment of the present application.
  • FIG. 8 is a schematic structural diagram of another communication device provided by an embodiment of the present application.
  • FIG. 9 is a schematic structural diagram of a chip provided by an embodiment of the present application.
  • FIG. 2 is a schematic diagram of a communication system 2000 applied by an embodiment of the present application.
  • the communication system 2000 includes a radio access network 100 and a core network 200 .
  • the communication system 2000 may also include the Internet 300 .
  • the radio access network 100 may include at least one radio access network device (such as 110a and 110b in FIG. 2 ), and may also include at least one terminal device (such as 120a-120j in FIG. 2 ).
  • the terminal equipment is connected to the wireless access network equipment in a wireless manner, and the wireless access network equipment is connected to the core network in a wireless or wired manner.
  • the core network equipment and the wireless access network equipment can be independent and different physical equipment, or the functions of the core network equipment and the logical functions of the wireless access network equipment can be integrated on the same physical equipment, or it can be a physical equipment It integrates some functions of core network equipment and some functions of wireless access network equipment.
  • Terminal devices and terminal devices and wireless access network devices may be connected to each other in a wired or wireless manner.
  • FIG. 2 is only a schematic diagram.
  • the communication system may also include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown in FIG. 2 .
  • the radio access network equipment can be a base station (base station), an evolved base station (evolved NodeB, eNodeB), a transmission reception point (transmission reception point, TRP), and the next generation in the fifth generation (5th generation, 5G) mobile communication system
  • Base station (next generation NodeB, gNB), the next generation base station in the sixth generation (6th generation, 6G) mobile communication system, the base station in the future mobile communication system or the access node in the WiFi system, etc.; it can also complete the base station part
  • a functional module or unit for example, can be a centralized unit (central unit, CU) or a distributed unit (distributed unit, DU).
  • the CU here completes the functions of the radio resource control protocol and the packet data convergence protocol (PDCP) of the base station, and also completes the function of the service data adaptation protocol (SDAP); the DU completes the functions of the base station
  • the functions of the radio link control layer and the medium access control (medium access control, MAC) layer can also complete the functions of part or all of the physical layer.
  • the radio access network device may be a macro base station (such as 110a in Figure 2), a micro base station or an indoor station (such as 110b in Figure 2), or a relay node or a donor node.
  • the radio access network device may be referred to as network device for short.
  • the radio access network device is referred to as network device for description below.
  • a terminal device may also be called a terminal, a user equipment (user equipment, UE), a mobile station, a mobile terminal, and the like.
  • Terminal devices can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (internet of things, IOT), virtual reality, augmented reality, industrial control, automatic driving, telemedicine, smart grid, smart furniture, smart office, smart wear, smart transportation, smart city, etc.
  • Terminals can be mobile phones, tablet computers, computers with wireless transceiver functions, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, etc.
  • the embodiment of the present application does not limit the specific technology and specific device form adopted by the terminal device.
  • Network equipment and terminal equipment can be fixed or mobile.
  • Network equipment and terminal equipment can be deployed on land, including indoors or outdoors, hand-held or vehicle-mounted; they can also be deployed on water; they can also be deployed on aircraft, balloons and artificial satellites in the air.
  • the embodiments of the present application do not limit the application scenarios of the network device and the terminal device.
  • the terminal device 120i is a network device; but for the network device 110a, 120i is a terminal device, that is, communication between 110a and 120i is performed through a wireless air interface protocol. Of course, communication between 110a and 120i may also be performed through an interface protocol between network devices. In this case, compared to 110a, 120i is also a network device. Therefore, both network equipment and terminal equipment can be collectively referred to as communication devices, 110a and 110b in FIG. 2 can be referred to as communication devices with network device functions, and 120a-120j in FIG. 2 can be referred to as communication devices with terminal device functions .
  • Communication between network devices and terminal devices, between network devices and network devices, between terminal devices and terminal devices can be performed through licensed spectrum, or through license-free spectrum, or through licensed spectrum and license-free spectrum at the same time
  • Communication can be performed through a frequency spectrum below 6 gigahertz (GHz), or can be performed through a frequency spectrum above 6 GHz, and can also be performed using a frequency spectrum below 6 GHz and a frequency spectrum above 6 GHz at the same time.
  • GHz gigahertz
  • the embodiments of the present application do not limit the frequency spectrum resources used for wireless communication.
  • the functions of the network device may also be performed by a module (such as a chip) in the network device, or may be performed by a control subsystem including the functions of the network device.
  • the control subsystem including network device functions may be the control center in the above application scenarios such as smart grid, industrial control, intelligent transportation, and smart city.
  • the functions of the terminal equipment may also be performed by a module (such as a chip or a modem) in the terminal equipment, or may be performed by a device including the functions of the terminal equipment.
  • the first communication device on the encoding side may be a terminal device, and the second communication device on the decoding side may be a network device.
  • the first communication device on the encoding side may be a network device, and the second communication device on the decoding side may be a terminal device.
  • the probability distribution value of the information bit sequence refers to the proportion of 0 or 1 in the information bit sequence. For example, take the probability distribution value as an example of the proportion of 1 in the information bit sequence. Assuming that the information bit sequence is 0000000011, the probability distribution value of the information bit sequence is 0.2.
  • the log likelihood ratio of a bit refers to the natural logarithm of the ratio of the probability that the bit is 1 to the probability that the bit is 0. If the probability of the bit being 1 is recorded as P(1), and the probability of the bit being 0 is recorded as P(0), then the log likelihood ratio of the bit is ln[P(0)/P(1) ].
  • the encoding code length refers to the number of bits in the encoded bit sequence. In the case where the number of information bits is fixed, if the coding method with a longer coding code length is used for coding, the more redundant bits in the coded bit sequence are, and the higher the reliability of data transmission is.
  • the coding rate refers to the ratio of information bits before coding to bits after coding. For a bit sequence, if a coding method with a lower coding rate is used for coding, the more redundant bits in the coded bit sequence will be, and the higher the reliability of data transmission will be.
  • a sequence that can be predetermined and can be repeated is called a definite sequence; a sequence that can neither be predetermined nor repeated is called a random sequence; a sequence that cannot be predetermined but can be repeatedly generated is called a pseudo-random sequence.
  • the m-sequence is the abbreviation of the longest linear shift register sequence, which is a pseudo-random sequence, a pseudo-noise (PN) code or a pseudo-random code or a pseudo-random sequence.
  • PN pseudo-noise
  • m-sequence is the most important and basic pseudo-random sequence.
  • the Gold sequence is a sequence generated by adding a pair of preferential m-sequences modulo 2, and a pair of preferential m-sequences makes the cross-correlation of different Gold sequences smaller.
  • FIG. 3 is a schematic flow chart of a method for encoding and decoding provided by an embodiment of the present application.
  • the encoding and decoding method includes the following steps 301 to 315 .
  • the method shown in FIG. 3 may be executed by the first communication device and the second communication device.
  • the execution body of the method shown in FIG. 3 may be a chip in the first communication device and a chip in the second communication device.
  • FIG. 3 is illustrated by taking the first communication device and the second communication device as execution subjects of the method as an example.
  • the first communication device acquires a first information bit sequence.
  • the first communications device determines a first frozen bit sequence based on the probability distribution value P1 of the first information bit sequence.
  • the first communication device determines the first frozen bit sequence based on the probability distribution value P1 of the first information bit sequence means: the first communication device determines the first frozen bit sequence based on the probability distribution value P1 of the first information bit sequence Freeze the value of the bit sequence. That is to say, the value of the first frozen bit sequence is not all 0 by default, and the value of the first frozen bit sequence is related to the probability distribution value P1 of the first information bit sequence.
  • the first communication device determines the first frozen bit sequence based on the probability distribution value P1 of the first information bit sequence.
  • P 1 selects the probability distribution value P 0 in the probability distribution value set P, and the probability distribution value P 0 is the probability distribution value closest to the probability distribution value P 1 in the probability distribution value set P; one of the probability distribution value sets P A probability distribution value corresponds to a frozen bit sequence mapping mode; according to the frozen bit sequence mapping mode corresponding to the probability distribution value P0 , the first frozen bit sequence is determined.
  • the probability distribution value set P is a set set in advance on the encoding side and the decoding side.
  • the probability distribution value set P includes multiple probability distribution values, and different probability distribution values correspond to different frozen bit sequence mapping methods. That is to say, different probability distribution values in the probability distribution value set P correspond to different frozen bit sequence values.
  • the probability distribution value set P includes ⁇ 0.2, 0.4, 0.5, 0.7 ⁇ .
  • a probability distribution value of 0.2 corresponds to frozen bit sequence mapping mode 1
  • a probability distribution value of 0.4 corresponds to frozen bit sequence mapping mode 2
  • a probability distribution value of 0.5 corresponds to frozen bit sequence mapping mode 3
  • a probability distribution value of 0.7 corresponds to frozen bit sequence mapping mode 4.
  • the first communication device obtains the probability distribution value 0.5 from the probability distribution value set P, and determines the value of the first frozen bit sequence based on the frozen bit sequence mapping method 3 corresponding to the probability distribution value 0.5. value.
  • different probability distribution values in the probability distribution value set P can correspond to different frozen bit sequence mapping methods, so that the decoding side is sequentially trying different probability distribution values and probability distribution values in the probability distribution value set When the corresponding frozen bit sequence is decoded, the decoding side can better distinguish different probability distribution values and reduce the probability of false detection.
  • the frozen bit sequence mapping method corresponding to the probability distribution value P0 may specifically include the following four methods:
  • Mode 1 The first frozen bit sequence is determined based on the basic sequence corresponding to the probability distribution value P 0 , and the basic sequence is determined based on the number of probability distribution values included in the probability distribution value set P.
  • the probability distribution value set P includes ⁇ 0.2, 0.4, 0.5, 0.7 ⁇ , and the number of probability distribution values in the probability distribution value set P is four. Then these 4 probability distribution values can be represented by 2 bits.
  • the probability distribution value 0.2 is represented by the basic sequence 00
  • the probability distribution value 0.4 is represented by the basic sequence 01
  • the probability distribution value 0.5 is represented by the basic sequence 10
  • the probability distribution value 0.7 is represented by the basic sequence 11.
  • the frozen bit sequence mapping mode 1 corresponding to the probability distribution value 0.2 is: determine the frozen bit sequence based on the basic sequence 00.
  • the frozen bit sequence mapping method 2 corresponding to the probability distribution value 0.4 is: determine the frozen bit sequence based on the basic sequence 01.
  • the frozen bit sequence mapping mode 3 corresponding to the probability distribution value 0.5 is: determine the frozen bit sequence based on the basic sequence 10 .
  • the frozen bit sequence mapping mode 4 corresponding to the probability distribution value 0.7 is: determine the frozen bit sequence based on the basic sequence 11 .
  • the value of the first frozen bit sequence can be obtained by directly extending or cross-extending the basic sequence corresponding to the probability distribution value P 0 .
  • the base sequence 00 can be directly expanded to obtain the first frozen bit sequence 0000. If the probability distribution value P 0 is 0.4, the base sequence 01 can be directly expanded to obtain the first frozen bit sequence 0101 . If the probability distribution value P 0 is 0.5, the base sequence 10 can be directly expanded to obtain the first frozen bit sequence 1010 . If the probability distribution value P 0 is 0.7, the base sequence 11 can be directly expanded to obtain the first frozen bit sequence 1111 .
  • the base sequence 00 can be cross-extended to obtain the first frozen bit sequence 0000. If the probability distribution value P 0 is 0.4, the base sequence 01 can be cross-extended to obtain the first frozen bit sequence 0011. If the probability distribution value P 0 is 0.5, then the base sequence 10 can be cross-extended to obtain the first frozen bit sequence as 1100. If the probability distribution value P 0 is 0.7, the base sequence 11 can be cross-extended to obtain the first frozen bit sequence 1111.
  • the encoding and decoding side only needs to store several basic sequences and the relationship between the first frozen bit sequence and the basic sequence, which is beneficial to reduce storage overhead and ensure that different first frozen bit sequences have a certain
  • the orthogonality reduces the probability of false detection.
  • the first frozen bit sequence is determined based on the m-sequence corresponding to the probability distribution value P 0 .
  • different probability distribution values in the probability distribution value set P correspond to different m-sequences.
  • the probability distribution value set P includes ⁇ 0.2, 0.4, 0.5, 0.7 ⁇ .
  • a probability distribution value of 0.2 corresponds to m-sequence 1
  • a probability distribution value of 0.4 corresponds to m-sequence 2
  • a probability distribution value of 0.5 corresponds to m-sequence 3
  • a probability distribution value of 0.7 corresponds to m-sequence 4.
  • the frozen bit sequence mapping mode 1 corresponding to the probability distribution value 0.2 is: determine the frozen bit sequence based on the m sequence 1 .
  • the frozen bit sequence mapping mode 2 corresponding to the probability distribution value 0.4 is: determine the frozen bit sequence based on the m sequence 2 .
  • the frozen bit sequence mapping mode 3 corresponding to the probability distribution value 0.5 is: determine the frozen bit sequence based on the m sequence 3 .
  • the frozen bit sequence mapping mode 4 corresponding to the probability distribution value 0.7 is: determine the frozen bit sequence based on the m sequence 4 .
  • the first N f bits can be selected from the m sequence as the first frozen bit sequence value of . If the length of the m-sequence corresponding to the probability distribution value P 0 is smaller than the length N f of the first frozen bit sequence, the frozen bits exceeding the length of the m-sequence can be assigned a value of 0.
  • the probability distribution value P 0 is 0.2, if the length of m-sequence 1 is 7, m-sequence 1 is 1010101, and the length N f of the first frozen bit sequence is 5, then the value of the first frozen bit sequence is 10101. If the length of m-sequence 1 is 7, the length of m-sequence 1 is 1010101, and the length N f of the first frozen bit sequence is 10. Then the value of the first frozen bit sequence is 1010101000.
  • the encoding and decoding side only needs to store the mapping relationship between the first frozen bit sequence and the m sequence, which is beneficial to reduce storage overhead and ensure that different first frozen bit sequences have a certain degree of orthogonality , reducing the probability of false detection.
  • Mode 3 The first frozen bit sequence is determined based on the Gold sequence corresponding to the probability distribution value P 0 .
  • Mode 3 is implemented in the same way as Mode 2.
  • Mode 3 please refer to the specific implementation mode of Mode 2, which will not be repeated here.
  • Mode 4 The first frozen bit sequence is determined based on the pseudo-random sequence corresponding to the probability distribution value P 0 .
  • Mode 4 is implemented in the same way as Mode 2.
  • the pseudo-random sequence is determined by the first communication device based on a random seed, and the random seed may be agreed between the first communication device and the second communication device through signaling, or the random seed may be predetermined by a protocol.
  • the protocol may also directly define in advance the frozen bit sequence values corresponding to different probability distribution values and the length of the frozen bit sequence. Based on the probability distribution value P 0 and the length of the first frozen bit sequence, the first communication device determines the value of the first frozen bit sequence from multiple values of the frozen bit sequence predefined in the protocol.
  • the protocol can predefine that when the probability distribution value is 0.2 and the frozen bit sequence length is 2, the corresponding frozen bit sequence takes the value 00; when the probability distribution value is 0.2 and the frozen bit sequence length is 4, the corresponding frozen bit sequence takes The value is 0000; when the probability distribution value is 0.4 and the length of the frozen bit sequence is 2, the value of the corresponding frozen bit sequence is 10; when the probability distribution value is 0.4 and the length of the frozen bit sequence is 4, the corresponding value of the frozen bit sequence is 1010.
  • the probability distribution value is 0.5 and the frozen bit sequence length is 2
  • the corresponding frozen bit sequence value is 01
  • when the probability distribution value is 0.5 and the frozen bit sequence length is 4, the corresponding frozen bit sequence value is 0101.
  • the probability distribution value is 0.7 and the frozen bit sequence length is 2
  • the corresponding frozen bit sequence value is 11; when the probability distribution value is 0.7 and the frozen bit sequence length is 4, the corresponding frozen bit sequence value is 1111.
  • the first communication device determines a parity bit sequence based on the second information bit sequence.
  • the second information bit sequence is the first information bit sequence or a sequence obtained after the first information bit sequence undergoes a pre-transformation operation.
  • the length of the second information bit sequence after the pre-transformation operation is the same as the length of the first information bit sequence.
  • Step 302 may be performed before or after step 303 .
  • the first communication device may perform a pre-transformation operation on the first information bit sequence based on the first frozen bit sequence to obtain the second information bit sequence.
  • the second information bit sequence may satisfy the following formula (1):
  • u(src) [x(src)-u(chk)*G(chk,src)-u(frz)*G(frz,src)]*G(src) -1 (1)
  • u(src) is the second information bit sequence.
  • x(src) is the first information bit sequence.
  • G(chk, src) means taking the row of the polarization matrix G corresponding to the set chk and the column corresponding to the set src.
  • u(frz) is the first frozen bit sequence.
  • G(frz, src) means taking the row of the polarization matrix G corresponding to the set frz and the column corresponding to the set src.
  • G(src) means to take the rows and columns of the set src corresponding to the polarization matrix G.
  • the set src represents a set of information bit positions
  • the set chk represents a set of check bit positions
  • the set frz represents a set of frozen bits.
  • the check bits include a cyclic redundancy check (cyclic redundancy check, CRC) and/or a parity check (parity check, PC).
  • CRC cyclic redundancy check
  • PC parity check
  • the first communication device obtains the first bit sequence based on the second information bit sequence, the parity bit sequence, and the first frozen bit sequence.
  • the first bit sequence includes bits in the second information bit sequence, bits in the parity bit sequence and bits in the first frozen bit sequence.
  • the first communication device obtains the first bit sequence based on the second information bit sequence, the parity bit sequence and the first frozen bit sequence as follows: the first communication device converts the second information bit sequence into Bits in the sequence are mapped to information bit positions in the information bit set, and bits in the check bit sequence are mapped to check bit positions in the information bit set, and bits in the first frozen bit sequence are mapped to frozen bits The frozen bit positions in the set, resulting in the first bit sequence.
  • the information bit set includes information bit positions and parity bit positions in the first bit sequence
  • the frozen bit set includes frozen bit positions in the first bit sequence.
  • the information bit set and the frozen bit set can be obtained based on the sum of the length of the second information bit sequence and the length of the parity bit sequence and the encoding code length.
  • the first communication device may acquire the information bit set and the frozen bit set based on the information bit length 12 and the encoding code length 16 .
  • the information bit set includes ⁇ 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 ⁇
  • the information bit positions in the information bit set include ⁇ 8, 10, 11, 12, 13, 14, 15, 16 ⁇
  • the check bit positions in the information bit set include ⁇ 4, 6, 7, 9 ⁇ .
  • the set of frozen bits includes ⁇ 1, 2, 3, 5 ⁇ .
  • the first communication device maps 8 bits in the second information bit sequence to information bit positions ⁇ 8, 10, 11, 12, 13, 14, 15, 16 ⁇ , and maps 4 bits in the check bit sequence to Check bit positions ⁇ 4, 6, 7, 9 ⁇ , and map the 4 bits in the first frozen bit sequence to the frozen bit set ⁇ 1, 2, 3, 5 ⁇ to obtain the first bit sequence.
  • the check bit position in the first bit sequence is the bit position corresponding to the row whose sum is 1 in G(a), and G(a) is the row of set a in the polarization matrix G and a matrix composed of columns, the polarization matrix G is a polarization matrix used for polar encoding, the set a is an information bit set, and the information bit set includes information bit positions and parity bit positions in the first bit sequence.
  • the above G(chk, src) can be set to 0, so that the pre-transformation operation on the first information bit sequence is decoupled from the determination of the parity bit sequence based on the second information bit sequence, so that the pre-transformation
  • the operation can be performed before determining the parity bit sequence, so as to reduce power consumption on the decoding side and improve decoding efficiency.
  • the encoding code length is 16, the information bit length is 12, and the freezing bit length is 4.
  • the length of the second information bit sequence is 8, and the length of the check bit sequence is 4.
  • the corresponding polarization matrix G under the encoding code length is shown in Table 1 below:
  • the decoding reliability ranking of each bit position can be ⁇ 1, 2, 3, 5, 9, 4, 6, 7, 10, 11, 13, 8, 12, 14, 15, 16 ⁇ , select the highest reliability
  • the 12 bit positions serve as a set of information bits. For example, ⁇ 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 ⁇ may be selected as the information bit set. Assuming that decoding is performed in reverse order of bits, the corresponding order is ⁇ 1, 9, 5, 13, 3, 11, 7, 15, 2, 10, 6, 14, 4, 12, 8, 16 ⁇ .
  • the rows summing to 1 in G(info_sorted) can be counted (that is, the bold rows in Table 2 above), and there are a total of 4 bit positions ⁇ 9, 7, 6, 4 ⁇ . These 4 bit positions ⁇ 9, 7, 6, 4 ⁇ are parity bit positions.
  • At least one check bit in the check bit sequence is located among the bits included in the second information bit sequence. If the decoding is performed in a non-bit reverse order, the at least one check bit can be used to check the information bits before it, realizing the function of early stop of decoding. Decoding early stop means that when the decoding side decodes some information bits of the sequence to be decoded, it can check the decoded part of the information bits through the check bits. If the part of the information bits fails to pass the check, Then the decoding is terminated in advance, thereby saving the power consumption of decoding.
  • the information bit set is ⁇ 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 ⁇
  • the decoding order is also ⁇ 4, 6 , 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 ⁇ .
  • parity bit positions include ⁇ 4, 9, 13, 14 ⁇ .
  • the check bits corresponding to the check bit positions ⁇ 4, 9 ⁇ are used to check the information bits corresponding to the information bit positions ⁇ 6, 7, 8 ⁇ .
  • the check bits corresponding to the check bit positions ⁇ 13, 14 ⁇ are used to check the information bits corresponding to the information bit positions ⁇ 10, 11, 12, 15, 16 ⁇ . If the information bit corresponding to the information bit position ⁇ 6, 7, 8 ⁇ fails to pass the verification, the decoding side can stop decoding in advance, so as to realize early stop of decoding.
  • the decoding order of at least one check bit of the check bit sequence is located in the middle of the decoding order of bits included in the second information bit sequence. In this way, the at least one check bit can be used to check the information bits before its decoding sequence, so as to realize the function of early stop in decoding.
  • the decoding order of information bits is ⁇ 9, 13, 11, 7, 15, 10, 6, 14, 4, 12, 8, 16 ⁇ .
  • Check bit positions include ⁇ 9, 7, 6, 4 ⁇ .
  • the check bits corresponding to the check bit positions ⁇ 9, 7 ⁇ are used to check the information bits corresponding to the information bit positions ⁇ 13, 11 ⁇ .
  • the check bits corresponding to the check bit positions ⁇ 6, 4 ⁇ are used to check the information bits corresponding to the information bit positions ⁇ 8, 10, 12, 14, 15, 16 ⁇ . If the information bit corresponding to the information bit position ⁇ 13, 11 ⁇ fails to pass the verification, the decoding side can stop decoding in advance, so as to realize early stop of decoding.
  • the first communication device performs polar encoding on the first bit sequence to obtain a second bit sequence.
  • the first communication device may perform polar coding on the first bit sequence by using the polarization matrix G to obtain the second bit sequence.
  • the bits obtained after polar encoding the parity bits in the first bit sequence satisfy the following formula (2):
  • x(chk) is a bit obtained by polar encoding the parity bits in the first bit sequence.
  • u(src) is the second information bit sequence.
  • G(src, chk) means to take the row of the polarization matrix G corresponding to the set src and the column of the corresponding set chk.
  • u(chk) is a check bit sequence.
  • G(chk) means to take the rows and columns of the set chk corresponding to the polarization matrix G.
  • u(frz) is the first frozen bit sequence.
  • G(frz, chk) means to take the row of the polarization matrix G corresponding to the set frz and the column of the corresponding set chk.
  • the set src represents a set of information bit positions
  • the set chk represents a set of check bit positions
  • the set frz represents a set of frozen bits.
  • the bits obtained after polar encoding the frozen bits in the first bit sequence satisfy the following formula (3):
  • x(frz) is a bit obtained by polar coding the frozen bits in the first bit sequence.
  • u(src) is the second information bit sequence.
  • G(src, frz) means taking the row of the polarization matrix G corresponding to the set src and the column corresponding to the set frz.
  • u(chk) is a check bit sequence.
  • G(chk, frz) means taking the row of the polarization matrix G corresponding to the set chk and the column corresponding to the set frz.
  • u(frz) is the first frozen bit sequence.
  • G(frz) means to take the row and column of the polarization matrix G corresponding to the set frz.
  • the set src represents a set of information bit positions
  • the set chk represents a set of check bit positions
  • the set frz represents a set of frozen bits.
  • the first communications device outputs a second bit sequence.
  • the first communication device modulates the second bit sequence to obtain modulation symbols.
  • the first communications device sends a modulation symbol to the second communications device.
  • the second communication device acquires a sequence to be decoded.
  • the second communication device demodulates the modulation symbols to obtain a sequence to be decoded.
  • the sequence to be decoded may be an LLR sequence, and the LLR sequence includes three parts, namely the LLR sequence corresponding to the set src, the LLR sequence corresponding to the set chk, and the LLR sequence corresponding to the set frz.
  • the set src represents a set of information bit positions
  • the set chk represents a set of check bit positions
  • the set frz represents a set of frozen bits.
  • the sequence to be decoded may be other bit sequence or symbol sequence.
  • the second communication device decodes the sequence to be decoded based on the i-th probability distribution value in the probability distribution value set P and the frozen bit sequence corresponding to the i-th probability distribution value, and obtains the i-th probability distribution value corresponding to the i-th probability distribution value three-bit sequence.
  • the third bit sequence includes bits in the third information bit sequence, parity bits, and bits in the frozen bit sequence corresponding to the i-th probability distribution value.
  • the second communication device verifies the third information bit sequence.
  • the second communication device acquires the first information bit sequence based on the third information bit sequence, and stops decoding.
  • the first information bit sequence is the third information bit sequence, or, the first information bit sequence is a sequence obtained by polar encoding the third information bit sequence.
  • x is the number of probability distribution values included in the probability distribution value set P.
  • the second communication device stops decoding, or acquires a fourth information bit sequence based on the target information bit sequence, and stops decoding.
  • the target information bit sequence is one of the x third information bit sequences corresponding to the probability distribution value set P
  • the fourth information bit sequence is the target information bit sequence
  • the fourth information bit sequence is the The target information bit sequence is a sequence obtained after polar coding.
  • i represents the decoding order of the probability distribution values in the probability distribution value set P.
  • the i-th probability distribution value represents the i-th probability distribution value used to decode the sequence to be decoded in the probability distribution value set P.
  • the second communication device may first decode the sequence to be decoded based on the probability distribution value 0.2 and the frozen bit sequence corresponding to the probability distribution value 0.2, to obtain a third bit sequence 1 corresponding to the probability distribution value 0.2.
  • the third bit sequence 1 includes bits in the third information bit sequence 1, parity bits 1, and bits in the frozen bit sequence corresponding to the probability distribution value 0.2. If the third information bit sequence 1 passes the verification, the second communication device obtains the first information bit sequence based on the third information bit sequence 1, and stops decoding, and the first information bit sequence is the third information bit sequence 1, or , the first information bit sequence is a sequence obtained by polar encoding the third information bit sequence 1 .
  • the second communication device decodes the sequence to be decoded based on the probability distribution value 0.5 and the frozen bit sequence corresponding to the probability distribution value 0.5, and obtains the third bit corresponding to the probability distribution value 0.5 sequence 2.
  • the third bit sequence 2 includes bits in the third information bit sequence 2, parity bits 2, and bits in the frozen bit sequence corresponding to the probability distribution value 0.5. If the third information bit sequence 2 passes the verification, the second communication device obtains the first information bit sequence based on the third information bit sequence 2, and stops decoding, and the first information bit sequence is the third information bit sequence 2, or , the first information bit sequence is a sequence obtained by polar encoding the third information bit sequence 2 .
  • the second communication device decodes the sequence to be decoded based on the probability distribution value 0.7 and the frozen bit sequence corresponding to the probability distribution value 0.7, and obtains the third bit corresponding to the probability distribution value 0.7 Sequence 3.
  • the third bit sequence 3 includes bits in the third information bit sequence 3 , parity bits 3 and bits in the frozen bit sequence corresponding to the probability distribution value 0.7. If the third information bit sequence 3 passes the verification, the second communication device obtains the first information bit sequence based on the third information bit sequence 3, and stops decoding, and the first information bit sequence is the third information bit sequence 3, or , the first information bit sequence is a sequence obtained by polar encoding the third information bit sequence 3 .
  • the second communication device may stop decoding, or select a third information bit sequence from the third information bit sequence 1 to the third information bit sequence 3 to determine the fourth information bit sequence. For example, if the third information bit sequence 2 is selected to determine the fourth information bit sequence, then the fourth information bit sequence can be the third information bit sequence 2, or the fourth information bit sequence is the third information bit sequence 2 through polarization The resulting sequence after encoding.
  • the second communication device decodes the sequence to be decoded based on the i-th probability distribution value and the frozen bit sequence corresponding to the i-th probability distribution value to obtain the i-th probability distribution
  • a possible implementation of the third bit sequence corresponding to the value is presented:
  • the second communication device may correct the value of the LLR sequence corresponding to the set src in the sequence to be decoded based on the i-th probability distribution value, to obtain the corrected LLR sequence corresponding to the set src.
  • the LLR sequence corresponding to the corrected set src satisfies the following formula (4):
  • LLR'(src) LLR(src)+log((1-P i,r )/P i,r ) (4)
  • LLR(src) is the LLR sequence corresponding to the set src
  • LLR'(src) is the LLR sequence corresponding to the set src after correcting the LLR sequence corresponding to the set src based on the i-th probability distribution value.
  • P i,r is the i-th probability distribution value.
  • the second communication device decodes the corrected sequence to be decoded based on the frozen bit sequence corresponding to the i-th probability distribution value to obtain a third bit sequence corresponding to the i-th probability distribution value.
  • the corrected sequence to be decoded includes three parts, which are the LLR sequence corresponding to the set chk, the LLR sequence corresponding to the set frz, and the LLR sequence corresponding to the corrected set src.
  • the second communication device may decode the corrected sequence to be decoded based on the frozen bit sequence, information bit set, and frozen bit set corresponding to the i-th probability distribution value, to obtain the i-th probability distribution value corresponding to third bit sequence.
  • the information bit set includes information bit positions and parity bit positions in the third bit sequence
  • the frozen bit set includes frozen bit positions in the third bit sequence.
  • the second communication device may obtain the information bit set and the frozen bit set based on the sum of the length of the third information bit sequence and the length of the parity bit sequence and the encoding code length.
  • the information bit set and frozen bit set used by the second communication device for decoding are the same as the information bit set and frozen bit set used by the first communication device for encoding.
  • the information bit positions in the third bit sequence are the same as the information bit positions in the first bit sequence
  • the check bit positions in the third bit sequence are the same as the check bit positions in the first bit sequence
  • the third The frozen bit position in the bit sequence is the same as the frozen bit position in the first bit sequence.
  • the second communication device may input the frozen bit sequence, the information bit set, the frozen bit set and the corrected sequence to be decoded corresponding to the i-th probability distribution value into a CRC-assisted serial cancellation list (CRC-aided successful Cancellation list (CA-SCL) decoder or parity check successive cancellation list (PC-SCL) decoder or other Polar decoder for decoding to get the i-th probability distribution value corresponding to the third bit sequence.
  • CRC-assisted serial cancellation list CRC-aided successful Cancellation list (CA-SCL) decoder or parity check successive cancellation list (PC-SCL) decoder or other Polar decoder for decoding to get the i-th probability distribution value corresponding to the third bit sequence.
  • CA-SCL CRC-aided successful Cancellation list
  • PC-SCL parity check successive cancellation list
  • a probability distribution value in the probability distribution value set P corresponds to a frozen bit sequence mapping method
  • the second communication device may also use the frozen bit sequence mapping method corresponding to the i-th probability distribution value , to determine the frozen bit sequence corresponding to the i-th probability distribution value.
  • the frozen bit sequence mapping method corresponding to the i-th probability distribution value may specifically include the following four methods:
  • Method 1 The frozen bit sequence corresponding to the i-th probability distribution value is determined based on the base sequence corresponding to the i-th probability distribution value, and the base sequence is determined based on the number of probability distribution values included in the probability distribution value set P.
  • Method 2 The frozen bit sequence corresponding to the i-th probability distribution value is determined based on the m-sequence corresponding to the i-th probability distribution value.
  • Mode 3 The frozen bit sequence corresponding to the i-th probability distribution value is determined based on the Gold sequence corresponding to the i-th probability distribution value.
  • Mode 4 The frozen bit sequence corresponding to the i-th probability distribution value is determined based on the pseudo-random sequence corresponding to the i-th probability distribution value.
  • the second communication device determines the frozen bit sequence corresponding to the i-th probability distribution value according to the frozen bit sequence mapping method corresponding to the i-th probability distribution value. 0 corresponding to the frozen bit sequence mapping manner, and determine the specific implementation manner of the first frozen bit sequence, which will not be repeated here.
  • the protocol may also directly define in advance the frozen bit sequence values corresponding to different probability distribution values and the length of the frozen bit sequence. Based on the probability distribution value and the length of the frozen bit sequence, the second communication device determines the value of the frozen bit sequence corresponding to the probability distribution value from a plurality of frozen bit sequence values predefined in the protocol.
  • the check bit position in the third bit sequence is the bit position corresponding to the row whose sum is 1 in G(a), and G(a) is the row of set a in the polarization matrix G and a matrix composed of columns, the polarization matrix G is a polarization matrix used for polar encoding, the set a is an information bit set, and the information bit set includes information bit positions and parity bit positions in the third bit sequence.
  • the pre-transformation operation of the first information bit sequence can be decoupled from the operation of determining the check bit sequence based on the second information bit sequence, so that the pre-transformation operation can be used to determine the check bit sequence.
  • the bit sequence is performed before, so that the decoding side only needs to perform polarization operation on the decoded information bit sequence that has passed the verification to obtain the first information bit sequence sent by the encoding side, so as to reduce the power consumption of the decoding side and improve decoding efficiency.
  • At least one of the check bits is located among the bits included in the third information bit sequence. In this way, the at least one check bit can be used to check the information bit before its position, which is beneficial to realize the function of early stop in decoding.
  • the decoding order of at least one of the check bits is located in the middle of the decoding order of the bits included in the third information bit sequence. In this way, the at least one check bit can be used to check the information bits before its decoding sequence, so as to realize the function of early stop in decoding.
  • the second communication device determines that the third information bit sequence is the first information bit sequence sequence of bits. That is to say, the first communication device may not perform a pre-transformation operation on the first information bit sequence.
  • the second communication device does not need to perform polar coding on the third information bit sequence. It can be seen that this can save the processing overhead of the first communication device and the second communication device.
  • the second communication device determines three The sequence obtained after the information bit sequence is polarized is the first information bit sequence. That is to say, the first communication device may perform a pre-transformation operation on the first information bit sequence first, and then determine a parity bit sequence based on the second information bit sequence obtained by the pre-transformation operation.
  • the second communication device only needs to polarize the decoded third information bit sequence that has passed the verification to obtain the first information bit sequence sent by the first communication device, which is beneficial to reduce power consumption on the decoding side and Improve decoding efficiency.
  • the second communication device needs to decode each probability distribution value to obtain the third information bit sequence Polar coding is performed on both, and then the information bit sequence obtained after the polar operation is checked (such as CRC or PC), so the power consumption on the decoding side is large and the decoding efficiency is low.
  • the second information bit sequence is the sequence obtained after the first information bit sequence undergoes a pre-transformation operation; or, if the probability distribution value P1 is equal to probability distribution, the second information bit sequence is the first information bit sequence.
  • the first information bit sequence is a sequence obtained by polar encoding the third information bit sequence; or if the value of the i-th probability distribution is equal to the probability distribution, the first An information bit sequence is the third information bit sequence.
  • the first communication device when the probability distribution value P 1 is not an equal probability distribution, the first communication device needs to perform a pre-transformation operation on the first information bit sequence.
  • the probability distribution value P1 is an equal probability distribution
  • the first communication device does not need to perform a pre-transformation operation on the first information bit sequence.
  • the second communication device needs to polarize the third information bit sequence to obtain the first information bit sequence; or if the i-th probability distribution value is an equal probability distribution, The second communication device does not need to perform polar coding on the third information bit sequence, and the second communication device directly determines the third information bit sequence as the first information bit sequence.
  • steps 402 to 405 and steps 415 to 416 in FIG. 4 are the same as the specific implementation manners of the corresponding steps in FIG. 3 , and will not be repeated here.
  • the system can be reasonably compatible with the two implementations of performing a pre-transformation operation on the first information bit sequence and not performing a pre-transformation operation on the first information bit sequence, and can be reasonably compatible with the third information bit sequence.
  • Performing a pre-transformation operation on the first information bit sequence utilizes the sparsity of the first information bit sequence to improve decoding performance.
  • the probability distribution value of the first information bit sequence is far from the equiprobable distribution, it means that the first information bit sequence is very sparse.
  • the probability distribution value of the first information bit sequence is equal probability distribution, it means that the first information bit sequence is not sparse, so when the probability distribution value of the first information bit sequence is equal probability distribution, there is no need to perform a pre-transformation operation on the first information bit sequence , so as to save the processing overhead of the first communication device and the second communication device.
  • the probability distribution value P 1 is an equal probability distribution
  • ⁇ is a preset value. If
  • This ⁇ can be a small value, for example, it can be 0.001, 0.01, 0.02, 0.03, 0.04 or 0.05 and so on.
  • the decoding order of the probability distribution values in the probability distribution value set P has nothing to do with the probability distribution values themselves, that is, the decoding order does not necessarily depend on the size of the probability distribution values from large to small or from small to large .
  • Mode 1 The decoding order of the probability distribution values in the probability distribution value set P is determined based on the information entropy corresponding to the probability distribution values in the probability distribution value set P.
  • the probability distribution value with larger information entropy is less sparse, and the probability distribution value with smaller information entropy is sparser.
  • the probability distribution value is 0.5, the information entropy is the largest, that is, the information entropy is 1, indicating that the information source bits are not sparse at all.
  • Determine the probability distribution value set P based on the information entropy corresponding to the probability distribution value in the probability distribution value set
  • the decoding order of the probability distribution values in is beneficial to reduce the probability of false detection.
  • the information entropy corresponding to the i-th probability distribution value is greater than or equal to the information entropy corresponding to the i+1-th probability distribution value. That is to say, the second communication device may preferentially use a probability distribution value with a larger information entropy for decoding. Due to the large probability distribution value of information entropy, the prior information that can be used by the decoding side is less. Trying these probability distribution values first can reduce the negative effect on the decoding effect caused by the introduction of wrong prior information on the decoding side. influence and reduce the probability of false detection.
  • the second communication device first decodes the sequence to be decoded based on the probability distribution value 1. If the decoding result fails the verification, the second communication device first decodes the sequence to be decoded based on the probability distribution value 2. If the decoding result fails the verification, the second communication device first decodes the sequence to be decoded based on the probability distribution value 3.
  • Mode 2 The decoding order of the probability distribution values in the probability distribution value set P is determined based on the historical probability distribution values of the sending end.
  • the sending end Historical usage for probability distribution value 2 is higher than historical usage for probability distribution value 3.
  • the second communication device first decodes the sequence to be decoded based on the probability distribution value 1. If the decoding result fails the verification, the second communication device first decodes the sequence to be decoded based on the probability distribution value 2. If the decoding result fails the verification, the second communication device first decodes the sequence to be decoded based on the probability distribution value 3.
  • the first communication device may also send the probability distribution reference value range or the probability distribution reference value to the second communication device every N information bit sequences, where N is an integer greater than 1.
  • the second communication device can also receive the probability distribution reference value range or the probability distribution reference value sent by the first communication device every N information bit sequences; wherein, the decoding order of the probability distribution values in the probability distribution value set P is based on the probability distribution Reference value range or probability distribution reference value determination.
  • the first communication device may send the probability distribution reference value range or the probability distribution reference value to the second communication device every 5 information bit sequences. Assuming that the probability distribution reference value sent by the first communication device in the current period is 0.5, the second communication device preferentially uses the probability distribution value 0.5 to decode the sequence to be decoded. Assuming that the probability distribution reference value sent by the first communication device in the current period ranges from 0.3 to 0.5, the second communication device preferentially uses the probability distribution value in the probability distribution value set P that is within the probability distribution reference value range of 0.3 to 0.5 to be decoded sequence to decode.
  • the fourth information bit sequence is the target information bit sequence. If the second information bit sequence on the first communication device side is a sequence obtained after the first information bit sequence undergoes a pre-transformation operation, then the fourth information bit sequence is a sequence obtained after the target information bit sequence undergoes polar coding.
  • the target information bit sequence is a third information bit sequence corresponding to an equal probability distribution in the probability distribution value set P. Since the second communication device does not know what the real probability distribution value is, when all the third information bit sequences corresponding to the probability distribution values fail to pass the verification, the fourth information bit is obtained based on the third information bit sequence corresponding to the equal probability distribution Sequence is a conservative scheme to avoid negative effects introduced by incorrect use of probability distribution values.
  • the first communication device may also adjust the coding rate.
  • the first communication device may adjust the coding rate based on system transmission resources, which can make the coding rate more flexible.
  • the first communication device may determine the first code based on the adjusted coding rate.
  • the first code may be obtained by puncturing or shortening the mother code based on the punctured bit set or the shortened bit set.
  • the first communication device may determine a set of information bits and a set of frozen bits of the first code based on the mother code.
  • the first communication device determines the first bit sequence based on the first information bit sequence, the parity bit sequence, the first frozen bit sequence, the information bit set and the frozen bit set of the first code.
  • the first communication device punctures or shortens the bit sequence obtained after polar coding based on the punctured bit set/shortened bit set, so as to obtain the second bit sequence.
  • the corresponding mother code length is 32.
  • the check digit set of includes ⁇ 4,6,7,10,27,29 ⁇ .
  • the nesting relationship of parity bit positions under different code lengths and code rates can be constructed to facilitate the system to save optional parity bit positions under different code lengths and code rates .
  • the optional parity bit set under the (N, K) code is assumed to be chk (N, K) .
  • Optional parity bit set chk (N, K-1) chk (N, K) ⁇ i ⁇ under (N, K-1) code.
  • G(a,b) means to take the row of polarization matrix G corresponding to set a and the column corresponding to set b.
  • the information bit length is 20, and the frozen bit length is 12.
  • the first communication device may puncture the systematic bits of the second bit sequence to obtain the bit sequence after the punctured systematic bits, so as to realize the information bit compression. After puncturing the systematic bits of the second bit sequence, the first communication device modulates the bit sequence after the punctured systematic bits, and sends the obtained modulation symbols to the second communication device.
  • the probability distribution value P1 is an equal probability distribution
  • the first communication device may modulate the second bit sequence and send the obtained modulation symbols to the second communication device. For example, as shown in step 607 of FIG. 6 .
  • the specific implementation manners of other steps in FIG. 6 are the same as the specific implementation manners of the corresponding steps in FIG. 3 , and will not be repeated here.
  • the value of the first frozen bit sequence is determined based on the probability distribution value of the first information bit sequence, instead of setting the value of the first frozen bit sequence to all 0 by default, In this way, when decoding the sequence to be decoded, the decoding side can sequentially try different probability distribution values in the probability distribution value set and the frozen bit sequences corresponding to the probability distribution values for decoding, and the decoding side can better distinguish between different probability distribution values. distribution values, reducing the probability of false detection.
  • FIG. 7 shows a schematic structural diagram of a communication device according to an embodiment of the present application.
  • the communication apparatus shown in FIG. 7 may be used to perform some or all functions of the first communication device in the method embodiment described in FIG. 3 , FIG. 4 or FIG. 6 .
  • the device may be the first communication device, or a device in the first communication device, or a device that can be matched and used with the first communication device. Wherein, the communication device may also be a system on a chip.
  • the communication device shown in FIG. 7 may include a communication unit 701 and a processing unit 702 . Wherein, the processing unit 702 is configured to perform data processing.
  • the communication unit 701 is integrated with a receiving unit and a sending unit.
  • the communication unit 701 may also be called a transceiver unit. Alternatively, the communication unit 701 may also be split into a receiving unit and a sending unit. in:
  • the processing unit 702 is configured to acquire the first information bit sequence; the processing unit 702 is also configured to determine the first frozen bit sequence based on the probability distribution value P1 of the first information bit sequence; the processing unit 702 is also configured to determine the first frozen bit sequence based on the second information
  • the bit sequence determines the parity bit sequence, and the second information bit sequence is the first information bit sequence or a sequence obtained after the first information bit sequence undergoes a pre-transformation operation; the processing unit 702 is also configured to, based on the second information bit sequence, check the bit sequence and the first frozen bit sequence to obtain the first bit sequence, the first bit sequence includes bits in the second information bit sequence, bits in the check bit sequence and bits in the first frozen bit sequence; processing The unit 702 is further configured to polarize the first bit sequence to obtain a second bit sequence; the processing unit 702 is further configured to output the second bit sequence.
  • the second information bit sequence is the sequence obtained after the first information bit sequence undergoes a pre-transformation operation; or if the probability distribution value P1 is equally probable distribution, the second information bit sequence is the first information bit sequence.
  • the probability distribution value P 1 is an equal probability distribution, and ⁇ is a preset value.
  • the check bit position in the first bit sequence is the bit position corresponding to the row whose sum is 1 in G(a), and G(a) is the row of set a in the polarization matrix G and a matrix composed of columns, the polarization matrix G is a polarization matrix used for polar encoding, the set a is an information bit set, and the information bit set includes information bit positions and parity bit positions in the first bit sequence.
  • At least one check bit in the check bit sequence is located among the bits included in the second information bit sequence.
  • the manner in which the processing unit 702 determines the first frozen bit sequence based on the probability distribution value P1 of the first information bit sequence is specifically: selecting the probability distribution value according to the probability distribution value P1 of the first information bit sequence
  • the probability distribution value P 0 in the set P, the probability distribution value P 0 is the probability distribution value closest to the probability distribution value P 1 in the probability distribution value set P;
  • a probability distribution value in the probability distribution value set P corresponds to A frozen bit sequence mapping method; according to the frozen bit sequence mapping method corresponding to the probability distribution value P 0 , the first frozen bit sequence is determined.
  • the first frozen bit sequence is determined based on a basic sequence corresponding to the probability distribution value P 0 , and the basic sequence is determined based on the number of probability distribution values included in the probability distribution value set P.
  • the first frozen bit sequence is determined based on the m-sequence, Gold sequence or pseudo-random sequence corresponding to the probability distribution value P 0 .
  • the probability distribution reference value range or the probability distribution reference value is sent to the second communication device every N information bit sequences, where N is an integer greater than 1.
  • the check bits include cyclic redundancy check CRC bits and/or parity check PC bits.
  • FIG. 7 shows a schematic structural diagram of a communication device according to an embodiment of the present application.
  • the communication apparatus shown in FIG. 7 may be used to perform some or all functions of the second communication device in the method embodiment described in FIG. 3 , FIG. 4 or FIG. 6 .
  • the device may be the second communication device, or a device in the second communication device, or a device that can be matched and used with the second communication device.
  • the communication device may also be a system on a chip.
  • the communication device shown in FIG. 7 may include a communication unit 701 and a processing unit 702 .
  • the processing unit 702 is configured to perform data processing.
  • the communication unit 701 is integrated with a receiving unit and a sending unit.
  • the communication unit 701 may also be called a transceiver unit.
  • the communication unit 701 may also be split into a receiving unit and a sending unit. in:
  • a processing unit 702 configured to acquire a sequence to be decoded
  • the processing unit 702 is further configured to decode the sequence to be decoded based on the i-th probability distribution value in the probability distribution value set P and the frozen bit sequence corresponding to the i-th probability distribution value, to obtain the i-th probability distribution value corresponding to A third bit sequence, the third bit sequence includes bits in the third information bit sequence, check bits, and bits in the frozen bit sequence corresponding to the i-th probability distribution value;
  • the processing unit 702 is further configured to check the third information bit sequence
  • the processing unit 702 is further configured to obtain a first information bit sequence based on the third information bit sequence and stop decoding if the third information bit sequence passes the verification, the first information bit sequence is the third information bit sequence, or , the first information bit sequence is a sequence obtained by polar encoding the third information bit sequence;
  • the processing unit 702 is further configured to stop decoding if the third information bit sequence fails the verification and i is equal to x, or obtain a fourth information bit sequence based on the target information bit sequence, and stop decoding; the target information
  • the bit sequence is one of the x third information bit sequences corresponding to the probability distribution value set P, the fourth information bit sequence is the target information bit sequence, or the fourth information bit sequence is the target information bit sequence after polarization encoding sequence obtained afterwards.
  • the first information bit sequence is a sequence obtained by polar encoding the third information bit sequence; or if the value of the i-th probability distribution is Equal probability distribution, the first information bit sequence is the third information bit sequence.
  • the i-th probability distribution value is an equal probability distribution
  • ⁇ is a preset value
  • P i,r is the i-th probability distribution value
  • the decoding order of the probability distribution values in the probability distribution value set P is determined based on information entropy corresponding to the probability distribution values in the probability distribution value set P.
  • the information entropy corresponding to the i-th probability distribution value is greater than or equal to the information entropy corresponding to the i+1-th probability distribution value.
  • the decoding order of the probability distribution values in the probability distribution value set P is determined based on the historical probability distribution values of the sending end.
  • the communication unit 701 is configured to receive a probability distribution reference value range or a probability distribution reference value sent by the first communication device every N information bit sequences, where N is an integer greater than 1; wherein, the probability distribution The decoding order of the probability distribution values in the value set P is determined based on the probability distribution reference value range or the probability distribution reference value.
  • the target information bit sequence is a third information bit sequence corresponding to an equal probability distribution in the probability distribution value set P.
  • the check bit position in the third bit sequence is the bit position corresponding to the row whose sum is 1 in G(a), and G(a) is the row of set a in the polarization matrix G and columns, the polarization matrix G is a polarization matrix used for polar encoding, the set a is an information bit set, and the information bit set includes information bit positions and parity bit positions in the third bit sequence.
  • At least one of the check bits is located among the bits included in the third information bit sequence.
  • a probability distribution value in the probability distribution value set P corresponds to a frozen bit sequence mapping method
  • the processing unit 702 is further configured to map way to determine the frozen bit sequence corresponding to the i-th probability distribution value.
  • the frozen bit sequence corresponding to the i-th probability distribution value is determined based on a base sequence corresponding to the probability distribution value, and the base sequence is determined based on the number of probability distribution values included in the probability distribution value set P.
  • the frozen bit sequence corresponding to the i-th probability distribution value is determined based on the m-sequence, Gold sequence or pseudo-random sequence corresponding to the probability distribution value.
  • the check bits include cyclic redundancy check CRC bits and/or parity check PC bits.
  • FIG. 8 shows a schematic structural diagram of a communication device.
  • the communication device 800 may be the first communication device in the above method embodiment, or the second communication device in the above method embodiment, or a chip, a chip system, or a chip that supports the first communication device to implement the above method.
  • the processor, etc. may also be a chip, a chip system, or a processor that supports the second communication device to implement the above method, and may also be a chip, a chip system, or a processor that supports the server to implement the above method.
  • the communication device may be used to implement the methods described in the foregoing method embodiments, and for details, reference may be made to the descriptions in the foregoing method embodiments.
  • the communication device 800 may include one or more processors 801 .
  • the processor 801 may be a general-purpose processor or a special-purpose processor. For example, it can be a baseband processor or a central processing unit.
  • the baseband processor can be used to process communication protocols and communication data
  • the central processing unit can be used to control communication devices (such as base stations, baseband chips, terminals, terminal chips, DU or CU, etc.), execute software programs, and process Data for Software Programs.
  • the communication device 800 may include one or more memories 802, on which instructions 804 may be stored, and the instructions may be executed on the processor 801, so that the communication device 800 executes the above method Methods described in the Examples.
  • data may also be stored in the memory 802 .
  • the processor 801 and the memory 802 can be set separately or integrated together.
  • the communication device 800 may further include a transceiver 805 and an antenna 806 .
  • the transceiver 805 may be called a transceiver unit, a transceiver, or a transceiver circuit, etc., and is used to implement a transceiver function.
  • the transceiver 805 may include a receiver and a transmitter, and the receiver may be called a receiver or a receiving circuit for realizing a receiving function; the transmitter may be called a transmitter or a sending circuit for realizing a sending function.
  • the processing unit 702 shown in FIG. 7 may be the processor 801 .
  • the communication unit 701 may be a transceiver 805 .
  • the communication apparatus 800 is a first communication device: the processor 801 is configured to perform a data processing operation of the first communication device in the foregoing method embodiments.
  • the transceiver 805 is configured to perform the data transceiving operation of the first communication device in the foregoing method embodiments.
  • the transceiver 805 may be used to perform the data transceiving operation of the first communication device in FIG. 3 , FIG. 4 or FIG. 6 .
  • transceiver 805 can transmit modulation symbols.
  • the processor 801 may be configured to execute data processing operations of the first communication device in FIG. 3 , FIG. 4 or FIG. 6 .
  • the processor 801 may execute steps 301 to 305 and 307 in FIG. 3 .
  • the processor 801 may execute steps 401 to 407 and step 409 in FIG. 4 .
  • the processor 801 may execute steps 601 to 605 as well as steps 607 and 608 in FIG. 6 .
  • the communication apparatus 800 is a second communication device: the processor 801 is configured to perform a data processing operation of the second communication device in the foregoing method embodiments.
  • the transceiver 805 is configured to perform the data transceiving operation of the second communication device in the foregoing method embodiments.
  • the transceiver 805 may be used to perform the data transceiving operation of the second communication device in FIG. 3 , FIG. 4 or FIG. 6 .
  • transceiver 805 can receive modulation symbols.
  • the processor 801 may be configured to perform data processing operations of the second communication device in FIG. 3 , FIG. 4 or FIG. 6 .
  • the processor 801 may execute steps 309 to 315 in FIG. 3 .
  • the processor 801 may execute steps 411 to 418 in FIG. 4 .
  • the processor 801 may execute steps 610 to 616 in FIG. 6 .
  • the processor 801 may include a transceiver for implementing receiving and sending functions.
  • the transceiver may be a transceiver circuit, or an interface, or an interface circuit.
  • the transceiver circuits, interfaces or interface circuits for realizing the functions of receiving and sending can be separated or integrated together.
  • the above-mentioned transceiver circuit, interface or interface circuit may be used for reading and writing code/data, or the above-mentioned transceiver circuit, interface or interface circuit may be used for signal transmission or transmission.
  • the processor 801 may store instructions 803, and the instructions 803 run on the processor 801, and may cause the communication device 800 to execute the methods described in the foregoing method embodiments.
  • the instruction 803 may be fixed in the processor 801, in this case, the processor 801 may be implemented by hardware.
  • the communication device 800 may include a circuit, and the circuit may implement the function of sending or receiving or communicating in the foregoing method embodiments.
  • the processor and the transceiver described in the embodiment of the present application can be implemented in integrated circuit (integrated circuit, IC), analog IC, radio frequency integrated circuit RFIC, mixed signal IC, application specific integrated circuit (application specific integrated circuit, ASIC), printed circuit board (printed circuit board, PCB), electronic equipment, etc.
  • the processor and transceiver can also be fabricated using various IC process technologies, such as complementary metal oxide semiconductor (CMOS), nMetal-oxide-semiconductor (NMOS), P-type Metal oxide semiconductor (positive channel metal oxide semiconductor, PMOS), bipolar junction transistor (Bipolar Junction Transistor, BJT), bipolar CMOS (BiCMOS), silicon germanium (SiGe), gallium arsenide (GaAs), etc.
  • CMOS complementary metal oxide semiconductor
  • NMOS nMetal-oxide-semiconductor
  • PMOS P-type Metal oxide semiconductor
  • BJT bipolar junction transistor
  • BiCMOS bipolar CMOS
  • SiGe silicon germanium
  • GaAs gallium arsenide
  • the communication device described in the above embodiments may be the first communication device and the second communication device, but the scope of the communication device described in the embodiment of the present application is not limited thereto, and the structure of the communication device may not be limited by FIG. 8 .
  • a communication device may be a stand-alone device or may be part of a larger device.
  • the communication device may be:
  • a set of one or more ICs may also include storage components for storing data and instructions;
  • ASIC such as modem (MSM)
  • the communication device may be a chip or a chip system
  • the chip 900 shown in FIG. 9 includes a processor 901 and an interface 902 .
  • a memory 903 may also be included.
  • the number of processors 901 may be one or more, and the number of interfaces 902 may be more than one.
  • the interface 902 is used to receive or output a signal; for example, the interface 902 may be used to perform a signal receiving or output operation of the first communication device in FIG. 3 , FIG. 4 or FIG. 6 .
  • interface 902 can output the second sequence of bits as well as output modulation symbols.
  • the processor 901 is configured to execute a data processing operation of the first communication device.
  • the processor 901 may be configured to perform data processing operations of the first communication device in FIG. 3 , FIG. 4 or FIG. 6 .
  • the processor 901 may execute steps 301 to 305 and step 307 in FIG. 3 .
  • the processor 901 may execute steps 401 to 407 and step 409 in FIG. 4 .
  • the processor 901 may execute steps 601 to 605 as well as steps 607 and 608 in FIG. 6 .
  • the interface 902 is used to receive or output a signal; for example, the interface 902 may be used to perform a signal receiving or output operation of the second communication device in FIG. 3 , FIG. 4 or FIG. 6 .
  • interface 902 can receive modulation symbols.
  • the processor 901 is configured to execute a data processing operation of the second communication device.
  • the processor 901 may be configured to perform data processing operations of the second communication device in FIG. 3 , FIG. 4 or FIG. 6 .
  • the processor 901 may execute steps 309 to 315 in FIG. 3 .
  • the processor 901 may execute steps 411 to 418 in FIG. 4 .
  • the processor 901 may execute steps 610 to 616 in FIG. 6 .
  • the processor in this embodiment of the present application may be an integrated circuit chip that has a signal processing capability.
  • each step of the above-mentioned method embodiment can be completed by an integrated logic circuit of hardware in a processor or an instruction in the form of software.
  • the above-mentioned processor can be a general-purpose processor, a digital signal processor (digital signal processor, DSP), an application specific integrated circuit (application specific integrated circuit, ASIC), a field programmable gate array (field programmable gate array, FPGA) or other possible Program logic devices, discrete gate or transistor logic devices, discrete hardware components.
  • the memory in the embodiments of the present application may be a volatile memory or a nonvolatile memory, or may include both volatile and nonvolatile memories.
  • the non-volatile memory can be read-only memory (read-only memory, ROM), programmable read-only memory (programmable ROM, PROM), erasable programmable read-only memory (erasable PROM, EPROM), electrically programmable Erases programmable read-only memory (electrically EPROM, EEPROM) or flash memory.
  • Volatile memory can be random access memory (RAM), which acts as external cache memory.
  • RAM random access memory
  • SRAM static random access memory
  • DRAM dynamic random access memory
  • DRAM synchronous dynamic random access memory
  • SDRAM double data rate synchronous dynamic random access memory
  • ESDRAM enhanced synchronous dynamic random access memory
  • SLDRAM direct memory bus random access memory
  • direct rambus RAM direct rambus RAM
  • the present application also provides a computer-readable medium, where computer programs or instructions are stored in the storage medium, and when the computer programs or instructions are executed by the communication device, the functions of any one of the above method embodiments are realized.
  • the present application also provides a computer program product including instructions.
  • the computer reads and executes the computer program product, the computer can realize the functions of any one of the above method embodiments.
  • all or part may be implemented by software, hardware, firmware or any combination thereof.
  • software When implemented using software, it may be implemented in whole or in part in the form of a computer program product.
  • the computer program product includes one or more computer instructions. When the computer instructions are loaded and executed on the computer, the processes or functions according to the embodiments of the present application will be generated in whole or in part.
  • the computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable devices.
  • the computer instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website, computer, server or data center Transmission to another website site, computer, server or data center by wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.).
  • the computer-readable storage medium may be any available medium that can be accessed by a computer, or a data storage device such as a server or a data center integrated with one or more available media.
  • the available medium may be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a high-density digital video disc (digital video disc, DVD)), or a semiconductor medium (for example, a solid state disk (solid state disk, SSD)) etc.
  • 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)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Error Detection And Correction (AREA)

Abstract

本申请提供了一种编码方法、译码方法及通信装置，该编码方法包括：获取第一信息比特序列；基于第一信息比特序列的概率分布值P 1确定第一冻结比特序列；基于第二信息比特序列确定校验比特序列，该第二信息比特序列为第一信息比特序列或者为第一信息比特序列经过预变换操作后得到的序列；基于第二信息比特序列、校验比特序列和第一冻结比特序列，得到第一比特序列，该第一比特序列包括第二信息比特序列中的比特、校验比特序列中的比特以及第一冻结比特序列中的比特；对第一比特序列进行极化编码，得到第二比特序列；输出第二比特序列。基于该方法，有利于降低译码侧的错误检测概率。

Description

一种编码方法、译码方法及通信装置
本申请要求于2021年10月30日提交中国专利局、申请号为202111278393.9、申请名称为“一种编码方法、译码方法及通信装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，尤其涉及一种编码方法、译码方法及通信装置。
背景技术
现有蜂窝、无线保真(wireless-fidelity，WiFi)等通信系统基于分离的信源信道编码(SSCC)方案，首先会对待发送的信源数据进行信源编码(压缩)处理，然后对压缩后的数据进行信道编码，加入一定冗余以提高信息传输的可靠性。其中，信源编码一般在应用层完成，信道编码一般在物理层完成。对于物理层而言，其假设上层已完成理想信源编码，得到了近似等概的序列。但是在实际应用中，物理层可能会处理到一些没有经过充分压缩的数据，例如，来自链路层或物理层的控制信息、待反馈的信道状态信息、部分上层应用数据等。为了充分利用物理层存在的信源冗余，提升传输性能，信源信道联合编码(JSCC)是一种潜在的解决方案，它可以同时完成对信源的压缩和信道保护操作。
图1是基于系统Polar(极化)的JSCC方案的流程示意图。编码侧先基于信息比特序列得到待编码比特序列，再对待编码比特序列进行系统极化编码，并将极化编码后的比特序列经过调制后发送给译码侧。并且编码侧将信息比特序列的概率分布值(即信息比特序列中0或1的比例)通过控制信令发送给译码侧。译码侧基于接收到的概率分布值和默认全0的冻结比特序列对待译码序列进行译码。现有的基于系统Polar的JSCC方案中，译码时需要发送端发送控制信令告知接收端当前信息比特序列的概率分布值，增加了控制信令开销。如果编码侧不向译码侧发送信息比特序列的概率分布值。译码侧在对待译码序列进行译码时，依次尝试不同的概率分布值以及结合默认全0的冻结比特序列对待译码序列进行译码，会导致错误检测概率高。错误检测概率是指译码侧使用错误的概率分布值尝试译码，得到了错误的译码结果，但错误的译码结果通过了校验，如循环冗余码校验(cyclic redundancy check，CRC)或者奇偶校验(parity check，PC)。
发明内容
本申请提供了一种编码方法、译码方法及通信装置，有利于降低译码侧的错误检测概率。
第一方面，本申请提供了一种编码方法，应用于第一通信设备，该方法包括：获取第一信息比特序列；基于第一信息比特序列的概率分布值P 1确定第一冻结比特序列；基于第二信息比特序列确定校验比特序列，该第二信息比特序列为第一信息比特序列或者为第一信息比特序列经过预变换操作后得到的序列；基于第二信息比特序列、校验比特序列和第一冻结比特序列，得到第一比特序列，该第一比特序列包括第二信息比特序列中的比特、校验比特序列中的比特以及第一冻结比特序列中的比特；对第一比特序列进行极化编码，得到第二比特序列；输出第二比特序列。
基于第一方面所描述的方法，通过使第一冻结比特序列的取值基于第一信息比特序列的概率分布值来确定，而不是将第一冻结比特序列的取值默认设置为全0，这样译码侧在对待译码序列进行译码时，可依次尝试概率分布值集合中不同的概率分布值以及概率分布值对应的冻结比特序列进行译码，译码侧可以更好地区分不同概率分布值，降低错误检测概率。
并且，在本申请中，第一通信设备可以先对第一信息比特序列进行预变换操作，再基于预变换操作得到的第二信息比特序列确定校验比特序列，这样译码侧只需要对译码得到的通过校验的第三信息比特序列进行极化操作，得到第一通信设备发送的第一信息比特序列，这样有利于减小译码侧的功耗以及提高译码效率。如果第一通信设备先基于第一信息比特序列确定校验比特序列，再对第一信息比特序列进行预变换操作，译码侧需要对每个概率分布值译码得到的第三信息比特序列均进行极化操作，再对极化操作后得到的信息比特序列进行校验(如CRC或PC)，这样的译码侧的功耗较大且译码效率低。
并且，在本申请中，第一通信设备可以直接基于第一信息比特序列来确定校验比特序列，即第一通信设备可以不对第一信息比特序列进行预变换操作，这样译码侧也不需要对译码得到的第三信息比特序列进行极化操作，译码侧可以直接将第三信息比特序列确定为第一信息比特序列，可以节省第一通信设备和译码侧的处理开销。
在一种可能的实现中，若概率分布值P 1不为等概分布，第二信息比特序列为第一信息比特序列经过预变换操作后得到的序列；或者若概率分布值P 1为等概分布，第二信息比特序列为第一信息比特序列。基于该可能的实现方式，可以在系统中合理兼容对第一信息比特序列进行预变换操作和不对第一信息比特序列进行预变换操作这两种实现方式。对第一信息比特序列进行预变换操作是利用第一信息比特序列的稀疏性来提高译码的性能。第一信息比特序列的概率分布值远离等概分布时表示第一信息比特序列很稀疏。由于第一信息比特序列的概率分布值为等概分布时表示第一信息比特序列不稀疏，所以第一信息比特序列的概率分布值为等概分布时不用对第一信息比特序列进行预变换操作，以便节省第一通信设备和译码侧的处理开销。
在一种可能的实现中，若|P 1-0.5|≤∈，则概率分布值P 1为等概分布，∈为预设值。该∈可以是一个较小值，例如可以是0.001、0.01、0.02、0.03、0.04或0.05等。
在一种可能的实现中，第一比特序列中的校验比特位置为G(a)中求和为1的行对应的比特位置，G(a)为取极化矩阵G中集合a的行和列组成的矩阵，极化矩阵G为进行极化编码使用的极化矩阵，集合a为信息位集合，该信息位集合包括第一比特序列中的信息比特位置以及校验比特位置。基于该可能的实现方式，在编码侧可以使第一信息比特序列的预变换操作与基于第二信息比特序列确定校验比特序列这一操作进行解耦，进而可以使得预变换操作在确定校验比特序列之前进行，以便减小译码侧的功耗以及提高译码效率。
在一种可能的实现中，校验比特序列中的至少一个校验比特位于第二信息比特序列包括的比特中间。这样该至少一个校验比特就可用于校验其位置之前的信息比特，这样有利于实现译码早停的功能。译码早停是指译码侧对待译码序列译码出部分信息比特时，就可通过校验比特对已译码出的部分信息比特进行校验，如果该部分信息比特未通过校验，则提前终止译码，从而节省译码侧的功耗。
在一种可能的实现中，校验比特序列的至少一个校验比特的译码顺序位于第二信息比特序列包括的比特的译码顺序中间。这样该至少一个校验比特就可用于校验其译码顺序之前的信息比特，实现译码早停的功能，节省译码侧的功耗。
在一种可能的实现中，基于第一信息比特序列的概率分布值P 1确定第一冻结比特序列， 包括：根据第一信息比特序列的概率分布值P 1选取概率分布值集合P中的概率分布值P 0，概率分布值P 0为概率分布值集合P中与概率分布值P 1最接近的概率分布值；概率分布值集合P中的一种概率分布值对应一种冻结比特序列映射方式；根据与概率分布值P 0对应的冻结比特序列映射方式，确定第一冻结比特序列。基于该可能的实现方式，概率分布值集合P中的不同的概率分布值可以对应不同的冻结比特序列映射方式，这样译码侧在依次尝试概率分布值集合中不同的概率分布值以及概率分布值对应的冻结比特序列进行译码时，译码侧可以更好地区分不同概率分布值，降低错误检测概率。
在一种可能的实现中，第一冻结比特序列基于概率分布值P 0对应的基础序列确定，该基础序列基于概率分布值集合P包括的概率分布值的数量确定。这样编译码侧只需要存储若干个基础序列和第一冻结比特序列与基础序列的关系，有利于降低存储开销，同时保证不同第一冻结比特序列具有一定的正交性，降低错误检测概率。
在一种可能的实现中，第一冻结比特序列基于概率分布值P 0对应的m序列或Gold序列或伪随机序列确定。这样编译码侧只需要存储第一冻结比特序列与m序列或Gold序列或伪随机序列的映射关系，有利于降低存储开销，同时保证不同第一冻结比特序列具有一定的正交性，降低错误检测概率。
在一种可能的实现中，每隔N个信息比特序列向第二通信设备发送概率分布参考值范围或概率分布参考值，N为大于1的整数。通过每隔N个信息比特序列向第二通信设备发送一次概率分布参考值范围或概率分布参考值，这样译码侧就可优先从概率分布值集合中选择概率分布参考值范围或概率分布参考值对应的概率分布值进行译码，有利于减小译码侧尝试译码的次数，降低译码功耗。
在一种可能的实现中，校验比特包括循环冗余码校验CRC比特和/或奇偶校验PC比特。
第二方面，本申请提供了一种译码方法，应用于第二通信设备，该方法包括：
步骤1，获取待译码序列；
步骤2，令i＝1；
步骤3，基于概率分布值集合P中的第i个概率分布值和第i个概率分布值对应的冻结比特序列对待译码序列进行译码，得到第i个概率分布值对应的第三比特序列，该第三比特序列包括第三信息比特序列中的比特、校验比特以及第i个概率分布值对应的冻结比特序列中的比特；
步骤4，对第三信息比特序列进行校验；
步骤5，如果第三信息比特序列通过校验，则基于该第三信息比特序列获取第一信息比特序列，并停止译码，该第一信息比特序列为第三信息比特序列，或者，该第一信息比特序列为第三信息比特序列经过极化编码后得到的序列；
步骤6，如果第三信息比特序列未通过校验，且i小于x，则令i＝i+1，并回到步骤3，x为概率分布值集合P包括的概率分布值的数量；
步骤7，如果第三信息比特序列未通过校验，且i等于x，则停止译码，或者，基于目标信息比特序列获取第四信息比特序列，并停止译码；该目标信息比特序列为概率分布值集合P对应的x个第三信息比特序列中的一个，该第四信息比特序列为目标信息比特序列或者为目标信息比特序列经过极化编码后得到的序列。
基于第二方面所描述的方法，译码侧在对待译码序列进行译码时，可依次尝试概率分布值集合中不同的概率分布值以及概率分布值对应的冻结比特序列进行译码，译码侧可以更好地区分不同概率分布值，降低错误检测概率。
并且，在本申请中，译码侧可以只对译码得到的通过校验的第三信息比特序列进行极化操作，得到第一通信设备发送的第一信息比特序列，这样有利于减小译码侧的功耗以及提高译码效率。或者，在本申请中，第二通信设备可以直接将第三信息比特序列确定为第一信息比特序列，即第二通信设备可以不对第三信息比特序列进行极化编码来得到第一信息比特序列，这样可以节省第二通信设备的处理开销。
在一种可能的实现中，若第i个概率分布值不为等概分布，第一信息比特序列为第三信息比特序列经过极化编码后得到的序列；或者若第i个概率分布值为等概分布，该第一信息比特序列为第三信息比特序列。基于该可能的实现方式，可以在系统中合理兼容将第三信息比特序列确定为第一信息比特序列，以及将第三信息比特序列经过极化编码后得到的序列确定为第一信息比特序列两种实现方式。
在一种可能的实现中，若|P i,r-0.5|≤∈，则第i个概率分布值为等概分布，该∈为预设值，该P i,r为所述第i个概率分布值。该∈可以是一个较小的值，例如可以是0.001、0.01、0.02、0.03、0.04或0.05等。
在一种可能的实现中，概率分布值集合P中的概率分布值的译码顺序基于概率分布值集合中的概率分布值对应的信息熵确定。信息熵越大的概率分布值越不稀疏，信息熵越小的概率分布值越稀疏，对于求和为1的两个概率分布值(如P′+P″＝1)，它们的信息熵相等，稀疏度一致。基于概率分布值集合中的概率分布值对应的信息熵确定概率分布值集合P中的概率分布值的译码顺序，有利于降低错误检测概率。
在一种可能的实现中，第i个概率分布值对应的信息熵大于或等于第i+1个概率分布值对应的信息熵。也就是说，第二通信设备可以优先使用信息熵较大的概率分布值进行译码。由于信息熵较大的概率分布值，能够供译码侧利用的先验信息较少，优先尝试这些概率分布值，可以减少译码侧通过引入错误先验信息，对译码效果带来的负面影响，降低错误检测概率。
在一种可能的实现中，概率分布值集合P中的概率分布值的译码顺序基于发送端历史的概率分布值确定。基于该可能的实现方式，有利于减小译码侧尝试译码的次数，降低译码功耗。
在一种可能的实现中，接收第一通信设备每隔N个信息比特序列发送的概率分布参考值范围或概率分布参考值，N为大于1的整数；其中，概率分布值集合P中的概率分布值的译码顺序基于概率分布参考值范围或概率分布参考值确定。基于该可能的实现方式，有利于减小译码侧尝试译码的次数，降低译码功耗。
在一种可能的实现中，目标信息比特序列为概率分布值集合P中的等概分布对应的第三信息比特序列。由于第二通信设备不知道真实的概率分布值是多少，在所有概率分布值对应的第三信息比特序列均未通过校验时，基于等概分布对应的第三信息比特序列获取第四信息比特序列是一种保守方案，可以避免因为错误使用概率分布值引入的负面效果。
在一种可能的实现中，第三比特序列中的校验比特位置为G(a)中求和为1的行对应的比特位置，G(a)为取极化矩阵G中集合a的行和列组成的矩阵，极化矩阵G为进行极化编码使用的极化矩阵，集合a为信息位集合，信息位集合包括第三比特序列中的信息比特位置以及校验比特位置。基于该可能的实现方式，在编码侧可以使第一信息比特序列的预变换操作与基于第二信息比特序列确定校验比特序列这一操作进行解耦，进而可以使得预变换操作在确定校验比特序列之前进行，这样译码侧只需要对译码得到的通过校验的第三信息比特序列进行极化操作，得到编码侧发送的第一信息比特序列，以便减小译码侧的功耗以及提高译码效率。
在一种可能的实现中，校验比特中的至少一个校验比特位于第三信息比特序列包括的比特中间。这样该至少一个校验比特就可用于校验其位置之前的信息比特，这样有利于实现译码早停的功能。译码早停是指译码侧对待译码序列译码出部分信息比特时，就可通过校验比特对已译码出的部分信息比特进行校验，如果该部分信息比特未通过校验，则提前终止译码，从而节省译码的功耗。
在一种可能的实现中，校验比特的至少一个校验比特的译码顺序位于第三信息比特序列包括的比特的译码顺序中间。这样该至少一个校验比特就可用于校验其译码顺序之前的信息比特，实现译码早停的功能。
在一种可能的实现中，概率分布值集合P中的一种概率分布值对应一种冻结比特序列映射方式，第二通信设备还可根据与第i个概率分布值对应的冻结比特序列映射方式，确定第i个概率分布值对应的冻结比特序列。基于该可能的实现方式，概率分布值集合P中的不同的概率分布值可以对应不同的冻结比特序列映射方式，这样译码侧在依次尝试概率分布值集合中不同的概率分布值以及概率分布值对应的冻结比特序列进行译码时，译码侧可以更好地区分不同概率分布值，降低错误检测概率。
在一种可能的实现中，第i个概率分布值对应的冻结比特序列基于概率分布值对应的基础序列确定，基础序列基于概率分布值集合P包括的概率分布值的数量确定。
在一种可能的实现中，第i个概率分布值对应的冻结比特序列基于概率分布值对应的m序列或Gold序列或伪随机序列确定。
在一种可能的实现中，校验比特包括循环冗余码校验CRC比特和/或奇偶校验PC比特。
第三方面，本申请提供了一种通信装置，该通信装置包括：处理单元，用于获取第一信息比特序列；以及还用于基于第一信息比特序列的概率分布值P 1确定第一冻结比特序列；以及还用于基于第二信息比特序列确定校验比特序列，该第二信息比特序列为第一信息比特序列或者为第一信息比特序列经过预变换操作后得到的序列；以及还用于基于第二信息比特序列、校验比特序列和第一冻结比特序列，得到第一比特序列，该第一比特序列包括第二信息比特序列中的比特、校验比特序列中的比特以及第一冻结比特序列中的比特；以及还用于对第一比特序列进行极化编码，得到第二比特序列；以及还用于输出第二比特序列。
在一种可能的实现中，若概率分布值P 1不为等概分布，第二信息比特序列为第一信息比特序列经过预变换操作后得到的序列；或者若概率分布值P 1为等概分布，第二信息比特序列为第一信息比特序列。
在一种可能的实现中，若|P 1-0.5|≤∈，则概率分布值P 1为等概分布，∈为预设值。该∈可以是一个较小值，例如可以是0.001、0.01、0.02、0.03、0.04或0.05等。
在一种可能的实现中，第一比特序列中的校验比特位置为G(a)中求和为1的行对应的比特位置，G(a)为取极化矩阵G中集合a的行和列组成的矩阵，极化矩阵G为进行极化编码使用的极化矩阵，该集合a为信息位集合，该信息位集合包括第一比特序列中的信息比特位置以及校验比特位置。
在一种可能的实现中，校验比特序列中的至少一个校验比特位于第二信息比特序列包括的比特中间。
在一种可能的实现中，处理单元基于第一信息比特序列的概率分布值P 1确定第一冻结比特序列的方式具体为：根据第一信息比特序列的概率分布值P 1选取概率分布值集合P中的概率分布值P 0，该概率分布值P 0为概率分布值集合P中与概率分布值P 1最接近的概率分布值；该概率分布值集合P中的一种概率分布值对应一种冻结比特序列映射方式；根据与概率分布 值P 0对应的冻结比特序列映射方式，确定第一冻结比特序列。
在一种可能的实现中，第一冻结比特序列基于概率分布值P 0对应的基础序列确定，该基础序列基于概率分布值集合P包括的概率分布值的数量确定。
在一种可能的实现中，第一冻结比特序列基于概率分布值P 0对应的m序列或Gold序列或伪随机序列确定。
在一种可能的实现中，该通信装置还包括通信单元，该通信单元用于每隔N个信息比特序列向第二通信设备发送概率分布参考值范围或概率分布参考值，N为大于1的整数。
在一种可能的实现中，校验比特包括循环冗余码校验CRC比特和/或奇偶校验PC比特。
第四方面，本申请提供了一种通信装置，该通信装置包括：
处理单元，用于获取待译码序列；
处理单元，还用于令i＝1；
处理单元，还用于基于概率分布值集合P中的第i个概率分布值和第i个概率分布值对应的冻结比特序列对待译码序列进行译码，得到第i个概率分布值对应的第三比特序列，该第三比特序列包括第三信息比特序列中的比特、校验比特以及第i个概率分布值对应的冻结比特序列中的比特；
处理单元，还用于对第三信息比特序列进行校验；
处理单元，还用于如果第三信息比特序列通过校验，则基于第三信息比特序列获取第一信息比特序列，并停止译码，该第一信息比特序列为第三信息比特序列，或者，该第一信息比特序列为第三信息比特序列经过极化编码后得到的序列；
处理单元，还用于如果第三信息比特序列未通过校验，且i小于x，则令i＝i+1，并执行所述基于概率分布值集合P中的第i个概率分布值和第i个概率分布值对应的冻结比特序列对待译码序列进行译码，得到第i个概率分布值对应的第三比特序列的步骤，x为概率分布值集合P包括的概率分布值的数量；
处理单元，还用于如果第三信息比特序列未通过校验，且i等于x，则停止译码，或者，基于目标信息比特序列获取第四信息比特序列，并停止译码；该目标信息比特序列为概率分布值集合P对应的x个第三信息比特序列中的一个，该第四信息比特序列为目标信息比特序列，或者，该第四信息比特序列为目标信息比特序列经过极化编码后得到的序列。
在一种可能的实现中，若第i个概率分布值不为等概分布，第一信息比特序列为第三信息比特序列经过极化编码后得到的序列；或者若第i个概率分布值为等概分布，第一信息比特序列为第三信息比特序列。
在一种可能的实现中，若|P i,r-0.5|≤∈，则第i个概率分布值为等概分布，∈为预设值，P i,r为第i个概率分布值。该∈可以是一个较小值，例如可以是0.001、0.01、0.02、0.03、0.04或0.05等。
在一种可能的实现中，概率分布值集合P中的概率分布值的译码顺序基于概率分布值集合P中的概率分布值对应的信息熵确定。
在一种可能的实现中，第i个概率分布值对应的信息熵大于或等于第i+1个概率分布值对应的信息熵。
在一种可能的实现中，概率分布值集合P中的概率分布值的译码顺序基于发送端历史的概率分布值确定。
在一种可能的实现中，通信装置还包括通信单元，该通信单元，用于接收第一通信设备每隔N个信息比特序列发送的概率分布参考值范围或概率分布参考值，N为大于1的整数； 其中，概率分布值集合P中的概率分布值的译码顺序基于概率分布参考值范围或概率分布参考值确定。
在一种可能的实现中，目标信息比特序列为所述概率分布值集合P中的等概分布对应的第三信息比特序列。
在一种可能的实现中，第三比特序列中的校验比特位置为G(a)中求和为1的行对应的比特位置，G(a)为取极化矩阵G中集合a的行和列组成的矩阵，该极化矩阵G为进行极化编码使用的极化矩阵，该集合a为信息位集合，该信息位集合包括第三比特序列中的信息比特位置以及校验比特位置。
在一种可能的实现中，校验比特中的至少一个校验比特位于第三信息比特序列包括的比特中间。
在一种可能的实现中，概率分布值集合P中的一种概率分布值对应一种冻结比特序列映射方式，处理单元，还用于根据与第i个概率分布值对应的冻结比特序列映射方式，确定第i个概率分布值对应的冻结比特序列。
在一种可能的实现中，第i个概率分布值对应的冻结比特序列基于概率分布值对应的基础序列确定，该基础序列基于概率分布值集合P包括的概率分布值的数量确定。
在一种可能的实现中，第i个概率分布值对应的冻结比特序列基于概率分布值对应的m序列或Gold序列或伪随机序列确定。
在一种可能的实现中，校验比特包括循环冗余码校验CRC比特和/或奇偶校验PC比特。
第五方面，本申请提供了一种通信装置，所述通信装置包括处理器，当所述处理器调用存储器中的计算机程序时，如第一方面或第二方面所述的方法被执行。
第六方面，本申请提供了一种通信装置，通信装置包括处理器和存储器，处理器和存储器耦合；处理器用于实现如第一方面或第二方面所述的方法。
第七方面，本申请提供了一种通信装置，通信装置包括处理器、存储器和收发器，处理器和存储器耦合；收发器用于收发数据，处理器用于实现如第一方面或第二方面所述的方法。
第八方面，本申请提供了一种通信装置，通信装置包括处理器和接口，该接口用于接收或输出信号，处理器用于通过逻辑电路或执行代码指令实现如第一方面或第二方面所述的方法。
第九方面，本申请提供了一种计算机可读存储介质，存储介质中存储有计算机程序或指令，当计算机程序或指令被通信装置执行时，实现如第一方面或第二方面所述的方法。
第十方面，本申请提供一种包括指令的计算机程序产品，当计算机读取并执行计算机程序产品时，使得计算机执行如第一方面或第二方面所述的方法。
附图说明
图1是现有的一种编译码方法的流程示意图；
图2是本申请实施例提供的一种通信系统的示意图；
图3是本申请实施例提供的一种编译码方法的流程示意图；
图4本申请实施例提供的另一种编译码方法的流程示意图；
图5是本申请实施例提供的一种嵌套关系的示意图；
图6本申请实施例提供的又一种编译码方法的流程示意图；
图7是本申请实施例提供的一种通信装置的结构示意图；
图8是本申请实施例提供的另一种通信装置的结构示意图；
图9是本申请实施例提供的一种芯片的结构示意图。
具体实施方式
本申请的说明书、权利要求书及附图中的术语“第一”和“第二”等是用于区别不同对象，而不是用于描述特定顺序。此外，术语“包括”和“具有”以及它们任何变形，意图在于覆盖不排他的包含。例如包含了一系列步骤或单元的过程、方法、系统、产品或设备没有限定于已列出的步骤或单元，而是可选地还包括没有列出的步骤或单元，或可选地还包括对于这些过程、方法、产品或设备固有的其它步骤或单元。
为了能够更好地理解本申请，下面对本申请实施例提供的通信系统进行介绍：
图2是本申请的实施例应用的通信系统2000的示意图。如图2所示，该通信系统2000包括无线接入网100和核心网200，可选的，通信系统2000还可以包括互联网300。其中，无线接入网100可以包括至少一个无线接入网设备(如图2中的110a和110b)，还可以包括至少一个终端设备(如图2中的120a-120j)。终端设备通过无线的方式与无线接入网设备相连，无线接入网设备通过无线或有线方式与核心网连接。核心网设备与无线接入网设备可以是独立的不同的物理设备，也可以是将核心网设备的功能与无线接入网设备的逻辑功能集成在同一个物理设备上，还可以是一个物理设备上集成了部分核心网设备的功能和部分的无线接入网设备的功能。终端设备和终端设备之间以及无线接入网设备和无线接入网设备之间可以通过有线或无线的方式相互连接。图2只是示意图，该通信系统中还可以包括其它网络设备，如还可以包括无线中继设备和无线回传设备，在图2中未画出。
无线接入网设备可以是基站(base station)、演进型基站(evolved NodeB，eNodeB)、发送接收点(transmission reception point，TRP)、第五代(5th generation，5G)移动通信系统中的下一代基站(next generation NodeB，gNB)、第六代(6th generation，6G)移动通信系统中的下一代基站、未来移动通信系统中的基站或WiFi系统中的接入节点等；也可以是完成基站部分功能的模块或单元，例如，可以是集中式单元(central unit，CU)，也可以是分布式单元(distributed unit，DU)。这里的CU完成基站的无线资源控制协议和分组数据汇聚层协议(packet data convergence protocol，PDCP)的功能，还可以完成业务数据适配协议(service data adaptation protocol，SDAP)的功能；DU完成基站的无线链路控制层和媒体接入控制(medium access control，MAC)层的功能，还可以完成部分物理层或全部物理层的功能，有关上述各个协议层的具体描述，可以参考第三代合作伙伴计划(3rd generation partnership project，3GPP)的相关技术规范。无线接入网设备可以是宏基站(如图2中的110a)，也可以是微基站或室内站(如图2中的110b)，还可以是中继节点或施主节点等。本申请的实施例对无线接入网设备所采用的具体技术和具体设备形态不做限定。在本申请的实施例中，无线接入网设备可以简称为网络设备，为了便于描述，下文将无线接入网设备简称为网络设备进行描述。
终端设备也可以称为终端、用户设备(user equipment，UE)、移动台、移动终端等。终端设备可以广泛应用于各种场景，例如，设备到设备(device-to-device，D2D)、车物(vehicle to everything，V2X)通信、机器类通信(machine-type communication，MTC)、物联网(internet of things，IOT)、虚拟现实、增强现实、工业控制、自动驾驶、远程医疗、智能电网、智能家具、智能办公、智能穿戴、智能交通、智慧城市等。终端可以是手机、平板电脑、带无线收发功能的电脑、可穿戴设备、车辆、无人机、直升机、飞机、轮船、机器人、机械臂、智能 家居设备等。本申请的实施例对终端设备所采用的具体技术和具体设备形态不做限定。
网络设备和终端设备可以是固定位置的，也可以是可移动的。网络设备和终端设备可以部署在陆地上，包括室内或室外、手持或车载；也可以部署在水面上；还可以部署在空中的飞机、气球和人造卫星上。本申请的实施例对网络设备和终端设备的应用场景不做限定。
网络设备和终端设备的角色可以是相对的，例如，图2中的直升机或无人机120i可以被配置成移动网络设备，对于那些通过120i接入到无线接入网100的终端设备120j来说，终端设备120i是网络设备；但对于网络设备110a来说，120i是终端设备，即110a与120i之间是通过无线空口协议进行通信的。当然，110a与120i之间也可以是通过网络设备与网络设备之间的接口协议进行通信的，此时，相对于110a来说，120i也是网络设备。因此，网络设备和终端设备都可以统一称为通信装置，图2中的110a和110b可以称为具有网络设备功能的通信装置，图2中的120a-120j可以称为具有终端设备功能的通信装置。
网络设备和终端设备之间、网络设备和网络设备之间、终端设备和终端设备之间可以通过授权频谱进行通信，也可以通过免授权频谱进行通信，也可以同时通过授权频谱和免授权频谱进行通信；可以通过6千兆赫(gigahertz，GHz)以下的频谱进行通信，也可以通过6GHz以上的频谱进行通信，还可以同时使用6GHz以下的频谱和6GHz以上的频谱进行通信。本申请的实施例对无线通信所使用的频谱资源不做限定。
本申请实施例中，网络设备的功能也可以由网络设备中的模块(如芯片)来执行，也可以由包含有网络设备功能的控制子系统来执行。这里的包含有网络设备功能的控制子系统可以是智能电网、工业控制、智能交通、智慧城市等上述应用场景中的控制中心。终端设备的功能也可以由终端设备中的模块(如芯片或调制解调器)来执行，也可以由包含有终端设备功能的装置来执行。
本申请实施例中，编码侧的第一通信设备可以是终端设备，译码侧的第二通信设备可以是网络设备。或者，编码侧的第一通信设备可以是网络设备，译码侧的第二通信设备可以是终端设备。
下面对出本申请实施例所使用的一些名词或术语进行解释说明。
一、概率分布值
信息比特序列的概率分布值是指信息比特序列中0或1所占的比例。例如，以概率分布值为信息比特序列中1所占的比例为例。假设信息比特序列为0000000011，则该信息比特序列的概率分布值为0.2。
二、对数似然比(log likelihood ratio，LLR)
一个比特的对数似然比是指该比特为1的概率和该比特为0的概率的比值取自然对数。若将该比特为1的概率记为P(1)，将该比特为0的概率记为P(0)，则该比特的对数似然比为ln[P(0)/P(1)]。
三、编码码长
编码码长是指编码之后的比特序列中的比特数。在信息比特数固定的情况下，若采用编码码长越长的编码方式进行编码，则编码之后的比特序列中的冗余比特越多，数据传输的可靠性越高。
四、编码码率
编码码率是指编码之前的信息比特在编码之后的比特中的占比。一个比特序列，若采用编码码率越低的编码方式进行编码，则编码之后的比特序列中的冗余比特越多，数据传输的可靠性越高。
五、伪随机序列
可以预先确定并且可以重复实现的序列称为确定序列；既不能预先确定又不能重复实现的序列称随机序列；不能预先确定但可以重复产生的序列称伪随机序列。
六、m序列
m序列是最长线性移位寄存器序列的简称，是一种伪随机序列、伪噪声(PN)码或伪随机码或伪随机序列。在所有的伪随机序列中，m序列是最重要、最基本的一种伪随机序列。
七、Gold(戈尔德)序列
Gold序列是由一对优先的m序列模2加生成的序列，一对优先的m序列，使得不同的Gold序列的互相关较小。
下面进一步对本申请实施例提供的编码方法、译码方法及通信装置进行详细描述。
图3是本申请实施例提供的一种编译码方法的流程示意图。如图3所示，该编译码方法包括如下步骤301～步骤315。图3所示的方法执行主体可以为第一通信设备和第二通信设备。或者，图3所示的方法执行主体可以为第一通信设备中的芯片和第二通信设备中的芯片。图3以第一通信设备和第二通信设备为方法的执行主体为例进行说明。
301、第一通信设备获取第一信息比特序列。
302、第一通信设备基于第一信息比特序列的概率分布值P 1确定第一冻结比特序列。
本申请实施例中，第一通信设备基于第一信息比特序列的概率分布值P 1确定第一冻结比特序列是指：第一通信设备基于第一信息比特序列的概率分布值P 1确定第一冻结比特序列的取值。也就是说，第一冻结比特序列的取值不是默认为全0，第一冻结比特序列的取值与第一信息比特序列的概率分布值P 1有关。
在一种可能的实现中，第一通信设备基于第一信息比特序列的概率分布值P 1确定第一冻结比特序列的具体实施方式为：第一通信设备根据第一信息比特序列的概率分布值P 1选取概率分布值集合P中的概率分布值P 0，该概率分布值P 0为概率分布值集合P中与概率分布值P 1最接近的概率分布值；概率分布值集合P中的一种概率分布值对应一种冻结比特序列映射方式；根据与概率分布值P 0对应的冻结比特序列映射方式，确定第一冻结比特序列。
其中，概率分布值集合P是预先在编码侧和译码侧设置的集合。概率分布值集合P中包括多个概率分布值，且不同的概率分布值对应不同的冻结比特序列映射方式。也就是说，概率分布值集合P中的不同概率分布值对应不同的冻结比特序列取值。
例如，假设概率分布值集合P中包括{0.2、0.4、0.5、0.7}。概率分布值0.2对应冻结比特序列映射方式1，概率分布值0.4对应冻结比特序列映射方式2，概率分布值0.5对应冻结比特序列映射方式3，概率分布值0.7对应冻结比特序列映射方式4。假设概率分布值P 1为0.48，则第一通信设备从概率分布值集合P中获取概率分布值0.5，并基于概率分布值0.5对应的冻结比特序列映射方式3来确定第一冻结比特序列的取值。
基于该可能的实现方式，概率分布值集合P中的不同的概率分布值可以对应不同的冻结比特序列映射方式，这样译码侧在依次尝试概率分布值集合中不同的概率分布值以及概率分布值对应的冻结比特序列进行译码时，译码侧可以更好地区分不同概率分布值，降低错误检测概率。
可选的，概率分布值P 0对应的冻结比特序列映射方式具体可以包括以下四种方式：
方式一：第一冻结比特序列基于概率分布值P 0对应的基础序列确定，该基础序列基于所述概率分布值集合P包括的概率分布值的数量确定。
其中，概率分布值集合P中不同的概率分布值对应不同的基础序列。
例如，假设概率分布值集合P中包括{0.2、0.4、0.5、0.7}，概率分布值集合P中的概率分布值个数为4。那么可以通过2个比特来表示这4个概率分布值。概率分布值0.2通过基础序列00表示，概率分布值0.4通过基础序列01表示，概率分布值0.5通过基础序列10表示，概率分布值0.7通过基础序列11表示。
概率分布值0.2对应的冻结比特序列映射方式1为：基于基础序列00确定冻结比特序列。概率分布值0.4对应的冻结比特序列映射方式2为：基于基础序列01确定冻结比特序列。概率分布值0.5对应的冻结比特序列映射方式3为：基于基础序列10确定冻结比特序列。概率分布值0.7对应的冻结比特序列映射方式4为：基于基础序列11确定冻结比特序列。
可选的，可通过对概率分布值P 0对应的基础序列进行直接拓展或交叉拓展来得到第一冻结比特序列的取值。
例如，以直接拓展为例。假设第一冻结比特序列的长度为4。如果概率分布值P 0为0.2，则可将基础序列00直接拓展得到第一冻结比特序列0000。如果概率分布值P 0为0.4，则可将基础序列01直接拓展得到第一冻结比特序列0101。如果概率分布值P 0为0.5，则可将基础序列10直接拓展得到第一冻结比特序列1010。如果概率分布值P 0为0.7，则可将基础序列11直接拓展得到第一冻结比特序列1111。
再如，以交叉拓展为例。如果概率分布值P 0为0.2，则可将基础序列00交叉拓展得到第一冻结比特序列0000。如果概率分布值P 0为0.4，则可将基础序列01交叉拓展得到第一冻结比特序列0011。如果概率分布值P 0为0.5，则可将基础序列10交叉拓展得到第一冻结比特序列为1100。如果概率分布值P 0为0.7，则可将基础序列11交叉拓展得到第一冻结比特序列为1111。
通过使用方式一描述的冻结比特序列映射方式，编译码侧只需要存储若干个基础序列和第一冻结比特序列与基础序列的关系，有利于降低存储开销，同时保证不同第一冻结比特序列具有一定的正交性，降低错误检测概率。
方式二：第一冻结比特序列基于概率分布值P 0对应的m序列确定。
其中，概率分布值集合P中不同的概率分布值对应不同的m序列。
例如，假设概率分布值集合P中包括{0.2、0.4、0.5、0.7}。概率分布值0.2对应m序列1，概率分布值0.4对应m序列2，概率分布值0.5对应m序列3，概率分布值0.7对应m序列4。
概率分布值0.2对应的冻结比特序列映射方式1为：基于m序列1确定冻结比特序列。概率分布值0.4对应的冻结比特序列映射方式2为：基于m序列2确定冻结比特序列。概率分布值0.5对应的冻结比特序列映射方式3为：基于m序列3确定冻结比特序列。概率分布值0.7对应的冻结比特序列映射方式4为：基于m序列4确定冻结比特序列。
在一种可能的实现中，如果概率分布值P 0对应的m序列的长度大于第一冻结比特序列的长度N f，则可从该m序列中选择前N f个比特作为第一冻结比特序列的取值。如果概率分布值P 0对应的m序列的长度小于第一冻结比特序列的长度N f，则可对超过该m序列长度部分的冻结比特赋值为0。例如，概率分布值P 0为0.2，如果m序列1的长度为7，m序列1为1010101，第一冻结比特序列的长度N f为5，那么第一冻结比特序列的取值为10101。如果m序列1的长度为7，m序列1为1010101，第一冻结比特序列的长度N f为10。那么第一冻结比特序列的取值为1010101000。
通过使用方式二描述的冻结比特序列映射方式，编译码侧只需要存储第一冻结比特序列与m序列的映射关系，有利于降低存储开销，同时保证不同第一冻结比特序列具有一定的正 交性，降低错误检测概率。
方式三：第一冻结比特序列基于概率分布值P 0对应的Gold序列确定。
方式三和方式二的实现方式相同，方式三的具体实现方式，可参见方式二的具体实现方式，在此不赘述。
方式四：第一冻结比特序列基于概率分布值P 0对应的伪随机序列确定。
方式四和方式二的实现方式相同，方式四的具体实现方式，可参见方式二的具体实现方式，在此不赘述。其中，该伪随机序列是第一通信设备基于随机种子确定的，随机种子可以第一通信设备和第二通信设备之间通过信令双方约定，或者，随机种子可以是协议预先规定的。
在一种可能的实现中，协议也可以预先直接定义出不同概率分布值和冻结比特序列的长度对应的冻结比特序列取值。第一通信设备基于概率分布值P 0和第一冻结比特序列的长度，从协议预先定义的多个冻结比特序列取值中确定第一冻结比特序列的取值。例如，协议可以预先定义概率分布值为0.2以及冻结比特序列长度为2时，对应的冻结比特序列取值为00；概率分布值为0.2以及冻结比特序列长度为4时，对应的冻结比特序列取值为0000；概率分布值为0.4以及冻结比特序列长度为2时，对应的冻结比特序列取值为10；概率分布值为0.4以及冻结比特序列长度为4时，对应的冻结比特序列取值为1010。概率分布值为0.5以及冻结比特序列长度为2时，对应的冻结比特序列取值为01；概率分布值为0.5以及冻结比特序列长度为4时，对应的冻结比特序列取值为0101。概率分布值为0.7以及冻结比特序列长度为2时，对应的冻结比特序列取值为11；概率分布值为0.7以及冻结比特序列长度为4时，对应的冻结比特序列取值为1111。
303、第一通信设备基于第二信息比特序列确定校验比特序列。
其中，该第二信息比特序列为第一信息比特序列或者为第一信息比特序列经过预变换操作后得到的序列。经过预变换操作之后的第二信息比特序列的长度与第一信息比特序列的长度相同。步骤302可以在步骤303之前执行或之后执行。
可选的，第一通信设备可以基于第一冻结比特序列来对第一信息比特序列进行预变换操作，得到第二信息比特序列。例如，第二信息比特序列可以满足以下公式(1)：
u(src)＝[x(src)-u(chk)*G(chk,src)-u(frz)*G(frz,src)]*G(src) -1  (1)
其中，u(src)为第二信息比特序列。x(src)为第一信息比特序列。u(chk)为基于第二信息比特序列得到的校验比特序列，例如，u(chk)＝CRC(u(src))或PC(u(src))。G(chk,src)表示取极化矩阵G对应集合chk的行和对应集合src的列。u(frz)为第一冻结比特序列。G(frz,src)表示取极化矩阵G对应集合frz的行和对应集合src的列。G(src)表示取极化矩阵G对应集合src的行和列。集合src表示信息比特位置集合，集合chk表示校验比特位置集合，集合frz表示冻结位集合。为了使对第一信息比特序列进行预变换操作与基于第二信息比特序列确定校验比特序列解耦，使得预变换操作后的u(src)只与第一信息比特序列x(src)和第一冻结比特序列u(frz)有关，进而可以使得预变换操作在确定校验比特序列之前进行，需要寻找集合chk和src使得约束G(chk,src)＝0成立。
在一种可能的实现中，校验比特包括循环冗余码校验(cyclic redundancy check，CRC)和/或者奇偶校验(parity check，PC)。
304、第一通信设备基于第二信息比特序列、校验比特序列和第一冻结比特序列，得到第一比特序列。
其中，该第一比特序列包括第二信息比特序列中的比特、校验比特序列中的比特以及第 一冻结比特序列中的比特。
在一种可能的实现中，第一通信设备基于第二信息比特序列、校验比特序列和第一冻结比特序列，得到第一比特序列的具体实施方式为：第一通信设备将第二信息比特序列中的比特映射到信息位集合中的信息比特位置，以及将校验比特序列中的比特映射到信息位集合中的校验比特位置，以及将第一冻结比特序列中的比特映射到冻结位集合中的冻结比特位置，得到第一比特序列。其中，信息位集合包括第一比特序列中的信息比特位置和校验比特位置，冻结位集合包括第一比特序列中的冻结比特位置。信息位集合和冻结位集合可以基于第二信息比特序列的长度和校验比特序列的长度之和以及编码码长得到。
举例来说，以(16，12)码为例。编码码长为16，信息位长度为12，信息位长度为第二信息比特序列的长度和校验比特序列的长度之和。第一通信设备可以基于信息位长度12和编码码长16获取信息位集合和冻结位集合。其中，信息位集合包括{4，6，7，8，9，10，11，12，13，14，15，16}，信息位集合中的信息比特位置包括{8，10，11，12，13，14，15，16}，信息位集合中的校验比特位置包括{4，6，7，9}。冻结位集合包括{1，2，3，5}。第一通信设备将第二信息比特序列中的8个比特映射至信息比特位置{8，10，11，12，13，14，15，16}，将校验比特序列中的4个比特映射至校验比特位置{4，6，7，9}，将第一冻结比特序列中的4个比特映射至冻结位集合{1，2，3，5}，就得到第一比特序列。
在一种可能的实现中，第一比特序列中的校验比特位置为G(a)中求和为1的行对应的比特位置，G(a)为取极化矩阵G中集合a的行和列组成的矩阵，极化矩阵G为进行极化编码使用的极化矩阵，该集合a为信息位集合，该信息位集合包括第一比特序列中的信息比特位置以及校验比特位置。基于该可能的实现方式，可以使上述G(chk,src)＝0，从而使对第一信息比特序列进行预变换操作与基于第二信息比特序列确定校验比特序列进行解耦，使得预变换操作可以在确定校验比特序列之前进行，以便减小译码侧的功耗以及提高译码效率。
举例来说，以(16，12)码为例。编码码长为16，信息位长度为12，冻结位长度为4。第二信息比特序列的长度为8，校验比特序列的长度为4。该编码码长下对应的极化矩阵G如下表1所示：
表1
Figure PCTCN2022123378-appb-000001
各比特位置的译码可靠度排序可以为{1，2，3，5，9，4，6，7，10，11，13，8，12，14，15，16}，选择可靠度最高的12个比特位置作为信息位集合。例如，可选择{4，6，7，8，9，10，11，12，13，14，15，16}作为信息位集合。假设译码时按照比特逆序进行，对应顺 序为{1，9，5，13，3，11，7，15，2，10，6，14，4，12，8，16}。其中信息位的译码顺序为info_sorted＝{9，13，11，7，15，10，6，14，4，12，8，16}。按照译码顺序得到G(info_sorted)，即取G矩阵的第9、13、11、7、15、10、6、14、4、12、8、16行和列出来，得到一个12*12的矩阵如下表2所示：
表2
Figure PCTCN2022123378-appb-000002
为了满足约束G(chk,src)＝0，可统计G(info_sorted)中求和为1的行(即上表2中粗体的行)，一共有4个比特位置{9，7，6，4}。这4个比特位置{9，7，6，4}就为校验比特位置。
在一种可能的实现中，校验比特序列中的至少一个校验比特位于第二信息比特序列包括的比特中间。如果译码时按照非比特逆序进行译码，则该至少一个校验比特就可用于校验其之前的信息比特，实现译码早停的功能。译码早停是指译码侧对待译码序列译码出部分信息比特时，就可通过校验比特对已译码出的部分信息比特进行校验，如果该部分信息比特未通过校验，则提前终止译码，从而节省译码的功耗。
例如，假设按照非比特逆序进行译码，信息位集合为{4，6，7，8，9，10，11，12，13，14，15，16}，译码顺序也为{4，6，7，8，9，10，11，12，13，14，15，16}。假设校验比特位置包括{4，9，13，14}。校验比特位置{4，9}对应的校验比特用于校验信息比特位置{6，7，8}对应的信息比特。校验比特位置{13，14}对应的校验比特用于校验信息比特位置{10，11，12，15，16}对应的信息比特。如果信息比特位置{6，7，8}对应的信息比特未通过校验，则译码侧可以提前停止译码，实现译码早停。
在一种可能的实现中，校验比特序列的至少一个校验比特的译码顺序位于第二信息比特序列包括的比特的译码顺序中间。这样该至少一个校验比特就可用于校验其译码顺序之前的信息比特，实现译码早停的功能。
例如，假设按照比特逆序进行译码，信息位的译码顺序为{9，13，11，7，15，10，6，14，4，12，8，16}。校验比特位置包括{9，7，6，4}。校验比特位置{9，7}对应的校验比特用于校验信息比特位置{13，11}对应的信息比特。校验比特位置{6，4}对应的校验比特用于校验信息比特位置{8，10，12，14，15，16}对应的信息比特。如果信息比特位置{13，11}对应的信息比特未通过校验，则译码侧可以提前停止译码，实现译码早停。
305、第一通信设备对第一比特序列进行极化编码，得到第二比特序列。
本申请实施例中，第一通信设备确定第一比特序列之后，可通过极化矩阵G对第一比特序列进行极化编码，得到第二比特序列。
可选的，对第一比特序列中的校验比特进行极化编码后得到的比特满足以下公式(2)：
x(chk)＝u(src)*G(src,chk)+u(chk)*G(chk)+u(frz)*G(frz,chk)  (2)
其中，x(chk)为对第一比特序列中的校验比特进行极化编码后得到的比特。u(src)为第 二信息比特序列。G(src,chk)表示取极化矩阵G对应集合src的行和对应集合chk的列。u(chk)为校验比特序列。G(chk)表示取极化矩阵G对应集合chk的行和列。u(frz)为第一冻结比特序列。G(frz,chk)表示取极化矩阵G对应集合frz的行和对应集合chk的列。集合src表示信息比特位置集合，集合chk表示校验比特位置集合，集合frz表示冻结位集合。
可选的，对第一比特序列中的冻结比特进行极化编码后得到的比特满足以下公式(3)：
x(frz)＝u(src)*G(src,frz)+u(chk)*G(chk,frz)+u(frz)*G(frz)  (3)
其中，x(frz)为对第一比特序列中的冻结比特进行极化编码后得到的比特。u(src)为第二信息比特序列。G(src,frz)表示取极化矩阵G对应集合src的行和对应集合frz的列。u(chk)为校验比特序列。G(chk,frz)表示取极化矩阵G对应集合chk的行和对应集合frz的列。u(frz)为第一冻结比特序列。G(frz)表示取极化矩阵G对应集合frz的行和列。集合src表示信息比特位置集合，集合chk表示校验比特位置集合，集合frz表示冻结位集合。
306、第一通信设备输出第二比特序列。
307、第一通信设备对第二比特序列进行调制，得到调制符号。
308、第一通信设备向第二通信设备发送调制符号。
309、第二通信设备获取待译码序列。
本申请实施例中，第二通信设备接收第一通信设备发送的调制符号之后，对调制符号进行解调，得到待译码序列。该待译码序列可以是LLR序列，该LLR序列中包括三个部分，分别为集合src对应的LLR序列、集合chk对应的LLR序列和集合frz对应的LLR序列。集合src表示信息比特位置集合，集合chk表示校验比特位置集合，集合frz表示冻结位集合。或者该待译码序列可以是其他的比特序列或符号序列。
310、第二通信设备令i＝1。
311、第二通信设备基于概率分布值集合P中的第i个概率分布值和第i个概率分布值对应的冻结比特序列对待译码序列进行译码，得到第i个概率分布值对应的第三比特序列。该第三比特序列包括第三信息比特序列中的比特、校验比特以及第i个概率分布值对应的冻结比特序列中的比特。
312、第二通信设备对该第三信息比特序列进行校验。
313、如果第三信息比特序列通过校验，则第二通信设备基于第三信息比特序列获取第一信息比特序列，并停止译码。其中，第一信息比特序列为第三信息比特序列，或者，第一信息比特序列为第三信息比特序列经过极化编码后得到的序列。
314、如果第三信息比特序列未通过校验，且i小于x，则第二通信设备令i＝i+1，并回到步骤311。其中，x为概率分布值集合P包括的概率分布值的数量。
315、如果第三信息比特序列未通过校验，且i等于x，则第二通信设备停止译码，或者，基于目标信息比特序列获取第四信息比特序列，并停止译码。其中，该目标信息比特序列为概率分布值集合P对应的x个第三信息比特序列中的一个，该第四信息比特序列为所述目标信息比特序列，或者，该第四信息比特序列为所述目标信息比特序列经过极化编码后得到的序列。
本申请实施例中，i表示概率分布值集合P中概率分布值的译码顺序。第i个概率分布值表示概率分布值集合P中第i个用来对待译码序列进行译码的概率分布值。第二通信设备令i＝1，表示从概率分布值集合P中选择第一个用来对待译码序列进行译码的概率分布值。第二通信设备令i＝1+1，表示从概率分布值集合P中选择下一个用来对待译码序列进行译码的概率分布值。
举例来说，假设概率分布值集合P包括{0.2、0.5、0.7}。第二通信设备可以先基于概率分布值0.2和概率分布值0.2对应的冻结比特序列对待译码序列进行译码，得到概率分布值0.2对应的第三比特序列1。第三比特序列1包括第三信息比特序列1中的比特、校验比特1以及概率分布值0.2对应的冻结比特序列中的比特。如果第三信息比特序列1通过校验，则第二通信设备基于第三信息比特序列1获取第一信息比特序列，并停止译码，该第一信息比特序列为第三信息比特序列1，或者，该第一信息比特序列为第三信息比特序列1经过极化编码后得到的序列。
如果第三信息比特序列1未通过校验，则第二通信设备基于概率分布值0.5和概率分布值0.5对应的冻结比特序列对待译码序列进行译码，得到概率分布值0.5对应的第三比特序列2。第三比特序列2包括第三信息比特序列2中的比特、校验比特2以及概率分布值0.5对应的冻结比特序列中的比特。如果第三信息比特序列2通过校验，则第二通信设备基于第三信息比特序列2获取第一信息比特序列，并停止译码，该第一信息比特序列为第三信息比特序列2，或者，该第一信息比特序列为第三信息比特序列2经过极化编码后得到的序列。
如果第三信息比特序列2未通过校验，则第二通信设备基于概率分布值0.7和概率分布值0.7对应的冻结比特序列对待译码序列进行译码，得到概率分布值0.7对应的第三比特序列3。第三比特序列3包括第三信息比特序列3中的比特、校验比特3以及概率分布值0.7对应的冻结比特序列中的比特。如果第三信息比特序列3通过校验，则第二通信设备基于第三信息比特序列3获取第一信息比特序列，并停止译码，该第一信息比特序列为第三信息比特序列3，或者，该第一信息比特序列为第三信息比特序列3经过极化编码后得到的序列。
如果第三信息比特序列3未通过校验，则第二通信设备可以停止译码，或者，从第三信息比特序列1～第三信息比特序列3中选择一个第三信息比特序列来确定第四信息比特序列。例如，选择第三信息比特序列2来确定第四信息比特序列，那么第四信息比特序列可以是第三信息比特序列2，或者，该第四信息比特序列为第三信息比特序列2经过极化编码后得到的序列。
下面以待译码序列为LLR序列为例，对第二通信设备基于第i个概率分布值和第i个概率分布值对应的冻结比特序列对待译码序列进行译码，得到第i个概率分布值对应的第三比特序列的可能的实施方式进行介绍：
第二通信设备可基于第i个概率分布值对待译码序列中集合src对应的LLR序列的取值进行修正，得到修正后的集合src对应的LLR序列。例如，修正后的集合src对应的LLR序列满足以下公式(4)：
LLR′(src)＝LLR(src)+log((1-P i,r)/P i,r)  (4)
其中，LLR(src)为集合src对应的LLR序列，LLR′(src)为基于第i个概率分布值对集合src对应的LLR序列进行修正后的集合src对应的LLR序列。P i,r为第i个概率分布值。第二通信设备基于第i个概率分布值对应的冻结比特序列对修正后的待译码序列进行译码，得到第i个概率分布值对应的第三比特序列。修正后的待译码序列包括三个部分，分别为集合chk对应的LLR序列、集合frz对应的LLR序列和修正后的集合src对应的LLR序列。
可选的，第二通信设备可基于第i个概率分布值对应的冻结比特序列、信息位集合和冻结位集合对修正后的待译码序列进行译码，得到第i个概率分布值对应的第三比特序列。其中，该信息位集合包括第三比特序列中的信息比特位置和校验比特位置，该冻结位集合包括第三比特序列中的冻结比特位置。第二通信设备可以基于第三信息比特序列的长度和校验比特序列的长度之和以及编码码长得到该信息位集合和该冻结位集合。第二通信设备进行译码 使用的信息位集合和冻结位集合与第一通信设备进行编码使用的信息位集合和冻结位集合相同。也就是说，第三比特序列中的信息比特位置与第一比特序列中的信息比特位置相同，第三比特序列中的校验比特位置与第一比特序列中的校验比特位置相同，第三比特序列中的冻结比特位置与第一比特序列中的冻结比特位置相同。
可选的，第二通信设备可将第i个概率分布值对应的冻结比特序列、信息位集合、冻结位集合和修正后的待译码序列输入CRC辅助的串行抵消列表(CRC-aided successive cancellation list，CA-SCL)译码器或奇偶校验的串行抵消列表(parity check successive cancellation list，PC-SCL)译码器或其他Polar译码器进行译码，得到第i个概率分布值对应的第三比特序列。
在一种可能的实现中，概率分布值集合P中的一种概率分布值对应一种冻结比特序列映射方式，第二通信设备还可根据与第i个概率分布值对应的冻结比特序列映射方式，确定第i个概率分布值对应的冻结比特序列。
可选的，第i个概率分布值对应的冻结比特序列映射方式具体可以包括以下四种方式：
方式一：第i个概率分布值对应的冻结比特序列基于第i个概率分布值对应的基础序列确定，该基础序列基于概率分布值集合P包括的概率分布值的数量确定。
方式二：第i个概率分布值对应的冻结比特序列基于第i个概率分布值对应的m序列确定。
方式三：第i个概率分布值对应的冻结比特序列基于第i个概率分布值对应的Gold序列确定。
方式四：第i个概率分布值对应的冻结比特序列基于第i个概率分布值对应的伪随机序列确定。
第二通信设备根据与第i个概率分布值对应的冻结比特序列映射方式，确定第i个概率分布值对应的冻结比特序列的具体实施方式可参见前文中第一通信设备根据与概率分布值P 0对应的冻结比特序列映射方式，确定第一冻结比特序列的具体实施方式，在此不赘述。
在一种可能的实现中，协议也可以预先直接定义出不同概率分布值和冻结比特序列的长度对应的冻结比特序列取值。第二通信设备基于概率分布值和冻结比特序列的长度，从协议预先定义的多个冻结比特序列取值中确定概率分布值对应的冻结比特序列的取值。
在一种可能的实现中，第三比特序列中的校验比特位置为G(a)中求和为1的行对应的比特位置，G(a)为取极化矩阵G中集合a的行和列组成的矩阵，极化矩阵G为进行极化编码使用的极化矩阵，该集合a为信息位集合，该信息位集合包括第三比特序列中的信息比特位置以及校验比特位置。基于该可能的实现方式，在编码侧可以使第一信息比特序列的预变换操作与基于第二信息比特序列确定校验比特序列这一操作进行解耦，进而可以使得预变换操作在确定校验比特序列之前进行，这样译码侧只需要对译码得到的通过校验的信息比特序列进行极化操作，得到编码侧发送的第一信息比特序列，以便减小译码侧的功耗以及提高译码效率。
在一种可能的实现中，校验比特中的至少一个校验比特位于第三信息比特序列包括的比特中间。这样该至少一个校验比特就可用于校验其位置之前的信息比特，这样有利于实现译码早停的功能。
在一种可能的实现中，校验比特的至少一个校验比特的译码顺序位于第三信息比特序列包括的比特的译码顺序中间。这样该至少一个校验比特就可用于校验其译码顺序之前的信息比特，实现译码早停的功能。
本申请实施例中，如果第一通信设备侧的第二信息比特序列为第一信息比特序列，则若第三信息比特序列通过校验，第二通信设备确定第三信息比特序列为第一信息比特序列。也就是说，第一通信设备可以不对第一信息比特序列进行预变换操作。相应地，第二通信设备也无需对第三信息比特序列进行极化编码。可见，这样可以节省第一通信设备和第二通信设备的处理开销。
本申请实施例中，如果第一通信设备侧的第二信息比特序列为第一信息比特序列经过预变换操作后得到的序列，则若第三信息比特序列通过校验，第二通信设备确定三信息比特序列经过极化编码后得到的序列为第一信息比特序列。也就是说，第一通信设备可以先对第一信息比特序列进行预变换操作，再基于预变换操作得到的第二信息比特序列确定校验比特序列。第二通信设备只需要对译码得到的通过校验的第三信息比特序列进行极化编码，得到第一通信设备发送的第一信息比特序列，这样有利于减小译码侧的功耗以及提高译码效率。如果第一通信设备先基于第一信息比特序列确定校验比特序列，再对第一信息比特序列进行预变换操作，第二通信设备需要对每个概率分布值译码得到的第三信息比特序列均进行极化编码，再对极化操作后得到的信息比特序列进行校验(如CRC或PC)，这样的译码侧的功耗较大且译码效率低。
在一种可能的实现中，若概率分布值P 1不为等概分布，第二信息比特序列为第一信息比特序列经过预变换操作后得到的序列；或者，若概率分布值P 1为等概分布，第二信息比特序列为第一信息比特序列。相应地，若第i个概率分布值不为等概分布，第一信息比特序列为第三信息比特序列经过极化编码后得到的序列；或者若第i个概率分布值为等概分布，第一信息比特序列为第三信息比特序列。
也就是说，概率分布值P 1不为等概分布时，第一通信设备需要对第一信息比特序列进行预变换操作。概率分布值P 1为等概分布时，第一通信设备不需要对第一信息比特序列进行预变换操作。若第i个概率分布值不为等概分布，第二通信设备需要对第三信息比特序列进行极化编码，以得到第一信息比特序列；或者若第i个概率分布值为等概分布，第二通信设备不需要对第三信息比特序列进行极化编码，第二通信设备直接将第三信息比特序列确定为第一信息比特序列。例如，如图4的步骤402～步骤405以及步骤415～步骤416所示。其中，图4中其他步骤的具体实现方式与图3中对应步骤的具体实现方式相同，在此不赘述。
可见，基于该可能的实现方式，可以在系统中合理兼容对第一信息比特序列进行预变换操作和不对第一信息比特序列进行预变换操作这两种实现方式，以及可以合理兼容将第三信息比特序列确定为第一信息比特序列，以及将第三信息比特序列经过极化编码后得到的序列确定为第一信息比特序列两种实现方式。对第一信息比特序列进行预变换操作是利用第一信息比特序列的稀疏性来提高译码的性能。第一信息比特序列的概率分布值远离等概分布时表示第一信息比特序列很稀疏。由于第一信息比特序列的概率分布值为等概分布时表示第一信息比特序列不稀疏，所以第一信息比特序列的概率分布值为等概分布时不用对第一信息比特序列进行预变换操作，以便节省第一通信设备和第二通信设备的处理开销。
在一种可能的实现中，若|P 1-0.5|≤∈，则概率分布值P 1为等概分布，∈为预设值。若|P i,r-0.5|≤∈，则第i个概率分布值为等概分布，∈为预设值，P i,r为第i个概率分布值。该∈可以是一个较小值，例如可以是0.001、0.01、0.02、0.03、0.04或0.05等。
需要注意的是，概率分布值集合P中概率分布值的译码顺序与概率分布值本身可以无关，即并不一定以概率分布值的大小按从大到小或者从小到大的顺序进行译码。下面对概率分布值集合P中概率分布值的译码顺序的几种确定方式进行介绍：
方式一：概率分布值集合P中的概率分布值的译码顺序基于概率分布值集合中的概率分布值对应的信息熵确定。
信息熵越大的概率分布值越不稀疏，信息熵越小的概率分布值越稀疏，对于求和为1的两个概率分布值(如P′+P″＝1)，它们的信息熵相等，稀疏度一致。概率分布值为0.5时，信息熵最大，即信息熵为1，表示信源比特完全不稀疏。基于概率分布值集合中的概率分布值对应的信息熵确定概率分布值集合P中的概率分布值的译码顺序，有利于降低错误检测概率。
在一种可能的实现中，第i个概率分布值对应的信息熵大于或等于第i+1个概率分布值对应的信息熵。也就是说，第二通信设备可以优先使用信息熵较大的概率分布值进行译码。由于信息熵较大的概率分布值，能够供译码侧利用的先验信息较少，优先尝试这些概率分布值，可以减少译码侧通过引入错误先验信息，对译码效果带来的负面影响，降低错误检测概率。
例如，如果概率分布值集合P中包括概率分布值1、概率分布值2和概率分布值3，概率分布值1的信息熵大于概率分布值2的信息熵，概率分布值2的信息熵大于概率分布值3的信息熵。第二通信设备先基于概率分布值1对待译码序列进行译码。如果译码结果未通过校验，则第二通信设备先基于概率分布值2对待译码序列进行译码。如果译码结果未通过校验，则第二通信设备先基于概率分布值3对待译码序列进行译码。
可选的，如果有两个概率分布值对应的信息熵相等，则先尝试这两个概率分布值中小于0.5的概率分布值。或者，如果有两个概率分布值对应的信息熵相等，则先尝试这两个概率分布值中大于0.5的概率分布值。
方式二：概率分布值集合P中的概率分布值的译码顺序基于发送端历史的概率分布值确定。
例如，如果概率分布值集合P中包括概率分布值1、概率分布值2和概率分布值3，发送端对概率分布值1的历史使用率高于对概率分布值2的历史使用率，发送端对概率分布值2的历史使用率高于对概率分布值3的历史使用率。第二通信设备先基于概率分布值1对待译码序列进行译码。如果译码结果未通过校验，则第二通信设备先基于概率分布值2对待译码序列进行译码。如果译码结果未通过校验，则第二通信设备先基于概率分布值3对待译码序列进行译码。
基于方式二，有利于减小译码侧尝试译码的次数，降低译码功耗。
方式三：第一通信设备还可每隔N个信息比特序列向第二通信设备发送概率分布参考值范围或概率分布参考值，该N为大于1的整数。第二通信设备还可接收第一通信设备每隔N个信息比特序列发送的概率分布参考值范围或概率分布参考值；其中，概率分布值集合P中的概率分布值的译码顺序基于概率分布参考值范围或概率分布参考值确定。
例如，第一通信设备可以每隔5个信息比特序列，向第二通信设备发送一次概率分布参考值范围或概率分布参考值。假设当前周期内第一通信设备发送的概率分布参考值为0.5，则第二通信设备优先使用概率分布值0.5对待译码序列进行译码。假设当前周期内第一通信设备发送的概率分布参考值范围为0.3～0.5，则第二通信设备优先使用概率分布值集合P中处于概率分布参考值范围0.3～0.5内的概率分布值对待译码序列进行译码。
基于方式三，有利于减小译码侧尝试译码的次数，降低译码功耗。
在一种可能的实现中，如果第一通信设备侧的第二信息比特序列为第一信息比特序列，则第四信息比特序列为目标信息比特序列。如果第一通信设备侧的第二信息比特序列为第一信息比特序列经过预变换操作后得到的序列，则第四信息比特序列为目标信息比特序列经过 极化编码后得到的序列。
在一种可能的实现中，目标信息比特序列为所述概率分布值集合P中的等概分布对应的第三信息比特序列。由于第二通信设备不知道真实的概率分布值是多少，在所有概率分布值对应的第三信息比特序列均未通过校验时，基于等概分布对应的第三信息比特序列获取第四信息比特序列是一种保守方案，可以避免因为错误使用概率分布值引入的负面效果。
在一种可能的实现中，第一通信设备还可对编码码率进行调整。例如，第一通信设备可基于系统的传输资源对编码码率进行调整，这样可以使编码码率更加灵活。
可选的，如果第一通信设备对编码码率进行调整，第一通信设备可以基于调整后的编码码率确定第一码。第一码可以是基于打孔位集合或缩短位集合对母码进行打孔或缩短得到。第一通信设备可基于母码确定第一码的信息位集合和冻结位集合。第一通信设备基于第一信息比特序列、校验比特序列和第一冻结比特序列、第一码的信息位集合和冻结位集合确定第一比特序列。第一通信设备对第一比特序列进行极化编码之后，基于打孔位集合/缩短位集合对极化编码之后得到的比特序列进行打孔或缩短，以便得到第二比特序列。
在一种可能的实现中，对于对编码码率进行调整的场景，可以首先在母码中选择第一码对应的打孔位/缩短位，然后在母码中的剩余位置选定第一码的信息位。以第一码为(30,20)码为例，其对应母码长度为32。如果以比特逆序打孔，需打掉{1,17}位置；根据剩余位置{2～16,18～32}译码可靠度，选择最可靠的20个位置作为信息位，得到第一码的信息位集合为info＝{4,6,7,8,10,12,14,15,16,20,22,23,24,26,27,28,29,30,31,32}，其中计算G(info)中求和为1的行(满足G(chk,src)＝0约束)得到6个信息位位置，分别为{4,6,7,10,27,29}，即第一码的校验位集合包括{4,6,7,10,27,29}。
在一种可能的实现中，针对同一个母码，可以在不同码长和码率下构建校验比特位置的嵌套关系，方便系统保存不同码长和码率下的可选校验比特位置。
1、(N,K)码下的可选校验比特集合假设为chk (N,K)。
2、(N,K)码—>(N,K–1)码：将(N,K)码的K个信息位中译码可靠度最低的信息位i变为冻结位。
a)(N,K-1)码下的可选校验比特集合chk (N,K-1)＝chk (N,K)\{i}。
b)找到G(info\{i},i)中的非0位置(记为Idx′)，评估G(Idx′,info\{i})中求和为1的行(记为Idx″)，更新chk (N,K-1)＝chk (N,K-1)∪Idx″(耦合关系解除的信息位可放置校验比特)。其中，G(a,b)表示取极化矩阵G对应集合a的行和对应集合b的列。
3、(N,K)码—>(N–1,K)码：
a)如果被打孔/缩短的是冻结位，则可选校验位集合不变，(N–1,K)码下的可选校验比特集合chk (N-1,K)＝chk (N,K)。
b)如果被打孔/缩短的是信息位，则需在(N–K)个冻结位中，将译码可靠度最高的冻结位f变为信息位；
b1)评估G(f,info∪{f})，如果求和为1则有chk (N-1,K)＝chk (N,K)∪{f}，否则chk (N-1,K)＝chk (N,K)；
b2)找到G(chk (N,K),f)中的非0位置(记为Idx′)，这些位置会产生耦合关系，需要从校验位集合中去掉，chk (N-1,K)＝chk (N-1,K)\Idx′。
4、(N,K)码—>(N–1,K–1)码：
a)如果被打孔/缩短的是信息位，则重复2中的a)和b)操作得到(N–1,K–1)码下的可选校验位集合chk (N-1,K-1)。
b)如果被打孔/缩短的是冻结位，则(N–1,K–1)码下的可选校验位集合chk (N-1,K-1)与(N,K–1)码下的可选校验位集合chk (N,K-1)一致。
基于上述1～4操作，以母码(N m，K m)为基准(K m/N m对应最高码率)，依次完成打孔/缩 短下的各种码长、码率组合构造，存储时采用二维链表结构，分码长和信息位长度两个维度。如图5所示，只有母码(N m，K m)需要存储完整的可选校验比特集合，其余组合只需存储可选校验比特集合的变化量。
以母码(32,20)为例，其信息位长度为20，冻结位长度为12。根据译码可靠度，选择最可靠的20个位置作为信息位，得到信息位集合为info＝{4,6,7,8,10,12,14,15,16,20,22,23,24,26,27,28,29,30,31,32}，其中计算G(info)中求和为1的行(满足G(chk,src)＝0约束)得到6个信息位位置，分别为{4,6,7,10,27,29}，即最多可以安排6个校验比特。
然后考虑利用(32,20)码的可选校验比特集合chk (32,20)＝{4,6,7,10,27,29}，分别得到(32,19)码、(31,20)码和(31,19)码的集合：
1、(32,19)码：
a)将可靠度最低的信息位7变为冻结位，更新后的信息位集合为info′＝{4,6,8,10,12,14,15,16,20,22,23,24,26,27,28,29,30,31,32}；
b)更新得到chk (32,19)＝chk (32,20)\{7}＝{4,6,10,27,29}。
c)找到G(info′\{7},7)中的非0位置(记为Idx′)，即有Idx′＝{8,15,16,23,24,31,32}，评估G(Idx′,info′\{7})中求和为1的行(记为Idx″)，即有Idx″＝{15,23}，进一步更新得到chk (32,19)＝chk (32,19)∪Idx″＝{4,6,10,15,23,27,29}；
d)记录chk (32,19)与chk (32,20)的变化值集合{7,15,23}。
2、(31,20)码：以比特逆序打孔为例，需要打掉{1}位置，由于该位置为冻结位，所以可选校验位集合不变，即chk (31,20)＝chk (32,20)，记录chk (31,20)与chk (32,20)的变化值集合
Figure PCTCN2022123378-appb-000003
3、(31,19)码：以比特逆序打孔为例，需要打掉{1}位置，由于该位置为冻结位，可以直接得到chk (31,19)＝chk (32,19)，记录chk (31,19)与chk (32,20)的变化值集合{7,15,23}。
在一种可能的实现中，当概率分布值P 1不是等概分布时，第一通信设备可以对第二比特序列打孔系统位，得到打孔系统位后的比特序列，从而实现信息比特的压缩。第一通信设备对第二比特序列打孔系统位之后，对打孔系统位后的比特序列进行调制，并向第二通信设备发送得到的调制符号。当概率分布值P 1为等概分布时，第一通信设备可以对第二比特序列进行调制，并向第二通信设备发送得到的调制符号。例如，如图6的步骤607所示。图6中其他步骤的具体实现方式与图3中对应步骤的具体实现方式相同，在此不赘述。
可见，基于图3所描述的方法，通过使第一冻结比特序列的取值基于第一信息比特序列的概率分布值来确定，而不是将第一冻结比特序列的取值默认设置为全0，这样译码侧在对待译码序列进行译码时，可依次尝试概率分布值集合中不同的概率分布值以及概率分布值对应的冻结比特序列进行译码，译码侧可以更好地区分不同概率分布值，降低错误检测概率。
请参见图7，图7示出了本申请实施例的一种通信装置的结构示意图。图7所示的通信装置可以用于执行上述图3、图4或图6所描述的方法实施例中第一通信设备的部分或全部功能。该装置可以是第一通信设备，也可以是第一通信设备中的装置，或者是能够和第一通信设备匹配使用的装置。其中，该通信装置还可以为芯片系统。图7所示的通信装置可以包括通信单元701和处理单元702。其中，处理单元702，用于进行数据处理。通信单元701集成有接收单元和发送单元。通信单元701也可以称为收发单元。或者，也可将通信单元701拆分为接收单元和发送单元。其中：
处理单元702，用于获取第一信息比特序列；处理单元702，还用于基于第一信息比特序列的概率分布值P 1确定第一冻结比特序列；处理单元702，还用于基于第二信息比特序列确定校验比特序列，该第二信息比特序列为第一信息比特序列或者为第一信息比特序列经过预变换操作后得到的序列；处理单元702，还用于基于第二信息比特序列、校验比特序列和第 一冻结比特序列，得到第一比特序列，该第一比特序列包括第二信息比特序列中的比特、校验比特序列中的比特以及第一冻结比特序列中的比特；处理单元702，还用于对第一比特序列进行极化编码，得到第二比特序列；处理单元702，还用于输出第二比特序列。
在一种可能的实现中，若概率分布值P 1不为等概分布，第二信息比特序列为第一信息比特序列经过预变换操作后得到的序列；或者若概率分布值P 1为等概分布，第二信息比特序列为第一信息比特序列。
在一种可能的实现中，若|P 1-0.5|≤∈，则概率分布值P 1为等概分布，∈为预设值。
在一种可能的实现中，第一比特序列中的校验比特位置为G(a)中求和为1的行对应的比特位置，G(a)为取极化矩阵G中集合a的行和列组成的矩阵，极化矩阵G为进行极化编码使用的极化矩阵，该集合a为信息位集合，该信息位集合包括第一比特序列中的信息比特位置以及校验比特位置。
在一种可能的实现中，校验比特序列中的至少一个校验比特位于第二信息比特序列包括的比特中间。
在一种可能的实现中，处理单元702基于第一信息比特序列的概率分布值P 1确定第一冻结比特序列的方式具体为：根据第一信息比特序列的概率分布值P 1选取概率分布值集合P中的概率分布值P 0，该概率分布值P 0为概率分布值集合P中与概率分布值P 1最接近的概率分布值；该概率分布值集合P中的一种概率分布值对应一种冻结比特序列映射方式；根据与概率分布值P 0对应的冻结比特序列映射方式，确定第一冻结比特序列。
在一种可能的实现中，第一冻结比特序列基于概率分布值P 0对应的基础序列确定，该基础序列基于概率分布值集合P包括的概率分布值的数量确定。
在一种可能的实现中，第一冻结比特序列基于概率分布值P 0对应的m序列或Gold序列或伪随机序列确定。
在一种可能的实现中，每隔N个信息比特序列向第二通信设备发送概率分布参考值范围或概率分布参考值，N为大于1的整数。
在一种可能的实现中，校验比特包括循环冗余码校验CRC比特和/或奇偶校验PC比特。
请参见图7，图7示出了本申请实施例的一种通信装置的结构示意图。图7所示的通信装置可以用于执行上述图3、图4或图6所描述的方法实施例中第二通信设备的部分或全部功能。该装置可以是第二通信设备，也可以是第二通信设备中的装置，或者是能够和第二通信设备匹配使用的装置。其中，该通信装置还可以为芯片系统。图7所示的通信装置可以包括通信单元701和处理单元702。其中，处理单元702，用于进行数据处理。通信单元701集成有接收单元和发送单元。通信单元701也可以称为收发单元。或者，也可将通信单元701拆分为接收单元和发送单元。其中：
处理单元702，用于获取待译码序列；
处理单元702，还用于令i＝1；
处理单元702，还用于基于概率分布值集合P中的第i个概率分布值和第i个概率分布值对应的冻结比特序列对待译码序列进行译码，得到第i个概率分布值对应的第三比特序列，该第三比特序列包括第三信息比特序列中的比特、校验比特以及第i个概率分布值对应的冻结比特序列中的比特；
处理单元702，还用于对第三信息比特序列进行校验；
处理单元702，还用于如果第三信息比特序列通过校验，则基于第三信息比特序列获取 第一信息比特序列，并停止译码，该第一信息比特序列为第三信息比特序列，或者，该第一信息比特序列为第三信息比特序列经过极化编码后得到的序列；
处理单元702，还用于如果第三信息比特序列未通过校验，且i小于x，则令i＝i+1，并执行所述基于概率分布值集合P中的第i个概率分布值和第i个概率分布值对应的冻结比特序列对待译码序列进行译码，得到第i个概率分布值对应的第三比特序列的步骤，x为概率分布值集合P包括的概率分布值的数量；
处理单元702，还用于如果第三信息比特序列未通过校验，且i等于x，则停止译码，或者，基于目标信息比特序列获取第四信息比特序列，并停止译码；该目标信息比特序列为概率分布值集合P对应的x个第三信息比特序列中的一个，该第四信息比特序列为目标信息比特序列，或者，该第四信息比特序列为目标信息比特序列经过极化编码后得到的序列。
在一种可能的实现中，若第i个概率分布值不为等概分布，第一信息比特序列为第三信息比特序列经过极化编码后得到的序列；或者若第i个概率分布值为等概分布，第一信息比特序列为第三信息比特序列。
在一种可能的实现中，若|P i,r-0.5|≤∈，则第i个概率分布值为等概分布，∈为预设值，P i,r为第i个概率分布值。
在一种可能的实现中，概率分布值集合P中的概率分布值的译码顺序基于概率分布值集合P中的概率分布值对应的信息熵确定。
在一种可能的实现中，第i个概率分布值对应的信息熵大于或等于第i+1个概率分布值对应的信息熵。
在一种可能的实现中，概率分布值集合P中的概率分布值的译码顺序基于发送端历史的概率分布值确定。
在一种可能的实现中，通信单元701，用于接收第一通信设备每隔N个信息比特序列发送的概率分布参考值范围或概率分布参考值，N为大于1的整数；其中，概率分布值集合P中的概率分布值的译码顺序基于概率分布参考值范围或概率分布参考值确定。
在一种可能的实现中，目标信息比特序列为所述概率分布值集合P中的等概分布对应的第三信息比特序列。
在一种可能的实现中，第三比特序列中的校验比特位置为G(a)中求和为1的行对应的比特位置，G(a)为取极化矩阵G中集合a的行和列组成的矩阵，该极化矩阵G为进行极化编码使用的极化矩阵，该集合a为信息位集合，该信息位集合包括第三比特序列中的信息比特位置以及校验比特位置。
在一种可能的实现中，校验比特中的至少一个校验比特位于第三信息比特序列包括的比特中间。
在一种可能的实现中，概率分布值集合P中的一种概率分布值对应一种冻结比特序列映射方式，处理单元702，还用于根据与第i个概率分布值对应的冻结比特序列映射方式，确定第i个概率分布值对应的冻结比特序列。
在一种可能的实现中，第i个概率分布值对应的冻结比特序列基于概率分布值对应的基础序列确定，该基础序列基于概率分布值集合P包括的概率分布值的数量确定。
在一种可能的实现中，第i个概率分布值对应的冻结比特序列基于概率分布值对应的m序列或Gold序列或伪随机序列确定。
在一种可能的实现中，校验比特包括循环冗余码校验CRC比特和/或奇偶校验PC比特。
图8给出了一种通信装置的结构示意图。所述通信装置800可以是上述方法实施例中的第一通信设备，也可以是上述方法实施例中的第二通信设备，还可以是支持第一通信设备实现上述方法的芯片、芯片系统、或处理器等，还可以是支持第二通信设备实现上述方法的芯片、芯片系统、或处理器等，还可以是支持服务器实现上述方法的芯片、芯片系统、或处理器等。该通信装置可用于实现上述方法实施例中描述的方法，具体可以参见上述方法实施例中的说明。
所述通信装置800可以包括一个或多个处理器801。所述处理器801可以是通用处理器或者专用处理器等。例如可以是基带处理器或中央处理器。基带处理器可以用于对通信协议以及通信数据进行处理，中央处理器可以用于对通信装置(如，基站、基带芯片，终端、终端芯片，DU或CU等)进行控制，执行软件程序，处理软件程序的数据。
可选的，所述通信装置800中可以包括一个或多个存储器802，其上可以存有指令804，所述指令可在所述处理器801上被运行，使得所述通信装置800执行上述方法实施例中描述的方法。可选的，所述存储器802中还可以存储有数据。所述处理器801和存储器802可以单独设置，也可以集成在一起。
可选的，所述通信装置800还可以包括收发器805、天线806。所述收发器805可以称为收发单元、收发机、或收发电路等，用于实现收发功能。收发器805可以包括接收器和发送器，接收器可以称为接收机或接收电路等，用于实现接收功能；发送器可以称为发送机或发送电路等，用于实现发送功能。其中，图7所示的处理单元702可以为处理器801。通信单元701可以为收发器805。
所述通信装置800为第一通信设备：处理器801用于执行上述方法实施例中第一通信设备的数据处理操作。收发器805用于执行上述方法实施例中第一通信设备的数据收发操作。例如，收发器805可用于执行图3、图4或图6中第一通信设备的数据收发操作。例如，收发器805可发送调制符号。处理器801可用于执行图3、图4或图6中第一通信设备的数据处理操作。例如，处理器801可执行图3中的步骤301～步骤305以及步骤307。或者，处理器801可执行图4中的步骤401～步骤407以及步骤409。或者，处理器801可执行图6中的步骤601～步骤605以及步骤607和步骤608。
所述通信装置800为第二通信设备：处理器801用于执行上述方法实施例中第二通信设备的数据处理操作。收发器805用于执行上述方法实施例中第二通信设备的数据收发操作。例如，收发器805可用于执行图3、图4或图6中第二通信设备的数据收发操作。例如，收发器805可接收调制符号。处理器801可用于执行图3、图4或图6中第二通信设备的数据处理操作。例如，处理器801可执行图3中的步骤309～步骤315。或者，处理器801可执行图4中的步骤411～步骤418。或者，处理器801可执行图6中的步骤610～步骤616。
另一种可能的设计中，处理器801中可以包括用于实现接收和发送功能的收发器。例如该收发器可以是收发电路，或者是接口，或者是接口电路。用于实现接收和发送功能的收发电路、接口或接口电路可以是分开的，也可以集成在一起。上述收发电路、接口或接口电路可以用于代码/数据的读写，或者，上述收发电路、接口或接口电路可以用于信号的传输或传递。
又一种可能的设计中，可选的，处理器801可以存有指令803，指令803在处理器801上运行，可使得所述通信装置800执行上述方法实施例中描述的方法。指令803可能固化在处理器801中，该种情况下，处理器801可能由硬件实现。
又一种可能的设计中，通信装置800可以包括电路，所述电路可以实现前述方法实施例 中发送或接收或者通信的功能。本申请实施例中描述的处理器和收发器可实现在集成电路(integrated circuit，IC)、模拟IC、射频集成电路RFIC、混合信号IC、专用集成电路(application specific integrated circuit，ASIC)、印刷电路板(printed circuit board，PCB)、电子设备等上。该处理器和收发器也可以用各种IC工艺技术来制造，例如互补金属氧化物半导体(complementary metal oxide semiconductor，CMOS)、N型金属氧化物半导体(nMetal-oxide-semiconductor，NMOS)、P型金属氧化物半导体(positive channel metal oxide semiconductor，PMOS)、双极结型晶体管(Bipolar Junction Transistor，BJT)、双极CMOS(BiCMOS)、硅锗(SiGe)、砷化镓(GaAs)等。
以上实施例描述中的通信装置可以是第一通信设备、第二通信设备，但本申请实施例中描述的通信装置的范围并不限于此，而且通信装置的结构可以不受图8的限制。通信装置可以是独立的设备或者可以是较大设备的一部分。例如所述通信装置可以是：
(1)独立的集成电路IC，或芯片，或，芯片系统或子系统；
(2)具有一个或多个IC的集合，可选的，该IC集合也可以包括用于存储数据，指令的存储部件；
(3)ASIC，例如调制解调器(MSM)；
(4)可嵌入在其他设备内的模块；
(5)接收机、终端、智能终端、蜂窝电话、无线设备、手持机、移动单元、车载设备、网络设备、云设备、人工智能设备等等；
(6)其他等等。
对于通信装置可以是芯片或芯片系统的情况，可参见图9所示的芯片的结构示意图。图9所示的芯片900包括处理器901、接口902。可选的，还可包括存储器903。其中，处理器901的数量可以是一个或多个，接口902的数量可以是多个。
一种设计中，对于芯片用于实现本申请实施例中第一通信设备的功能的情况：
所述接口902，用于接收或输出信号；例如，接口902可用于执行图3、图4或图6中第一通信设备的信号接收或输出操作。例如，接口902可输出第二比特序列以及输出调制符号。
所述处理器901，用于执行第一通信设备的数据处理操作。例如，处理器901可用于执行图3、图4或图6中第一通信设备的数据处理操作。例如，处理器901可执行图3中的步骤301～步骤305以及步骤307。或者，处理器901可执行图4中的步骤401～步骤407以及步骤409。或者，处理器901可执行图6中的步骤601～步骤605以及步骤607和步骤608。
另一种设计中，对于芯片用于实现本申请实施例中第二通信设备的功能的情况：
所述接口902，用于接收或输出信号；例如，接口902可用于执行图3、图4或图6中第二通信设备的信号接收或输出操作。例如，接口902可接收调制符号。
所述处理器901，用于执行第二通信设备的数据处理操作。例如，处理器901可用于执行图3、图4或图6中第二通信设备的数据处理操作。例如，处理器901可执行图3中的步骤309～步骤315。或者，处理器901可执行图4中的步骤411～步骤418。或者，处理器901可执行图6中的步骤610～步骤616。
可以理解的是，本申请实施例中的一些可选的特征，在某些场景下，可以不依赖于其他特征，比如其当前所基于的方案，而独立实施，解决相应的技术问题，达到相应的效果，也可以在某些场景下，依据需求与其他特征进行结合。相应的，本申请实施例中给出的通信装置也可以相应的实现这些特征或功能，在此不予赘述。
应理解，本申请实施例中的处理器可以是一种集成电路芯片，具有信号的处理能力。在 实现过程中，上述方法实施例的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。上述的处理器可以是通用处理器、数字信号处理器(digital signal processor，DSP)、专用集成电路(application specific integrated circuit，ASIC)、现场可编程门阵列(field programmable gate array，FPGA)或者其它可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。
可以理解，本申请实施例中的存储器可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(read-only memory，ROM)、可编程只读存储器(programmable ROM，PROM)、可擦除可编程只读存储器(erasable PROM，EPROM)、电可擦除可编程只读存储器(electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(random access memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(static RAM，SRAM)、动态随机存取存储器(dynamic RAM，DRAM)、同步动态随机存取存储器(synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(double data rate SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(direct rambus RAM，DR RAM)。应注意，本文描述的系统和方法的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
本申请还提供了一种计算机可读介质，存储介质中存储有计算机程序或指令，当计算机程序或指令被通信装置执行时，实现上述任一方法实施例的功能。
本申请还提供了一种包括指令的计算机程序产品，当计算机读取并执行计算机程序产品时，使得计算机实现上述任一方法实施例的功能。
上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机指令时，全部或部分地产生按照本申请实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(digital subscriber line，DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质(例如，软盘、硬盘、磁带)、光介质(例如，高密度数字视频光盘(digital video disc，DVD))、或者半导体介质(例如，固态硬盘(solid state disk，SSD))等。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (30)

  1. 一种编码方法，其特征在于，应用于第一通信设备，所述方法包括：
    获取第一信息比特序列；
    基于所述第一信息比特序列的概率分布值P 1确定第一冻结比特序列；
    基于第二信息比特序列确定校验比特序列，所述第二信息比特序列为所述第一信息比特序列或者为所述第一信息比特序列经过预变换操作后得到的序列；
    基于第二信息比特序列、所述校验比特序列和所述第一冻结比特序列，得到第一比特序列，所述第一比特序列包括所述第二信息比特序列中的比特、所述校验比特序列中的比特以及所述第一冻结比特序列中的比特；
    对所述第一比特序列进行极化编码，得到第二比特序列；
    输出所述第二比特序列。
  2. 根据权利要求1所述的方法，其特征在于，
    若所述概率分布值P 1不为等概分布，所述第二信息比特序列为所述第一信息比特序列经过预变换操作后得到的序列；或者
    若所述概率分布值P 1为等概分布，所述第二信息比特序列为所述第一信息比特序列。
  3. 根据权利要求2所述的方法，其特征在于，若|P 1-0.5|≤∈，则所述概率分布值P 1为等概分布，所述∈为预设值。
  4. 根据权利要求1～3中任意一项所述的方法，其特征在于，所述第一比特序列中的校验比特位置为G(a)中求和为1的行对应的比特位置，所述G(a)为取极化矩阵G中集合a的行和列组成的矩阵，所述极化矩阵G为进行所述极化编码使用的极化矩阵，所述集合a为信息位集合，所述信息位集合包括所述第一比特序列中的信息比特位置以及校验比特位置。
  5. 根据权利要求1～4中任意一项所述的方法，其特征在于，所述校验比特序列中的至少一个校验比特位于所述第二信息比特序列包括的比特中间。
  6. 根据权利要求1～5中任意一项所述的方法，其特征在于，所述基于所述第一信息比特序列的概率分布值P 1确定第一冻结比特序列，包括：
    根据所述第一信息比特序列的概率分布值P 1选取概率分布值集合P中的概率分布值P 0，所述概率分布值P 0为所述概率分布值集合P中与所述概率分布值P 1最接近的概率分布值；所述概率分布值集合P中的一种概率分布值对应一种冻结比特序列映射方式；
    根据与概率分布值P 0对应的冻结比特序列映射方式，确定第一冻结比特序列。
  7. 根据权利要求6所述的方法，其特征在于，所述第一冻结比特序列基于所述概率分布值P 0对应的基础序列确定，所述基础序列基于所述概率分布值集合P包括的概率分布值的数量确定。
  8. 根据权利要求6所述的方法，其特征在于，所述第一冻结比特序列基于所述概率分布值P 0对应的m序列或Gold序列或伪随机序列确定。
  9. 根据权利要求1～8中任意一项所述的方法，其特征在于，所述方法还包括：
    每隔N个信息比特序列向第二通信设备发送概率分布参考值范围或概率分布参考值，所述N为大于1的整数。
  10. 根据权利要求1～9中任意一项所述的方法，其特征在于，所述校验比特包括循环冗余码校验CRC比特和/或奇偶校验PC比特。
  11. 一种译码方法，其特征在于，应用于第二通信设备，所述方法包括：
    步骤1，获取待译码序列；
    步骤2，令i＝1；
    步骤3，基于概率分布值集合P中的第i个概率分布值和所述第i个概率分布值对应的冻结比特序列对所述待译码序列进行译码，得到所述第i个概率分布值对应的第三比特序列，所述第三比特序列包括第三信息比特序列中的比特、校验比特以及所述第i个概率分布值对应的冻结比特序列中的比特；
    步骤4，对所述第三信息比特序列进行校验；
    步骤5，如果所述第三信息比特序列通过校验，则基于所述第三信息比特序列获取第一信息比特序列，并停止译码，所述第一信息比特序列为所述第三信息比特序列，或者，所述第一信息比特序列为所述第三信息比特序列经过极化编码后得到的序列；
    步骤6，如果所述第三信息比特序列未通过校验，且所述i小于x，则令i＝i+1，并回到步骤3，所述x为所述概率分布值集合P包括的概率分布值的数量；
    步骤7，如果所述第三信息比特序列未通过校验，且所述i等于所述x，则:
    停止译码；或者，
    基于目标信息比特序列获取第四信息比特序列，并停止译码；所述目标信息比特序列为所述概率分布值集合P对应的x个第三信息比特序列中的一个，所述第四信息比特序列为所述目标信息比特序列或者为所述目标信息比特序列经过极化编码后得到的序列。
  12. 根据权利要求11所述的方法，其特征在于，
    若所述第i个概率分布值不为等概分布，所述第一信息比特序列为所述第三信息比特序列经过极化编码后得到的序列；或者
    若所述第i个概率分布值为等概分布，所述第一信息比特序列为所述第三信息比特序列。
  13. 根据权利要求12所述的方法，其特征在于，若|P i,r-0.5|≤∈，则所述第i个概率分布值为等概分布，所述∈为预设值，所述P i,r为所述第i个概率分布值。
  14. 根据权利要求11～13中任意一项所述的方法，其特征在于，所述概率分布值集合P中的概率分布值的译码顺序基于所述概率分布值集合P中的概率分布值对应的信息熵确定。
  15. 根据权利要求14所述的方法，其特征在于，所述第i个概率分布值对应的信息熵大于 或等于第i+1个概率分布值对应的信息熵。
  16. 根据权利要求11～13中任意一项所述的方法，其特征在于，所述概率分布值集合P中的概率分布值的译码顺序基于发送端历史的概率分布值确定。
  17. 根据权利要求11～13中任意一项所述的方法，其特征在于，所述方法还包括：
    接收第一通信设备每隔N个信息比特序列发送的概率分布参考值范围或概率分布参考值，所述N为大于1的整数；
    其中，所述概率分布值集合P中的概率分布值的译码顺序基于所述概率分布参考值范围或所述概率分布参考值确定。
  18. 根据权利要求11～17中任意一项所述的方法，其特征在于，所述目标信息比特序列为所述概率分布值集合P中的等概分布对应的第三信息比特序列。
  19. 根据权利要求11～18中任意一项所述的方法，其特征在于，所述第三比特序列中的校验比特位置为G(a)中求和为1的行对应的比特位置，所述G(a)为取极化矩阵G中集合a的行和列组成的矩阵，所述极化矩阵G为进行所述极化编码使用的极化矩阵，所述集合a为信息位集合，所述信息位集合包括所述第三比特序列中的信息比特位置以及校验比特位置。
  20. 根据权利要求11～19中任意一项所述的方法，其特征在于，所述校验比特中的至少一个校验比特位于所述第三信息比特序列包括的比特中间。
  21. 根据权利要求11～20中任意一项所述的方法，其特征在于，所述概率分布值集合P中的一种概率分布值对应一种冻结比特序列映射方式，所述方法还包括：
    根据与所述第i个概率分布值对应的冻结比特序列映射方式，确定所述第i个概率分布值对应的冻结比特序列。
  22. 根据权利要求21所述的方法，其特征在于，所述第i个概率分布值对应的冻结比特序列基于所述概率分布值对应的基础序列确定，所述基础序列基于所述概率分布值集合P包括的概率分布值的数量确定。
  23. 根据权利要求21所述的方法，其特征在于，所述第i个概率分布值对应的冻结比特序列基于所述概率分布值对应的m序列或Gold序列或伪随机序列确定。
  24. 根据权利要求11～23中任意一项所述的方法，其特征在于，所述校验比特包括循环冗余码校验CRC比特和/或奇偶校验PC比特。
  25. 一种通信装置，其特征在于，包括用于执行如权利要求1～10中任一项所述方法的单元，或包括用于执行如权利要求11～24中任一项所述方法的单元。
  26. 一种通信装置，其特征在于，包括处理器和存储器，所述处理器和所述存储器耦合， 所述处理器用于实现如权利要求1～10中任一项所述的方法，或所述处理器用于实现如权利要求11～24中任一项所述的方法。
  27. 一种芯片，其特征在于，包括处理器和接口，所述处理器和所述接口耦合；
    所述接口用于接收或输出信号，所述处理器用于执行代码指令，以使权利要求1～10中任一项所述的方法被执行，或以使权利要求11～24中任一项所述的方法被执行。
  28. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质中存储有计算机可执行指令，所述计算机可执行指令在被所述计算机调用时用于使所述计算机执行上述权利要求1-10中任一项所述的方法，或，所述计算机可执行指令在被所述计算机调用时用于使所述计算机执行上述权利要求11-24中任一项所述的方法。
  29. 一种计算机程序产品，其特征在于，所述计算机程序产品包括：计算机程序代码，所述计算机程序代码被计算机运行时，使得所述计算机执行如权利要求1～10中任一项所述的方法，或使得所述计算机执行如权利要求11～24中任一项所述的方法。
  30. [根据细则91更正 09.11.2022]　
    一种通信系统，其特征在于，包括执行如权利要求1～10中任一项所述的方法的第一通信设备和执行如权利要求11～24中任一项所述的方法第二通信设备。
PCT/CN2022/123378 2021-10-30 2022-09-30 一种编码方法、译码方法及通信装置 WO2023071711A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111278393.9 2021-10-30
CN202111278393.9A CN116073943A (zh) 2021-10-30 2021-10-30 一种编码方法、译码方法及通信装置

Publications (1)

Publication Number Publication Date
WO2023071711A1 true WO2023071711A1 (zh) 2023-05-04

Family

ID=86160290

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/123378 WO2023071711A1 (zh) 2021-10-30 2022-09-30 一种编码方法、译码方法及通信装置

Country Status (2)

Country Link
CN (1) CN116073943A (zh)
WO (1) WO2023071711A1 (zh)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108933643A (zh) * 2017-05-24 2018-12-04 华为技术有限公司 编译码方法及装置
CN112886971A (zh) * 2020-11-20 2021-06-01 北京邮电大学 一种信源信道联合极化的消息传递方法及装置
WO2021196054A1 (zh) * 2020-03-31 2021-10-07 华为技术有限公司 一种极化码的编译码方法及装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108933643A (zh) * 2017-05-24 2018-12-04 华为技术有限公司 编译码方法及装置
WO2021196054A1 (zh) * 2020-03-31 2021-10-07 华为技术有限公司 一种极化码的编译码方法及装置
CN112886971A (zh) * 2020-11-20 2021-06-01 北京邮电大学 一种信源信道联合极化的消息传递方法及装置

Also Published As

Publication number Publication date
CN116073943A (zh) 2023-05-05

Similar Documents

Publication Publication Date Title
CN110249538B (zh) 低密度奇偶校验(ldpc)循环缓冲器速率匹配
CN108365848B (zh) 一种极性码的译码方法和装置
WO2016119105A1 (zh) 极化Polar码的生成方法和设备
CN109075799A (zh) 极化Polar码的编译码方法及装置
WO2018137568A1 (zh) 编码方法、编码装置和通信装置
WO2022161201A1 (zh) 编码调制与解调解码方法及装置
WO2021103978A1 (zh) 一种极化码编码方法及装置
WO2018166455A1 (zh) 编码方法、编码装置和通信装置
WO2019028892A1 (zh) 发送和接收数据的方法和装置
WO2023071711A1 (zh) 一种编码方法、译码方法及通信装置
CN113055022A (zh) 并行软消除译码方法及相关装置
WO2021249080A1 (zh) 编码方法及装置
WO2020233401A1 (zh) 通信方法和装置
CN113965208A (zh) 极化码译码方法与装置、译码器和通信设备
WO2021035440A1 (zh) 收发控制信息的方法、装置和系统
WO2022111575A1 (zh) 传输数据的方法以及装置
WO2024036634A1 (zh) 编码方法、译码方法及装置
WO2023197808A1 (zh) 一种编码方法和装置
WO2024098276A1 (zh) 一种通信方法、通信装置及通信系统
WO2023273893A1 (zh) 极化码的构造方法和装置
WO2022011715A1 (zh) 数据传输方法及装置
WO2024017218A1 (zh) 一种数据传输方法及相关装置
WO2022213821A1 (zh) 物理下行控制信道重复传输的方法及通信装置
WO2023109733A1 (zh) 一种速率匹配的方法及装置
WO2024103298A1 (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: 22885594

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2022885594

Country of ref document: EP

Effective date: 20240429