261results about "Error correction/detection using linear codes" patented technology

Systems, methods, and instrumentalities are disclosed for priority-based channel coding for control information. A wireless transmit / receive unit (WTRU) may sort control information associated with a first control information type into a first control information group and the control information associated with a second control information type into a second control information group, for example, based on respective priorities associated with the first and second control information types. The WTRU may group one or more bits of the first control information group into a first bit level control information group and a second bit level control information group based on priority. The WTRU may selectively apply a cyclic redundancy check (CRC) to the first control information group, the second control information group, the first bit level control information group, and / or the second bit level control information group.

A wireless device may receive a first code block of one or more code blocks associated with a transport block for the wireless device. The wireless device may output, using a neural network model associated with the wireless device, a set of low-density parity-check (LDPC) quantization values for a set of iterations of an LDPC decoding procedure for the first code block. In some examples, the set of LDPC quantization values may include respective LDPC quantization values for respective iterations of the set of iterations. The wireless device may perform one or more iterations of the LDPC decoding procedure for the first code block in accordance with one or more LDPC quantization values of the set of LDPC quantization values output using the neural network model.

This communication device may apply convolution precoding to a bit sequence, polar-encode the convolution-precoded bit sequence, and transmit same. When the size of a polar coder for convolution precoding is 2N, pre-determined values are mapped to last m bit indexes from among first N bit indexes in a bit sequence having the length of 2N, which is an input for the convolution precoding, and bit values of an information block are mapped to K bit indexes from among remaining (2N-m) bit indexes.

A reduced number of interleaved encoded bits is obtained by encoding input bits by a polar code and interleaving a subset of the encoded bits obtained by the encoding. The polar code comprises a number of bit indices for placing bit values before encoding, including a first set of bit indices for placing values of the input bits and a second set of bit indices for placing a predetermined bit value. The first set of bit indices comprises a first subset of bit indices and a second subset of bit indices. The subset of the encoded bits corresponds to the second subset of the bit indices, and is for reducing the number of the encoded bits. An input bit value placed on both a first bit index in the first subset and a second bit index in the second subset, and the second bit index is based on the interleaving.

Polar codes for wireless communications are constructed to adapt to channel conditions. Input bits are encoded by a polar code to obtain a number of encoded bits, and a reduced number of the encoded bits are decoded to obtain decoded input bits. The polar code provides or includes bit indices for bit values, and the bit indices include a first set of bit indices for values of the input bits and a second set of bit indices for a predetermined bit value. Encoded bits in a subset, which includes fewer than all of the encoded bits and is for reducing the number of the encoded bits, are interleaved.

The application relates to a Polar code decoding simulation circuit implementation method, system, equipment and medium based on a memory-computing integrated device, and the method comprises the following steps: obtaining a Polar code sparse check matrix and a corresponding probability graph model according to a received Polar code; obtaining an initial log-likelihood ratio of each variable node in the probability graph model; dividing a memory-computing integrated device array into an input part, an output part, an iteration part and a check part according to the Polar code sparse check matrix, and configuring the resistance state of the cross nodes in each part; loading the initial log-likelihood ratio into the input part of the memory-computing integrated device array and keeping it, and the initial input of other parts is 0; checking and iteratively calculating the calculation results output by the iteration part, the check part and the output part in the memory-computing integrated device array by using a peripheral circuit, and outputting a final decoding result after the check condition is met. The application can be widely applied in the field of decoding technology.

According to an example aspect of the present invention, there is provided encode or decode data using a polar code, wherein a generator matrix of the polar code is comprised of rows of a polar transform matrix formula (I), where BN; is an N × N bit-reversal matrix, where N = 2n is a non-negative integer and where formula (II) is an n- fold Kronecker product of formula (III), a set of indices of rows of the polar transform matrix which form the generator matrix being set A.

