70results about "Reed-muller codes" patented technology

The invention discloses a polar code coding method and device, relates to the technical field of communication, and can enable a nested PC-Polar code to multiplex a sub-block interleaving rate matching mode of an NR PC-Polar code and improve NR compatibility. The method comprises the following steps: 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; wherein the second sequence comprises k information bits, x parity check PC bits and N-k-x frozen bits, and k, N and x are all positive integers; m information bits in the k information bits are the first m bits ranked according to the reliability from high to low in the second sequence, and the remaining (k-m) information bits in the k information bits are the bits corresponding to the first (k-m) information bits ranked according to the reliability from high to low in the preset information bit set in the second sequence; the x PC bits are x PC bits in a preset PC bit set; and performing polarization coding on the second sequence to obtain a third sequence.

A method and apparatus for a device that handles time-varying packet sizes in the downlink. In some embodiments, a method performed by a user equipment (UE) includes receiving first signaling including a downlink (DL) semi-persistent scheduling (SPS) configuration, the DL SPS configuration including a first instruction for a DL SPS periodicity and a first physical layer resource, the first physical layer resource being used to dynamically modify a size of a second physical layer resource for SPS DL data transmission; receiving second signaling activating reception based on the DL SPS, the second signaling including information for specifying boundaries of the second physical layer resource; monitoring the first physical layer resource on each SPS occasion based on the periodicity to decode the second instruction; determining a size of the second physical layer resource for SPS DL data transmission based on the second instruction; and receiving data on the determined second physical layer resource for each SPS occasion based on the determined size.

The invention provides a data processing method and device and a communication system, and belongs to the technical field of communication. The method comprises the steps that a data sequence is acquired, and the data sequence comprises a plurality of forward error correction (FEC) code words; performing FEC decoding on at least one FEC code word in the data sequence to obtain at least one decoded code word; and finding a preset sequence in the at least one decoded code word. The bit error rate of the decoded code word is low, so that the time consumed for searching the preset sequence in the at least one decoded code word of the data sequence is short, and the efficiency, precision and reliability of searching the preset sequence in the data sequence can be improved.

A polar code encoding method and apparatus, which relate to the technical field of communications, and enable information bit sequences of different sizes to construct polar codes on the basis of the same reliability sequence and the same first matrix, thereby reducing the hardware complexity and improving the decoding performance. The method comprises: on the basis of a reliability sequence having a length of N, mapping an information bit sequence having a length of k onto k bits of a first sequence having a length of N, so as 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, so as to obtain a third sequence; and performing polarization encoding, so as to obtain a fourth sequence, wherein k≤K≤N; 1≤x; K is the maximum value of the length of the information bit sequence; k, K, N and x are all positive integers; the elements below the diagonals of the first matrix are all 0; the elements on the diagonals are all 1; the column weight of a column in the first matrix which corresponds to the PC bits is greater than 1; the column weight of a column corresponding to the frozen bits or the information bits is equal to 1; and the number of columns having a column weight greater than 1 is less than or equal to N-K.

A coding method and apparatus are provided to provide a uniform coding method for ultra short codes. The method is as follows: obtaining, by a transmit end, to-be-coded information bits; performing, by the transmit end, PC-polar coding on the to-be-coded information bits based on first constructor parameters, to obtain a coded bit sequence; and sending the coded bit sequence, where a check equation of the first constructor parameters include a first element representing a check-required information bit position and a second element representing a check bit position, the first element corresponds to a first vector in a generator matrix for PC-polar codes, the second element corresponds to a second vector in the generator matrix, and if a first Hamming weight of the first vector is the same as a second Hamming weight of the second vector, a third Hamming weight of an addition modulo 2 vector is greater than the first Hamming weight and greater than the second Hamming weight, or if the first Hamming weight is different from the second Hamming weight, the third Hamming weight is greater than a smaller one of the first Hamming weight and the second Hamming weight.

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.

A coding method and apparatus are provided to provide a uniform coding method for ultra short codes. The method is as follows: obtaining, by a transmit end, to-be-coded information bits; performing, by the transmit end, PC-polar coding on the to-be-coded information bits based on first constructor parameters, to obtain a coded bit sequence; and sending the coded bit sequence, where a check equation of the first constructor parameters include a first element representing a check-required information bit position and a second element representing a check bit position, the first element corresponds to a first vector in a generator matrix for PC-polar codes, the second element corresponds to a second vector in the generator matrix, and if a first Hamming weight of the first vector is the same as a second Hamming weight of the second vector, a third Hamming weight of an addition modulo 2 vector is greater than the first Hamming weight and greater than the second Hamming weight, or if the first Hamming weight is different from the second Hamming weight, the third Hamming weight is greater than a smaller one of the first Hamming weight and the second Hamming weight.

Aspects described herein relate to encoding uplink communications based on a coding table, including determining to avoid portions of a coding table that may result in decoding errors or using a modified coding table to improve decoding results. In one aspect, a network can send a configuration to a device indicating whether to use a modified coding table to encode uplink communications.

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.

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

The present invention discloses a puncturing method and system based on recursive list decoding of RM codes. The method includes the following steps: S1. Determine a puncturing order set based on the column weights of RM codes; S2. Select a puncturing index from the puncturing order set to obtain a puncturing set F, puncture the bit positions of the puncturing indexes in the puncturing set F, and set the log-likelihood ratio at the puncturing positions to zero; S3. Input the punctured information bits and the unpunctured information bits into the decoder in the original order; S4. Decode the RM code through the decoder using a recursive structure, and select the one with the minimum path metric value from the decoding paths as the output result. The present invention selects the puncturing order according to the column weights of the generating matrix G of RM codes, and has better error performance, higher information transmission capacity, and higher information transmission efficiency in the case of a large number of puncturing.

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.

