26results about "Reed-muller codes" patented technology

The invention discloses a polar code coding method and device, relates to the technical field of communication, and aims at enabling different numbers of information bit sequences to construct polar codes based on the same reliability sequence and a first matrix, reducing the hardware complexity and improving the decoding performance. The method comprises the steps of mapping an information bit sequence with the length of k to k bits of a first sequence with the length of N according to a reliability sequence with the length of N to obtain a second sequence comprising k information bits, x PC bits and N-k-x frozen bits, multiplying the second sequence by a first matrix to obtain a third sequence, and performing polarization coding to obtain a fourth sequence. K < = K < = N, 1 < = x, K is the maximum value of the length of the information bit sequence, k, K, N and x are positive integers, all the parts below the diagonal lines of the first matrix are 0, all the diagonal lines are 1, the column weight of the column corresponding to the PC bit in the first matrix is greater than 1, the column weight of the column corresponding to the frozen bit or the information bit is equal to 1, and the number of the columns with the column weight greater than 1 is smaller than or equal to N-K.

Methods and apparatuses for decoding polar codes are provided. A simplified successive cancellation list (SSCL) decoding tree for a polar code is generated. The SSCL decoding tree includes a plurality of nodes. One or more nodes of the plurality of nodes are identified for decoding using a Reed-Muller code. Decoding of received log likelihood ratios (LLRs) is performed at the one or more nodes using the Reed-Muller code. Hard decision values are output from the one or more nodes.

Techniques are described herein for iterative decoding. An example method can include iteratively decoding a codeword by at least: determining soft channel reliability information values for bits of the codeword in a decoding iteration k, sorting the soft channel reliability information values, generating soft extrinsic information for the codeword based on a belief-propagation technique wherein the soft extrinsic information is based on the sorted channel reliability information values, and passing the soft extrinsic information to a decoding iteration k+1, such that soft channel reliability information for the decoding iteration k+1 is updated based on the soft extrinsic information for the codeword. The method can further include determining whether iteratively decoding the codeword is successful based on the updated soft channel reliability information, wherein the codeword was generated using a Reed-Muller encoding technique.

Various embodiments relate to a Reed-Muller decoding system and a Reed-Muller decoding method configured to decode an RM code by processing each received noisy codeword of received RM encoded data, and to decode the RM code by processing each received noisy codeword of the received RM encoded data, the corresponding decoding most suitable for the noisy code word is determined by the following steps: (1) solving a subspace coset of the noisy code word approximately equal to the effective code word; (2) solving another subspace coset which is partially contained in the coset, so that the limitation of the combination of the noisy code word and the to-be-verified code word is close to an effective code word; (3) determining the decoding of the code words on the whole subspace coset spanned by the subspace coset and by using the to-be-verified decoding of the code words on the union set of the subspace coset and declaring that the coset is a new value of the subspace coset; (4) repeating the steps (2) to (3) so as to keep the extended subspace coset with decoding on the extended subspace coset until the extended subspace coset covers the whole space; and (5) repeating steps 1 to 4 at least once to determine the corresponding decoding most suitable for the noisy codeword therefrom.

This application belongs to the field of communication technologies, and provides a data processing method, an apparatus, and a communication system. The method includes: obtaining a data sequence, where the data sequence includes a plurality of forward error correction (forward error correction, FEC) codewords; performing FEC decoding on at least one FEC codeword in the data sequence to obtain at least one decoded codeword; and finding a preset sequence in the at least one decoded codeword. Because a bit error ratio of the decoded codeword is low, time consumed in searching for the preset sequence in the at least one decoded codeword in the data sequence is short, so that efficiency, precision, and reliability of searching for the preset sequence in the data sequence can be improved.

