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

21. 发明授权

US07373585B2 Combined-replica group-shuffled iterative decoding for error-correcting codes 失效
标题翻译：用于纠错码的组合复制组混洗迭代解码
公开(公告)号：US07373585B2
公开(公告)日：2008-05-13
申请号：US11035828
申请日：2005-01-14
申请人： Jonathan S. Yedidia , Marc P. C. Fossorier , Juntan Zhang , Yige Wang
发明人： Jonathan S. Yedidia , Marc P. C. Fossorier , Juntan Zhang , Yige Wang
IPC分类号： H03M13/03
CPC分类号： H03M13/2987 , H03M13/1108 , H03M13/1111 , H03M13/114 , H03M13/1194 , H03M13/6561
摘要： A method generates a combined-replica group-shuffled iterative decoder. First, an error-correcting code and an iterative decoder for an error-correcting code is received. Multiple group-shuffled sub-decoders for the error-correcting code are constructed, based on the iterative decoder. Then, the multiple group-shuffled sub-decoders are combined into a combined-replica group-shuffled iterative decoder.
摘要翻译：一种方法生成组合复制组混洗迭代解码器。首先，接收用于纠错码的纠错码和迭代解码器。基于迭代解码器构建了用于纠错码的多组混洗子解码器。然后，将多组混洗子解码器组合成组合复制组混洗迭代解码器。

22. 发明授权

US07191376B2 Decoding Reed-Solomon codes and related codes represented by graphs 失效
标题翻译：解码Reed-Solomon码和由图表表示的相关码
公开(公告)号：US07191376B2
公开(公告)日：2007-03-13
申请号：US10728338
申请日：2003-12-04
申请人： Jonathan S. Yedidia
发明人： Jonathan S. Yedidia
IPC分类号： H04L1/18
CPC分类号： H03M13/114 , H03M13/1102 , H03M13/1191 , H03M13/136 , H03M13/1505 , H03M13/1515 , H03M13/3707 , H03M13/39 , H03M13/45 , H03M13/6362 , H03M13/658
摘要： A method decodes a soft-input cost function for an error-correcting code. First, the code is selected and its FSTFG representation is constructed. The representation is simplified, and an encoding method consistent with the representation is selected. A set of message-update and belief-update rules are selected. Messages are initialized according to a soft-input cost function. An iterative decoding cycle is then begun. The first step updates the messages according to the pre-selected message-update rules. The second step determines a trial code word from the messages, the pre-selected message-update rules, and the encoding method. The third step replaces a tentative output code word of the decoding method with the trial code word if the trial code word has lower cost. The decoding cycle terminates if a termination condition is true, and outputs the tentative code word.
摘要翻译：一种解码纠错码的软输入成本函数的方法。首先，选择代码并构建其FSTFG表示。该表示被简化，并且选择与该表示一致的编码方法。选择一组消息更新和置信更新规则。消息根据软输入成本函数进行初始化。然后开始迭代解码周期。第一步根据预先选择的消息更新规则更新消息。第二步确定消息中的试用码字，预先选择的消息更新规则和编码方法。如果试用代码字的成本较低，则第三步用试用代码字代替解码方法的暂定输出代码字。如果终止条件为真，则解码周期终止，并输出暂定码字。

23. 发明授权

