117results about "Checking code calculations" patented technology

An apparatus may include a transmitter and one or more processors. The one or more processors may identify, based on a first parity check matrix of a first quasi-cyclic-low-density parity-check (QC-LDPC) code according to a code rate of 3 / 4, a second parity check matrix corresponding to a first exponent matrix comprising 576 values for a second QC-LDPC code. The second QC-LDPC code may have a code block size that is twice a code block size of the first QC-LDPC code. The one or more processors may encode data using the second parity check matrix. The transmitter may be configured to transmit the encoded data.

An apparatus may include a transmitter and one or more processors. The one or more processors may identify, based on a first parity check matrix of a first quasi-cyclic-low-density parity-check (QC-LDPC) code according to a code rate of 5 / 6, a second parity check matrix corresponding to a first exponent matrix comprising 384 values for a second QC-LDPC code. The second QC-LDPC code may have a code block size that is twice a code block size of the first QC-LDPC code. The one or more processors may encode data using the second parity check matrix. The transmitter may be configured to transmit the encoded data.

An apparatus may include a transmitter and one or more processors. The one or more processors may identify, based on a first parity check matrix of a first quasi-cyclic-low-density parity-check (QC-LDPC) code according to a code rate of 2 / 3, a second parity check matrix corresponding to a first exponent matrix comprising 768 values for a second QC-LDPC code. The second QC-LDPC code may have a code block size that is twice a code block size of the first QC-LDPC code. The one or more processors may encode data using the second parity check matrix. The transmitter may be configured to transmit the encoded data.

An apparatus may include a transmitter and one or more processors. The one or more processors may identify, based on a first parity check matrix of a first quasi-cyclic-low-density parity-check (QC-LDPC) code according to a code rate of 1 / 2, a second parity check matrix corresponding to a first exponent matrix comprising 1152 values for a second QC-LDPC code. The second QC-LDPC code may have a code block size that is twice a code block size of the first QC-LDPC code. The one or more processors may encode data using the second parity check matrix. The transmitter may be configured to transmit the encoded data.

In an aspect, digital communication coding methods (or simply coding methods) are provided, said methods comprising providing families of quasi-cyclic low-density parity check, LDPC, codes each represented by a single equation. Said single equation is derived from a geometry whose nature implies good error correcting properties for each of the LDPC codes and allows quasi-cyclic parity check matrices to be constructed for geometric LDPC codes of exceedingly long length, up to and exceeding four hundred thousand bits. The construction of such check matrices is not possible by any other known method. The LDPC codes have different lengths and different rates and the families of LDPC codes are provided with a guarantee of minimum distance. The geometric and quasi-cyclic properties of the LDPC codes allow low complexity decoding with very low frame error rates. Systems, computing systems and computer programs suitable to perform such coding methods are also provided.

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.

Certain aspects of this disclosure generally relate to techniques for enhanced puncturing and low-density parity-check (LDPC) code structures. A method for wireless communication by a transmitting device is provided. This method generally includes: encoding a set of information bits based on an LDPC code to generate a codeword, the LDPC code being defined by a basic matrix having a first number of variable nodes and a second number of parity nodes; puncturing the codeword according to a puncturing pattern designed to puncture bits corresponding to at least two of the variable nodes to generate a punctured codeword; adding at least one additional parity bit to the punctured at least two variable nodes; and transmitting the punctured codeword.

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.

A method for constructing a permutation matrix or a check matrix, a processing device, a storage medium and a coding method. The method for constructing the permutation matrix comprises: obtaining a base matrix for the permutation matrix; and performing lifting on the base matrix to obtain the permutation matrix. The lifting on the base matrix to obtain the permutation matrix comprises: obtaining a modulus graph of the base matrix, obtaining each macro ring in the modulus graph, and for each macro ring in the modulus graph, determining the size of a short ring corresponding to the macro ring in a Tanner graph of a check matrix corresponding to the permutation matrix from an equivalent cycle value ECS of the macro ring, and determining whether at least one cycle value in the macro ring needs to be set according to the size of the short ring. The method can more efficiently obtain a required permutation matrix.

An LDPC encoder is described with memory for storing a parity check matrix and a calculation unit to encode information bits into a codeword with reference to the parity check matrix. The parity check matrix includes an information part matrix and a parity part matrix. In the parity part matrix, Z*Z sub-matrices are sub-matrices, other than a zero matrix, and are arranged in each of the m rows and m columns. A sub-matrix is a scaled cyclic matrix obtained by shifting elements of an identity matrix by one to the left and multiplying the shifted elements by a scaling element. Except for the scaled cyclic matrix, the remaining sub-matrices are a zero matrix or an identity matrix, and the scaling element is an element allowing the parity part matrix to satisfy a full rank condition on a Galois field.

