Abstract: This application provides a polar encoding and decoding method, a sending device, and a receiving device, to help overcome disadvantages in transmission of medium and small packets, a code rate, reliability, and complexity in the prior art.

Abstract: Embodiments of this application provide a method for encoding data in a wireless communication network. A communication device obtains an information bit sequence of a bit length K and a code length M. When M is greater than or equal to a first threshold and K is greater than or equal to a second threshold, the device divides the information bit sequence into p subsequences that are of an equal length K1. Then the device encodes each of the p subsequence to obtain p encoded subsequences. The device rate-matches each of the p encoded subsequences to obtain p rate matched subsequences, concatenates the p rate matched subsequences to obtain the output sequence of the code length M, then outputs the output sequence.

Abstract: Embodiments of the application provide a method and device for polar code rate matching in a wireless communication network. A device of the network obtains K information bits. The device generates a to-be-encoded sequence having a length N bits. The to-be-encoded sequence includes the K information bits and L frozen bits. The L frozen bits are placed in L bit positions of the to-be-encoded sequence. The L bit positions are determined according to a rate match manner which is either puncturing or shortening. The device polar encodes the to-be-encoded sequence to obtain the encoded sequence. The device interleaves the encoded sequence to obtain an interleaved sequence and then stores the interleaved sequence into a cyclic cache. The device sequentially outputs M bits of the interleaved sequence from the cyclic cache according to the rate matching manner.

Abstract: This application relates to the field of wireless communications technologies, and discloses a polar code encoding method and apparatus, to improve accuracy of reliability calculation and ordering for polarized channels. The method includes: obtaining a first sequence used to encode K to-be-encoded bits, where the first sequence includes sequence numbers of N polarized channels, the sequence numbers of the N polarized channels are arranged in the first sequence based on reliability of the N polarized channels, K is a positive integer, N is a mother code length of a polar code, N is a positive integer power of 2, and K?N; selecting sequence numbers of K polarized channels from the first sequence in descending order of reliability; and placing the to-be-encoded bits based on the selected sequence numbers of the K polarized channels, and performing polar code encoding on the to-be-encoded bits.

Abstract: This application discloses a polar code-based interleaving method and apparatus, to resolve a problem existing in the prior art that when a code length is relatively long, an implementation process of reading a sequence obtained after random interleaving is relatively complex. The method includes: determining an interleaving matrix based on a target code length M of a polar code; and interleaving, based on the interleaving matrix, encoded bits obtained after encoding of the polar code, to generate interleaved bits.

Abstract: This application provides a polar code encoding and decoding method and apparatus and a device. An example method includes: sequentially configuring, by a sending device, information bits and first check bits on subchannels in a first subchannel set, and configuring frozen bits on subchannels in a second subchannel set, where the subchannels in the first subchannel set are sorted according to a natural order of serial numbers of the subchannels; and performing polarization encoding on bits on the subchannels to obtain an encoded sequence. In this way, encoding efficiency and decoding efficiency are improved.

Abstract: Embodiment techniques map parity bits to sub-channels based on their row weights. The row weight for a sub-channel may be viewed as the number of “ones” in the corresponding row of the Kronecker matrix or as a power of 2 with the exponent (i.e. the hamming weight) being the number of “ones” in the binary representation of the sub-channel index (further described below). In one embodiment, candidate sub-channels that have certain row weight values are reserved for parity bit(s). Thereafter, K information bits may be mapped to the K most reliable remaining sub-channels, and a number of frozen bits (e.g. N?K) may be mapped to the least reliable remaining sub-channels. Parity bits may then mapped to the candidate sub-channels, and parity bit values are determined based on a function of the information bits.

