公开(公告)号：US08499218B2

公开(公告)日：2013-07-30

申请号：US13251143

申请日：2011-09-30

申请人： Jonathan Yedidia ,  Stark Draper ,  Yige Wang

发明人： Jonathan Yedidia ,  Stark Draper ,  Yige Wang

IPC分类号： H03M13/00

CPC分类号： H03M13/1154 ,  H03M13/036 ,  H03M13/116 ,  H03M13/6527 ,  H03M13/6544

摘要： A method estimates parameters of 3-phase voltage signals to synchronize a power grid in a presence of a voltage unbalance by transforming the 3-phase voltage signals to αβ-reference signals using a Clarke transformation matrix, and estimating sinusoidal signals and corresponding quadrature signals of the αβ-reference signals using an extended Kalman filter, and determining a phase angle of a positive sequence based on a relationship of the phase angle to the estimated the sinusoidal signals.

摘要翻译： 一种方法估计三相电压信号的参数以通过使用克拉克变换矩阵将三相电压信号转换为字母表参考信号来在电压不平衡的存在下同步电网，并且估计正弦信号和相应的正交信号 使用扩展卡尔曼滤波器的字母表参考信号，以及基于相位角与估计的正弦信号的关系确定正序列的相位角。

公开(公告)号：US20130086456A1

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

申请号：US13251143

申请日：2011-09-30

申请人： Jonathan Yedidia ,  Stark Draper ,  Yige Wang

发明人： Jonathan Yedidia ,  Stark Draper ,  Yige Wang

IPC分类号： H03M13/05 ,  G06F11/10 ,  H03M13/07

CPC分类号： H03M13/1154 ,  H03M13/036 ,  H03M13/116 ,  H03M13/6527 ,  H03M13/6544

摘要： A system and a method determine a quasi-cyclic (QC) low-density parity-check (LDPC) code corresponding to a protograph and having a predetermined girth. At least several elements of the connectivity matrix representing the protograph are duplicated along at least one line of duplication to produce an inflated connectivity matrix, wherein values of at least several elements in the connectivity matrix form a pattern indicated by the predetermined girth. A hierarchical quasi-cyclic (HQC) LDPC code corresponding to the inflated connectivity matrix is determined and at least several elements of a matrix representing the HQC LDPC code are removed, such that the matrix is squashed along the line of duplication to produce the QC LDPC code.

摘要翻译： 系统和方法确定对应于原图并具有预定周长的准循环（QC）低密度奇偶校验（LDPC）码。 表示原型图的连接矩阵的至少几个元素沿着至少一行复制复制，以产生充气连接矩阵，其中，连通性矩阵中的至少几个元素的值形成由预定周长表示的图案。 确定对应于充气连通性矩阵的分级准循环（HQC）LDPC码，并且去除表示HQC LDPC码的矩阵的至少几个元素，使得矩阵沿着复制线被压缩以产生QC LDPC 码。

公开(公告)号：US20110041033A1

公开(公告)日：2011-02-17

申请号：US12819396

申请日：2010-06-21

申请人： Jonathan Yedidia ,  Yige Wang ,  Stark Draper

发明人： Jonathan Yedidia ,  Yige Wang ,  Stark 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.

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

公开(公告)号：US08595589B2

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

申请号：US13251180

申请日：2011-09-30

申请人： Jonathan Yedidia ,  Yige Wang

发明人： Jonathan Yedidia ,  Yige Wang

IPC分类号： H03M13/00

CPC分类号： H03M13/116 ,  H03M13/1154 ,  H03M13/1165

摘要： 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码。 矩阵可以存储到存储器中。

公开(公告)号：US20060161830A1

公开(公告)日：2006-07-20

申请号：US11035828

申请日：2005-01-14

申请人： Jonathan Yedidia ,  Marc Fossorier ,  Juntan Zhang ,  Yige Wang

发明人： Jonathan Yedidia ,  Marc Fossorier ,  Juntan Zhang ,  Yige Wang

IPC分类号： H03M13/00

CPC分类号： H03M13/2987 ,  H03M13/1108 ,  H03M13/1111 ,  H03M13/114 ,  H03M13/1194 ,  H03M13/6561

摘要： A method generates a combined-replica group-shuffled iterative decoder, comprising. First. an error-correcting code and an iterative decoder for an error-correcting code is received by the method. 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.

摘要翻译： 一种方法产生组合复制组混洗迭代解码器，包括。 第一。 通过该方法接收纠错码和用于纠错码的迭代解码器。 基于迭代解码器构建了用于纠错码的多组混洗子解码器。 然后，将多组混洗子解码器组合成组合复制组混洗迭代解码器。

公开(公告)号：US20130086445A1

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

申请号：US13251180

申请日：2011-09-30

申请人： Jonathan Yedidia ,  Yige Wang

发明人： Jonathan Yedidia ,  Yige Wang

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

CPC分类号： H03M13/116 ,  H03M13/1154 ,  H03M13/1165

摘要： 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码。 矩阵可以存储到存储器中。

公开(公告)号：US20070174633A1

公开(公告)日：2007-07-26

申请号：US11564638

申请日：2006-11-29

申请人： Stark Draper ,  Ashish Khisti ,  Emin Martinian ,  Anthony Vetro ,  Jonathan Yedidia

