Quasi-Cyclic Low-Density Parity-Check Codes
    1.
    发明申请
    Quasi-Cyclic Low-Density Parity-Check Codes 有权
    准循环低密度奇偶校验码

    公开(公告)号:US20130086445A1

    公开(公告)日:2013-04-04

    申请号:US13251180

    申请日:2011-09-30

    IPC分类号: H03M13/29 G06F11/10

    摘要: A system and a method for determining a quasi-cyclic (QC) low-density parity-check (LDPC) code, such that the QC LDPC code has no trapping sets are disclosed. A set of matrices representing a family of QC LDPC codes are acquired, wherein each QC LDPC code is a tail-biting spatially-coupled code of girth not less than eight, and wherein each column of each matrix in the set has a weight not less than four. Based on a trapping set pattern, a matrix from the set of matrices is selected such that the matrix represents the QC LDPC code with no trapping sets. The matrix can be stored into a memory.

    摘要翻译: 一种用于确定准循环(QC)低密度奇偶校验(LDPC)码的系统和方法,使得QC LDPC码没有捕获集合被公开。 获取表示QC LDPC码族的一组矩阵,其中每个QC LDPC码是周长不小于8的尾巴空间耦合码,并且其中集合中的每个矩阵的每列具有不小于 比四。 基于捕获集合模式,选择来自矩阵集合的矩阵,使得矩阵表示没有陷阱集合的QC LDPC码。 矩阵可以存储到存储器中。

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

    公开(公告)号:US08407550B2

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

    申请号:US12541810

    申请日:2009-08-14

    IPC分类号: G06F11/00

    摘要: 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 for Minimizing Undetectable Errors in Data Packets in Communication Systems
    3.
    发明申请
    Method for Minimizing Undetectable Errors in Data Packets in Communication Systems 失效
    最小化通信系统中数据包中不可检测错误的方法

    公开(公告)号:US20120207027A1

    公开(公告)日:2012-08-16

    申请号:US13026336

    申请日:2011-02-14

    IPC分类号: H04L12/26

    摘要: Undetectable errors in packets are minimized by verifying the CRC in each packet, setting a CRC flag to 0 to indicate success, and setting the CRC flag to 1 to indicate failure. If at least one packet in the set of packets fails then generate an error pattern E for each packet by comparing the packet that fails with one packet that passed the CRC verification, and comparing the error pattern to a set of known error patterns. Then, setting a CRC flag to 0 to indicate success and passing the payload of each packet and the CRC flag to the application if the difference is less than a predetermined threshold, and otherwise, setting the CRC flag to 1 to indicate failure.

    摘要翻译: 通过验证每个分组中的CRC,将CRC标志设置为0以指示成功,并将CRC标志设置为1以指示故障,使分组中的不可检测的错误最小化。 如果该组数据包中的至少一个数据包失败,则通过将失败的数据包与通过CRC验证的一个数据包进行比较,并将错误模式与一组已知错误模式进行比较,为每个数据包生成错误模式E. 然后,如果差小于预定阈值,则将CRC标志设置为0以指示成功并将每个分组的有效载荷和CRC标志传递给应用,否则将CRC标志设置为1以指示故障。

    Method and system for replica group-shuffled iterative decoding of quasi-cyclic low-density parity check codes
    4.
    发明申请
    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

    IPC分类号: H03M13/00

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

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

    Quasi-cyclic low-density parity-check codes
    6.
    发明授权
    Quasi-cyclic low-density parity-check codes 有权
    准循环低密度奇偶校验码

    公开(公告)号:US08595589B2

    公开(公告)日:2013-11-26

    申请号:US13251180

    申请日:2011-09-30

    IPC分类号: H03M13/00

    摘要: A system and a method for determining a quasi-cyclic (QC) low-density parity-check (LDPC) code, such that the QC LDPC code has no trapping sets are disclosed. A set of matrices representing a family of QC LDPC codes are acquired, wherein each QC LDPC code is a tail-biting spatially-coupled code of girth not less than eight, and wherein each column of each matrix in the set has a weight not less than four. Based on a trapping set pattern, a matrix from the set of matrices is selected such that the matrix represents the QC LDPC code with no trapping sets. The matrix can be stored into a memory.

    摘要翻译: 一种用于确定准循环(QC)低密度奇偶校验(LDPC)码的系统和方法,使得QC LDPC码没有捕获集合被公开。 获取表示QC LDPC码族的一组矩阵,其中每个QC LDPC码是周长不小于8的尾巴空间耦合码,并且其中集合中的每个矩阵的每列具有不小于 比四。 基于捕获集合模式,选择来自矩阵集合的矩阵,使得矩阵表示没有陷阱集合的QC LDPC码。 矩阵可以存储到存储器中。

    Method for minimizing undetectable errors in data packets in communication systems
    7.
    发明授权
    Method for minimizing undetectable errors in data packets in communication systems 失效
    减少通信系统中数据包不可检测误差的方法

    公开(公告)号:US08537689B2

    公开(公告)日:2013-09-17

    申请号:US13026336

    申请日:2011-02-14

    IPC分类号: H04J1/16

    摘要: Undetectable errors in packets are minimized by verifying the CRC in each packet, setting a CRC flag to 0 to indicate success, and setting the CRC flag to 1 to indicate failure. If at least one packet in the set of packets fails then generate an error pattern E for each packet by comparing the packet that fails with one packet that passed the CRC verification, and comparing the error pattern to a set of known error patterns. Then, setting a CRC flag to 0 to indicate success and passing the payload of each packet and the CRC flag to the application if the difference is less than a predetermined threshold, and otherwise, setting the CRC flag to 1 to indicate failure.

    摘要翻译: 通过验证每个分组中的CRC,将CRC标志设置为0以指示成功,并将CRC标志设置为1以指示故障,使分组中的不可检测的错误最小化。 如果该组数据包中的至少一个数据包失败,则通过将失败的数据包与通过CRC验证的一个数据包进行比较,并将错误模式与一组已知错误模式进行比较,为每个数据包生成错误模式E. 然后,如果差小于预定阈值,则将CRC标志设置为0以指示成功并将每个分组的有效载荷和CRC标志传递给应用,否则将CRC标志设置为1以指示故障。

    Signal Coding Using Spatial Statistical Dependencies
    9.
    发明申请
    Signal Coding Using Spatial Statistical Dependencies 审中-公开
    使用空间统计依赖的信号编码

    公开(公告)号:US20120140829A1

    公开(公告)日:2012-06-07

    申请号:US12960974

    申请日:2010-12-06

    IPC分类号: H04N7/30

    摘要: An encoded signal is decoded based on statistical dependencies between the encoded signal and the side information. A statistical reliability of each transform block of the side information is determined as a function of absolute values of transform coefficients of a transform block. The transform blocks of the side information are grouped into a set of groups based on the statistical reliability of each transform block. The decoding is performed using a statistical dependency between a transform block of the encoded signal and a group including a corresponding transform block of the side information.

    摘要翻译: 编码信号根据编码信号与侧信息之间的统计依赖关系进行解码。 侧信息的每个变换块的统计可靠性被确定为变换块的变换系数的绝对值的函数。 基于每个变换块的统计可靠性,侧信息的变换块被分组成一组组。 使用编码信号的变换块和包括副信息的相应变换块的组之间的统计依赖性来执行解码。

    Computer system and method for analyzing data sets and providing personalized recommendations
    10.
    发明授权
    Computer system and method for analyzing data sets and providing personalized recommendations 有权
    用于分析数据集和提供个性化建议的计算机系统和方法

    公开(公告)号:US09396492B2

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

    申请号:US13274235

    申请日:2011-10-14

    IPC分类号: G06Q30/06 G06Q30/02

    摘要: Embodiments of the invention relate to a computer-implemented method and system for providing personalized recommendations for a target user based at least on stored data about the target user. The method comprises obtaining a plurality of feedback data from a plurality of users, wherein the feedback data comprises an indication of a media object, a response obtained from target user related to the feedback data, and at least one demographic data element associated with the target user. A set of personalized recommendations for the target user are identified based at least on stored data about the target user and the feedback data related to the user. The personalized recommendations system identifies media objects to potentially provide to the target user, and selects or filters the identified media objects to form a set of personalized media objects associated with the set of personalized recommendations.

    摘要翻译: 本发明的实施例涉及一种计算机实现的方法和系统,用于至少基于存储的关于目标用户的数据为目标用户提供个性化建议。 该方法包括从多个用户获得多个反馈数据,其中所述反馈数据包括媒体对象的指示,从与所述反馈数据相关的目标用户获得的响应以及与所述目标相关联的至少一个人口统计数据元素 用户。 至少基于关于目标用户的存储数据和与用户相关的反馈数据来识别针对目标用户的一组个性化建议。 个性化推荐系统识别可能提供给目标用户的媒体对象,并且选择或过滤所识别的媒体对象以形成与该组个性化推荐相关联的一组个性化媒体对象。