US06857097B2 Evaluating and optimizing error-correcting codes using a renormalization group transformation 失效
标题翻译：使用重归一化组转换来评估和优化纠错码
公开(公告)号：US06857097B2
公开(公告)日：2005-02-15
申请号：US09858358
申请日：2001-05-16
申请人： Jonathan S. Yedidia , Jean-Philippe M. Bouchaud
发明人： Jonathan S. Yedidia , Jean-Philippe M. Bouchaud
IPC分类号： G06F11/10 , H03M13/01 , H03M13/19 , H03M13/37 , H03M13/47 , H04L1/24 , H03M13/00
CPC分类号： H03M13/47 , H03M13/01 , H03M13/37
摘要： A method evaluates an error-correcting code for a data block of a finite size. An error-correcting code is defined by a parity check matrix, wherein columns represent variable bits and rows represent parity bits. The parity check matrix is represented as a bipartite graph. A single node in the bipartite graph is iteratively renormalized until the number of nodes in the bipartite graph is less than a predetermine threshold. During the iterative renormalization, a particular variable node is selected as a target node, and a distance between the target node and every other node in the bipartite graph is measured. Then, if there is at least one leaf variable node, renormalize the leaf variable node farthest from the target node, otherwise, renormalize a leaf check node farthest from the target node, and otherwise renormalize a variable node farthest from the target node and having fewest directly connected check nodes. By evaluating many error-correcting codes according to the method, an optimal code according to selected criteria can be obtained.
摘要翻译：一种方法评估有限大小的数据块的纠错码。纠错码由奇偶校验矩阵定义，其中列表示可变位，行表示奇偶校验位。奇偶校验矩阵表示为二分图。二分图中的单个节点被迭代重新归一化，直到两分图中的节点数小于预定阈值。在迭代重归一化期间，选择特定变量节点作为目标节点，并测量目标节点与二分图中每个其他节点之间的距离。然后，如果存在至少一个叶变节点，则对目标节点最远的叶变量节点进行重新规范化，否则，将与目标节点最远的叶检查节点重新归一化，否则将距离目标节点最远的变量节点重新规范化，最小直接连接检查节点。通过根据该方法评估许多纠错码，可以获得根据所选标准的最佳码。

24. 发明授权

US07103825B2 Decoding error-correcting codes based on finite geometries 失效
标题翻译：基于有限几何解码纠错码
公开(公告)号：US07103825B2
公开(公告)日：2006-09-05
申请号：US10643618
申请日：2003-08-19
申请人： Jonathan S. Yedidia , Marc P. C. Fossorier , Ravi Palanki
发明人： Jonathan S. Yedidia , Marc P. C. Fossorier , Ravi Palanki
IPC分类号： H03M13/43 , H03M13/45
CPC分类号： H03M13/136 , H03M13/134 , H03M13/3738 , H03M13/3746
摘要： A method decodes a received word for a binary linear block code based on a finite geometry. First, a parity check matrix representation of the code is defined. The received word is stored in a channel register. An active register represents a current state of the decoder. Each element in the active register can take three states, representing the two possible states of the corresponding bit in the word, and a third state representing uncertainty. Votes from parity checks to elements of the active register are determined from parity checks in the matrix, and the current state of the active register. A recommendation and strength of recommendation for each element in the active register is determined from the votes. The elements in the active register are then updated by comparing the recommendation and strength of recommendation with two thresholds, and the state of the corresponding bit in the received word. When termination conditions are satisfied, the decoder outputs the state of the active register. If the decoder outputs a state of the active register that does not correspond to a codeword, a new representation for the code using a parity check matrix with substantially more rows is chosen, and the decoding cycle is restarted.
摘要翻译：一种基于有限几何的二进制线性块码的接收字来解码。首先，定义代码的奇偶校验矩阵表示。接收到的字存储在通道寄存器中。活动寄存器表示解码器的当前状态。有效寄存器中的每个元素可以采用三种状态，表示字中相应位的两种可能状态，表示不确定性的第三种状态。从奇偶校验到活动寄存器的元素的投票由矩阵中的奇偶校验和活动寄存器的当前状态确定。活跃登记册中每一项要素的建议和实力取决于投票。然后通过将建议和强度与两个阈值进行比较，以及接收到的字中的相应位的状态来更新活动寄存器中的元素。当满足终止条件时，解码器输出有效寄存器的状态。如果解码器输出与代码字不对应的活动寄存器的状态，则使用具有基本上更多行的奇偶校验矩阵的代码的新表示被选择，并且重新开始解码周期。

25. 发明授权