A method for encoding data includes: selecting a sequence of pivot candidate positions from a sequence of g encoded vectors to encode blocks of g data symbols in a round of encoding by the following steps: providing a set of g pivot candidate positions; selecting pivot candidate positions for the sequence from the set of pivot candidate positions; removing the selected pivot candidate positions from the set of pivot candidate positions; and repeating until the set of pivot candidate positions is empty and the sequence of selected pivot candidate positions in the round is non-linear. A set of encoded vectors is generated based on the sequence of selected pivot candidate positions, each encoded vector including zero-valued coefficients at positions within the encoded vector preceding the pivot candidate positions and non-zero-valued coefficients at least at the pivot candidate positions.

A reduced number of interleaved encoded bits is obtained by encoding input bits by a polar code and interleaving a subset of the encoded bits obtained by the encoding. The polar code comprises a number of bit indices for placing bit values before encoding, including a first set of bit indices for placing values of the input bits and a second set of bit indices for placing a predetermined bit value. The first set of bit indices comprises a first subset of bit indices and a second subset of bit indices. The subset of the encoded bits corresponds to the second subset of the bit indices, and is for reducing the number of the encoded bits. An input bit value placed on both a first bit index in the first subset and a second bit index in the second subset, and the second bit index is based on the interleaving.

Acceleration of S-polarized ECC throughput by a scheduler is disclosed. A method of simplified successive cancellation list (SSCL) error decoding of an S-polar code includes representing an S-polar code as a perfect binary tree; providing a node v with a soft information vector from a parent node of v to compute a soft information vector for a left child node of v; providing v with a hard decision vector from the left child node and using it with to create a soft information vector and pass it to a right child node of v; providing v with a hard decision vector from its right child node and using it with to create a hard decision vector β v and pass it to its parent node; when v is an i-th leaf node of the perfect tree, updating two path metrics and selecting a path obtained by extending a current path by the lowest path metric.

A multi-stage decoding algorithm for improving the decoding performance of bits encoded with a linear error-correcting block code of small or medium block length is provided. The algorithm comprises an input stage, at least two intermediate stages and an output stage. For each of the stages (except for the last intermediate stage and the output stage), a certain number of bit positions is selected and set to a maximum possible absolute LLR value. The output data of each stage is used to compute the input data of the next stage. Each of the intermediate stages executes a specified number of parallel decoding runs, and the input data for each of the intermediate stages is generated based on the output data of the previous intermediate stage and initial LLRs obtained after demodulation. The bit positions set to the maximum possible absolute LLR value in the previous stage cannot be used again in the next stage. At the output stage, only one decoding run is executed, for which input data are formed based on the initial LLRs and the LLRs obtained at the last intermediate stage.

The present application relates to multi-candidate successive cancellation list (SCL) decoding of polar codes. In an example, an apparatus processes multiple candidate codewords using a same SCL decoder. The SCL decoder may be cyclic redundancy code (CRC)-aided. The multiple candidate codewords may have different code configurations and / or different inputs. In an example, the multiple candidate codewords are packaged so that at most one of the candidate codewords in the package is valid.

Communication methods and an apparatus, which are used for efficiently extending the length of a Polar code sequence. A method comprises: on the basis of a first sequence having a length of N, determining a second sequence having a length of 2N, the 2i-th element and the (2i+1)-th element in the second sequence being determined on the basis of the i-th element in the first sequence, the 2i-th element and the (2i+1)-th element in the second sequence being the same as each other, and i = 0, 1, 2...N-1; on the basis of the second sequence, a third sequence having a length of N and a fourth sequence having a length of N, determining a fifth sequence having a length of 2N, the values of elements of the third sequence and elements of the fourth sequence being greater than or equal to 0 but less than N; and, on the basis of the fifth sequence, polar coding information bits.

This application provides a polar code encoding method and an apparatus, to reduce implementation complexity of encoding while ensuring encoding performance. The method includes: determining a threshold based on a length N of a first reliability sequence and a length M of an encoded bit sequence, where N is a positive integer power of 2, and M is a positive integer; determining a first sub-sequence and a second sub-sequence based on a rate matching method of the encoded bit sequence and the first reliability sequence; determining, based on the threshold, the first sub-sequence, the second sub-sequence, the rate matching method of the encoded bit sequence, and the first reliability sequence, K information bits corresponding to the encoded bit sequence, where K is a positive integer less than M; and performing polar encoding to obtain the encoded bit sequence.