Abstract: The present disclosure relates to polar code encoding methods and apparatus. One example method includes separately performing check encoding on the at least two to-be-checked first bit sequences to obtain at least two check bit sequences, where a union set of the at least two to-be-checked first bit sequences includes the K information bits, and K is a positive integer, interleaving the K information bits and the at least two check bit sequences, or interleaving a first part of information bit sequence and a first check bit sequence to obtain an interleaved third bit sequence, where a second check bit sequence, a third check bit sequence, and a second part of information bit sequence in a sequence of all information bits except the first part of information bit sequence form a second bit sequence, and performing polar encoding on the second bit sequence.

Abstract: Embodiments of this application provide an information processing method and a coding apparatus. An information bit sequence includes a K-bit information block. The information bit sequence is to be processed into an encoded bit sequence with a target code length M, M>1024. For a given code rate R, when the length K of the information block is greater than a preset threshold, the information bit sequence is segmented into two or more segments. Each segment is polar encoded into an encoded subsequence. The encoded subsequence has a length that equals to a mother code length Ni, and i=1, 2, . . . , p. Each of the p encoded subsequences is rate matched to obtain a rate-matched encoded subsequence. A rate-matched encoded subsequence i of the p rate-matched encoded subsequences has a code length Mi. The p rate-matched encoded subsequences are concatenated into an encoded bit sequence which has a code length M.

Abstract: Embodiment techniques map parity bits to sub-channels based on their row weights. The row weight for a sub-channel may be viewed as the number of “ones” in the corresponding row of the Kronecker matrix or as a power of 2 with the exponent (i.e. the hamming weight) being the number of “ones” in the binary representation of the sub-channel index (further described below). In one embodiment, candidate sub-channels that have certain row weight values are reserved for parity bit(s). Thereafter, K information bits may be mapped to the K most reliable remaining sub-channels, and a number of frozen bits (e.g. N?K) may be mapped to the least reliable remaining sub-channels. Parity bits may then mapped to the candidate sub-channels, and parity bit values are determined based on a function of the information bits.

Abstract: This application discloses a polar polar code interleaving processing method and apparatus. The method includes: determining N to-be-encoded bits, where N is a positive integer (S210); obtaining a first sequence that includes sequence numbers of N polarized channels, where the first sequence is used to indicate a reliability order of the N polarized channels (S220); performing polar encoding on the N to-be-encoded bits to obtain encoded bits (S230); and performing interleaving processing on the encoded bits based on the first sequence (S240). Because the first sequence used to indicate the reliability of the polarized channels is a sequence already existing in a polar code encoding process, no additional storage resource needs to be used to store the first sequence in the interleaving processing process, thereby reducing use of storage resources.

Abstract: A data processing method and a data processing apparatus are provided to reduce a bit error rate of a wireless communications system and improve transmission performance of the wireless communications system. The method includes: mapping L to-be-sent bits to L bit locations included in at least one modulation symbol, where the L to-be-sent bits include at least one bit field, a bit in a bit field having a high priority is preferentially mapped to a bit location that is of the at least one modulation symbol and that has a high reliability level, the at least one bit field is at least one of an information bit field, a first parity bit field, and a second parity bit field; and outputting the at least one modulation symbol.

Abstract: The present disclosure relates to polar code encoding methods and apparatus. One example method includes obtaining a first sequence used to encode K to-be-encoded bits, where the first sequence includes sequence numbers of N polarized channels, the sequence numbers of the N polarized channels are arranged in the first sequence based on reliability of the N polarized channels, K is a positive integer, N is a mother code length of a polar code, N is a positive integer power of 2, and K?N, selecting sequence numbers of K polarized channels from the first sequence in descending order of reliability, placing the K to-be-encoded bits based on the selected sequence numbers of the K polarized channels, and performing polar code encoding on the K to-be-encoded bits.

Abstract: Embodiments of this application provide a method for processing information bits in a wireless communication network. A device obtains a Polar encoded bit sequence, then divide the Polar encoded bit sequence into g groups that are of equal length N/g, wherein g is 32. The device block interleaves the g groups to obtain an interleaved bit sequence according to a sequence S, wherein the sequence S comprises: group numbers of the g groups, wherein a group whose number is 0 is the first element in the sequence S, wherein a group whose number is 12 is the 17th element in the sequence S, wherein a group whose number is 31 is the 32nd element in the sequence S, wherein the S is an integer and output the interleaved bit sequence.