US07103818B2 Transforming generalized parity check matrices for error-correcting codes 失效
标题翻译：转换用于纠错码的广义奇偶校验矩阵
公开(公告)号：US07103818B2
公开(公告)日：2006-09-05
申请号：US10260334
申请日：2002-09-30
申请人： Jonathan S. Yedidia , Jinghu Chen
发明人： Jonathan S. Yedidia , Jinghu Chen
IPC分类号： H03M13/00
CPC分类号： H03M13/616 , H03M13/1102 , H03M13/1111 , H03M13/1191 , H03M13/1194 , H03M13/1505 , H03M13/19
摘要： A method transforms a generalized parity check matrix representing a linear block binary code. First, an input generalized parity check matrix is defined for the linear block binary code. Auxiliary sets are formed from the input generalized parity check matrix and organized into a partially ordered set. The subsets of each auxiliary set are ordered in a list, and parity check equations are constructed from the list of ordered subsets. The parity check equations are translated into an output generalized parity check matrix, which can be used to decode a message encoded according to the linear block binary code.
摘要翻译：一种方法转换表示线性块二进制码的广义奇偶校验矩阵。首先，为线性块二进制码定义输入广义奇偶校验矩阵。辅助集合由输入的广义奇偶校验矩阵形成，并被组织为部分有序集合。每个辅助集合的子集在列表中排序，并且从有序子集的列表中构建奇偶校验方程。奇偶校验方程被转换成输出广义奇偶校验矩阵，其可用于对根据线性块二进制码编码的消息进行解码。

26. 发明授权

US06745157B1 Super-node normalized belief propagation for probabilistic systems 有权
标题翻译：概率系统的超节点归一化信念传播
公开(公告)号：US06745157B1
公开(公告)日：2004-06-01
申请号：US09586281
申请日：2000-06-02
申请人： Yair Weiss , William T. Freeman , Jonathan S. Yedidia
发明人： Yair Weiss , William T. Freeman , Jonathan S. Yedidia
IPC分类号： G06F1710
CPC分类号： G06F17/10
摘要： A method determines the probabilities of states of a system represented by a model including of nodes connected by links. Each node represents possible states of a corresponding part of the system, and each link represents statistical dependencies between possible states of related nodes. The nodes are grouped into arbitrary sized clusters such that every node is included in at least one cluster. A minimal number of marginalization constraints to be satisfied between the clusters are determined. A super-node network is constructed so that each cluster of nodes is represented by exactly one super-node. Super-nodes that share one of the marginalization constraints are connected by super-links. The super-node network is searched to locate closed loops of super-nodes containing at least one common node. A normalization operator for each closed loop is determined, and messages between the super-nodes are defined. Initial values are assigned to the messages, and the messages between super-nodes are updated using standard belief propagation. The messages are replaced by associated normalized values using the corresponding normalization operator, and approximate probabilities of the states of the system are determined from the messages when a termination condition is reached.
摘要翻译：一种方法确定由包括通过链接连接的节点的模型所表示的系统的状态的概率。每个节点表示系统的对应部分的可能状态，并且每个链路表示相关节点的可能状态之间的统计依赖性。节点被分组成任意大小的集群，使得每个节点被包括在至少一个集群中。确定要在群集之间满足的最小数量的边缘化约束。构建超节点网络，使得每个节点簇由正好一个超节点表示。分享边缘化约束的超级节点通过超级链接连接。搜索超节点网络以定位包含至少一个公共节点的超节点的闭环。确定每个闭环的归一化运算符，并定义超节点之间的消息。初始值分配给消息，超级节点之间的消息使用标准置信传播进行更新。使用相应的归一化算子将消息替换为关联的归一化值，并且当达到终止条件时，从消息确定系统的状态的近似概率。

27. 发明授权

