公开(公告)号：US07620873B2

公开(公告)日：2009-11-17

申请号：US11385493

申请日：2006-03-21

申请人： Toshikazu Kanaoka ,  Toshihiko Morita

发明人： Toshikazu Kanaoka ,  Toshihiko Morita

IPC分类号： H03M13/00

CPC分类号： H03M13/6343 ,  H03M13/033 ,  H03M13/095 ,  H03M13/11 ,  H03M13/1162 ,  H03M13/118 ,  H03M13/1185 ,  H03M13/1188 ,  H03M13/1197 ,  H03M13/152

摘要： An information sequence having a code length of N (N=K+M), where K is information length and M is parity length, is encoded into a code sequence by using an LDPC code. The LDPC code is generated based on a matrix H, with M rows and N columns. The matrix H includes a check matrix H2 and a check matrix H1 . The check matrix H2 has M rows and M columns, it is a cyclic permutation matrix, and an inverse matrix exists for the check matrix H2, and its column weight is 3. The check matrix H1 has M rows and K columns.

摘要翻译： 具有码长N（N = K + M）的信息序列，其中K是信息长度，M是奇偶长度，通过使用LDPC码被编码成码序列。 基于具有M行和N列的矩阵H生成LDPC码。 矩阵H包括校验矩阵H2和校验矩阵H1。 校验矩阵H2具有M行和M列，它是循环置换矩阵，并且对于校验矩阵H2存在逆矩阵，并且其列权重为3.校验矩阵H1具有M行和K列。

公开(公告)号：US07458009B2

公开(公告)日：2008-11-25

申请号：US10563216

申请日：2004-10-14

申请人： Nam-Yul Yu ,  Min-Goo Kim

发明人： Nam-Yul Yu ,  Min-Goo Kim

IPC分类号： G06F11/00

CPC分类号： H03M13/1197 ,  H03M13/1114 ,  H03M13/1137 ,  H03M13/1162 ,  H03M13/118 ,  H03M13/1185 ,  H03M13/611

摘要： An apparatus and method for encoding low-density parity check (LDPC) codes. The method for generating a low-density parity check code formed of an information-part matrix and a parity-part matrix comprises the steps of converting the information-part matrix into an array code structure and assigning a degree sequence to each submatrix column; extending a dual-diagonal matrix corresponding to the parity-part matrix such that an offset value between diagonals has a random value; lifting the normalized dual-diagonal matrix; determining an offset value for cyclic column shift for each submatrix of the lifted normalized dual-diagonal matrix; and determining a parity symbol corresponding to a column of the parity-part matrix.

摘要翻译： 一种用于编码低密度奇偶校验（LDPC）码的装置和方法。 用于产生由信息部分矩阵和奇偶校验部分矩阵形成的低密度奇偶校验码的方法包括以下步骤：将信息部分矩阵转换为阵列码结构，并将度序列分配给每个子矩阵列; 扩展对应于奇偶校验部分矩阵的双对角矩阵，使得对角线之间的偏移值具有随机值; 提升归一化双对角矩阵; 确定提升的归一化双对角矩阵的每个子矩阵的循环列移位的偏移值; 以及确定对应于所述奇偶校验部分矩阵的列的奇偶校验符号。

公开(公告)号：US20080082868A1

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

申请号：US11709078

申请日：2007-02-21

申请人： Hau Thien Tran ,  Kelly Brian Cameron ,  Ba-Zhong Shen ,  Tak K. Lee

发明人： Hau Thien Tran ,  Kelly Brian Cameron ,  Ba-Zhong Shen ,  Tak K. Lee

IPC分类号： G06K5/04

CPC分类号： H03M13/1162 ,  H03M13/1117 ,  H03M13/112 ,  H03M13/1122 ,  H03M13/1125 ,  H03M13/1137 ,  H03M13/114 ,  H03M13/1165 ,  H03M13/1185 ,  H03M13/616 ,  H03M13/6505 ,  H03M13/658 ,  H03M13/6583

摘要： Novel decoding approach is presented, by which, updated bit edge messages corresponding to a sub-matrix of an LDPC matrix are immediately employed for updating of the check edge messages corresponding to that sub-matrix without requiring storing the bit edge messages; also updated check edge messages corresponding to a sub-matrix of the LDPC matrix are immediately employed for updating of the bit edge messages corresponding to that sub-matrix without requiring storing the check edge messages. Using this approach, twice as many decoding iterations can be performed in a given time period when compared to a system that performs updating of all check edge messages for the entire LDPC matrix, then updating of all bit edge messages for the entire LDPC matrix, and so on. When performing this overlapping approach in conjunction with min-sum processing, significant memory savings can also be achieved.

摘要翻译： 提出了新的解码方法，通过该方法，立即采用对应于LDPC矩阵的子矩阵的更新的位边消息来更新与该子矩阵相对应的校验边消息，而不需要存储位边消息; 立即采用对应于LDPC矩阵的子矩阵的更新的校验边消息来更新与该子矩阵相对应的位边消息，而不需要存储校验边消息。 与执行整个LDPC矩阵的所有校验边消息的更新的系统相比，使用这种方法，在给定时间段内可以执行两倍的解码迭代，然后更新整个LDPC矩阵的所有位边消息，以及 所以。 当结合最小和处理执行这种重叠方法时，也可以节省大量的内存。

公开(公告)号：US20070143657A1