A polar code encoding method and an apparatus are provided and relate to the field of communication technologies, to enable polar codes to be constructed based on a same reliability sequence and a same first matrix for sequences of different quantities of information bits, thereby reducing hardware complexity and improving decoding performance. The method includes: mapping, based on a reliability sequence whose length is N, an information bit sequence whose length is k to k bits of a first sequence whose length is N, to obtain a second sequence including k information bit positions, x PC bit positions, and N-k-x frozen bit positions; multiplying the second sequence by a first matrix to obtain a third sequence; and performing polar encoding to obtain a fourth sequence, where k≤K≤N, 1≤x, K is a maximum value of the length of the information bit sequence, k, K, N, and x are all positive integers, there are all 0s below a diagonal of the first matrix, and all 1s on the diagonal, a column weight of a column corresponding to the PC bit position in the first matrix is greater than 1, a column weight of a column corresponding to the frozen bit position or the information bit position is equal to 1, and a quantity of columns whose column weights are greater than 1 is less than or equal to N-K.

To provide a method and apparatus for communicating a synchronization signal (SS) block that includes an SS block index in a physical broadcast channel (PBCH) payload.SOLUTION: In a wireless communication system, a UE receives, at different times separated by a time increment, a first synchronization signal (SS) block including a first codeword and a second SS block including a second codeword, each based at least in part on linear encoding of a PBCH payload. The UE determines, based at least in part on the time increment, one or more hypotheses, including a correct hypothesis, of combined decoding metrics for the first codeword and the second codeword, and decodes the first codeword based on each thereof. The UE determines the first codeword based at least in part on an error detection procedure such as CRC verification performed when decoding the first codeword based at least in part on the correct hypothesis.SELECTED DRAWING: Figure 4

Various embodiments are directed to Reed-Muller decoding systems and methods configured to decode RM codes by processing each received noisy codeword f of the received RM encoded data to determine therefrom a respective decoding that best fits the noisy codeword f by (1) finding a subspace coset W on which the noisy codeword f is approximately equal to a valid codeword; (2) finding another subspace coset W ⋆ that is partially contained in W such that the restriction of the combination of the noisy codeword f and the alleged codeword on W to W ⋆ is close to a valid codeword; (3) using the alleged decodings of the codeword on the union of subspace cosets W and W ⋆, determine a decoding of the codeword on the entire subspace coset spanned by subspace cosets W and W ⋆ and declaring this coset the new value of subspace coset W ; (4) repeating steps 2-3 to keep expanding the subspace coset it has a decoding on until the expanded subspace coset W covers the entire space; and (5) repeating steps 1-4 at least once to determine therefrom a respective decoding that best fits the noisy codeword f.

The approaches proposed here concern error handling using at least two error processing branches, each branch comprising a syndrome generator, an error detection unit, and an error correction unit. Each error processing branch is configured (i) to process a data word, wherein the data words of the error processing branches differ by at least one bit, and (ii) to provide a processed data word. Furthermore, a decision unit is provided, configured to select one of the processed data words or to execute a predefined action if an uncorrectable error is detected.

Methods, systems, and devices for wireless communication are described. A transmitting device may assign a set of information bits to multiple subsets of bits corresponding to channel instances of a channel. The transmitting device may encode a first subset of bits according to a first channel coding scheme for a first channel instance and a second subset of bits according to a second channel coding scheme for a second channel instance. The transmitting device may input the encoded subsets of bits to a polarization transform, which may output a set of encoded polarization bits that are transmitted to a receiving device. Upon receiving the encoded polarization bits, the receiving device may apply a depolarization transform to obtain multiple subsets of bits corresponding to channel instances of the channel and may decode each subset of bits according to a respective channel coding scheme.

Methods, systems, and devices for wireless communications are described. A transmitting device may support shaping of bits in block encoding schemes and a probabilistic shaping framework to generate shaped bits that include both information bits and shaping bits, without conveying extra information (e.g., in addition to the shaped bits) to a receiving device. The transmitter may use a decoder such as a polar decoder (e.g., a modem configured for both coding and decoding) to determine a set of shaping bits based on the information bits. The transmitting deice may also map information bits to frozen bit locations of the polar code, and the shaping bits to information bit locations of the polar, such that the encoded (e. g., shaped) bits from the polar encoder satisfy a target probability distribution.

Aspects presented herein relate to error processing by means of at least two error processing branches, wherein each error processing branch comprises a syndrome generator, an error recognition unit, and an error correction unit. Each error processing branch is designed to: (i) process a data word, wherein the data word of the error processing branch differs in at least one bit; and (ii) providing the processed data word. The invention further relates to a determination unit which is designed to select one of the processed data words or to perform a predetermined action if an uncorrectable error is detected.

