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

A cyclic redundancy check bit determination method and system, the method including obtaining an information bit, determining, based on a first correspondence, that a check bit length is L, where L is a natural number, and where the first correspondence includes a correspondence among code length information of to-be-transmitted data including the information bit, length information of the information bit, and the check bit length, and determining a first check bit based on a first cyclic redundancy check (CRC) polynomial, where a length of the first check bit is the check bit length L, where a highest power of terms in the first CRC polynomial is Lmax, where Lmax is a positive integer, and where Lmax is greater than or equal to L.

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.

A device is configured for encoding an input sequence comprising message bits into a codeword using a polar code. The device is configured to sequentially encode each of a plurality of blocks of the input sequence by applying a sliding window to the input sequence, wherein each block of the input sequence is encoded based on an XOR operation of the block and a previous block of the input sequence to obtain a codeword block of the codeword, and sequentially output each obtained codeword block of the codeword.

The invention discloses a code rate self-adaption method and system based on a Polar code, and relates to the technical field of communication. The code rate self-adaption system based on the Polar code comprises a channel state data acquisition module, a code rate self-adaption module and a code rate self-adaption module, the channel monitoring module is used for acquiring and comprehensively analyzing channel state data in real time and analyzing a channel state set, the channel evaluation module is used for analyzing a channel comprehensive quality evaluation index based on the channel state set, and the code rate control module is used for adjusting a coding rate based on the channel comprehensive quality evaluation index. The channel quality can be accurately evaluated and the coding rate can be dynamically adjusted according to the comprehensive quality evaluation index of the channel, such as the signal-to-noise ratio, the bit error rate, the transmission distance, the environmental data and the receiving state of the receiving end, and the flexible self-adaptive adjustment mechanism enables the system to automatically optimize the transmission scheme according to the real-time wireless channel change, so that the transmission efficiency is improved. And the problem of possible low efficiency of a traditional static system in different environments is avoided.

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.

A 5th generation (5G) or 6th generation (6G) communication system for supporting a higher data rate than a beyond 4th generation (4G) communication system, such as long-term evolution (LTE) is provided. An electronic device performs interleaving on codeword bits, according to a polar code sequence corresponding to the codeword bits, allocates the interleaved codeword bits respectively to blocks, and transmits at least one symbol generated as a result of performing modulation on the interleaved codeword bits for each block, based on the allocation, on at least one resource block corresponding to each of the blocks.

Systems, devices, and methods for encoding information bits for storage, including obtaining information bits; encoding the information bits using an inner code to obtain a plurality of inner code words; encoding the plurality of inner code words using an outer code to generate an outer code word; and storing the outer code word in a storage device, wherein at least one of the inner code and the outer code includes a generalized concatenated code (GCC), and wherein the outer code word includes a hierarchical-GCC (H-GCC) code word.

In order to reduce system power consumption of polar code encoding / decoding in the field of communication technology, a data processing method, an apparatus and a system are provided. The method includes: obtaining a total data length of information bits; and obtaining a code block of C according to the total data length of information bits and a preset first code rate. The code block of C corresponds to one or more code lengths, and the one or more code lengths fill a form of a positive integer power of 2, and C is a positive integer. The code block of C is matched with the code length in the form of a positive integer power of 2 filled by the code word obtained after polar code encoding, so that the code word obtained after the code block of C is encoded can be directly transmitted or received by using the first code rate, and no rate matching module needs to be additionally configured. This effectively simplifies the system design for polar code encoding / decoding and reduces the system power consumption.

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.

The present method relates to a method by which a device transmits a signal in a communication system and to a device therefor, the method comprising the steps of: generating a first encoded bit sequence from an information bit sequence on the basis of a polar code; generating a second encoded bit sequence by puncturing the first encoded bit sequence, on the basis of a code rate; and transmitting the second encoded bit sequence, wherein the first encoded bit sequence is processed on the basis of a proposed puncturing pattern, and the puncturing pattern satisfies a nested property.

Systems, methods, and instrumentalities are disclosed for interleaving coded bits. A wireless transmit / receive unit (WTRU) may generate a plurality of polar encoded bits using polar encoding. The WTRU may divide the plurality of polar encoded bits into sub-blocks of equal size in a sequential manner. The WTRU may apply sub-block wise interleaving to the sub-blocks using an interleaver pattern. The sub-blocks associated with a subset of the sub-blocks may be interleaved, and sub-blocks associated with another subset of the sub-blocks may not be interleaved. The sub-block wise interleaving may include applying interleaving across the sub-blocks without interleaving bits associated with each of the sub-blocks. The WTRU may concatenate bits from each of the interleaved sub-blocks to generate interleaved bits, and store the interleaved bits associated with the interleaved sub-blocks in a circular buffer. The WTRU may select a plurality of bits for transmission from the interleaved bits.

Certain aspects of the present disclosure provide techniques for a probabilistic constellation shaping (PCS) scheme for multiple layer transmissions. An example method includes obtaining a configuration for performing a PCS modulation scheme, identifying a set of bits corresponding to a transport block for communication via the multi-layer transmission, performing distribution matching on the set of bits using a set of parameters indicated in the configuration to obtain a set of distributed symbols, converting the set of distributed symbols into a set of distributed bits, encoding the set of distributed bits to obtain an encoded set of distributed bits, performing a modulation procedure on the encoded set of distributed bits in accordance with the PCS modulation scheme to obtain a set of modulation symbols corresponding to a codeword associated with the transport block, and transmitting, to a receiving device, the codeword, including the set of modulation symbols, via the multi-layer transmission.

