Huawei Technologies Co., Limited

Nikita Andreevich Polianskii

Vasily Stanislavovich Usatyuk

Mikhail Sergeevich Kamenev

Ilya Viktorovich Vorobyev

Jian Wang

German Viktorovich Svistunov

Zukang Shen

Yunfei Qiao

Ying Chen

Hejia Luo

Gongzheng Zhang

Huazi Zhang

Yinggang Du

Lingchen Huang

Shengchen Dai

Chen Xu

Yourui Huangfu

Vladimir Anatolyevich Gaev

Yulia Borisovna Kameneva

Rong Li

Jian Jun Wang

This application relates to the field of wireless communications technologies, and discloses an encoding method and apparatus, to improve accuracy of reliability calculation and ordering for polarized channels. The method includes: obtaining a first sequence used to encode K to-be-encoded bits, where the first sequence includes sequence numbers of N polarized channels, the first sequence is same as a second sequence or a subset of the second sequence, the second sequence comprises sequence numbers of Npolarized channels, and the second sequence is the sequence shown in Sequence Q11 or Table Q11, K is a positive integer, N is a positive integer power of 2, n is equal to or greater than 5, K≤N, N=1024; selecting sequence numbers of K polarized channels from the first sequence; and performing polar code encoding on K the to-be-encoded bits based on the selected sequence numbers of the K polarized channels.

Polar code encoding method and apparatus in wireless communications

This application relates to the field of wireless communications technologies, and discloses an encoding method and apparatus, to improve accuracy of reliability calculation and ordering for polarized channels. The method includes: obtaining a first sequence used to encode K to-be-encoded bits, where the first sequence includes sequence numbers of N polarized channels, the first sequence is same as a second sequence or a subset of the second sequence, the second sequence comprises sequence numbers of Npolarized channels, and the second sequence is the sequence shown in Sequence Q11 or Table Q11, K is a positive integer, N is a positive integer power of 2, n is equal to or greater than 5, K&#x2264;N, N=1024; selecting sequence numbers of K polarized channels from the first sequence; and performing polar code encoding on K the to-be-encoded bits based on the selected sequence numbers of the K polarized channels.

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

Growing community of inventors

Moscow, Russia

Nikita Andreevich Polianskii