Huawei Technologies Co., Limited

Vasily Stanislavovich Usatyuk

Nikita Andreevich Polianskii

Ilya Viktorovich Vorobyev

German Viktorovich Svistunov

Oleg Feat'evich Kurmaev

Mikhail Sergeevich Kamenev

Alexey Mikhailovich Razinkin

Vladimir Anatolyevich Gaev

Yulia Borisovna Kameneva

Provided is a system and method for determining a generalized Low-Density Parity-Check (LDPC) code for forward error correction channel coding that has a repeat-accumulate code structure.

Generalized low-density parity check codes (GLDPC)

Provided is an encoder, a decoder, a computer-readable medium and methods of forward error correction channel encoding/decoding within a HARQ scheme, based on a generalized quasi-cyclic low-density parity-check code comprising a Cordaro-Wagner component code.

Generalized low-density parity check codes in digital communication system

Devices and methods are disclosed for generating on the basis of a first protograph matrix Pof size m&#xd7;n, wherein the first protograph matrix Pdefines a first code H, a second protograph matrix Pof size (m+d)&#xd7;(n+d), wherein the second protograph matrix Pdefines a second code H. The device comprises a processor configured to: generate an auxiliary protograph matrix P' of size (m+d)&#xd7;(n+d) on the basis of the first protograph matrix Pusing row splitting; generate drandom integer numbers, wherein d=d&#x2212;d; generate a binary matrix M of size d&#xd7;(n&#x2212;m), wherein rows of the binary matrix M are generated on the basis of the drandom integer numbers; generate a matrix M&#x2032; by lifting the binary matrix M; Other operation steps are also included.

Devices and methods for generating a low density parity check code for a incremental redundancy HARQ communication apparatus

A method for quasi-cyclic low-density parity-check (QC-LDPC) encoding and decoding of a data packet by a lifted matrix is provided, the method comprising: lifting the QC-LDPC code for maximal code length Nand maximal circulant size Zof the base matrix; generating a plurality of optimal values rfor a plurality of circulants Z, Z, . . . , Zbased on the QC-LDPC code lifted for maximal length N, 0&#x2264;r&#x2264;Z&#x2212;1; saving the generated plurality of optimal values rcorresponding to the plurality of circulants Z, Z, . . . , Zand a matrix for the QC-LDPC code lifted for maximal length Nin the memory; receiving a current circulant Zfrom the plurality of circulants Z, Z, . . . , Z; selecting a current optimal value rfrom the plurality of optimal values rstored in the memory corresponding to the current circulant Z; and lifting the base matrix based on the current optimal value r.

Method and apparatus for encoding and decoding of variable length quasi-cyclic low-density parity-check, QC-LDPC, codes

The disclosure relates to devices and methods implementing polar codes. For instance, the disclosure relates to an an encoder for encoding data, wherein the encoder comprises a processor configured to encode the data using a (n, k, d) parent polar code C into codewords c=uA subject to the constraints uV=0, wherein udenotes the data, wherein wherein Fdenotes the m-times Kronecker product of the matrix F with itself and wherein the constraint matrix V comprises in addition to the constraint matrix Vof the parent polar code the constraint matrix Vof a first helper code Cand the constraint matrix Vof a second helper code C.

Devices and methods implementing polar codes

Encoding devices and methods, arranged to execute encoding, wherein an input vector for polar encoding is computed, wherein the input vector comprises a set of information bits and a set of frozen bits, and an intermediate codeword is generated by executing a polar encoding of the input vector. Further, punctured and shortened bits are removed from the intermediate codeword, to obtain a reduced intermediate codeword, and an output codeword is generated by applying a permutation operation on the reduced intermediate codeword. A sequence of extension bits is selected from the intermediate codeword bits and information bits, and modulated symbols are generated by applying bitmapping on the output codeword and on the sequence of extension bits.

Growing community of inventors

Moscow, Russia

Vasily Stanislavovich Usatyuk