Abstract: The present disclosure relates to decoding methods and devices. One example method includes receiving N LLRs corresponding to a to-be-decoded signal, where N is a code length, classifying K decoded bits into reliable bits and unreliable bits based on at least one of a prior LLR or a posterior LLR, generating M decoding paths based on the N LLRs and a preset rule, and selecting each stage of target decoding path based on PM values of the M decoding paths to obtain a decoding result of each stage of decoded bit.

Abstract: Embodiments of this application provide a coding scheme indication method and device. The method includes: obtaining, by a first device, a coding scheme indication, where the coding scheme indication is used to indicate a coding scheme of first data and/or a coding scheme of second data, the first data is data sent by the first device to a second device, the coding scheme of the first data is a polar coding scheme or a low-density parity-check LDPC coding scheme, the second data is data sent by the second device to the first device, and the coding scheme of the second data is a polar coding scheme or an LDPC coding scheme; and sending, by the first device, the coding scheme indication to the second device.

Abstract: Embodiments of this application provide a method for coding in a wireless communication network. A communication device interleave a first bit sequence to obtain a first interleaved sequence having sequence number starting with a sequence number of 0, wherein the first bit sequence comprises bits for indicating timing, wherein the bits for indicating timing comprises a set of bits for indicating synchronization signal block index (SSBI); wherein the set of bits for indicating SSBI are placed in positions indicated by sequence numbers of 2, 3 and 5 in the first interleaved sequence. The devices add d first CRC bits on the first interleaved sequence to obtain a second bit sequence, interleave on the second bit sequence according to an interleave pattern to obtain a second interleaved sequence, and polar encode the second interleaved sequence to obtain the encoded sequence.

Abstract: Aspects of this disclosure provide a technique for implementing polar encoding with incremental redundancy HARQ re-transmission. In particular, a transmitter encodes a message using different polar codes to obtain a first codeword and a second codeword that is twice the length of the first codeword, and transmit the first codeword as an original transmission, and the second half of the second codeword as a re-transmission without transmitting the first half of the second codeword. Information bits that are common to both the first codeword and the second half of the second codeword is mapped to more-reliable bit-locations in the second half of the second codeword. Decoded bit values for the common information in the original transmission and retransmission is compared by the receiver to perform a parity check.

Abstract: This application discloses a user sequence transmission method, a network device, and a terminal device. The method includes: sending, by a network device, first signaling to a terminal device, where the first signaling includes first information indicating a quantity of user sequences in a first user sequence space, and the user sequences in the first user sequence space include a universal set of user sequences used by the terminal device served by the network device; receiving, by the network device, a first user sequence sent by the terminal device based on the first information; and performing, by the network device, user detection and/or communication parameter estimation based on the first user sequence.

Abstract: Examples of the present disclosure provide a contact matching method. The method includes: obtaining a first interest label corresponding to a contact waiting for match and a second interest label corresponding to respective contact other than the contact waiting for match in a matching interface displayed on the client device; comparing the first interest label and the second interest label to obtain at least one contact matching with the contact waiting for match; and displaying a first contact identifier corresponding to the contact waiting for match and a second contact identifier corresponding to respective matching contact or a second contact identifier corresponding to respective matching contact in the matching interface according to a predefined first displaying manner. Examples of the present disclosure also provide a contact matching apparatus. The solution of the present disclosure improves contact matching efficiency and accuracy.

Abstract: This application discloses a data transmission method, apparatus, and system. The method includes: generating a to-be-sent bit sequence, where the to-be-sent bit sequence includes one or more bits in a bit sequence having a length of (N?M), where N is a length of a mother code for polar encoding, M is a length of encoded bits obtained after rate matching is performed on a bit sequence having a length of N, N is m raised to the power of an integer, m is a positive integer greater than 1, M is a positive integer, and N<M; and sending the generated bit sequence. A corresponding apparatus and system are further disclosed. In this application, in this data transmission solution, an additional coding gain is generated during decoding, so that a decoding FER is reduced, and decoding performance is improved.

Abstract: Embodiments of the application provide a method for rate matching in a wireless communication network. A device obtains K information bits and a target code length M of a polar code, determines, according to a minimum value of a set of values, a mother code length N1, polar encodes the K information bits to obtain an encoded sequence of N1 bits, obtains a target sequence of M bits from the N1 bit encoded sequence, and outputs the M-bit target sequence. When the mother code length N1 is larger than the target code length M, (N1?M) bits of the encoded sequence are punctured or shortened from the N1 bit encoded 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: A method to explicitly indicate the version information while still supporting soft combining is disclosed. A polar code encoder maps q bits to q positions of q sub-channels, q is a positive integer; wherein the q bits are used to indicate a version of encoded codeword; map 1 to a special frozen bit corresponding to the q bits; map K?q information bits to K?q positions for the K?q information bits, K is an integer, K>q; and perform polar encoding over an input vector u0N-1, comprising the q bits, the special frozen bit and the K?q information bits, with the length of N, N is an integer, N>=K. With this method, there is no need to make blind detection to achieve the version information of transmitted payload, which reduces power consumption for a receiver.