The present invention discloses an iterative detection decoding method based on tree search, comprising: initializing a K-Best detector; obtaining a priori message L through a FastSOL decoder; A1 (s i ); perform the K-Best detector with the prior message L A1 (s i ) to obtain a symbol estimate sequence; the symbol estimate sequence is converted into a bit estimate sequence, which is output to the FastSOL decoder for FastSOL decoding to obtain a decoded result sequence; a determination is made as to whether the maximum number of iterations has been reached. If not, the decoded result sequence is output to the K-Best detector as a priori information; otherwise, detection and decoding are completed, and the corresponding FER performance data is output. This invention utilizes soft information exchange between the detection and decoding modules to achieve better reliability than separate detection and decoding (SDD). This solution is optimized to meet the requirements of error rate performance and complexity, achieving better error rate performance and lower complexity by adjusting the layer width and message exchange.

In some implementations, an apparatus may include a transmitter and one or more processors. The one or more processors may be configured to identify, according to a code rate of 3 / 4 and a code block size of 3888 bits, a first binary parity check matrix for a quasi-cyclic-low-density parity-check (QC-LDPC) code. The first binary parity check matrix may correspond to a first exponent matrix having 144 values. The one or more processors may be configured to encode data using the first binary parity check matrix. The one or more processors may be configured to transmit the encoded data.

The present disclosure provides methods, components, devices, and systems for low density parity check (LDPC) coding. Some aspects are more particularly directed to expanding an LDPC codeword to produce a longer codeword. In some examples, a first wireless device may generate a baseline LDPC code by performing a first boost on a basis matrix, which may produce an LDPC code for a current Wi-Fi implementation. The first wireless device may then perform a second boost or re-boost (such as a cyclic boost, a product boost, an exchange boost, or a combination thereof) to generate an extended boosted code. The extended lifted code may be an extension of the first LDPC code such that the first LDPC code may be held as part of the extended code. The first wireless device may then transmit the expanded LDPC code as an expanded or boosted codeword.

Techniques pertaining to low-density parity-check (LDPC) encoding enhancement for next-generation wireless local area network (WLAN) systems in wireless communications are described. An apparatus (e.g., a station (STA) ) encodes a plurality of bits with an enlarged codeword length. The apparatus then communicates with the encoded plurality of bits in a wireless communication system.

An apparatus may include a transmitter (120) and one or more processors (2010). The one or more processors (2010) may identify, based on a first parity check matrix of a first quasi-cyclic-low-density parity-check, QC-LDPC, code according to a code rate of 1 / 2, a second parity check matrix corresponding to a first exponent matrix comprising 1152 values for a second QC-LDPC code. The second QC-LDPC code may have a code block size that is twice a code block size of the first QC-LDPC code. The one or more processors (2010) may encode data using the second parity check matrix. The transmitter (120) may be configured to transmit the encoded data.

In some examples, a system groups a multitude of blocks of coded data into first segments, where each first segment comprises several blocks from the multitude of blocks, and the coded data is based on the application of a deletion correction coding to input data. The system stores the first segments in corresponding error domains of a first set of error domains in a first deletion correction configuration, where the first deletion correction configuration allows error recovery in response to lost coded data in a specified number of error domains. The system transitions from the first deletion correction configuration to a second deletion correction configuration by reorganizing the first segments into second segments, where each second segment comprises a different number of blocks of coded data than a first segment.

In some implementations, an apparatus may include a transmitter and one or more processors. The one or more processors may be configured to identify, according to a code rate of 3 / 4 and a code block size of 3888 bits, a first binary parity check matrix for a quasi-cyclic-low-density parity-check (QC-LDPC) code. The first binary parity check matrix may correspond to a first exponent matrix having 144 values. The one or more processors may be configured to encode data using the first binary parity check matrix. The one or more processors may be configured to transmit the encoded data.

This invention provides an encoding and decoding method and apparatus for Structured Low-Density Parity-Check (LDPC) codes. The encoding method includes: determining a base matrix for encoding, the base matrix comprising one or more submatrices, the submatrices including a top-left submatrix Hb1 and a top-left submatrix Hb2, wherein the number of rows and columns of the top-left submatrix Hb1 and Hb2 are both less than the number of rows and columns of the base matrix Hb, and the top-left submatrix Hb1 is the top-left submatrix of the top-left submatrix Hb2; performing LDPC encoding operations on the source information bit sequence based on the base matrix and the corresponding extension factor Z to obtain a codeword sequence, where Z is a positive integer greater than or equal to 1. The above technical solution provided by this invention solves the problems of insufficient flexibility and inability to support incremental redundancy HARQ in related technologies for LDPC encoders and decoders.

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.

Certain aspects of the present disclosure generally relate to techniques for compactly describing lifted low-density parity-check (LDPC) codes. A method for wireless communications by a transmitting device generally includes selecting a first lifting size value Z and a first set of lifting values; generating a first lifted LDPC code by applying the first set of lifting values to interconnect edges in copies of a base parity check matrix (PCM) to obtain a first lifted PCM corresponding to the first lifted LDPC code; determining a second set of lifting values for generating second lifted PCM corresponding to a second lifted LDPC code for a second lifting size value based on the first set of lifting values; encoding a set of information bits based on at least one of: the first lifted LDPC code or the second lifted LDPC code to produce a code word; and transmitting the code word.