The invention relates to a construction method and device of a polarization adjustment convolutional code, a terminal and a storage medium. The method comprises the following steps: calculating a first minimum code weight, a first error coefficient and a first dominant index of the polarization adjustment convolutional code; constructing a candidate frozen set according to the code length, the information bit number and the initial information set, and obtaining a target information set without the first dominant index according to the initial information set and the first dominant index; performing iterative optimization on the initial information set, the first minimum code weight and the first error coefficient based on each frozen bit in the target information set and the candidate frozen set to obtain an optimized information set, an optimized minimum code weight and an optimized error coefficient; and obtaining a polarization adjustment convolutional code based on the optimization information set, the optimization minimum code weight and the optimization error coefficient. According to the method, the minimum code weight and the error coefficient of the polarization adjustment convolutional code are remarkably improved, so that the certainty, the effectiveness and the calculation efficiency of the polarization adjustment convolutional code are improved.

Embodiments of the present application provide flexible nested reliability sequence extraction methods, systems and apparatus. In the method, a plurality of reliability ordering sequences are determined, and a plurality of information bits are encoded based on the plurality of reliability ordering sequences. The plurality of information bits are encoded into a plurality of codewords. The plurality of codewords correspond to the plurality of reliability ordering sequences, which means that one codeword can correspond to at least one reliability ordering sequence. The flexible nested reliability sequence extraction method and apparatus can be applied to a communication system to support scenarios where multiple codes with at least one retransmission or multiple redundancy versions are needed.

The invention discloses a low-power-consumption wake-up signal receiving method based on improved Reed-Muller coding, relates to the technical field of low-power-consumption communication, and aims at solving the problem that the low-power-consumption wake-up signal receiving performance is insufficient due to the fact that the minimum Hamming distance of code words is limited in Reed-Muller coding in the existing 3GPP (3rd Generation Partnership Project) standard. According to the method, firstly, Reed-Muller coding in 3GPP is optimized: a simulated annealing algorithm is introduced, the optimal code word combination of coding is searched by using the global optimization capability of the simulated annealing algorithm, the minimum Hamming distance of each code word after coding is significantly increased, the anti-interference capability of low-power-consumption wake-up signal transmission is enhanced, and the detection error rate (MDR) during detection is reduced from the coding level; at a receiving end, a threshold value judgment receiving mode is used for further improving the detection performance, the receiving reliability of the low-power-consumption wake-up signal is effectively improved, and the method is suitable for an LP-WUS (low-power-consumption wake-up signal) system, especially suitable for scenes with complex noise interference and strict requirements for the false alarm rate and the equipment power consumption, such as the Internet of Things and the Internet of Vehicles. And the method has relatively high practicability and popularization value.

A configuration for a device to interleave a codeword, where the codeword is based on an enhanced noncoherent error correction code. The apparatus encodes a set of bits based on a noncoherent error correction code to generate a first codeword. The apparatus interleaves the first codeword to permute coded bits of the first codeword into a second codeword. The apparatus transmits the second codeword to a second device.

The apparatus may be configured to receive a plurality of codewords associated with a plurality of messages, where the plurality of codewords comprises a first subset of the plurality of codewords associated with a first subset of the plurality of messages and a second subset of the plurality of codewords associated with a second subset of the plurality of messages, wherein the first and second subset of codewords are associated with first and second RM codes, wherein the first RM code is a subcode of the second RM code, decode the plurality of codewords using a decoding method that is associated with a first error tolerance for the first subset of the plurality of codewords that is higher than a second error tolerance for the second subset of the plurality of codewords, and output a plurality of decoded codewords associated with the plurality of messages.

Aspects described herein relate to encoding uplink communications based on a coding table including determining to avoid certain portions of a coding table that may result decoding errors, or using a modified coding table, to improve decoding results. In one aspect, a network can transmit, to a device, a configuration indicating whether to use a modified coding table for encoding uplink communications. Examples are provided with Reed Muller encoding, where rate matched Reed Muller codes can suffer from rank deficiency and decoding ambiguity. In that case invalid pairs of encoding parameters containing number of systematic bits and code length are triggering an error case or alternative encoding table is indicated.