US07860158B2 Coding correlated images using syndrome bits 有权
标题翻译：使用校正子位编码相关图像
公开(公告)号：US07860158B2
公开(公告)日：2010-12-28
申请号：US10929050
申请日：2004-08-27
申请人： Anthony Vetro , Jonathan S. Yedidia
发明人： Anthony Vetro , Jonathan S. Yedidia
IPC分类号： H04N7/48 , H04N7/66 , H04N7/46 , H04N7/52
CPC分类号： H04N19/59 , H04N19/124 , H04N19/127 , H04N19/154 , H04N19/166 , H04N19/18 , H04N19/44 , H04N19/46 , H04N19/513 , H04N19/523 , H04N19/597 , H04N19/63
摘要： A method represents a correlated set of images. The correlation can be spatial or temporal. A lossy operation is applied to each image in the correlated set to generate a coarse image. The coarse image is encoded losslessly to yield an encoded coarse image. Each image is also represented by syndrome bits. The combination of the encoded coarse images and the syndrome bits represent the correlated set of images.
摘要翻译：一种方法表示一组相关的图像。相关性可以是空间或时间。对相关集合中的每个图像应用有损操作以生成粗略图像。粗略图像被无损编码以产生编码的粗略图像。每个图像也由校正子位表示。编码的粗略图像和校正子位的组合表示相关的图像集合。

28. 发明授权

US07620818B2 Biometric based user authentication and data encryption 有权
标题翻译：基于生物特征的用户认证和数据加密
公开(公告)号：US07620818B2
公开(公告)日：2009-11-17
申请号：US11218261
申请日：2005-09-01
申请人： Anthony Vetro , Jonathan S. Yedidia , Emin Martinian , Sergey M. Yekhanin
发明人： Anthony Vetro , Jonathan S. Yedidia , Emin Martinian , Sergey M. Yekhanin
IPC分类号： G06F9/46 , G06F21/00
CPC分类号： H04L9/0894 , G07C9/00158 , H04L9/0866 , H04L9/3231
摘要： First biometric parameters are acquired from a user. Input data are encrypted according to the biometric parameters to produce ciphertext. The biometric parameters are encoded using a syndrome encoder to produce a syndrome code. The ciphertext and the syndrome code are associated with each other and stored in a computer readable media so that only the same user can subsequently decrypt the cipher text.
摘要翻译：从用户获取第一生物特征参数。根据生物特征参数对输入数据进行加密以产生密文。使用校正子编码器对生物特征参数进行编码以产生校正子码。密文和纠错码相互关联并存储在计算机可读介质中，使得只有相同的用户可随后解密密文。

29. 发明申请

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

30. 发明授权

US06771197B1 Quantizing signals using sparse generator factor graph codes 有权
标题翻译：使用稀疏发生器因子图代码量化信号
公开(公告)号：US06771197B1
公开(公告)日：2004-08-03
申请号：US10672919
申请日：2003-09-26
申请人： Jonathan S. Yedidia , Emin Martinian
发明人： Jonathan S. Yedidia , Emin Martinian
IPC分类号： H03M700
CPC分类号： H03M13/1111 , H03M13/1108 , H03M13/1191 , H03M13/63 , H03M13/6577
摘要： A method quantizes an input signal of N samples into a string of k symbols drawn from a q-ary alphabet. A complementary method reproduces a minimally distorted version of the input signal from the quantized string, given some distortion measure. First, an [N,k]q linear error-correcting code that has a sparse generator factor graph representation is selected. A fixed mapping from q-ary symbols to samples is selected. A soft-input decoder and an encoder for the SGFG codes is selected. A cost function is determined from the input signal and a distortion measure, using the fixed mapping. The decoder determines an information block corresponding to a code word of the SGFG code with a low cost for the input signal. The input signal can be reproduced using the encoder for the SGFG code, in combination with the fixed mapping.
摘要翻译：一种方法将N个样本的输入信号量化为从q字母字母绘制的k个符号的串。给定一些失真测量，补充方法从量化串中再现输入信号的最小失真版本。首先，选择具有稀疏发生器因子图表示的[N，k] q线性纠错码。选择从q元符号到样本的固定映射。选择软输入解码器和用于SGFG码的编码器。使用固定映射从输入信号和失真度量确定成本函数。解码器以对于输入信号的低成本来确定与SGFG码的码字相对应的信息块。输入信号可以使用SGFG码的编码器与固定映射相结合。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式