公开(公告)日：2007-06-21

申请号：US11385493

申请日：2006-03-21

申请人： Toshikazu Kanaoka ,  Toshihiko Morita

发明人： Toshikazu Kanaoka ,  Toshihiko Morita

IPC分类号： H03M13/00

CPC分类号： H03M13/6343 ,  H03M13/033 ,  H03M13/095 ,  H03M13/11 ,  H03M13/1162 ,  H03M13/118 ,  H03M13/1185 ,  H03M13/1188 ,  H03M13/1197 ,  H03M13/152

摘要： An information sequence having a code length of N (N=K+M), where K is information length and M is parity length, is encoded into a code sequence by using an LDPC code. The LDPC code is generated based on a matrix H, with M rows and N columns. The matrix H includes a check matrix H2 and a check matrix H1. The check matrix H2 has M rows and M columns, it is a cyclic permutation matrix, and an inverse matrix exists for the check matrix H2, and its column weight is 3. The check matrix H1 has M rows and K columns.

摘要翻译： 具有码长N（N = K + M）的信息序列，其中K是信息长度，M是奇偶长度，通过使用LDPC码被编码成码序列。 基于具有M行和N列的矩阵H生成LDPC码。 矩阵H包括校验矩阵H 2 2和校验矩阵H 1 1。 校验矩阵H 2具有M行和M列，它是循环置换矩阵，并且对于校验矩阵H 2 2存在逆矩阵，并且其列权重是 支票矩阵H 1具有M行和K列。

公开(公告)号：US20050050435A1

公开(公告)日：2005-03-03

申请号：US10926932

申请日：2004-08-26

申请人： Gyu-Bum Kyung ,  Hong-Sil Jeong ,  Jae-Yoel Kim ,  Sung-Eun Park ,  Kyeong-Cheol Yang ,  Se-Ho Myung

发明人： Gyu-Bum Kyung ,  Hong-Sil Jeong ,  Jae-Yoel Kim ,  Sung-Eun Park ,  Kyeong-Cheol Yang ,  Se-Ho Myung

IPC分类号： H04L1/00 ,  H03M13/11 ,  H03M13/00 ,  G06F11/00

CPC分类号： H03M13/1105 ,  H03M13/1102 ,  H03M13/1151 ,  H03M13/1162 ,  H03M13/1171 ,  H03M13/118 ,  H03M13/1185 ,  H03M13/1188 ,  H03M13/1194

摘要： A method for generating a parity check matrix of a block LDPC code is disclosed. The parity check matrix includes an information part corresponding to an information word and a first parity part and a second parity part each corresponding to a parity. The method includes determining a size of the parity check matrix based on a coding rate applied when coding the information word with the block LDPC code, and a codeword length; dividing a parity check matrix with the determined size into a predetermined number of blocks; classifying the blocks into blocks corresponding to the information part, blocks corresponding to the first parity part, and blocks corresponding to the second parity part; arranging permutation matrixes in predetermined blocks from among the blocks classified as the first parity part, and arranging identity matrixes in a full lower triangular form in predetermined blocks from among the blocks classified as the second parity part; and arranging the permutation matrixes in the blocks classified as the information part such that a minimum cycle length is maximized and weight values are irregular on a factor graph of the block LDPC code.

摘要翻译： 公开了一种用于生成块LDPC码的奇偶校验矩阵的方法。 奇偶校验矩阵包括对应于信息字的信息部分和对应于奇偶校验的第一奇偶校验部分和第二奇偶校验部分。 该方法包括基于在使用块LDPC码对信息字进行编码时应用的编码率和码字长度来确定奇偶校验矩阵的大小; 将具有所确定的大小的奇偶校验矩阵除以预定数量的块; 将块分类为对应于信息部分的块，对应于第一奇偶校验部分的块，以及对应于第二奇偶校验部分的块; 从分类为第一奇偶校验部分的块中将预定块中的置换矩阵排列在预定块中的整个下三角形形式中的单位矩阵，从被分类为第二奇偶校验部分的块中排列; 以及将排列矩阵排列在分组为信息部分的块中，使得最小周期长度最大化，权重值在块LDPC码的因子图上是不规则的。

公开(公告)号：US20030037298A1

公开(公告)日：2003-02-20

申请号：US09902859

申请日：2001-07-11

申请人： International Business Machines Corporation

发明人： Evangelos Stavros Eleftheriou ,  Richard Leo Galbraith ,  Sedat Oelcer

IPC分类号： H03M013/00

CPC分类号： H04L1/0058 ,  G11B20/1833 ,  H03M13/1162 ,  H03M13/118 ,  H03M13/255

摘要： A method for low-density parity-check (LDPC) encoding of data comprises defining a first MnullN parity check matrix; generating, based on the first parity check matrix, a second parity check matrix having an MnullM triangular sub-matrix; and, mapping the data into an LDPC code word based on the second parity check matrix. The method is particularly useful for data communications applications, but may also be employed in other applications such as, for example, data storage.

摘要翻译： 用于数据的低密度奇偶校验（LDPC）编码的方法包括定义第一M×N奇偶校验矩阵; 基于所述第一奇偶校验矩阵生成具有M×M三角形子矩阵的第二奇偶校验矩阵; 以及基于第二奇偶校验矩阵将数据映射到LDPC码字。 该方法对于数据通信应用特别有用，但也可以用于其他应用中，例如数据存储。