The present disclosure relates to a 5G communication system or a 6G communication system for supporting higher data rates beyond a 4G communication system such as long term evolution (LTE). A method (500) for channel coding performed at a transmitter (202) includes applying a pre-processing operation on a coding scheme based on a plurality of parameters such as code rate, code length, information length, data type, equipmemt type, service type, resource allocation parameters, number of time domain symbols, etc. Further, the method (500) includes encoding data to be transmitted based on the pre-processed coding scheme and transmitting, to a receiver via a plurality of transmission channels, the encoded data along with one of an indication of the coding scheme or the application of the pre-processing operation on the coding scheme.

The approaches proposed here relate to error processing by means of at least two error processing branches. Each of the error processing branches is configured (i) to process a data word, wherein the data words of the error processing branches differ in at least one bit, and (ii) to provide a processed data word to a decision unit. The decision unit is configured to select one of the processed data words or to perform a predetermined action if an uncorrectable error has been detected.

In a method for decoding a syndrome of a QEC code, a syndrome of the QEC code and a plurality of transformation pairs are obtained. Each transformation pair comprises a first transformation and a second transformation. Applying each transformation pair to a parity check matrix of the QEC code leaves the parity check matrix invariant. For each transformation pair, the first transformation is applied to the syndrome to obtain a transformed syndrome, and an error estimate is determined based on the transformed syndrome and the parity-check matrix. A permuted error estimate is determined for at least one of the error estimates based on the second transformation and the error estimate. An error associated with the syndrome is determined based on the permuted error estimates of the plurality of transformation pairs.

For joint uplink encoding and decoding, input bits including data bits and bits associated with control information are encoded to generate encoded bits, and the encoded bits can be decoded to recover the data bits and the bits associated with the control information. The encoding includes jointly encoding the data bits and the bits associated with the control information according to a first code, the first code being different from a second code, the second encoded bits being generated from the control information according to the second code. In some embodiments, both the encoded bits and the second encoded bits are transmitted or otherwise output, and the control information can be decoded from either or both of the encoded bits and the second encoded bits.

Embodiments of this application provide a rate matching method and a communication apparatus. In the method, a to-be-encoded sequence is encoded based on a basis sequence corresponding to small packet encoding, to obtain a first codeword sequence whose length is 32 bits; then the first codeword sequence is interleaved to obtain a second codeword sequence; and finally, the second codeword sequence is punctured from back to front based on a value E, to obtain a third codeword sequence, where the value E indicates a quantity of bits of the second codeword sequence after rate matching, and E is a positive integer less than 32. According to the method, a code distance characteristic of a punctured first codeword sequence can be improved, so that a Hamming distance between different valid codewords is as large as possible, thereby improving decoding performance.

The apparatus may be configured to receive a plurality of codewords associated with a plurality of messages, where the plurality of codewords comprises a first subset of the plurality of codewords associated with a first subset of the plurality of messages and a second subset of the plurality of codewords associated with a second subset of the plurality of messages, wherein the first and second subset of codewords are associated with first and second RM codes, wherein the first RM code is a subcode of the second RM code, decode the plurality of codewords using a decoding method that is associated with a first error tolerance for the first subset of the plurality of codewords that is higher than a second error tolerance for the second subset of the plurality of codewords, and output a plurality of decoded codewords associated with the plurality of messages.

The embodiment of the invention provides a rate matching method and a communication device, and the method comprises the steps: carrying out the coding of a to-be-coded sequence based on a basic sequence corresponding to small packet coding, obtaining a first code word sequence with the length of 32 bits, carrying out the interweaving of the first code word sequence, obtaining a second code word sequence, and finally, carrying out the coding of the to-be-coded sequence. And punching the second code word sequence from back to front based on a numerical value E to obtain a third code word sequence, the numerical value E indicating the number of bits after rate matching of the second code word sequence, and E being a positive integer less than 32. According to the method, the code distance characteristic of the first code word sequence after punching can be improved, so that the Hamming distance between different legal code words is as large as possible, and the decoding performance is improved.