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

The invention belongs to the technical field of communication, and particularly relates to a multiplication active code decoding method based on an SO-ORBGRAND decoder. The SO-ORBGRAND decoder outputs soft information by calculating a correct posterior probability of a conjecture code word sequence, and high-performance decoding is realized through soft information exchange and optimization processing between the row decoder and the column decoder. In the iteration process, a method for judging the validity of the code word through the check matrix is designed by utilizing the polarization characteristic of the multiplication active code, so that the iteration is supported to jump out in advance to reduce the complexity. The invention provides a multiplication active code decoding algorithm based on an SO-ORBGRAND decoder, and compared with various non-system multiplication active code decoding algorithms and the performance of traditional long-code polarization codes, the method has remarkable advantages in error correction performance; a method for judging the validity of the code word through the check matrix by utilizing the polarization characteristic design of the multiplication positive code is provided, the complexity is reduced while the judgment success rate is improved, and the implementation overhead is reduced.

The invention belongs to the technical field of polarization codes, and discloses a large nuclear polarization code BP decoding algorithm based on a pruning permutation factor graph, and the algorithm comprises the steps: firstly, randomly generating a permutation factor graph; secondly, deleting nodes with low contribution degree and non-contribution degree to decoding through pruning operation; and when the stop condition is not met, replacing the factor graph to execute BP decoding of the pruned and permutated factor graph until the stop condition is met. For a large nuclear polarization code, a permutation factor graph can improve the decoding performance, and a pruning factor graph can reduce the decoding complexity. A simulation result shows that compared with a BP decoding algorithm, the algorithm provided by the invention can ensure that the complexity is not too high and the decoding performance is improved at the same time.

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.

Certain aspects of the present disclosure provide data compression and channel coding techniques for variable length payloads. A method performed at a wireless node may include obtaining a payload for transmission, compressing the payload using a variable length compression technique to obtain a compressed payload having compressed payload bits of a first length, adding padding bits to the compressed payload to obtain a padded compressed payload. The padded compressed payload comprises information bits including the compressed payload bits and the padding bits. The method further includes encoding the padded compressed payload and outputting the encoded padded compressed payload.

This application provides example concatenated code encoding and decoding methods. In one example method, polar code encoding is performed on a to-be-encoded message bit sequence based on a frozen bit set and a message bit set that are of a first polar code, to obtain a first encoded code word whose length is N_o. The first encoded code word is interleaved to obtain a second encoded code word, and optimized low-density parity-check (LDPC) code encoding is performed on the second encoded code word to obtain a concatenated code word. Interleaving includes both outer interleaving and inner interleaving. The concatenated code word is then outputted.

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.

Methods, systems, and devices for wireless communications are described. In some cases, a first wireless device may communicate, with a second wireless device, a control signal indicating a systematic polar code configuration, the systematic polar code configuration indicating for the first wireless device to perform systematic polar encoding on a first set of bits associated with a non-uniform bit distribution. As such, the first wireless device may apply a systematic polar code to the first set of bits to generate a systematic polar codeword based on the systematic polar code configuration. In such cases, the systematic polar codeword may include a set of parity bits and a set of systematic bits. Thus, the first wireless device may transmit at least the set of parity bits of the systematic polar code.

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.

Dynamic frozen polar codes for probabilistic shaping are described. An apparatus is configured to map transmission bits to an EC-polar code. The transmission bits include first data bits, second data bits, EC bits, and shaping bits. The first data bits correspond to frozen bit locations of the EC-polar code, the shaping bits correspond to information bit locations of the EC-polar code, and the EC bits and the second bits both correspond to remaining locations of the EC-polar code. The apparatus is configured to shape the transmission bits to shaped transmission bits based on the mapping, the EC-polar code, and an addition operation on the transmission bits including the EC bits and the second data bits. The apparatus is configured to transmit, to a receiver network device, the shaped transmission bits.

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.

A device in a communication or broadcast system may comprise a memory, at least one transceiver, and at least one processor, comprising processing circuitry, 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 based on 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.