The invention relates to a coding method, a decoding method and a device, in the coding method, first equipment can determine a second bit sequence and a third bit sequence based on a first bit sequence, and the third bit sequence comprises a bit sequence of which the weight is higher than a first threshold in a base graph corresponding to the first bit sequence. That is, the weight corresponding to the second bit sequence is lower than the weight corresponding to the third bit sequence. Furthermore, the first device can perform polar code coding on the second bit sequence, which is equivalent to providing additional protection for the second bit sequence with lower weight in a polar code coding mode, so as to improve the error correction performance. And for the third bit sequence with relatively high weight, LDPC coding can be performed on the third bit sequence and a polarization code coding result (namely, a fourth bit sequence obtained by performing polarization code coding on the second bit sequence). The error floor of LDPC decoding is reduced, and the error correction performance of LDPC codes is improved.

Methods and devices are provided in which a channel encoded with a polarization-adjusted convolutional (PAC) code is received. A decoded codeword is generated based at least in part on simplified successive cancellation list (SSCL) decoding performed on the channel via a decoding tree. The decoding tree includes a node that generates candidate codeword output based on predefined processing using convolutional code (CC) state input and channel vector input. A sub-tree of the node remains unprocessed.

The invention provides a polar code decoding method and device, electronic equipment and a storage medium, and the method comprises the steps: obtaining a plurality of log likelihood ratio LLR values corresponding to a to-be-decoded bit sequence; for a current decoding layer in a preset multi-layer decoding architecture, circularly executing the following steps until an intermediate LLR value output by the first decoding layer is determined: taking the acquired LLR values as LLR values input by the last current decoding layer, and taking the intermediate LLR value output by the next decoding layer after the non-last current decoding layer as the LLR value input by the non-last current decoding layer, inputting the LLR value input by the current decoding layer into a judgment unit set by the current decoding layer, performing nonlinear processing based on a middle LLR value output by the judgment unit, and determining the middle LLR value obtained by processing as the middle LLR value output by the current decoding layer; based on the middle LLR value output by the first decoding layer, the bit sequence after decoding is determined, and consumption of software and hardware resources in the decoding process is smaller.

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.

The invention relates to a bit error rate reduction method for reconfigured GPS CNAV-2 navigation message, by using the ORC-POLAR channel coding method instead of BCH and LDPC as the channel coding method to capture and correct errors caused by ambient noise.

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.

The invention discloses a high-parallelism polarization code encoder based on a feedforward pipeline architecture. The high-parallelism polarization code encoder comprises K encoding matrixes and K-1 core encoding modules, the coding matrixes are transversely arranged at intervals, and one core coding module is arranged between every two adjacent coding matrixes; the polar code encoding process of the high-parallelism polar code encoder is divided into K stages; each stage corresponds to one coding matrix; the coding matrix and the core coding module are continuously multiplexed, so that the construction of the whole high-parallelism polar code encoder can be completed; according to the invention, the parallel stage number of the encoder and the encoding stage number of the encoder can be autonomously selected as preset encoder parameters according to specific encoding requirements so as to adapt to different resource requirements, rate requirements and encoding code length requirements; compared with the existing encoder, the high-parallelism polar code encoder provided by the invention can effectively reduce the hardware complexity and improve the encoding speed.

The invention discloses a PAC code fast decoding method and system based on a neural network, and relates to the technical field of communication channel coding and decoding, and the method comprises the steps: obtaining a plurality of code words to be decoded and LLR values thereof; classifying according to the LLR value of each code word to be decoded, and determining an optimal decoding algorithm corresponding to each code word to be decoded; based on the LLR value of each code word to be decoded and the optimal decoding algorithm, training a neural network model to obtain a trained neural network model; obtaining a target to-be-decoded codeword and an LLR value thereof, inputting the LLR value of the target to-be-decoded codeword into the trained neural network model, and determining an optimal decoding algorithm corresponding to the target to-be-decoded codeword; and decoding the target to-be-decoded codeword by using the optimal decoding algorithm corresponding to the target to-be-decoded codeword to obtain a decoding result. According to the invention, the decoding complexity of the PAC code can be greatly reduced while the high error correction performance of the PAC code is ensured.

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.

The present disclosure relates to a technical solution that improves the reliability of communications over a wireless communication channel by replacing a conventional interleaver (e.g., random interleaver) with a Neural Network (NN)-generated interleaver. For this purpose, a well-trained NN is used, which is configured to receive a UE connection status and a channel status as input data and outputs the interleaver in the form of an orthogonal binary matrix. The NN is shared by a UE and a network node. The network node may use the interleaver to interleave a set of bits in a downlink control message before the downlink control message is encoded, e.g., with an error correcting code, such as a polar code. The UE may generate and transpose the interleaver to obtain a deinterleaver to be applied to the downlink control message after its decoding (e.g., polar decoding).

Various aspects of the present disclosure relate to receiving (1502) a polar codeword comprising a set of bits and generating (1504) a permuted vector based at least in part on the polar codeword and a permutation matrix. Aspects of the disclosure may relate to determining (1506) a plurality of polar subcodes based on the permuted vector, and identifying (1508), for each polar subcode of the plurality of polar subcodes, a set of kernels, where each kernel of the set of kernels is associated with a bit pattern of a set of one or more bit patterns. Aspects of the disclosure may relate to decoding (1510) the plurality of polar subcodes using a plurality of parallel polar code component decoders, where each parallel polar code component decoder includes one or more fast decode modules to decode a corresponding kernel of the set of kernels.