AUTOMORPHISM-BASED POLAR ENCODING AND DECODING

    公开(公告)号:WO2022174884A1

    公开(公告)日:2022-08-25

    申请号:PCT/EP2021/053710

    申请日:2021-02-16

    Abstract: The present disclosure relates generally to the field of data encoding and decoding, and particularly to automorphism-based polar encoding and decoding apparatuses and methods, as well as computer program products embodying the method steps in the form of computer codes. More specifically, it is proposed to design polar codes such that their frozen bits support automorphisms described by a binary upper triangular matrix having a diagonal including at least one of zeros and units. Codewords generated using these polar codes may be subsequently subjected to automorphism-based polar decoding in an efficient manner and with a lower decoding latency compared to the conventional Successive Cancellation List decoding algorithms. Furthermore, the efficiency of the automorphism-based polar decoding may be increased even more if the automorphisms are based on matrix elements arranged above the diagonal in a vicinity of a bottom right corner of the binary upper triangular matrix.

    ">

    公开(公告)号:WO2021226665A1

    公开(公告)日:2021-11-18

    申请号:PCT/AU2021/050438

    申请日:2021-05-12

    Abstract: A channel encoding method and a channel encoder are disclosed. In an example, a method of data encoding includes dividing payload data to be transmitted into a set of information vectors and multiplying each of information vectors by a kxn binary precoding matrix to obtain a corresponding input vector. The information vector includes k bits, and n is a power of 2. Additionally, n is greater than k and the kxn binary precoding matrix is configured to minimize successive cancellation decoding error probability under a constraint on a minimum distance d. The method also includes multiplying each input vector including n bits by an nxn polarization transformation matrix to obtain a corresponding codeword that has a Hamming weight of 0 or at least d. The method minimizes both successive cancellation (SC) and maximum-likelihood (ML) decoding error probabilities.

    VERTICAL LAYERED FINITE ALPHABET ITERATIVE DECODING

    公开(公告)号:WO2019028072A1

    公开(公告)日:2019-02-07

    申请号:PCT/US2018/044691

    申请日:2018-07-31

    Abstract: This invention presents a method and apparatus for vertical layered finite alphabet iterative decoding of low-density parity-check codes (LDPC) which operate on parity check matrices that consist of blocks of sub-matrices. The iterative decoding involves passing messages between variable nodes and check nodes of the Tanner graph that associated with one or more sub-matrices constitute decoding blocks, and the messages belong to a finite alphabet. Various embodiments for the method and apparatus of the invention are presented that can achieve very high throughputs with low hardware resource usage and power.

    APPARATUS AND METHODS FOR TRAINING-BASED CHANNEL CODE DESIGN

    公开(公告)号:WO2018126982A1

    公开(公告)日:2018-07-12

    申请号:PCT/CN2017/119386

    申请日:2017-12-28

    Abstract: One or more codewords are generated by encoding input bits at input bit positions onto sub-channels that are provided by a code. Each of the sub-channels has an associated reliability of correct decoding of an input bit at an input bit position. Each codeword is transmitted to a decoder, and a word based on each transmitted codeword is received at the decoder. Each received word is decoded, and the reliabilities of the sub-channels are determined based on decoded bits and known input bits from which each codeword was generated. An indication that is based on the determined reliabilities of the sub-channels, such as an indication of the determined reliabilities, is transmitted to the encoder, and may be used by the encoder in selecting the sub-channels for encoding subsequent input bits, for example.

    DETERMINING ELEMENTS OF BASE MATRICES FOR QUASI-CYCLIC LDPC CODES HAVING VARIABLE CODE LENGTHS
    9.
    发明申请
    DETERMINING ELEMENTS OF BASE MATRICES FOR QUASI-CYCLIC LDPC CODES HAVING VARIABLE CODE LENGTHS 审中-公开
    确定具有可变代码长度的准循环LDPC码的基本矩阵元素

    公开(公告)号:WO2018029616A1

    公开(公告)日:2018-02-15

    申请号:PCT/IB2017/054868

    申请日:2017-08-09

    Abstract: Encoding/decoding method comprising the derivation of the elements of base matrices for Quasi-Cyclic LDPC, codes using different lifting sizes to obtain variable code lengths. The cyclic shift values of smaller lifting sizes Z are derived from stored elements a base matrix corresponding to a maximal lifting sizes Zmax by applying right shifting (ceil(log2Z/Zmax) times) to a binary vector representation of all non- negative stored elements of the base matrix corresponding to Zmax. The right shifting operation may be applied only when the stored cyclic shift value corresponding to Zmax is larger than the smaller lifting size Z. Application to an encoder/decoder within a wireless communications network, a magnetic storage system or a solid-state drive system.

    Abstract translation: 编码/解码方法包括用于准循环LDPC的基本矩阵的元素的导出,使用不同的提升大小来获得可变代码长度的代码。 通过将右移(ceil(log2Z / Zmax)次)到所有非负存储的元素的二进制矢量表示,从存储的元素中导出对应于最大提升大小Zmax的基本矩阵的较小提升大小Z的循环移位值 基矩阵对应于Zmax。 只有当存储的对应于Zmax的循环移位值大于较小的提升尺寸Z时才可以应用右移位操作。应用于无线通信网络内的编码器/解码器,磁存储系统或固态驱动系统。

Patent Agency Ranking