Dividing, scheduling, and parallel processing compiled sub-tasks on an asynchronous multi-core processor
    21.
    发明授权
    Dividing, scheduling, and parallel processing compiled sub-tasks on an asynchronous multi-core processor 有权
    在异步多核处理器上分割,调度和并行处理编译子任务

    公开(公告)号:US09400685B1

    公开(公告)日:2016-07-26

    申请号:US14610351

    申请日:2015-01-30

    申请人: Yiqun Ge Wuxian Shi

    发明人: Yiqun Ge Wuxian Shi

    摘要: An asynchronous multiple-core processor may be adapted for carrying out sets of known tasks, such as the tasks in the LAPACK and BLAS packages. Conveniently, the known tasks may be handled by the asynchronous multiple-core processor in a manner that may be considered to be more power efficient than carrying out the same known tasks on a single-core processor. Indeed, some of the power savings are realized through the use of token-based single core processors. Use of such token-based single core processors may be considered to be power efficient due to the lack of a global clock tree.

    摘要翻译: 异步多核处理器可以适于执行已知任务的集合,诸如LAPACK和BLAS包中的任务。 方便地,已知任务可以由异步多核处理器以与在单核处理器上执行相同已知任务相比更有效率的方式来处理。 实际上,通过使用基于令牌的单核处理器来实现一些功率节省。 由于缺乏全局时钟树,因此使用这种基于令牌的单核处理器可能被认为是功率有效的。

    Decoding method for tail-biting convolutional codes using a search depth viterbi algorithm
    22.
    发明授权
    Decoding method for tail-biting convolutional codes using a search depth viterbi algorithm 有权
    使用搜索深度维特比算法解码卷积码的解码方法

    公开(公告)号:US07856591B2

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

    申请号:US11687543

    申请日:2007-03-16

    IPC分类号: H03M13/03

    摘要: A method for decoding tail-biting convolutional codes. The method includes initializing a correction depth, selecting a first starting state from a set of encoding states, and initializing a metric value for the selected starting state as zero and the other states as infinity. The input bit stream is read and a Search Depth Viterbi algorithm (SDVA) is performed to determine path metrics and identify a minimum-metric path. The ending state for the minimum-metric path is determined and the output for this ending state is identified as “previous output.” A second starting state is set to the ending state of the minimum-metric path, and symbols equal to the correction depth from the previous output are read. The SDVA is performed on the second set of read symbols to generate a corrected output. A decoded output is generated by replacing symbols at the beginning of the previous output with the corrected output.

    摘要翻译: 一种用于解码尾巴卷积码的方法。 该方法包括初始化校正深度,从一组编码状态中选择第一起始状态,以及将所选择的起始状态的度量值初始化为零,将其他状态初始化为无穷大。 读取输入比特流,执行搜索深度维特比算法(SDVA)以确定路径度量并识别最小度量路径。 确定最小度量路径的结束状态,并将该结束状态的输出识别为“先前输出”。将第二起始状态设置为最小度量路径的结束状态,等于校正深度的符号 从以前的输出读取。 在第二组读符号上执行SDVA以产生校正输出。 通过使用校正输出替换先前输出开始处的符号来产生解码输出。

    BLIND CARRIER FREQUENCY OFFSET ESTIMATOR BASED ON SINGLE-OFDM-SYMBOL PN RANGING CODE IN MULTI-USER OFDMA UPLINK
    23.
    发明申请
    BLIND CARRIER FREQUENCY OFFSET ESTIMATOR BASED ON SINGLE-OFDM-SYMBOL PN RANGING CODE IN MULTI-USER OFDMA UPLINK 有权
    基于多用户OFDMA上行链路中的单OFDM符号PN范围代码的盲载波频率估计器

    公开(公告)号:US20080056116A1

    公开(公告)日:2008-03-06

    申请号:US11833157

    申请日:2007-08-02

    IPC分类号: H04J11/00 H04B7/216

    CPC分类号: H04L27/2657 H04L27/2676

    摘要: A blind carrier frequency offset estimator is based on a single-OFDM-symbol training sequence in multi-user OFDMA uplink. Through multiple access interference modeling and analysis, a virtual user is employed that occupies the all null sub-carriers. By minimizing the energy leakage on the virtual user in term of tentative frequency offsets, the estimator can approach the real frequency offset. The estimator performs only on frequency-domain, simplifies interference calculations, and lowers the rank of the matrix. An iterative computation method is used to approach the real frequency offset.

    摘要翻译: 盲载波频偏估计器基于多用户OFDMA上行链路中的单OFDM符号训练序列。 通过多址干扰建模和分析,采用占用全部空子载波的虚拟用户。 通过最小化虚拟用户在暂定频率偏移方面的能量泄漏,估计器可以接近实际频率偏移。 估计器仅在频域上执行,简化了干扰计算,并降低了矩阵的秩。 迭代计算方法用于逼近实际频偏。

    Multiple access wireless communications using a non-gaussian manifold

    公开(公告)号:US11252004B2

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

    申请号:US16834494

    申请日:2020-03-30

    摘要: A method and apparatus for multiple-access wireless transmission is disclosed. The method involves mapping a plurality of signals onto a multi-dimensional non-Gaussian source manifold, the plurality of signals including signals targeted for transmission to a plurality of receivers. The method also involves transforming the source manifold into a multi-dimensional target manifold using a polarization stream network. The method further involves generating a multiple-access transmission waveform for transmission to the plurality of receivers, the multiple-access transmission waveform being based on the target manifold.

    Concatenated and sliding-window polar coding
    26.
    发明授权

    公开(公告)号:US10673468B2

    公开(公告)日:2020-06-02

    申请号:US16253082

    申请日:2019-01-21

    申请人: Yiqun Ge Wuxian Shi

    发明人: Yiqun Ge Wuxian Shi

    摘要: Methods, apparatuses, and systems for implementing error-correction in communication systems, particularly wireless communication systems, are provided. A Polar code-based encoding method combines first and second pluralities of information bits and error-correcting code bits, and a plurality of frozen bits, into an input vector. The input vector is encoded according to a Polar code to produce a first codeword, which improves the probability of successfully transmitting and receiving the codeword over a physical channel in the communication system.

    Apparatus and methods of specifying ordered sequences of coding sub-channels

    公开(公告)号:US10608786B2

    公开(公告)日:2020-03-31

    申请号:US15889544

    申请日:2018-02-06

    IPC分类号: H04L1/00 H03M13/13 H03M13/03

    摘要: 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.

    Signature-enabled polar encoder and decoder

    公开(公告)号:US10581462B2

    公开(公告)日:2020-03-03

    申请号:US15364521

    申请日:2016-11-30

    申请人: Yiqun Ge Wuxian Shi

    发明人: Yiqun Ge Wuxian Shi

    摘要: A signature-enabled Polar code encoder and decoder are provided. Signature bits are inserted in some unreliable bit positions. Different signature bits are inserted for different receivers. For a given codeword, only the receiver with knowledge of the signature can decode the codeword. Cyclic redundancy check (CRC) bits may be included in the input vector to assist in decoding.

    Systems and methods for rate matching via a heterogeneous kernel when using general polar codes

    公开(公告)号:US10579452B2

    公开(公告)日:2020-03-03

    申请号:US15607593

    申请日:2017-05-29

    摘要: Systems and methods are disclosed for performing rate matching when using general polar codes. In one embodiment, a method of generating a codeword includes receiving bits at a polar encoder and encoding the bits using polar encoder kernels. The polar encoder kernels include a first kernel and a second kernel. The first kernel receives a set of input q-ary symbols and modifies the set of input q-ary symbols according to a first kernel generator matrix to produce a set of output q-ary symbols. The second kernel receives a set of input l-ary symbols, where l does not equal q, and modifies the set of input l-ary symbols according to a second kernel generator matrix to produce a set of output l-ary symbols. For example, the first kernel may be a binary kernel and the second kernel may be a Reed-Solomon (RS) based kernel.

    Systems and methods for piece-wise rate matching when using polar codes

    公开(公告)号:US10567011B2

    公开(公告)日:2020-02-18

    申请号:US15607591

    申请日:2017-05-29

    IPC分类号: H03M13/00 H04L1/00

    摘要: Systems and methods are disclosed that relate to performing rate matching when using polar codes. In one embodiment, a plurality of bits are received at a polar encoder. A value is obtained that corresponds to at least one of: a coding rate to be used to transmit the plurality of bits, and a number of coded bits to be used to transmit the plurality of bits. It is determined which range of values the value falls within, and an information sequence is obtained that corresponds to the range the value falls within. The plurality of bits are mapped to a subset of positions of an input vector according to the information sequence. The remaining positions of the input vector are set as frozen values that are known by a decoder. The input vector is then encoded in the polar encoder to generate a codeword.