利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

30 条记录 (耗时 0.024 秒)

    Method for constructing large-girth quasi-cyclic low-density parity-check codes
    3.
    发明申请
    Method for constructing large-girth quasi-cyclic low-density parity-check codes 有权
    构建大环准循环低密度奇偶校验码的方法

    公开(公告)号：US20100058139A1

    公开(公告)日：2010-03-04

    申请号：US12199512

    申请日：2008-08-27

    申请人： Yige Wang ,  Jonathan S. Yedidia ,  Stark C. Draper

    发明人： Yige Wang ,  Jonathan S. Yedidia ,  Stark C. Draper

    IPC分类号： H03M13/11 ,  G06F11/10

    CPC分类号： H03M13/116 ,  H03M13/033

    摘要： A method constructs a code, wherein the code is a large-girth quasi-cyclic low-density parity-check code. A base matrix is selected for the code. A cost matrix corresponding to the base matrix is determined. A single element in the base is changed repeatedly maximize a reduction in cost. A parity check matrix is constructing for the code from the base matrix when the cost is zero, and an information block is encoded as a code word using the parity check matrix in an encoder.

    摘要翻译： 一种方法构建代码，其中代码是大环准循环低密度奇偶校验码。 为代码选择基本矩阵。 确定与基本矩阵相对应的成本矩阵。 基地中的单个元素反复更改最大化成本降低。 当成本为零时，从基本矩阵构建奇偶校验矩阵，并且使用编码器中的奇偶校验矩阵将信息块编码为码字。

    Method and system for decoding graph-based codes using message-passing with difference-map dynamics
    6.
    发明授权
    Method and system for decoding graph-based codes using message-passing with difference-map dynamics 有权
    使用差分图动态消息传递来解码基于图形的代码的方法和系统

    公开(公告)号：US08407550B2

    公开(公告)日：2013-03-26

    申请号：US12541810

    申请日：2009-08-14

    申请人： Jonathan S. Yedidia ,  Yige Wang ,  Stark C. Draper

    发明人： Jonathan S. Yedidia ,  Yige Wang ,  Stark C. Draper

    IPC分类号： G06F11/00

    CPC分类号： G06F7/5057 ,  G06F7/5443 ,  H03M13/1111 ,  H03M13/658 ,  H04B10/6165 ,  H04L9/3218 ,  H04L2209/46 ,  H04L2209/50

    摘要： A code to be decoded by message-passing is represented by a factor graph. The factor graph includes variable nodes indexed by i and constraint nodes indexed by a connected by edges for transferring messages mi→a outgoing from the variable nodes to the constraint nodes and messages ma→i incoming from the constraint nodes to the variable nodes. The messages mi→a are initialized based on beliefs bi of a received codeword. The messages ma→i are generated by overshooting the messages mi→a at the constraint nodes. The beliefs bi are updated at the variable nodes using the messages ma→i. The codeword is outputted if found, otherwise, the messages mi→a are updated using a correction for the overshooting.

    摘要翻译： 通过消息传递解码的代码由因子图表示。 因子图包括由i索引的变量节点和由连接的边缘索引的约束节点，用于传送从变量节点传出的约束节点和从约束节点到变量节点的消息ma→i。 基于所接收的码字的信念bi来初始化消息mi→a。 消息ma→i是通过在约束节点超过消息mi→a生成的。 使用消息ma→i在变量节点更新信念bi。 如果找到，则输出码字，否则，使用用于过冲的校正来更新消息mi→a。

    Method and system for replica group-shuffled iterative decoding of quasi-cyclic low-density parity check codes
    7.
    发明申请
    Method and system for replica group-shuffled iterative decoding of quasi-cyclic low-density parity check codes 审中-公开
    准循环低密度奇偶校验码的复制组混洗迭代解码方法与系统

    公开(公告)号：US20080052594A1

    公开(公告)日：2008-02-28

    申请号：US11494921

    申请日：2006-07-28

    申请人： Jonathan S. Yedidia ,  Marc P. Fossorier ,  Jeffrey S. Proctor ,  Wenyi Jin ,  Yige Wang

    发明人： Jonathan S. Yedidia ,  Marc P. Fossorier ,  Jeffrey S. Proctor ,  Wenyi Jin ,  Yige Wang

    IPC分类号： H03M13/00

    CPC分类号： H03M13/116 ,  H03M13/1105 ,  H03M13/1111 ,  H03M13/112 ,  H03M13/1122 ,  H03M13/6583

    摘要： A block of symbols are decoded using iterative belief propagation. A set of belief registers store beliefs that a corresponding symbol in the block has a certain value. Check processors determine output check-to-bit messages from input bit-to-check messages by message-update rules. Link processors connect the set of belief registers to the check processors. Each link processor has an associated message register. Messages and beliefs are passed between the set of belief registers and the check processors via the link processors for a predetermined number of iterations while updating the beliefs to decode the block of symbols based on the beliefs at termination.

    摘要翻译： 使用迭代置信传播来解码符号块。 一组信念寄存器存储块中相应符号具有一定值的信念。 检查处理器通过消息更新规则确定从输入位到检查消息的输出检查到位消息。 链接处理器将一组置信寄存器连接到检查处理器。 每个链接处理器都有一个关联的消息寄存器。 消息和信念通过链接处理器在一组置信寄存器和检查处理器之间传递预定数量的迭代，同时基于终止的信念来更新信念以解码符号块。

    Method for constructing large-girth quasi-cyclic low-density parity-check codes
    9.
    发明授权
    Method for constructing large-girth quasi-cyclic low-density parity-check codes 有权
    构建大环准循环低密度奇偶校验码的方法

    公开(公告)号：US08103931B2

    公开(公告)日：2012-01-24

    申请号：US12199512

    申请日：2008-08-27

    申请人： Yige Wang ,  Jonathan S. Yedidia ,  Stark C. Draper

    发明人： Yige Wang ,  Jonathan S. Yedidia ,  Stark C. Draper

    IPC分类号： H03M13/00

    CPC分类号： H03M13/116 ,  H03M13/033

    摘要： A method constructs a code, wherein the code is a large-girth quasi-cyclic low-density parity-check code. A base matrix is selected for the code. A cost matrix corresponding to the base matrix is determined. A single element in the base is changed repeatedly maximize a reduction in cost. A parity check matrix is constructing for the code from the base matrix when the cost is zero, and an information block is encoded as a code word using the parity check matrix in an encoder.

    摘要翻译： 一种方法构建代码，其中代码是大环准循环低密度奇偶校验码。 为代码选择基本矩阵。 确定与基本矩阵相对应的成本矩阵。 基地中的单个元素反复更改最大化成本降低。 当成本为零时，从基本矩阵构建奇偶校验矩阵，并且使用编码器中的奇偶校验矩阵将信息块编码为码字。