Abstract: A decoding method and apparatus are provided, to improve a degree of parallelism in decoded bit decisions and reduce a decoding delay. The method includes: performing a hard decision on each LLR in an inputted LLR vector having a length of M to obtain a first vector, where M?N and N is a length of to-be-decoded information; sequentially performing negation of some elements of the first vector to obtain L vectors; and then determining decoding results of the LLR vector based on the L vectors.

Abstract: This application provides a channel encoding method, an encoding apparatus, and a system. A bit sequence X1N is output by using X1N=D1N FN, where D1N is a bit sequence obtained after an input bit sequence u1N is encoded based on locations of K to-be-encoded information bits in an encoding diagram that has a mother code length of N, u1N is a bit sequence obtained based on the K to-be-encoded information bits, and FN is a Kronecker product of log2 N matrices F2. In the foregoing technical solution, in particular, a design considers that the locations of the K to-be-encoded information bits in the encoding diagram that has a mother code length of N include a row location index set H of the information bits in the encoding diagram and a layer location index set M of the information bits in the encoding diagram, where 0?H?N, and 0<M?logm N?1.

Abstract: Embodiments of the present disclosure provide a data transmission method, including: performing polar code coding on to-be-coded bits, to obtain a mother code, where a code length of the mother code is related to K and Mi, i=1, 2, . . . , K, K is a quantity of sending times, Mi is a length of bits sent at an ith time, and K and Mi are positive integers greater than 1; performing rate matching on the mother code, to obtain to-be-sent bits, where a quantity of the to-be-sent bits is a sum of lengths of bits sent at K times; and sending Mi to-be-sent bits at the ith time.

Abstract: A video production method and apparatus, a storage medium, and a computer device are disclosed. The method includes: receiving a follow-shot instruction in a case that reference video content is played on a video play interface, the follow-shot instruction including a reference video identifier; displaying a first video display region and a second video display region on a terminal screen; playing the reference video content in the first video display region, and recording displayed real-time video content in the second video display region; and generating a target video based on the recorded real-time video content and the reference video content. The first video display region and the second video display region are displayed on the terminal screen, the reference video content is played in the first video display region, and the displayed real-time video content is recorded in the second video display region.

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. 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 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: The application provides method for communicating channel state information (CSI) in a communication network. The method is as follows: An apparatus determines whether a length of CSI is less than a preset length; and adds a padding bit to the CSI when determining that the length of the CSI is less than the preset length, where a length of CSI obtained by adding the padding bit is consistent with the predetermined length. The CSI obtained by adding the padding bit is communicated in the communication network.

Abstract: A polar encoding and rate matching method is provided, including: determining one or more to-be-deleted rows of a generator matrix, where the generator matrix is determined based on a preset mother code length, and a column in which 1 in the one or more to-be-deleted rows is located includes at least one column with a column weight being 1; deleting, from the one or more to-be-deleted rows, a row corresponding to a polarized channel with lowest reliability, and deleting, from a column in which 1 in the row is located, a column with a column weight being 1, to obtain an after-deletion generator matrix; using the after-deletion generator matrix as a generator matrix to repeat the foregoing steps, until an order of a final generator matrix is equal to a target code length; and performing encoding and rate matching on a to-be-encoded bit based on the final generator matrix.

Abstract: The present disclosure provides a method for making a housing for a mobile communication device, comprising: step S1: mixing a zirconia ceramic powder, a solvent and a binder to form a mixed slurry; step S2: tape-casting the mixed slurry to form a single layer of base membrane band, and then preparing at least one layer of laminated membrane band on the base membrane band by lamination and isostatic pressing, so as to form a laminated body; step S3: debinding, sintering and hot-bending the laminated body to obtain a compact ceramic housing for a mobile communication device; wherein step S3 is performed in one common step combining sintering and hot bending or by hot bending a flat sample, which has beneficial effects such as high yield, low production cost, good product compactness, good fracture toughness, and good flexural strength, etc.

Abstract: A rate matching method for a polar code is provided, to improve performance. The method includes: encoding, based on an N*N encoding matrix of a polar code, a sequence including N first bits, to generate a mother code including N second bits, where the N first bits are in a one-to-one correspondence with N rows in the encoding matrix in sequence, and the N second bits are in a one-to-one correspondence with N columns in the encoding matrix in sequence; determining N?M to-be-punctured second bits from the N second bits, where at least one first bit in N?M first bits participating in encoding of the N?M second bits belongs to the first M first bits in the N first bits, and the N?M first bits are fixed bits; and puncturing the N?M second bits, to obtain a target polar code including M second bits.