Methods, systems, and devices for wireless communications are described. A transmitting device may support bit shaping in a block coding scheme and a probabilistic shaping framework to generate shaped bits including 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 device may also map the information bits to frozen bit positions of a polar code and the shaping bits to polar information bit positions such that the coded (e.g., shaped) bits from the polar encoder satisfy a target probability distribution.

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.

There is disclosed a method of operating a radio node in a wireless communication network, the method comprising communicating based on communication signalling, the communication signalling comprising at least one data block, wherein the at least one data block represents and / or comprises an integer number NDB of bits, wherein NDB = I ×NST, wherein I is an integer of 1 or larger, and NST is an integer number of bits comprised in a unit of digital information. The disclosure also pertains to related devices and methods.

A coding method and apparatus for a polar code, which relate to the technical field of communications, and can enable a nested PC-Polar code to reuse a sub-block interleaving rate matching mode of an NR PC-Polar code, so as to improve the NR compatibility. The method comprises: on the basis of a reliability sequence having a length of N, mapping an information bit sequence having a length of k to k bits of a first sequence having a length of N to obtain a second sequence, the second sequence comprising k information bits, x parity check (PC) bits and N-k-x frozen bits, wherein k, N and x are all positive integers, m information bits among the k information bits are the first m bits ranked in descending order of reliability in the second sequence, and the remaining (k-m) information bits among the k information bits are bits in the second sequence that correspond to the first (k-m) information bits ranked in descending order of reliability in a preset information bit set, and the x PC bits are x PC bits in a preset PC bit set; and performing polar coding on the second sequence to obtain a third sequence.

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.

Disclosed are a staircase matrix code and a highly parallel low-latency ordered statistics decoding (OSD) method thereof. The staircase matrix code may be divided into a staircase generator matrix code and a staircase parity-check matrix code, and a corresponding generator matrix or parity-check matrix thereof has a staircase structure, or has a staircase structure after row and column permutation. Based on the special staircase structure, special highly parallel low-latency OSD can be employed to decode the staircase matrix code. Specifically, at least one reliable bit is selected from bits corresponding to each staircase to constitute an extended reliable basis, then a corresponding generator matrix or parity-check matrix has an upper triangular or lower triangular structure. Under the special triangular structure, parallel Gaussian elimination of all rows can be implemented, and then re-encoding and the like are executed to complete decoding. The staircase structure proposed in the present disclosure is combined with a special OSD design, thereby solving the deficiency of conventional OSD that Gaussian elimination can only be executed serially, and the staircase structure can be further combined with locally constrained OSD and the like to reduce re-encoding times, thereby implementing low-latency, low-complexity and high-reliability decoding.

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 first device may obtain a first message bit combination that includes a first quantity of bits for inclusion in a message to be transmitted by the first wireless device. The first device may encode the first set of bits using a first subcode that is mapped to the first message bit combination of a set of message bit combinations in accordance with a subcode mapping scheme, each of the set of message bit combinations having the first quantity of bits. The subcode mapping scheme may be based on a set of communication probability metrics for the set of message bit combinations and a set of error probability metrics for a set of subcodes that comprises the first subcode. The first device may output the message comprising the encoded first set of bits.

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.

Methods and apparatus for dynamic acknowledgement list selection in detection of uplink control channel formats. In an exemplary embodiment, an apparatus includes a dynamic acknowledgement (ACK) list allocation circuit that generates a dynamic ACK list that includes one or two most likely ACK candidates, and a top-Q candidate CQI bits detector that dynamically allocates a detection branch to each of the one or two most likely ACK candidates to detect top-Q candidate CQI bits. The apparatus also includes a merger circuit that mergers the top-Q candidate CQI bits detected for the one or two most likely ACK candidates to generate a merged list, a top-Q CQI symbol generator that generates top-Q CQI symbols for the top-Q candidate CQI bits detected for the one or two most likely ACK candidates, and a joint detector that detects transmitted CQI bits and ACK bits.

This application provides an information transmission method and an apparatus and relates to the field of wireless communication technologies, to reduce an amount of retransmitted data and reduce transmission overheads. In the method, a sending device sends a first bit sequence to a receiving device. Optionally, the first bit sequence is an information bit sequence, or the first bit sequence is an information bit sequence obtained through first encoding. The sending device receives a second bit sequence from the receiving device. The sending device sends a first code block to the receiving device, where the first code block is obtained based on a first error pattern and a first check matrix. The first error pattern is determined based on the second bit sequence and the first bit sequence. According to the foregoing solution, the sending device may determine and obtain the first error pattern that is in previous transmission, and the sending device adaptively adjusts a data amount of retransmitted data by using the first error pattern. In comparison with a current retransmission solution, the data amount in retransmission can be reduced, channel utilization can be improved, and transmission overheads can be reduced.

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.

A data encoding method and a device are provided, to improve encoding / decoding performance in a case of incoherent detection and improve decoding accuracy. The method includes: obtaining column weights and row weights of a generator matrix (201); determining K sequence numbers from a first sequence of the generator matrix (202); determining a bit sequence based on the K sequence numbers (203); performing encoding based on the bit sequence and the generator matrix, to obtain encoded bits (204); and sending the encoded bits to a receiving device (205).