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: 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 the present invention disclose a coding method. The method in the embodiments of the present invention includes: constructing a check equation based on a correspondence between a first subchannel and a second subchannel that is in a second subchannel group, where a check bit of the check equation corresponds to the first subchannel, an information bit of the check equation corresponds to the second subchannel, the second subchannel group includes at least one second subchannel, a sequence number of the first subchannel is divided by a first preset value and a remainder is a second preset value, a sequence number of the second subchannel is divided by a third preset value and a remainder is a fourth preset value, and the sequence number of the first subchannel is greater than the sequence number of the second subchannel; and performing coding by using the check equation.

Abstract: The application provides manner for communicating channel state information (CSI) in a communication network. A preset length is used for equalizing lengths of CSI to be reported. The preset length is determined based on a quantity of CSI-reference signal (RS) ports. A communication device determines whether a total length of one or more indication information items to be included in the CSI is less than the preset length. If the total length of the one or more indication information items to be included in the CSI is less than the preset length, the communication device adds one or more padding bits, to obtain a CSI bit sequence including the one or more indication information items and the one or more padding bits. A total length of the CSI bit sequence is consistent with the preset length. The communication device then outputs the CSI bit sequence.

Abstract: This application provides a channel encoding method and apparatus in wireless communications. The method includes: performing CRC encoding on A to-be-encoded information bits, to obtain a first bit sequence, where the first bit sequence includes L CRC bits and A information bits; performing a interleaving operation on the first bit sequence, to obtain a second bit sequence, where a first interleaving sequence used for the interleaving operation is obtained based on a system-supported maximum-length interleaving sequence with the length of Kmax+L, and Kmax is a maximum information bit quantity corresponding to the maximum-length interleaving sequence ad a preset rule, and a length of the first interleaving sequence is equal to A+L. Therefore, during distributed CRC encoding, when an information bit quantity is less than the maximum information bit quantity, an interleaving sequence required for completing an interleaving process is obtained based on the system-supported maximum-length interleaving sequence.

Abstract: This application provides an encoding method and apparatus in wireless communications between a network device and a terminal. The method includes: performing CRC encoding on A to-be-encoded information bits based on a CRC polynomial, to obtain a first bit sequence, where the first bit sequence includes L CRC bits and A information bits, L=11; and performing polar encoding on the first bit sequence. Based on an improved CRC polynomial, encoding satisfying an FAR requirement is implemented.

Abstract: A polar code-based transmission method and apparatus are provided, to better apply polar encoding to a PBCH. The method is as follows: performing, by a transmit end, polar encoding on a to-be-encoded first bit sequence, to generate an encoded sequence; performing, by the transmit end, a transformation operation on the encoded sequence, to obtain a second bit sequence, where the transformation operation includes at least one of scrambling, interleaving, and reordering; and sending, by the transmit end, the second bit sequence in M inconsecutive time units, where at least two time intervals between the time units in the M inconsecutive time units are unequal.

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.

Abstract: Embodiments of this application disclose a resource mapping method and an apparatus. The method includes: network device performs nested-structure mapping on a modulated symbol set to obtain a first resource block, where the modulated symbol set carries downlink control information corresponding to each of at least one user equipment, and modulated symbols of same user equipment that are carried on the first resource block are consecutive; then reconstructs, the first resource block to obtain a second resource block, where modulated symbols of same user equipment that are carried on the second resource block are non-consecutive; and maps the second resource block to a time-frequency resource, so that the user equipment obtains the modulated symbol set based on the time-frequency resource.

Abstract: Embodiments of this application provide a method for processing information bits. A communication device obtains K information bits and a code length M. The code length M is a length of an output sequence resulting from processing the information bits. The communication device generates an N-bit bit sequence that includes the K information bits and one or more parity check bits, encodes the bit sequence using a polar encoding formula to obtain an N-bit encoded sequence, rate matches the encoded sequence to obtain the output sequence, modulates the rate matched sequence to obtain output sequence and outputs the output sequence. When M?K>192, in the bit sequence, one of the parity check bits is placed in a bit position that is determined according to reliabilities of the bit positions in the bit sequence for placing the K information bits and the one or more parity check bits.

Abstract: Embodiments of polar encoding/decoding methods and apparatuses are described. CRC encoding is performed on an information block to obtain a CRC encoded block with a length of B, where a CRC length is Lcrc, an information block length is K, and B=K+Lcrc. The CRC encoded block is interleaved. Lpc CRC bits in the interleaved encoded block are located between bits of the information block. Each CRC bit of the Lpc CRC bits is located after all bits checked by using the CRC bit. Lpc is an integer greater than 0 and less than Lcrc. The interleaved encoded block is mapped to information bits. A frozen bit is set to an agreed fixed value. Polar encoding is performed on the information bits and the frozen bit to obtain a polar encoded codeword to improve performance of a CA-polar code.

Abstract: This application provides an encoding method and apparatus in wireless communications between a network device and a terminal. The method includes: performing CRC encoding on A to-be-encoded information bits based on a CRC polynomial, to obtain a first bit sequence, where the first bit sequence includes L CRC bits and A information bits, L=6; and performing polar encoding on the first bit sequence. Based on an improved CRC polynomial, encoding satisfying an FAR requirement is implemented.

