User-specific scrambling for polar codes

    公开(公告)号:US11038624B2

    公开(公告)日:2021-06-15

    申请号:US16764957

    申请日:2017-11-17

    IPC分类号: H04L1/00

    摘要: A transmitting device may identify a set of bit locations of a polar code for encoding an input vector based at least in part on a reliability order of the bit locations, where the input vector includes a set of payload bits. The transmitting device may map bits of the input vector to respective bit locations of the identified set of bit locations and may apply a masking operation to a subset of bits of the input vector that is mapped to a most reliable subset of the set of bit locations. The transmitting device may perform an encoding operation according to the mapped input vector to generate a codeword for transmission. A receiving device may perform complementary operations to obtain the payload bits of the input vector. Based on the described techniques, a false alarm rate for the receiving device may be suppressed.

    DECODING OF LINEAR CODES WITH PARITY CHECK MATRIX
    3.
    发明申请
    DECODING OF LINEAR CODES WITH PARITY CHECK MATRIX 有权
    用奇偶校验矩阵解码线性代码

    公开(公告)号:US20100017676A1

    公开(公告)日:2010-01-21

    申请号:US12503607

    申请日:2009-07-15

    IPC分类号: H03M13/05 G06F11/10

    CPC分类号: H03M13/1171 H04L1/0057

    摘要: A decoding method and system for stochastic decoding of linear codes with the parity check matrix comprising elements of a Galois field is provided. Each encoded sample of a set of encoded samples is first scaled by a scaling factor proportional to a noise level of the set of encoded samples. Each of the scaled encoded samples is then converted into a corresponding probability. For each probability a corresponding probability message is the generated by encoding each probability as a sequence of symbols or bits. Each probability message is then provided to a respective variable node of a logic circuitry for stochastic decoding. The logic circuitry represents a factor graph of the parity check matrix of the linear code. Using the logic circuitry each probability message is passed through the factor graph by performing for each received symbol at the variable nodes the equality function, at the permutation nodes one of multiplication and division, and at the parity check nodes the parity check function, wherein each of the variable nodes provides an output symbol in dependence upon each received symbol.

    摘要翻译: 提供了一种具有包括伽罗瓦域元素的奇偶校验矩阵的线性码随机解码的解码方法和系统。 一组编码样本的每个编码样本首先按照与编码样本集合的噪声电平成比例的缩放因子来缩放。 然后将每个经缩放的编码样本转换成相应的概率。 对于每个概率,相应的概率消息是通过将每个概率编码为符号或比特的序列而生成的。 然后将每个概率消息提供给用于随机解码的逻辑电路的相应可变节点。 逻辑电路表示线性码的奇偶校验矩阵的因子图。 使用逻辑电路,通过对可变节点处的每个接收到的符号执行相等函数,在置换节点乘法和除法之一以及奇偶校验节点处执行奇偶校验功能,将每个概率消息传递通过因子图,其中每个 可变节点根据每个接收的符号提供输出符号。

    Methods and Systems for Decoding Polar Codes
    5.
    发明申请
    Methods and Systems for Decoding Polar Codes 有权
    用于解码极地码的方法和系统

    公开(公告)号:US20130117344A1

    公开(公告)日:2013-05-09

    申请号:US13671617

    申请日:2012-11-08

    IPC分类号: G06F17/10

    摘要: Coding within noisy communications channels is essential but a theoretical maximum rate defines the rate at which information can be reliably transmitted on this noisy channel. Capacity-achieving codes with an explicit construction eluded researchers until polar codes were proposed. However, whilst asymptotically reaching channel capacity these require increasing code lengths, and hence increasingly complex hardware implementations. It would be beneficial to address architectures and decoding processes to reduce polar code decoder complexity both in terms of the number of processing elements required, but also the number of memory elements and the number of steps required to decode a codeword. Beneficially architectures and design methodologies established by the inventors address such issues whilst reducing overall complexity as well as providing methodologies for adjusting decoder design based upon requirements including, but not limited to, cost (e.g. through die area) and speed (e.g. through latency, number of cycles, number of elements etc).

    摘要翻译: 噪声通信信道中的编码是必不可少的,但是理论上的最大速率定义了在这个噪声信道上可靠地发送信息的速率。 在提出极性代码之前,具有明确结构的能力实现代码不包括研究人员。 然而,虽然渐近地达到信道容量,但这些需要增加代码长度,并因此增加复杂的硬件实现。 解决架构和解码过程将有利于在所需的处理元件的数量方面降低极性码解码器的复杂性,而且还要解码码字所需的存储器元件的数量和步骤的数量。 本发明人建立的有利的架构和设计方法解决了这样的问题,同时降低了整体的复杂性,并且提供了基于需求来调整解码器设计的方法,包括但不限于成本(例如,通过管芯面积)和速度(例如通过延迟,数量 周期数,元素数等)。

    Polar coding techniques for blind detection of different payload sizes

    公开(公告)号:US11228394B2

    公开(公告)日:2022-01-18

    申请号:US16765066

    申请日:2018-09-24

    IPC分类号: H04L1/00 H03M13/45

    摘要: Methods, systems, and devices for wireless communications are described. In some systems, wireless devices may encode and decode transmissions using polar codes. A transmitting device may encode a payload based on a selected payload size. For example, the transmitting device may construct a bit vector including payload bits, parity bits, frozen bits, or some combination of these, and may modify the bits or the order of the bits based on the selected payload size. The device may generate a polar-encoded codeword based on this bit vector, and may transmit the polar-encoded codeword to a receiving device. The receiving device may blind decode the polar-encoded codeword, and may determine the correct payload size based on the decoded bit vector. For example, the device may perform decoding or may check decoded bits based on a payload size hypothesis, where the decoding may fail for any incorrect payload size hypothesis.

    METHODS AND SYSTEMS FOR DECODING POLAR CODES
    8.
    发明申请
    METHODS AND SYSTEMS FOR DECODING POLAR CODES 审中-公开
    用于解码极性代码的方法和系统

    公开(公告)号:US20160056843A1

    公开(公告)日:2016-02-25

    申请号:US14930879

    申请日:2015-11-03

    摘要: Coding within noisy communications channels is essential but a theoretical maximum rate defines the rate at which information can be reliably transmitted on this noisy channel. Capacity-achieving codes with an explicit construction eluded researchers until polar codes were proposed. However, whilst asymptotically reaching channel capacity these require increasing code lengths, and hence increasingly complex hardware implementations. It would be beneficial to address architectures and decoding processes to reduce polar code decoder complexity both in terms of the number of processing elements required, but also the number of memory elements and the number of steps required to decode a codeword. Beneficially architectures and design methodologies established by the inventors address such issues whilst reducing overall complexity as well as providing methodologies for adjusting decoder design based upon requirements including, but not limited to, cost (e.g. through die area) and speed (e.g. through latency, number of cycles, number of elements etc).

    摘要翻译: 噪声通信信道中的编码是必不可少的,但是理论上的最大速率定义了在这个噪声信道上可靠地发送信息的速率。 在提出极性代码之前,具有明确结构的能力实现代码不包括研究人员。 然而,虽然渐近地达到信道容量,但这些需要增加代码长度,并因此增加复杂的硬件实现。 解决架构和解码过程将有利于在所需的处理元件的数量方面降低极性码解码器的复杂性,而且还要解码码字所需的存储器元件的数量和步骤的数量。 本发明人建立的有利的架构和设计方法解决了这样的问题,同时降低了整体的复杂性,并且提供了基于需求来调整解码器设计的方法,包括但不限于成本(例如,通过管芯面积)和速度(例如通过延迟,数量 周期数,元素数等)。

    CIRCULAR BUFFER BASED HYBRID AUTOMATIC RETRANSMISSION REQUEST FOR POLAR CODES

    公开(公告)号:US20200374034A1

    公开(公告)日:2020-11-26

    申请号:US16759255

    申请日:2018-11-20

    IPC分类号: H04L1/00 H04L1/08 H04L1/18

    摘要: Certain aspects of the present disclosure generally relate to wireless communications and, more particularly, to methods and apparatus for rate-matching a stream of bits encoded using polar codes. An exemplary method generally includes determining a target coding rate, RT, for transmitting a group of K information bits, based on a first coding rate, R1, corresponding to a first target block error rate (BLER) for a first transmission of a first redundancy version (RV) of the packet and a second coding rate, R2, corresponding to a second target BLER for a last transmission of a last RV of the packet; determining a circular buffer size, N, of a circular buffer for use in transmitting the first RV and the last RV of the packet; generating encoded information bits from the K information bits using a polar code having a mother code size of N; writing the encoded information bits to the circular buffer; determining a maximum number of retransmissions, based on a latency requirement for the packet; generating different RVs from the encoded information bits in the circular buffer, each RV based on a corresponding target BLER; and transmitting the first RV via a wireless medium.