专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

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

2. 发明申请

US20110041029A1 Method and System for Decoding Graph-Based Codes Using Message-Passing with Difference-Map Dynamics 有权
公开(公告)号：US20110041029A1
公开(公告)日：2011-02-17
申请号：US12541810
申请日：2009-08-14
申请人： Jonathan S. Yedidia , Yige Wang , Stark C. Draper
发明人： Jonathan S. Yedidia , Yige Wang , Stark C. Draper
IPC分类号： H03M13/05 , G06F11/10
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.

3. 发明授权

US07779268B2 Biometric based user authentication and data encryption 有权
标题翻译：基于生物特征的用户认证和数据加密
公开(公告)号：US07779268B2
公开(公告)日：2010-08-17
申请号：US11564638
申请日：2006-11-29
申请人： Stark C. Draper , Ashish Khisti , Emin Martinian , Anthony Vetro , Jonathan S. Yedidia
发明人： Stark C. Draper , Ashish Khisti , Emin Martinian , Anthony Vetro , Jonathan S. Yedidia
IPC分类号： G06F7/00 , G06F7/04 , G06F21/00
CPC分类号： G06K9/00885 , G06K9/00073 , H04L9/3231 , H04L9/3236
摘要： Biometric parameters acquired from human forces, voices, fingerprints, and irises are used for user authentication and access control. Because the biometric parameters are continuous and vary from one reading to the next, syndrome codes are applied to determine biometric syndrome vectors. The biometric syndrome vectors can be stored securely while tolerating an inherent variability of biometric data. The stored biometric syndrome vector is decoded during user authentication using biometric parameters acquired at that time. The syndrome codes can also be used to encrypt and decrypt data.
摘要翻译：从人力，语音，指纹和鸢尾获得的生物特征参数用于用户认证和访问控制。因为生物特征参数是连续的，并且从一个读数变化到下一个读数，所以应用校正子码来确定生物特征综合征矢量。可以安全地存储生物特征综合征矢量，同时容忍生物特征数据的固有变异性。存储的生物统计量子载体在用户认证期间使用当时获取的生物特征参数进行解码。校正码也可用于加密和解密数据。

4. 发明申请

US20080144562A1 Cooperative Routing in Wireless Networks using Mutual-Information Accumulation 审中-公开
标题翻译：使用相互信息积累的无线网络中的协作路由
公开(公告)号：US20080144562A1
公开(公告)日：2008-06-19
申请号：US12039843
申请日：2008-02-29
申请人： Stark C. Draper , Lingjia Liu , Andreas F. Molisch , Jonathan S. Yedidia
发明人： Stark C. Draper , Lingjia Liu , Andreas F. Molisch , Jonathan S. Yedidia
IPC分类号： H04B7/14 , H04L12/56
CPC分类号： H04B7/2606 , H04B7/026 , H04B7/15592 , H04L1/06 , H04L1/0618 , H04L2001/0092 , H04W52/46
摘要： A route is selected in a wireless cooperative relay network of nodes. A decoding order is initialized. A set of resources is minimized subject to constraints. The resources are allocated to the nodes in the decoding order. The decoding order is changed iteratively to further minimize the allocated resources, until a minimum is reached. A code word is transmitted when the allocated resources are at the minimum, which can either be determined globally or locally at each node. The method can operate in a centralized or distributed manner.
摘要翻译：在节点的无线协作中继网络中选择路由。解码顺序被初始化。一系列资源在受限制的情况下被最小化。资源按解码顺序分配给节点。迭代地改变解码顺序，以进一步最小化分配的资源，直到达到最小值。当分配的资源为最小时，发送码字，这可以在每个节点全局或局部地确定。该方法可以集中或分布式运行。

5. 发明授权