Abstract: This application provides a channel encoding method and apparatus in wireless communications. The method includes: performing CRC encoding on A to-be-encoded information bits, to obtain a first bit sequence, where the first bit sequence includes L CRC bits and A information bits; performing an interleaving operation on the first bit sequence, to obtain a second bit sequence, where a first interleaving sequence used for the interleaving operation is obtained based on a system-supported maximum-length interleaving sequence with the length of Kmax+L, and Kmax is a maximum information bit quantity corresponding to the maximum-length interleaving sequence and a preset rule, and a length of the first interleaving sequence is equal to A+L. Therefore, during distributed CRC encoding, when an information bit quantity is less than the maximum information bit quantity, an interleaving sequence required for completing an interleaving process is obtained based on the system-supported maximum-length interleaving sequence.

Abstract: This application provides a wireless communication method and device. The method includes: scrambling, with each piece of configuration information of a plurality of pieces of configuration information for configuring a terminal device, bits that are included in a cyclic redundancy check (CRC) of downlink control information (DCI) and that correspond to each piece of configuration information, to obtain a scrambled sequence, where at least one bit of bits that correspond to each piece of configuration information does not correspond to another piece of configuration information of the plurality of pieces of configuration information; and sending the DCI and the scrambled sequence to the terminal device.

Abstract: Embodiments provide a data transmission method and a related device. Under the method, after determining a first data packet to be sent to a receive end, a transmit end may generate a second data packet based on the first data packet, encode the second data packet, and send an encoded second data packet. A length of the second data packet is greater than a length of the first data packet. In various embodiments, when sending a data packet to the receive end, the transmit end may generate a longer data packet from a shorter data packet through combination, and send the longer data packet to the receive end after channel coding. In this way, a relatively high channel coding gain can be obtained during data transmission, and a relatively high bit error rate of short packet transmission is avoided, so that data transmission reliability can be improved.

Abstract: The application provides manner for communicating channel state information (CSI) in a communication network. A preset length is used for equalizing lengths of CSI to be reported. The preset length is determined based on a quantity of CSI-reference signal (RS) ports. A communication device determines whether a total length of one or more indication information items to be included in the CSI is less than the preset length. If the total length of the one or more indication information items to be included in the CSI is less than the preset length, the communication device adds one or more padding bits, to obtain a CSI bit sequence including the one or more indication information items and the one or more padding bits. A total length of the CSI bit sequence is consistent with the preset length. The communication device then outputs the CSI bit sequence.

Abstract: This application discloses a transmission method, a transmission apparatus, and a communications device. The transmission method includes: performing polar encoding on a bit sequence, to obtain an encoded sequence, where the bit sequence includes control information and a cyclic redundancy check CRC sequence; fragmenting the encoded sequence, to obtain n encoded subsequences, where n is an integer, and n>0; and scrambling the n encoded subsequences by using n scrambling sequences respectively, to obtain n scrambled sequences. In the transmission method, the n scrambling sequences are newly defined based on encoding and decoding features of a polar code, and the n scrambling sequences additionally carry ?log2 n?-bit information. According to the foregoing encoding method, signaling overheads are reduced.

Abstract: Example information transmission methods and devices are disclosed. One example method is applied to a network device and includes determining CRC bits of to-be-sent information bits, concatenating the CRC bits and the to-be-sent information bits to obtain a first information sequence, and interleaving bits in the first information sequence in an interleaving manner or scrambling the bits in the first information sequence in a scrambling manner, to obtain a second information sequence, to ensure that bits at locations of the CRC bits after a cyclic shift cannot check bits at locations of the to-be-sent information bits after the cyclic shift. A cyclic shift is performed on the second information sequence to obtain a third information sequence, where a quantity of cyclically shifted bits is used to carry information about some bits of a system frame number, and the third information sequence is sent.

Abstract: A method and device are provided for encoding a master information block (MIB), where the MIB includes indication information, the indication information is used by a terminal device to determine a decoding mode for decoding first information, and the first information includes at least one of a system information block (SIB) 1 and system information (SI); and sending an encoded MIB to the terminal device. The terminal device can determine a correct decoding mode for the SIB and the SI according to the indication information before receiving the SIB and the SI, and then the terminal device can decode the SIB and the SI in the correct decoding mode after receiving the SIB and the SI. The terminal device can flexibly decode the SIB and the SI.

Abstract: A method comprises: obtaining a coded bit sequence by performing PC-polar coding on information bits based on first constructor parameters; and sending the coded bit sequence. A check equation of the first constructor parameters includes a first element representing a check-required information bit position and a second element representing a check bit position, the first element corresponds to a first vector (V1) in a generator matrix for PC-polar codes, the second element corresponds to a second vector (V2) in the generator matrix, and if a first Hamming weight (HW1) of V1 is the same as a second Hamming weight (HW2) of V2, then a third Hamming weight (HW3) of an addition modulo 2 vector is greater than HW1 and greater than HW2, or if HW1 is different from HW2, then HW3 is greater than a smaller one of the HW1 and HW2.