This application discloses an encoding method, an apparatus, a communications device, and a communications system. The method includes: encoding an input bit sequence by using a low-density parity-check LDPC matrix, where a base graph of the LDPC matrix is represented by a matrix of m rows and n columns, m is an integer greater than or equal to 5, and n is an integer greater than or equal to 27; the base graph includes at least a submatrix A and a submatrix B; the submatrix A is a matrix of five rows and 22 columns; and the submatrix B is a matrix of five rows and five columns, and the submatrix B includes a column whose weight is 3 and a submatrix B' with a bidiagonal structure. According to the encoding method, the apparatus, the communications device, and the communications system in this application, encoding requirements of information bit sequences of a plurality of lengths can be supported.

This disclosure describes systems, methods, and devices related to for low-density parity-check (LDPC) Wi-Fi coding and decoding. A device may identify a first base matrix to generate LDPC codewords of 1944 bits; identify a mask matrix to generate a second base matrix based on the first base matrix used to generate LDPC codewords of 3888 bits, the entries of the mask matrix having values of 0, 1, and −1; generate the second base matrix by multiplying each the first base matrix by the mask matrix, the entries of the second base matrix indicative of respective cyclic shifts to apply to an identity matrix; generate a parity check matrix by multiplying the second base matrix by the identity matrix; generate a LDPC codeword of 3888 bits based on the parity check matrix; and transmit a frame including the LDPC codeword.

A method for data transfer via a communication channel (11) is provided, comprising: determining, in a first data processing unit (10), a codeword from a message using a channel code and sending the codeword via the communication channel (11), wherein the channel code comprises an outer code concatenated with an inner code; the outer code is one of a Reed-Solomon code, a folded Reed-Solomon code, a twisted Reed-Solomon code, and a generalized Reed-Solomon code; the inner code is a neural network code comprising a neural encoder-decoder pair, which includes an encoding neural network (21) and a decoding neural network (23); a nonlinear channel and / or a noisy channel (22) is arranged between the encoding neural network (21) and the decoding neural network (23); and the neural encoder-decoder pair has been adapted such that the decoding neural network (23) provides an estimated outer codeword symbol for an input outer codeword symbol by training the neural encoder-decoder pair using a training data set which comprises a plurality of outer codewords determined from a plurality of input messages by an outer code encoder (31), wherein one or more outer codeword symbols of the plurality of outer codewords are used as an input to the encoding neural network (21). Moreover, a further method and systems for data transfer via a communication channel (11) are provided.

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

Methods, systems, and devices for wireless communications are described. A first device may transmit, to a second device, a bit sequence encoded with a convolutional encoder associated with a constraint length of five, six, or seven, and associated with a subset of polynomials of a polynomial set, wherein the polynomial set is selected from a group of polynomial sets, expressed with octal values, consisting of polynomial sets described herein.

A coding method and apparatus are provided. The method includes: coding an information bit by using a preset generator matrix of a systematic (U|U+V)-code to obtain a codeword of a systematic code. The preset generator matrix of the systematic (U|U+V)-code includes a first identity sub-matrix of a U code and a second identity sub-matrix of a V code. A plurality of elements in a same column as the first identity sub-matrix are all 0. A plurality of elements in a same column as the second identity sub-matrix are all 0.

An encoding method and apparatus, a decoding method and apparatus, and a device are provided. The encoding method includes: obtaining K to-be-encoded bits (S301), where K is a positive integer; determining a first generator matrix, where the first generator matrix includes at least two sub-blocks distributed based on a preset position relationship, and the sub-block includes a plurality of first generator matrix cores (S302); generating a second generator matrix based on the first generator matrix, where the second generator matrix includes T sub-blocks, and a position relationship between two adjacent sub-blocks of the T sub-blocks is determined based on the preset position relationship (S303), where T is a positive integer; and polar encoding the K to-be-encoded bits based on the second generator matrix (S304), to obtain encoded bits. This can reduce encoding / decoding complexity.

An encoding method and apparatus, a decoding method and apparatus, and a device are provided. The encoding method includes: obtaining K to-be-encoded bits (S301), where K is a positive integer; determining a first generator matrix, where the first generator matrix includes at least two sub-blocks distributed based on a preset position relationship, and the sub-block includes a plurality of first generator matrix cores (S302); generating a second generator matrix based on the first generator matrix, where the second generator matrix includes T sub-blocks, and a position relationship between two adjacent sub-blocks of the T sub-blocks is determined based on the preset position relationship (S303), where T is a positive integer; and polar encoding the K to-be-encoded bits based on the second generator matrix (S304), to obtain encoded bits. This can reduce encoding / decoding complexity.

A turbo code designing method for designing a turbo encoding using a high-performance interleaver is provided. A turbo encoder is provided with a first convolutional encoder, an interleaver, and a second convolutional encoder. The first convolutional encoder generates a first parity stream of input data by use of a predetermined RSC encoding. The interleaver swaps an order of series inside the input data based on a first rule to generate a swapped data. The second convolutional encoder es a second parity stream of the swapped data by use of the RSC encoder. The turbo code designing method includes selecting a polynomial that indicate the RSC encoding from a Galois field of polynomials and designing the first rule of the inter leaver based on the RSC encoding.