US08261170B2 Multi-stage decoder for error-correcting codes 有权
标题翻译：用于纠错码的多级解码器
公开(公告)号：US08261170B2
公开(公告)日：2012-09-04
申请号：US12360832
申请日：2009-01-27
申请人： Jonathan S. Yedidia , Yige Wang , Stark C. Draper
发明人： Jonathan S. Yedidia , Yige Wang , Stark C. Draper
IPC分类号： H03M13/03
CPC分类号： H04L1/0053 , H03M13/1108 , H03M13/1111 , H03M13/112 , H03M13/1194 , H03M13/2957 , H03M13/3707 , H03M13/3761 , H03M13/45 , H03M13/6577 , H03M13/658 , H04L1/005
摘要： A multi-stage decoder decodes a block of symbols, received via a noisy channel, to a codeword. The decoder includes multiple sub-decoders connected sequentially, and wherein a next sub-decoder has a slower processing time and better word error rate than a previous sub-decoder, and wherein the next sub-decoder is only executed if the previous decoder fails to decode the block sequence of symbols, and a last sub-decoder is executed until a termination condition is reached.
摘要翻译：多级解码器将经由噪声信道接收到的符号块解码为码字。解码器包括顺序连接的多个子解码器，并且其中下一个子解码器具有比先前的子解码器更慢的处理时间和更好的字错误率，并且其中下一个子解码器仅在先前的解码器不能对符号的块序列进行解码，并且执行最后一个子解码器直到达到终止条件。

6. 发明申请

US20080316069A1 Maximum Likelihood Decoding via Mixed-Integer Adaptive Linear Programming 有权
标题翻译：通过混合整数自适应线性规划的最大似然解码
公开(公告)号：US20080316069A1
公开(公告)日：2008-12-25
申请号：US11764938
申请日：2007-06-19
申请人： Stark C. Draper , Jonathan S. Yedidia
发明人： Stark C. Draper , Jonathan S. Yedidia
IPC分类号： H03M7/38
CPC分类号： H03M13/1105 , H03M13/37 , H03M13/451 , H03M13/458
摘要： A method and system decodes a sequence of symbols received via a channel to a codeword of an error-correcting code. Log-likelihood ratios are determined from a sequence of symbols received via a channel. A set of constraints is initialized according to the log-likelihood ratios. An adaptive linear programming decoder is applied to the set of constraints and the log-likelihood ratios according to an error-correcting code to produce an estimate of the codeword and an updated set of constraints. If the estimate of the codeword is a non-integer pseudo codeword, further update the set of updated constraints with a set of integer constraints if the estimate of the codeword is the non-integer pseudo codeword, and proceeding with the applying step, and otherwise producing the estimate of the codeword as the final codeword.
摘要翻译：方法和系统将经由信道接收的符号序列解码为纠错码的码字。从通过信道接收的符号序列确定对数似然比。根据对数似然比初始化一组约束。根据纠错码将自适应线性规划解码器应用于约束集和对数似然比，以产生码字的估计和更新的约束集合。如果码字的估计是非整数伪码字，则如果码字的估计是非整数伪码字，并进行应用步骤，则用一组整数约束进一步更新更新的约束集合，否则产生码字的估计作为最终码字。

7. 发明授权

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

8. 发明授权

US07945845B2 Maximum likelihood decoding via mixed-integer adaptive linear programming 有权
标题翻译：通过混合整数自适应线性规划的最大似然解码
公开(公告)号：US07945845B2
公开(公告)日：2011-05-17
申请号：US11764938
申请日：2007-06-19
申请人： Stark C. Draper , Jonathan S. Yedidia
发明人： Stark C. Draper , Jonathan S. Yedidia
IPC分类号： H03M13/03
CPC分类号： H03M13/1105 , H03M13/37 , H03M13/451 , H03M13/458
摘要： A method and system decode a sequence of symbols received via a channel to a codeword of an error-correcting code. Log-likelihood ratios are determined from a sequence of symbols received via a channel. A set of constraints is initialized according to the log-likelihood ratios. An adaptive linear programming decoder is applied to the set of constraints and the log- likelihood ratios according to an error-correcting code to produce an estimate of the codeword and an updated set of constraints. If the estimate of the codeword is a non-integer pseudo codeword, further update the set of updated constraints with a set of integer constraints if the estimate of the codeword is the non-integer pseudo codeword, and proceeding with the applying step, and otherwise producing the estimate of the codeword as the final codeword.
摘要翻译：方法和系统将经由信道接收的符号序列解码为纠错码的码字。从通过信道接收的符号序列确定对数似然比。根据对数似然比初始化一组约束。根据纠错码将自适应线性规划解码器应用于约束集和对数似然比，以产生码字的估计和更新的约束集合。如果码字的估计是非整数伪码字，则如果码字的估计是非整数伪码字，并进行应用步骤，则用一组整数约束进一步更新更新的约束集合，否则产生码字的估计作为最终码字。

