POLAR CODE HYBRID AUTOMATIC REPEAT REQUEST METHOD AND APPARATUS, AND WIRELESS COMMUNICATIONS APPARATUS
    1.
    发明申请
    POLAR CODE HYBRID AUTOMATIC REPEAT REQUEST METHOD AND APPARATUS, AND WIRELESS COMMUNICATIONS APPARATUS 有权
    极性代码混合自动重复请求方法和装置以及无线通信装置

    公开(公告)号:US20170019214A1

    公开(公告)日:2017-01-19

    申请号:US15280546

    申请日:2016-09-29

    Abstract: A method includes: selecting, from M polar codes of a same code length and code rate, a polar code corresponding to an actual code rate for a first transmission, and encoding an information bit sequence by using the polar code to obtain encoded bits; and performing rate matching on the encoded bits to generate to-be-sent bits. Different from a traditional HARQ using one polar code, in this embodiment, a polar code corresponding to the actual code rate for the first transmission is selected from the M polar codes during the initial transmission, so that a different polar code can be selected adaptively according to the actual code rate for the first transmission.

    Abstract translation: 一种方法包括:从相同码长和码率的M极码中选择与第一次发送的实际码率相对应的极性码,并通过使用极性码对信息比特序列进行编码以获得编码比特; 并对编码的比特执行速率匹配以生成待发送的比特。 与使用一个极性码的传统HARQ不同,在本实施例中,在初始发送期间从M极性码中选择与第一次发送的实际码率相对应的极性码,从而可以根据 到第一次传输的实际码率。

    Decoding method and receiving apparatus in wireless communication system

    公开(公告)号:US09762352B2

    公开(公告)日:2017-09-12

    申请号:US15191533

    申请日:2016-06-24

    Abstract: A method for decoding Polar codes includes: receiving a Polar code having a length of N, and dividing the Polar code into m subcodes that are coupled to each other, each subcode has a length of N/m, and each of N and m is an integer powers of 2; calculating squared Euclidean distances of input bits in the m subcodes, to obtain minimum squared Euclidean distances of the input bits that are independent of each other; obtaining, accordingly a minimum squared Euclidean distance of input bits that are coupled to each other in the m subcodes; and obtaining input bits that are in the m subcodes and that meet the independent minimum squared Euclidean distances and the combined minimum squared Euclidean distance, and obtaining a decoding result of the Polar code with reference to relationships between the m subcodes and the Polar code.

    POLAR CODE DECODING METHOD AND DECODING APPARATUS
    5.
    发明申请
    POLAR CODE DECODING METHOD AND DECODING APPARATUS 有权
    极法码解码方法和解码器

    公开(公告)号:US20160308643A1

    公开(公告)日:2016-10-20

    申请号:US15191533

    申请日:2016-06-24

    Abstract: A method for decoding Polar codes includes: receiving a Polar code having a length of N, and dividing the Polar code into m subcodes that are coupled to each other, each subcode has a length of N/m, and each of N and m is an integer powers of 2; calculating squared Euclidean distances of input bits in the m subcodes, to obtain minimum squared Euclidean distances of the input bits that are independent of each other; obtaining, accordingly a minimum squared Euclidean distance of input bits that are coupled to each other in the m subcodes; and obtaining input bits that are in the m subcodes and that meet the independent minimum squared Euclidean distances and the combined minimum squared Euclidean distance, and obtaining a decoding result of the Polar code with reference to relationships between the m subcodes and the Polar code.

    Abstract translation: 一种用于解码极性码的方法包括:接收长度为N的极性码,并将极性码分成彼此耦合的m个子码,每个子码的长度为N / m,N和m中的每一个为 整数幂为2; 计算m个子码中输入比特的平方欧几里德距离,以获得彼此独立的输入比特的最小平方欧几里德距离; 因此,获得在m个子码中彼此耦合的输入比特的最小平方欧几里德距离; 并获得在m个子码中并且满足独立的最小平方欧几里德距离和组合的最小平方欧几里得距离的输入比特,并且参考m个子码和极地码之间的关系获得极地码的解码结果。

Patent Agency Ranking