公开(公告)号：US20150222457A1

公开(公告)日：2015-08-06

申请号：US14341869

申请日：2014-07-28

Applicant: Ceva D.S.P. Ltd.

Inventor： Zeev KAPLAN ,  Noam Dvoretzki ,  Eitan Hai

IPC: H04L25/03 ,  H04B7/02

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）生成的度量和计数度量的表; 基于指定的预测方案来预测包括确定半径之外的节点和分支的树图中的路径的计数度量; 以及在所述预测计数器度量与所确定的计数器度量相比最大似然项更好的情况下，更新包括具有所述预测计数器度量的所述计数器度量的表。

公开(公告)号：US09459812B2

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

申请号：US14612742

申请日：2015-02-03

Applicant: Ceva D.S.P. Ltd.

Inventor： Noam Dvoretzki ,  Zeev Kaplan

IPC: G06F12/00 ,  G06F3/06 ,  G06F17/14

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; 并将子段映射到存储器，每个在单独的行中，具有包括段偏移和子段偏移的偏移。

公开(公告)号：US10402196B2

公开(公告)日：2019-09-03

申请号：US14708767

申请日：2015-05-11

Applicant: Ceva D.S.P. Ltd.

Inventor： Roni M. Sadeh ,  Noam Dvoretzki

IPC: G06F9/30

Abstract: A logic circuit in a processor including a plurality of input registers, each for storing a vector containing data elements, a coefficient register for storing a vector containing N coefficients, an output register for storing a result vector, and an arithmetic unit configured to: obtain a pattern for selecting N data elements from the plurality of input registers, select a plurality of groups of N data elements from the plurality of input registers in parallel, wherein each group is selected in accordance with the pattern, and wherein each group is shifted with respect to a previous selected group, perform an arithmetic operation between each of the selected groups and the coefficients in parallel, and store results of the arithmetic operations in the output register.

公开(公告)号：US09391738B2

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

申请号：US14168397

申请日：2014-01-30

Applicant: Ceva D.S.P. Ltd.

Inventor： Noam Dvoretzki ,  Zeev Kaplan ,  Jeffrey Allan (Alon) Jacob (Yaakov)

IPC: H04L27/06 ,  H04L1/00 ,  H04B7/04 ,  H04B7/08 ,  H04L25/03

CPC classification number: H04L1/0054 ,  H04B7/0413 ,  H04B7/0837 ,  H04L1/0047 ,  H04L25/03242 ,  H04L25/03891 ,  H04L2025/03426

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

公开(公告)号：US09407475B2

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

申请号：US14341869

申请日：2014-07-28

Applicant: Ceva D.S.P. Ltd.

Inventor： Zeev Kaplan ,  Noam Dvoretzki ,  Eitan Hai

IPC: H04L27/06 ,  H04L25/03 ,  H04B7/02

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）生成的度量和计数度量的表; 基于指定的预测方案来预测包括确定半径之外的节点和分支的树图中的路径的计数度量; 以及在所述预测计数器度量与所确定的计数器度量相比最大似然项更好的情况下，更新包括具有所述预测计数器度量的所述计数器度量的表。