9. 发明申请

US20100192040A1 Multi-Stage Decoder for Error-Correcting Codes 有权
标题翻译：用于纠错码的多级解码器
公开(公告)号：US20100192040A1
公开(公告)日：2010-07-29
申请号：US12360832
申请日：2009-01-27
申请人： Jonathan S. Yedidia , Yige Wang , Stark C. Draper
发明人： Jonathan S. Yedidia , Yige Wang , Stark C. Draper
IPC分类号： H03M13/29 , G06F11/10
CPC分类号： H04L1/0053 , H03M13/1108 , H03M13/1111 , H03M13/112 , H03M13/1194 , H03M13/2957 , H03M13/3707 , H03M13/3761 , H03M13/45 , H03M13/6577 , H03M13/658 , H04L1/005
摘要： A multi-stage decoder decodes a block of symbols, received via a noisy channel, to a codeword. The decoder includes multiple sub-decoders connected sequentially, and wherein a next sub-decoder has a slower processing time and better word error rate than a previous sub-decoder, and wherein the next sub-decoder is only executed if the previous decoder fails to decode the block sequence of symbols, and a last sub-decoder is executed until a termination condition is reached.
摘要翻译：多级解码器将经由噪声信道接收到的符号块解码为码字。解码器包括顺序连接的多个子解码器，并且其中下一个子解码器具有比先前的子解码器更慢的处理时间和更好的字错误率，并且其中下一个子解码器仅在先前的解码器不能对符号的块序列进行解码，并且执行最后一个子解码器直到达到终止条件。

10. 发明申请

US20080235515A1 Pre-processing Biometric Parameters before Encoding and Decoding 有权
标题翻译：在编码和解码之前预处理生物特征参数
公开(公告)号：US20080235515A1
公开(公告)日：2008-09-25
申请号：US11928687
申请日：2007-10-30
申请人： Jonathan S. Yedidia , Stark C. Draper , Yagiz Sutcu , Anthony Vetro
发明人： Jonathan S. Yedidia , Stark C. Draper , Yagiz Sutcu , Anthony Vetro
IPC分类号： H04K1/00 , H04L9/00
CPC分类号： H04L9/3236 , G06K9/00073 , G06K9/0061 , H04L9/3231 , H04L2209/30 , H04L2209/805
摘要： Biometric parameters acquired from human faces, voices, fingerprints, and irises are used for user authentication and access control. Because the biometric parameters are continuous and vary from one reading to the next, syndrome codes are applied to determine biometric syndrome vectors. The biometric syndrome vectors can be stored securely, while tolerating an inherent variability of biometric data. The stored biometric syndrome vector is decoded during user authentication using biometric parameters acquired at that time. The syndrome codes can also be used to encrypt and decrypt data. The biometric parameters can be pre-processed to form a binary representation, in which the binary representation has a set of predetermined statistical properties enforced imposed by a set of binary logical conditions.
摘要翻译：从人脸，语音，指纹和虹膜获取的生物特征参数用于用户认证和访问控制。因为生物特征参数是连续的，并且从一个读数到下一个读数不同，所以应用校正子码来确定生物统计学综合征矢量。可以安全地存储生物特征综合征矢量，同时容忍生物特征数据的固有变异性。存储的生物统计量子载体在用户认证期间使用当时获取的生物特征参数进行解码。校正码也可用于加密和解密数据。生物特征参数可以被预处理以形成二进制表示，其中二进制表示具有由一组二进制逻辑条件强加的一组预定的统计特性。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式