发明人： Stark Draper ,  Ashish Khisti ,  Emin Martinian ,  Anthony Vetro ,  Jonathan Yedidia

IPC分类号： H04L9/00 ,  H04K1/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.

摘要翻译： 从人力，语音，指纹和鸢尾获得的生物特征参数用于用户认证和访问控制。 因为生物特征参数是连续的，并且从一个读数到下一个读数不同，所以应用校正子码来确定生物统计学综合征矢量。 可以安全地存储生物特征综合征矢量，同时容忍生物特征数据的固有变异性。 存储的生物统计量子载体在用户认证期间使用当时获取的生物特征参数进行解码。 校正码也可用于加密和解密数据。

公开(公告)号：US20060045184A1

公开(公告)日：2006-03-02

申请号：US10929050

申请日：2004-08-27

申请人： Anthony Vetro ,  Jonathan Yedidia

发明人： Anthony Vetro ,  Jonathan Yedidia

IPC分类号： H04N11/02 ,  H04N11/04 ,  H04N15/00 ,  H04N7/12 ,  H04N13/00 ,  H04B1/66

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.

摘要翻译： 一种方法表示一组相关的图像。 相关性可以是空间或时间。 对相关集合中的每个图像应用有损操作以生成粗略图像。 粗略图像被无损编码以产生编码的粗略图像。 每个图像也由校正子位表示。 编码的粗略图像和校正子位的组合表示相关的图像集合。

公开(公告)号：US20050138516A1

公开(公告)日：2005-06-23

申请号：US10728338

申请日：2003-12-04

申请人： Jonathan Yedidia

发明人： Jonathan Yedidia

IPC分类号： H03M13/11 ,  H03M13/15 ,  H03M13/39 ,  H03M13/45 ,  H04L1/00 ,  G06F11/00 ,  G06F11/30 ,  G08C25/00 ,  H03M13/00 ,  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 [N,k]q linear block error- correcting code that has a fast sparse transform factor graph (FSTFG) representation, such as Reed-Solomon codes. First, the code is selected and its FSTFG representation is constructed. The representation is simplified and is made redundant if the improved performance is more important than the increased decoding complexity. An encoding method consistent with the representation is selected. A set of message-update and belief-update rules are selected. The messages are initialized according to a soft-input cost function. An iterative decoding cycle is then begun, in which the first step consists of updating the messages according to the pre-selected message-update rules. In the second step of the decoding cycle, a trial code word is determined from the messages, the pre- selected message-update rules, and the encoding method. In the third step of the decoding cycle, the tentative output code word of the decoding method is replaced with the trial code word if the trial code word has lower cost. Finally, the decoding cycle terminates if a termination condition is true, and outputs the tentative code word, and otherwise repeats the decoding cycle. The decoding method can be combined or concatenated with other decoding methods for FSTFG codes.

摘要翻译： 一种方法对具有快速稀疏变换因子图（FSTFG）表示（例如Reed-Solomon码）的[N，k] <！ - SIPO - >线性块纠错码解码软输入成本函数。 首先，选择代码并构建其FSTFG表示。 如果改进的性能比增加的解码复杂度更重要，则表示被简化并且被冗余。 选择与该表示一致的编码方法。 选择一组消息更新和置信更新规则。 消息根据软输入成本函数进行初始化。 然后开始迭代解码周期，其中第一步包括根据预先选择的消息更新规则更新消息。 在解码周期的第二步中，根据消息，预选消息更新规则和编码方法确定试用码字。 在解码周期的第三步骤中，如果试用代码字具有较低的成本，则将解码方法的暂定输出代码字替换为试用代码字。 最后，如果终止条件为真，解码周期终止，并输出暂定码字，否则重复解码周期。 解码方法可以与FSTFG码的其他解码方法组合或连接。

公开(公告)号：US20050044475A1

公开(公告)日：2005-02-24

申请号：US10643618

申请日：2003-08-19

申请人： Jonathan Yedidia ,  Marc Fossorier ,  Ravi Palanki

发明人： Jonathan Yedidia ,  Marc Fossorier ,  Ravi Palanki

IPC分类号： G06F11/10 ,  G06F11/00 ,  H03M13/00 ,  H03M13/09 ,  H03M13/19 ,  H03M13/37

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.

摘要翻译： 一种基于有限几何的二进制线性块码的接收字来解码。 首先，定义代码的奇偶校验矩阵表示。 接收到的字存储在通道寄存器中。 活动寄存器表示解码器的当前状态。 有效寄存器中的每个元素可以采用三种状态，表示字中相应位的两种可能状态，表示不确定性的第三种状态。 从奇偶校验到活动寄存器的元素的投票由矩阵中的奇偶校验和活动寄存器的当前状态确定。 活跃登记册中每一项要素的建议和实力取决于投票。 然后通过将建议和强度与两个阈值进行比较，以及接收到的字中的相应位的状态来更新活动寄存器中的元素。 当满足终止条件时，解码器输出有效寄存器的状态。 如果解码器输出与代码字不对应的活动寄存器的状态，则使用具有基本上更多行的奇偶校验矩阵的代码的新表示被选择，并且重新开始解码周期。