A METHOD AND APPARATUS FOR WIRELESS COMMUNICATION USING POLARIZATION-BASED SIGNAL SPACE MAPPING

    公开(公告)号:WO2020200129A1

    公开(公告)日:2020-10-08

    申请号:PCT/CN2020/081902

    申请日:2020-03-28

    Abstract: A polarization stream architecture is described. A transmitter may implement a reverse polarization stream to shape a first source signal in a first signal space to a first target signal in a second signal space. The reverse polarization stream is implemented as a cascade of reverse polarization steps. Each reverse polarization step includes a shuffle function, a split function, a scaling function and an offset function. Machine-learning techniques may be used to implement the scaling function and the offset function. A receiver may implement a polarization stream to recover the source signal.

    APPARATUS AND METHODS OF SPECIFYING ORDERED SEQUENCES OF CODING SUB-CHANNELS

    公开(公告)号:WO2018153260A1

    公开(公告)日:2018-08-30

    申请号:PCT/CN2018/075598

    申请日:2018-02-07

    Abstract: An ordered number sequence may be determined based on an ordered sub-channel sequence specifying an order of N sub-channels that are defined by a code and that have associated reliabilities for input bits at N input bit positions. The ordered number sequence represents the ordered sub-channel sequence as a sequence of fewer than N numbers. The numbers in the ordered number sequence indicate the sub-channels, by representing numbers of the sub-channels for example, from different subsets of the N sub-channels, that appear in the order specified by the ordered sub-channel sequence. Using ordered number sequences, longer ordered sub-channel sequences could be constructed from smaller ordered sub-channel sequences, and/or sub-channels that to be selected from a longer ordered sub-channel sequence could be divided into two or more parts, with each part to be selected from shorter ordered sub-channel sequences.

    METHOD AND DEVICE FOR PARALLEL POLAR CODE ENCODING/DECODING
    4.
    发明申请
    METHOD AND DEVICE FOR PARALLEL POLAR CODE ENCODING/DECODING 审中-公开
    用于并行极化编码编码/解码的方法和装置

    公开(公告)号:WO2018059558A1

    公开(公告)日:2018-04-05

    申请号:PCT/CN2017/104550

    申请日:2017-09-29

    Abstract: Embodiments of this disclosure enhance the error detection performance of parallel polar encoding by cross-concatenating parity bits between segments of information bits transmitted over different sets of sub-channels. In one embodiment, a first segment of information bits is transmitted over a first set of sub-channels, and at least a second segment of information bits, and a masked parity bit, are transmitted over a second set of sub-channels. A value of the masked parity bit is equal to a bitwise combination of a first parity bit computed from the first segment of information bits and a second parity bit computed from the second segment of information bits. The bitwise combination may be a bitwise AND, a bitwise OR, or a bitwise XOR of the respective parity bits.

    Abstract translation: 本公开的实施例通过在通过不同子集信道集传输的信息比特段之间交叉连接奇偶校验比特来增强并行极坐标编码的差错检测性能。 在一个实施例中,通过第一组子信道传输第一信息比特段,并且通过第二组子信道传输至少第二信息比特段和掩蔽奇偶校验比特。 掩蔽奇偶校验位的值等于从第一信息位段计算出的第一奇偶校验位和从第二信息位段计算出的第二奇偶校验位的按位组合。 按位组合可以是相应奇偶校验位的按位与,按位或或按位XOR。

    CONCATENATED AND SLIDING-WINDOW POLAR CODING
    5.
    发明申请
    CONCATENATED AND SLIDING-WINDOW POLAR CODING 审中-公开
    连续和滑动窗口极化编码

    公开(公告)号:WO2017125046A1

    公开(公告)日:2017-07-27

    申请号:PCT/CN2017/071735

    申请日:2017-01-19

    Abstract: Methods for encoding and decoding Polar codes are provided, together with apparatuses for performing the methods. An encoding method combines first and second sequences of information bits and CRC bits and a plurality of frozen bits into an input vector. The input vector is multiplied by a generator matrix for a Polar code to produce a concatenated codeword. A decoding method receives such a codeword and produces a decoded vector by generating successive levels of a decision tree. For a first number of levels of the decision tree, paths beyond a first maximum number of most probable paths are discarded. For a second number of levels of the decision tree, paths beyond a second maximum number of most probable paths are discarded. In some cases, the decoding method may have improved performance compared to some decoding methods for non-concatenated codewords.

    Abstract translation: 提供了用于编码和解码极性码的方法,以及用于执行这些方法的设备。 编码方法将信息比特的第一和第二序列以及CRC比特和多个冻结比特组合成输入向量。 输入向量乘以Polar码的生成矩阵以产生级联码字。 解码方法接收这样的码字并通过产生连续的决策树级别来产生解码的矢量。 对于决策树的第一级数目,丢弃超出第一最大数目的最可能路径的路径。 对于决策树的第二级数目,丢弃超出第二最大数目的最可能路径的路径。 在一些情况下,解码方法与用于非级联码字的一些解码方法相比可以具有改进的性能。

    METHOD AND APPARATUS FOR PARALLELIZED QRD-BASED OPERATIONS OVER MULTIPLE EXECUTION UNIT PROCESSING SYSTEM
    6.
    发明申请
    METHOD AND APPARATUS FOR PARALLELIZED QRD-BASED OPERATIONS OVER MULTIPLE EXECUTION UNIT PROCESSING SYSTEM 审中-公开
    多进行单元处理系统中基于QRD的并行操作的方法与装置

    公开(公告)号:WO2016119519A1

    公开(公告)日:2016-08-04

    申请号:PCT/CN2015/096562

    申请日:2015-12-07

    CPC classification number: G06F17/16

    Abstract: Methods and apparatuses relating to QR decomposition using a multiple execution unit processing system are provided. A method includes receiving input values at the processing system and generating a first set of values based on the input values, where at least some of the first values are computed in parallel. A second set of values are generated recursively based on values in the first set. A third set of values are generated based on values in the second set, where at least some of the values in the third set are computed in parallel. The recursive component may be simplified to consist of one or more low latency operations. The processing performance of operations relating to QR decomposition may therefore be improved by using the parallelism available in multiple execution unit systems.

    Abstract translation: 提供了使用多执行单元处理系统与QR分解有关的方法和装置。 一种方法包括在处理系统处接收输入值并基于输入值生成第一组值,其中并行计算至少一些第一值。 第二组值是基于第一组中的值递归生成的。 基于第二组中的值生成第三组值,其中并行计算第三组中的至少一些值。 递归组件可以被简化为由一个或多个低延迟操作组成。 因此,可以通过使用多个执行单元系统中可用的并行性来改进与QR分解相关的操作的处理性能。

    SYSTEM AND METHOD FOR AN ASYNCHRONOUS PROCESSOR WITH ASYNCHRONOUS INSTRUCTION FETCH, DECODE, AND ISSUE
    7.
    发明申请
    SYSTEM AND METHOD FOR AN ASYNCHRONOUS PROCESSOR WITH ASYNCHRONOUS INSTRUCTION FETCH, DECODE, AND ISSUE 审中-公开
    具有异步指令的异步处理器的系统和方法,解码和发布

    公开(公告)号:WO2015032358A1

    公开(公告)日:2015-03-12

    申请号:PCT/CN2014/086115

    申请日:2014-09-09

    CPC classification number: G06F9/38 G06F9/3802 G06F9/3836 G06F9/3869 G06F9/3871

    Abstract: Embodiments are provided for an asynchronous processor with an asynchronous Instruction fetch, decode, and issue unit. The asynchronous processor comprises an execution unit for asynchronous execution of a plurality of instructions, and a fetch, decode and issue unit configured for asynchronous decoding of the instructions. The fetch, decode and issue unit comprises a plurality of resources supporting functions of the fetch, decode and issue unit, and a plurality of decoders arranged in a predefined order for passing a plurality of tokens. The tokens control access of the decoders to the resources and allow the decoders exclusive access to the resources. The fetch, decode and issue unit also comprises an issuer unit for issuing the instructions from the decoders to the execution unit

    Abstract translation: 为具有异步指令提取,解码和发布单元的异步处理器提供实施例。 异步处理器包括用于异步执行多个指令的执行单元,以及被配置用于对指令进行异步解码的读取,解码和发布单元。 获取,解码和发布单元包括支持获取,解码和发布单元的功能的多个资源,以及以预定顺序排列以传送多个令牌的多个解码器。 令牌控制解码器对资源的访问,并允许解码器独占访问资源。 提取,解码和发布单元还包括用于从解码器向执行单元发出指令的发行者单元

    INTERFACING WITH CODED INFERENCE NETWORKS
    8.
    发明申请

    公开(公告)号:WO2023070655A1

    公开(公告)日:2023-05-04

    申请号:PCT/CN2021/127892

    申请日:2021-11-01

    Abstract: Some embodiments of the present disclosure relate to inferencing using a trained deep neural network. Inferencing may, reasonably, be expected to be a mainstream application of 6G wireless networks. Agile, robust and accurate inferencing is important for the success of AI applications. Aspects of the present application relate to introducing coding theory into inferencing in a distributed manner. It may be shown that redundant wireless bandwidths and edge units help to ensure agility, robustness and accuracy in coded inferencing networks.

    METHOD, SYSTEM, AND APPARATUS FOR A SEGMENTED POLARIZATION-ADJUSTED CONVOLUTIONAL (PAC) CODE

    公开(公告)号:WO2021185380A1

    公开(公告)日:2021-09-23

    申请号:PCT/CN2021/082154

    申请日:2021-03-22

    Abstract: A codeword is generated based on a segmentation transform and a Polarization-Assisted Convolutional (PAC) code that includes an outer convolutional code and a polar code, and based on separate encoding of respective different segments of convolutionally encoded input bits according to the polar code. Each segment of the respective segments includes multiple bits of the convolutionally encoded input bits for which the separate encoding of the segment is independent of the separate encoding of other segments. Separate decoding may be applied to segments of such a codeword to decode convolutionally encoded input bits corresponding to the separately encoded segments of the convolutionally encoded input bits.

    METHOD AND APPARATUS FOR ENCODING DATA USING A POLAR CODE
    10.
    发明申请
    METHOD AND APPARATUS FOR ENCODING DATA USING A POLAR CODE 审中-公开
    使用极坐标编码来编码数据的方法和设备

    公开(公告)号:WO2018050063A1

    公开(公告)日:2018-03-22

    申请号:PCT/CN2017/101531

    申请日:2017-09-13

    Abstract: Embodiment techniques map parity bits to sub-channels based on their row weights. The row weight for a sub-channel may be viewed as the number of "ones" in the corresponding row of the Kronecker matrix or as a power of 2 with the exponent (i.e. the hamming weight) being the number of "ones" in the binary representation of the sub-channel index (further described below). In one embodiment, candidate sub-channels that have certain row weight values are reserved for parity bit (s). Thereafter, K information bits may be mapped to the K most reliable remaining sub-channels, and a number of frozen bits (e.g. N-K) may be mapped to the least reliable remaining sub-channels. Parity bits may then mapped to the candidate sub-channels, and parity bit values are determined based on a function of the information bits.

    Abstract translation: 实施例技术基于其行权重将奇偶位映射到子信道。 子频道的行权重可以被视为“1”的数量。 在Kronecker矩阵的相应行中,或者作为指数(即汉明重量)为“1”的数目的2的幂。 在子信道索引的二进制表示中(下面进一步描述)。 在一个实施例中,具有特定行权值的候选子信道被保留用于奇偶校验位。 此后,可以将K个信息比特映射到K个最可靠的剩余子信道,并且可以将多个冻结比特(例如N-K)映射到最不可靠的剩余子信道。 奇偶比特然后可以映射到候选子信道,并且基于信息比特的函数来确定奇偶比特值。

Patent Agency Ranking