Described herein are systems and methods for encoding digital data into oligonucleotides and decoding the oligonucleotides back to digital data. The encoding and decoding schemes include inner codecs for converting digital data to bases and bases to digital data. The encoding and decoding schemes also include outer codecs that include error correction schemes.

A communication device generates N encoded bits by encoding an information block on the basis of a polar sequence QN-10={Q0, Q1, . . . , QN-1} wherein N>1024, and 0<=QNi<=N−1 denotes a bit index for i=0, 1, . . . , N−1, the polar sequence QN-10 is defined in ascending order of reliability W(QN0)<W(QN1< . . . <W(QNN-1), W(QNi is the reliability of the bit index QNi, a reliability order of bit indices 0 to 1023 in the polar sequence QN-10 is the same as the reliability order of bit indices 0 to 1023 of a pre-defined polar sequence Q0Nmax-1 in which Nmax=1024, and bit indices having a partial order that can be evaluated from among bit indices greater than or equal to 1024 in the polar sequence QN-10 satisfy W(QNx)<W(QNy) for at least QNx<QNy.

Polar codes for wireless communications are constructed to adapt to channel conditions. Input bits are encoded by a polar code to obtain a number of encoded bits, and a reduced number of the encoded bits are decoded to obtain decoded input bits. The polar code provides or includes bit indices for bit values, and the bit indices include a first set of bit indices for values of the input bits and a second set of bit indices for a predetermined bit value. Encoded bits in a subset, which includes fewer than all of the encoded bits and is for reducing the number of the encoded bits, are interleaved.

Disclosed in the present application is a data processing method, comprising: acquiring an information bit sequence, wherein the information bit sequence comprises K information bits, and K is an integer greater than 0; encoding the information sequence according to at least one of a first encoding parameter, a quantized weight value sequence and a reliability threshold, so as to obtain au encoded data sequence, wherein the encoded data sequence comprises N pieces of encoded data, N is an integer greater than K, the quantized weight value sequence comprises n quantized weight values, N represents the number of polarized sub-channels, and N is less than or equal to the n-th power of 2; and transmitting the encoded data sequence.

The invention particularly relates to a parameter adaptive hybrid disturbance serial cancellation (SC) decoding method for polarization codes. Aiming at the problems of disturbance parameter fixation and rigidity, lack of channel adaptability and dependence on off-line parameter search in the existing hybrid disturbance serial cancellation (HPSC) decoding method, the method comprises the following steps: firstly, establishing a linear mapping relation between disturbance noise power and channel noise power to realize automatic adaptation of a channel environment; then, the check characteristic of a cyclic redundancy check code is used as a detection indicator of a local optimal trap, intelligent switching is carried out between adaptive random disturbance and adaptive biased disturbance, and a bias adjustment strategy dynamically changing along with the number of iterations and the reliability of a received symbol is introduced in the biased disturbance stage; therefore, parameter-adjustment-free high-performance decoding is realized on the premise of keeping low complexity of SC. Simulation results show that compared with a traditional HPSC decoding method with fixed parameters, the method provided by the invention has better block error rate performance, and has lower average decoding iterations in a high signal-to-noise ratio region.

Polar codes for wireless communications are constructed to adapt to channel conditions. Input bits are encoded by a polar code to obtain a number of encoded bits, and a reduced number of the encoded bits are decoded to obtain decoded input bits. The polar code provides or includes bit indices for placing values of the input bits before encoding. The bit indices include a first set of bit indices for the values of the input bits, a second set of bit indices for a predetermined bit value, and a third set of bit indices including input bit indices for the values of the input bits and reducing the number of the encoded bits. Decoding is not performed for the third set of bit indices. Non-sequential decoding enables decoding for the bit indices in the first and second sets to be out of order relative to sequential order of the bit indices.

The present disclosure relates to a 5G or 6G communication system for supporting a higher data transmission rate than a 4G communication system such as LTE. An encoding method performed by a transmission device of a communication system according to an embodiment of the present disclosure may comprise the steps of: identifying at least one parameter related to a convolutional code associated with a polarization-adjusted convolutional (PAC) code; on the basis of the at least one parameter, identifying a parity check matrix for an input binary vector of a polar code associated with the PAC code; on the basis of the parity check matrix, encoding a polar code concatenated with an outer code; and transmitting a codeword vector generated on the basis of the encoding.

The invention discloses a data processing method and device and relates to the technical field of communication. In the method, under the condition that the code length is relatively short, the transmitting end adopts a Polar code encoding mode to encode, and compared with Turbo code encoding, the encoding performance is improved, so that the subsequent communication performance is improved.

This disclosure relates to precoding for polar codes and provides a method comprising: determining a first precoding matrix, the size of which is determined based on the message size of a message to be encoded by polar coding and the codeword size of the polar-coded codeword; determining a second precoding matrix based on the first precoding matrix and the information positions of a zero-padding vector; and performing precoding on the message based on the second precoding matrix to generate an output vector.

Provided is a device in a communication system or a broadcast system. The device may comprise a memory, at least one transceiver, and at least one processor connected to the memory and the at least one transceiver. The device may be configured to: acquire a signal; identify information about at least one dummy parity check (PC) bit among one or more PC bits of the signal on the basis of at least one information bit of the signal and a rate matching size for a polar code; identify a decoder setting for error detection and error correction on the basis of information about the at least one dummy PC bit; and decode the signal on the basis of the decoder setting. The at least one dummy PC bit may include a bit having a fixed value regardless of one or more preceding bits of the decoding among the one or more PC bits.

Provided in the embodiments of the present disclosure are an encoding method, a decoding method, and an apparatus, a storage medium and a program product. The encoding method comprises: acquiring a sequence to be encoded corresponding to input encoded bits; on the basis of a preset polar permutation relationship, performing subcode rate adjustment on the sequence to be encoded, wherein the preset polar permutation relationship is used for indicating a correspondence between frozen-bit subcode indices and the number of information bits, and the frozen-bit subcode indices are indices of frozen-bit subcodes comprised in a polar sequence of a preset maximum code length; on the basis of the adjusted sequence to be encoded and the input encoded bits, constructing an information sequence; performing polar code encoding on the information sequence, so as to obtain an encoded sequence; and sending the encoded sequence.

The present disclosure relates to a technology for decoding encoded data based on PME-HARQ. In accordance with an aspect of the present disclosure, there is provided a PME-HARQ-based data decoding device, comprising: at least one first decoding unit that performs successive cancellation-based decoding on PME-HARQ-based data; at least one second decoding unit that performs polar code permutation-based decoding on the PME-HARQ-based data; and a decoding result selection unit that selects one of decoding results of the first decoding unit and decoding results of the second decoding unit based on a reliability of the decoding results of the first decoding unit and a reliability of the decoding results of the second decoding unit.

This application provides a data processing method, apparatus, and device. According to the method, a new encoding matrix G of a polar code is designed. When a terminal device uses the encoding matrix G to encode information bits to be encoded, after receiving a portion of the information bits in the encoding process, the terminal device can encode the portion of the information bits to perform stream encoding, which helps reduce the size of the encoder and buffer of the terminal device. Furthermore, the information bits to be encoded are encoded using the encoding matrix to obtain coded data, which makes stream decoding easier and reduces the size of the decoder.

Low density parity check (LDPC) codes for wireless communications are constructed to adapt to channel conditions. A method of encoding input bits by an LDPC code to obtain encoded bits is provided. A method of decoding the encoded bits is also provided. The LDPC code has a parity check matrix obtained by lifting a protograph matrix according to a lifting matrix, in which the lifting matrix is based on a polar kernel.