Abstract: Embodiments of this application provide a method for encoding data in a wireless communication network. A communication device obtains an information bit sequence of a bit length K and a code length M. When M is greater than or equal to a first threshold and K is greater than or equal to a second threshold, the device divides the information bit sequence into p subsequences that are of an equal length K1. Then the device encodes each of the p subsequence to obtain p encoded subsequences. The device rate-matches each of the p encoded subsequences to obtain p rate matched subsequences, concatenates the p rate matched subsequences to obtain the output sequence of the code length M, then outputs the output sequence.

Abstract: This application provides a coding and decoding method and apparatus. The method includes: performing polarization coding on first to-be-coded information, to obtain first coded information with a bit sequence length of M, where M is a positive integer; sending the first coded information on a first channel corresponding to the first to-be-coded information; performing polarization coding on second to-be-coded information, to obtain second coded information with a bit sequence length of 2M, where the second to-be-coded information includes the first to-be-coded information, and differences between sequence numbers of information bits corresponding to the first to-be-coded information and sequence numbers of information bits at (M+1)th to 2Mth bit positions in information bits corresponding to the second to-be-coded information are sequentially M in ascending order of sequence numbers.

Abstract: Embodiments of this application provide a method and an apparatus for constructing a coding sequence. The method includes: storing a reliability sequence corresponding to a basic sequence, where a length of the reliability sequence corresponding to the basic sequence is less than or equal to a length of a reliability sequence corresponding to a mother code sequence; storing a reliability reference sequence, where the reliability reference sequence includes at least one element remaining after the reliability sequence corresponding to the basic sequence is excluded from the reliability sequence corresponding to the mother code sequence; and constructing a coding sequence by using the reliability sequence corresponding to the basic sequence and an element in the reliability reference sequence. During implementation of this application, during storage, only the reliability sequence corresponding to the basic sequence and the reliability reference sequence are stored.

Abstract: Embodiments of this application provide an information processing method and a coding apparatus. An information bit sequence includes a K-bit information block. The information bit sequence is to be processed into an encoded bit sequence with a target code length M, M>1024. For a given code rate R, when the length K of the information block is greater than a preset threshold, the information bit sequence is segmented into two or more segments. Each segment is polar encoded into an encoded subsequence. The encoded subsequence has a length that equals to a mother code length Ni, and i=1, 2, . . . , p. Each of the p encoded subsequences is rate matched to obtain a rate-matched encoded subsequence. A rate-matched encoded subsequence i of the p rate-matched encoded subsequences has a code length Mi. The p rate-matched encoded subsequences are concatenated into an encoded bit sequence which has a code length M.

Abstract: This application provides a polar code encoding method and apparatus. The method includes: obtaining, by a sending device, a sequence corresponding to a required mother code length; obtaining, by the sending device, a to-be-encoded bit; and performing, by the sending device, polar code encoding on the to-be-encoded bit by using the sequence corresponding to the required mother code length, to obtain an encoded bit, where the sequence is generated based on a basic sequence, and a length of the basic sequence is less than the mother code length.

Abstract: A data transmission method, a chip, a transceiver, and a computer readable storage medium are provided. The method includes: obtaining K information bits; determining to-be-encoded bits, where the to-be-encoded bits include (K+P) bits, the (K+P) bits include the K information bits and P check bits, the K information bits correspond to K polarization channels, the P check bits include T first-type check bits, all the T first-type check bits are PC bits, and reliability of a polarization channel corresponding to each of the T first-type check bits is greater than a minimum value of reliability of the K polarization channels; and performing polar coding on the to-be-encoded bits to obtain encoded bits, where the (K+P) bits are in a one-to-one correspondence with (K+P) rows in a generator matrix of the encoded bits, a maximum row weight corresponding to the T first-type check bits is less than or equal to W2.