APPARATUS AND METHOD FOR GENERATING A FROZEN SET ASSOCIATED WITH A POLAR CODE

    公开(公告)号:US20240243759A1

    公开(公告)日:2024-07-18

    申请号:US18613097

    申请日:2024-03-21

    CPC classification number: H03M13/616 H03M13/611 H03M13/612

    Abstract: An apparatus for generating a frozen set associated with a polar code of length ‘N’ and dimension ‘K’ comprises a processing unit configured to take in input the polar code length ‘N’, the dimension ‘K’, and a profile of a structure of a block lower triangular affine (BLTA) group. The BLTA group structure is associated with an affine transformation matrix of size ‘n×n’ and the profile is an ordered set of a plurality of values corresponding to block sizes of blocks. The blocks are sub-matrices of the affine transformation matrix with all the diagonals of blocks in the same order as the ordered block sizes, forming the diagonal of the affine transformation matrix, each of the block sizes is such that ‘n’ is equal to the sum of block sizes and ‘n’ is equal to log2(N). The processing unit generates the frozen set.

    Automorphism-based polar encoding and decoding

    公开(公告)号:US12199635B2

    公开(公告)日:2025-01-14

    申请号:US18450203

    申请日:2023-08-15

    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, polar codes are designed 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.

Patent Agency Ranking