System and method for accelerating a maximum likelihood decoder in a MIMO system
    1.
    发明授权
    System and method for accelerating a maximum likelihood decoder in a MIMO system 有权
    用于加速MIMO系统中的最大似然解码器的系统和方法

    公开(公告)号:US09391738B2

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

    申请号:US14168397

    申请日:2014-01-30

    Abstract: A decoder to search a tree graph to decode a received signal. The tree graph may have a plurality of levels, each level having a plurality of nodes and each node representing a different value of an element of a candidate transmit signal corresponding to the received signal. The decoder may include a first module to execute a branch prediction at each branch node to select one of a plurality of candidate nodes stemming from the branch node that has a smallest distance increment, and a second module, running in parallel to the first module, to evaluate the branch prediction made by the first module at each branch node by computing an accumulated distance of the selected node. If the accumulated distance of the selected node is greater than or equal to a search radius, the first module may override the branch prediction and select an alternative candidate node.

    Abstract translation: 解码器,用于搜索树形图以解码所接收的信号。 树图可以具有多个级别,每个级别具有多个节点,并且每个节点表示对应于接收到的信号的候选发射信号的元素的不同值。 解码器可以包括第一模块,用于在每个分支节点处执行分支预测,以选择源自具有最小距离增量的分支节点的多个候选节点中的一个;以及与第一模块并行运行的第二模块, 通过计算所选节点的累积距离来评估由每个分支节点处的第一模块进行的分支预测。 如果所选节点的累积距离大于或等于搜索半径,则第一模块可以覆盖分支预测并选择替代候选节点。

    System and method for using low complexity maximum likelihood decoder in a mimo decoder

    公开(公告)号:US12057986B2

    公开(公告)日:2024-08-06

    申请号:US17679944

    申请日:2022-02-24

    CPC classification number: H04L27/3405 H04L1/0054 H04L25/061

    Abstract: A method and system for performing quadrature amplitude modulation (QAM) decoding of a received signal includes finding for each layer a region in a first constellation diagram of the received signal, the region including a portion of the first constellation diagram, the portion having the same size of a second constellation diagram, and a first constellation order of the received signal is higher than a second constellation order of the second constellation diagram; and, for each layer: finding a first portion of bits based on bits that are constant among constellation points located in the region of the layer; decoding the received signal using a QAM decoder having the second constellation order to obtain a second portion of bits; adjusting the second portion of bits based on the region of the layer; and merging the first portion of bits with the second portion of bits to obtain a decoded symbol.

    System and method for blind detection of transmission parameters of an interfering cell

    公开(公告)号:US10743201B2

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

    申请号:US15414652

    申请日:2017-01-25

    Abstract: Joint demodulation of a desired transmission and an interfering transmission received from an interfering cell with an unknown combination of transmission parameters is performed. For each subcarrier, an exhaustive search for the serving cell symbols and projection for the interfering cell symbols is performed for tested hypotheses of the interfering cell, by minimizing a whitened noise parabola for each combination of searched hypothesis and hyper constellation point of the serving cell. A constellation point for the interfering cell that is closest to the minimum point of the parabola is selected, where coefficients of the parabola are calculated once for each subgroup of four modulation types of the interfering cell. A measure of likelihood for each of the tested hypotheses is calculated. A cumulative measure of likelihood for each of the tested hypotheses is calculated, and the most likely hypothesis is selected based on the cumulative measure of likelihood.

    System and method for zero contention memory bank access in a reorder stage in mixed radix discrete fourier transform
    6.
    发明授权
    System and method for zero contention memory bank access in a reorder stage in mixed radix discrete fourier transform 有权
    用于混合基数离散傅立叶变换的重排序阶段的零竞争存储器组访问的系统和方法

    公开(公告)号:US09459812B2

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

    申请号:US14612742

    申请日:2015-02-03

    CPC classification number: G06F3/0665 G06F3/0619 G06F3/0689 G06F17/142

    Abstract: Device and method for writing Discrete Fourier transform (DFT) samples in a memory in a reorder stage, the memory includes memory banks, each having a dedicated address generator. The method includes: dividing the DFT samples into R(reorder) equally sized segments, where R(reorder) is the radix value of the reorder stage of the DFT; checking whether a number of butterfly computations per cycle of a reorder stage of the DFT operation times R(reorder), denoted as P, is not larger than the number of segments; if P is larger than the number of segments: further dividing the segments or sub-segments into X equally sized sub-segments, where X is a radix value of a next stage of the DFT operation until P is not larger than the number of sub-segments; and mapping the sub-segments to the memory, each in a separate row, with an offset that includes segment offset and sub-segment offset.

    Abstract translation: 在重排阶段的存储器中将离散傅里叶变换(DFT)采样写入的装置和方法,所述存储器包括存储体,每个具有专用地址生成器。 该方法包括:将DFT样本划分为R(重排序)等大小的段,其中R(重排序)是DFT的重排阶段的基数; 检查DFT操作的重新排序阶段的每个周期的若干蝶式计算是否表示为P,不大于段数; 如果P大于段数:进一步将段或子段划分为X个相等大小的子段,其中X是DFT操作的下一级的基数,直到P不大于子数 -segments; 并将子段映射到存储器,每个在单独的行中,具有包括段偏移和子段偏移的偏移。

    System and method for radio cell synchronization

    公开(公告)号:US10512048B2

    公开(公告)日:2019-12-17

    申请号:US15657586

    申请日:2017-07-24

    Abstract: A system and method for cell synchronization suitable for a wireless signal including substantially identical synchronization signals that repeat in predetermined time intervals, the synchronization signals including a plurality of substantially identical symbols. For a plurality of candidate synchronization points: dividing the wireless signal into a plurality of signal segments, each equal or longer than the time interval, and each including a plurality of sub-segments having substantially same length as the symbol; performing symbol-length cross-correlations between an expected symbol and the sub-segments; performing segmented symbol-wise correlations between the cross-correlation results; calculating a cost function based on the results of the symbol-wise correlations; accumulating the cost functions across a plurality of signal segments; and selecting a coarse synchronization point from the plurality of candidate synchronization points based on the accumulated cost function; Estimating synchronization parameters e.g. time and frequency offset based on the selected synchronization point.

    System and method for selecting transmission parameters

    公开(公告)号:US10447353B2

    公开(公告)日:2019-10-15

    申请号:US15723219

    申请日:2017-10-03

    Abstract: A system and method for MIB estimation including generating a signal model for rank=2, based on the reference signals of a received wireless signal; converting the signal model to a four-parameter representation; determining, for values of parameters derived from the four-parameter representation, whether mutual information per bit (MIB) values depend on a single parameter or on a plurality of parameters; if the MIB values depend on the single parameter, calculating MIB values based on the single parameter; and if the MIB values depend on the plurality of parameters, calculating MIB values based on the plurality of parameters. Calculating MIB values based on the single parameter, determining, whether MIB values depend on a single parameter or on a plurality of parameters and, calculating MIB values based on the plurality of parameters, are performed using a machine learning algorithm.

    System and method for tree-search enhancement by metric prediction based on incomplete paths in soft output MIMO decoder
    9.
    发明授权
    System and method for tree-search enhancement by metric prediction based on incomplete paths in soft output MIMO decoder 有权
    基于软输出MIMO解码器中不完整路径的度量预测树搜索增强的系统和方法

    公开(公告)号:US09407475B2

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

    申请号:US14341869

    申请日:2014-07-28

    CPC classification number: H04L25/03242 H04B7/02 H04L25/03191 H04L2025/03426

    Abstract: A method and system for soft output multiple-input-multiple-output (MIMO) decoding may include generating a tree-graph based on: MIMO rank, number of bits per layer, and type of modulation, wherein the tree-graph comprises a root node, leaf nodes, nodes, and branches connecting the nodes; performing sphere decoding by determining a radius covering a subset of nodes within said tree-graph; managing, based on the sphere decoding, tables comprising metrics and counter metrics usable for log likelihood ratio (LLR) generation; predicting, based on a specified prediction scheme, counter metrics for paths in the tree-graph that comprise nodes and branches out of the determined radius; and updating the tables comprising the counter metrics with the predicted counter metric, in a case that the predicted counter metrics are better in maximum likelihood terms than the determined counter metrics.

    Abstract translation: 用于软输出多输入多输出(MIMO)解码的方法和系统可以包括:基于MIMO秩,每层位数和调制类型生成树图,其中树图包括根 节点,叶节点,节点和连接节点的分支; 通过确定覆盖所述树形图中的节点子集的半径来执行球体解码; 基于球体解码管理包括可用于对数似然比(LLR)生成的度量和计数度量的表; 基于指定的预测方案来预测包括确定半径之外的节点和分支的树图中的路径的计数度量; 以及在所述预测计数器度量与所确定的计数器度量相比最大似然项更好的情况下,更新包括具有所述预测计数器度量的所述计数器度量的表。

    SYSTEM AND METHOD FOR ACCELERATING A MAXIMUM LIKELIHOOD DECODER IN A MIMO SYSTEM
    10.
    发明申请
    SYSTEM AND METHOD FOR ACCELERATING A MAXIMUM LIKELIHOOD DECODER IN A MIMO SYSTEM 有权
    用于在MIMO系统中加速最大似然解码器的系统和方法

    公开(公告)号:US20150155971A1

    公开(公告)日:2015-06-04

    申请号:US14168397

    申请日:2014-01-30

    Abstract: A decoder to search a tree graph to decode a received signal y. The tree graph may have a plurality of levels, each level having a plurality of nodes and each node representing a different value of an element of a candidate transmit signal s corresponding to the received signal y. The decoder may include a first module to execute a branch prediction at each branch node of the tree graph to select one of a plurality of candidate nodes stemming from the branch node that has a smallest distance increment. The decoder may include a second module, running in parallel to the first module, to evaluate the branch prediction made by the first module at each branch node by computing an accumulated distance of the selected node. If the accumulated distance of the selected node is greater than or equal to a search radius, the first module may override the branch prediction and select an alternative candidate node.

    Abstract translation: 解码器,用于搜索树形图以解码所接收的信号y。 树图可以具有多个级别,每个级别具有多个节点,并且每个节点表示与接收信号y对应的候选发射信号s的元素的不同值。 解码器可以包括第一模块,以在树形图的每个分支节点处执行分支预测,以选择源自具有最小距离增量的分支节点的多个候选节点之一。 解码器可以包括与第一模块并行运行的第二模块,以通过计算所选节点的累积距离来评估由每个分支节点处的第一模块进行的分支预测。 如果所选节点的累积距离大于或等于搜索半径,则第一模块可以覆盖分支预测并选择替代候选节点。

Patent Agency Ranking