The disclosure relates to a 5G or 6G communication system for supporting a higher data transmission rate. The present disclosure discloses a method and an apparatus for error correction coding in a communication system, more specifically, to error correction coding integrated with transmission diversity.

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.

Methods, devices, and systems for controlling a storage system, including: a storage device configured to store a plurality of code words; and at least one processor configured to: obtain information bits; encode the information bits using a first code to obtain a first plurality of code words; encode the first plurality of code words using a second code to generate a second plurality of code words; update the first plurality of code words based on the second plurality of code words to generate an adaptive generalized concatenated code (A-GCC) code word; and store the A-GCC code word in the storage device, wherein each code word of the first plurality of code words is encoded using a different error protection level.

In 5G / New Radio (NR), sidelink communication refers to a channel for communications directly between devices, e.g., user equipment (UEs), without use of traditional uplink or downlink communication channels. Sidelink Control Information (SCI) is separated into two stages (i.e., SCI stage 1 and SCI stage 2) before being transmitted to configure a user device. A method for configuring sidelink communications for a wireless device includes: obtaining SCI Stage 2 payload information; attaching and distributing cyclic redundancy check (CRC) information to the payload information; performing encoding and rate matching (RM) on the payload information; scrambling the encoded and rate matched payload information; performing modulation on the scrambled payload information; determining a resource mapping for the modulated payload information, wherein the modulated payload information is aggregated across two or more slots (e.g., using different processing operations for at least two slots); and transmitting the modulated payload information according to the determined resource mapping.

The application relates to the technical field of communication channel coding, and discloses a low-complexity polar code construction method. The method uses the log-likelihood ratio (LLR) output by noiseless SC decoding to represent the reliability of each polar channel, first uses a binary expansion reliability sorting generation algorithm to obtain the reliability sorting of all N polar channels, then according to a code rate R, selects the indexes of the most reliable NR polar channels in the reliability sorting of the N polar channels as information bits, and uses the indexes of the remaining N-NR polar channels as frozen bits, and finally completes the construction of a polar code with a code length N and a code rate R. The method is independent of an actual channel, can effectively reduce the complexity of polar code construction, and improves the performance in a medium-high signal-to-noise ratio (SNR) region.

Blocks of encoded bits are obtained by encoding input bits, and are output, for transmission for example. Each of the blocks of encoded bits has a respective associated code rate and a respective associated capacity. The blocks of encoded bits include nested blocks, and each nested block includes a subcode of another one of the blocks of encoded bits that has a higher respective associated code rate than the nested block. The nested blocks include coupled blocks that are coupled to each other. The coupled blocks may provide or support such features as any one or more of the following: flexible output order based on blockwise code rate and capacity, flexible decoding order based on blockwise code rate and capacity, or variable blockwise code rate.

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.

Methods, systems, and devices for wireless communications are described. Cyclic redundancy check (CRC) bits may be appended to a set of information bits on a per-group basis prior to encoding using an error correcting code. The amount of CRC bits appended to each group of information bits may be based on the priority of the group of information bits. For example, the priority may be based on the type of information conveyed by the group of information bits. For example, for a video stream, information bits conveying low frequency information may have a higher priority than information bits conveying high frequency information, as the low frequency bits may be more important to user perception / experience of the video. The transmitting device and the receiving device may negotiate the CRC configuration (e.g., the CRC bits pergroupand the locations of the groups) so that the receiving device can verify the information bits.

This application provides a rate matching method, a de-rate matching method, and a communication apparatus. The method includes: The communication apparatus determines a second position set based on a first position set. The first position set is an initial position set corresponding to a bit to be deleted during rate matching, and the second position set is a bit position set corresponding to an information bit in a to-be-encoded sequence. The communication apparatus performs rate matching on a first bit sequence to obtain a second bit sequence. The first bit sequence is obtained by performing channel encoding on the to-be-encoded sequence based on the second position set, the second bit sequence corresponds to a bit position other than a third position set in the first bit sequence, and a bit position in the third position set is a bit position obtained when a bit position in the first position set in the first bit sequence is converted in one or more of cyclic shift, mirror reversal, or segmented cyclic shift. The communication apparatus sends the second bit sequence. In this way, rate matching complexity can be reduced.

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.