公开(公告)号：US07966543B2

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

申请号：US11741693

申请日：2007-04-27

申请人： Jui-Hui Hung ,  Jui-Hung Hung ,  Sau-Gee Chen

发明人： Jui-Hui Hung ,  Jui-Hung Hung ,  Sau-Gee Chen

IPC分类号： H03M13/00

CPC分类号： H03M13/1122 ,  H03M13/1117

摘要： A cyclic comparison method for an LDPC decoder. The nth element of the input k elements, wherein n=1, . . . , k, is sequentially removed by the corresponding comparator to obtain k first level sequences. Next, pairs of two elements selected from the k elements are used to form k second level sequences. The preceding step is repeated k×┌log2(k−1)┐ times to obtain k output results. Either of one first level sequences and one output results contains (k−1) elements. The first level sequences are compared with the output results to determine whether they are identical. If they are identical, the process stops. If they are not identical, the abovementioned step is repeated to obtain new output results. The cyclic comparison method of the present invention needs only k×┌log2(k−1)┐ comparisons to obtain output results. Thus, the present invention can reduce the number of basic operations and can apply to any input number.

摘要翻译： 一种LDPC解码器的循环比较方法。 输入k个元素的第n个元素，其中n = 1。 。 。 ，k被相应的比较器顺序地去除以获得k个第一级序列。 接下来，使用从k个元素中选择的两个元素的对来形成k个第二等级序列。 上述步骤重复k×┌log2（k-1）┐次以获得k个输出结果。 一个第一级序列和一个输出结果中的任一个包含（k-1）个元素。 将第一级序列与输出结果进行比较，以确定它们是否相同。 如果它们相同，则该过程停止。 如果它们不相同，则重复上述步骤以获得新的输出结果。 本发明的循环比较方法只需要k×┌log2（k-1）┐比较来获得输出结果。 因此，本发明可以减少基本操作的数量并且可以应用于任何输入数。

公开(公告)号：US07945839B2

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

申请号：US11742499

申请日：2007-04-30

申请人： Jui-Hui Hung ,  Jui-Hung Hung ,  Sau-Gee Chen

发明人： Jui-Hui Hung ,  Jui-Hung Hung ,  Sau-Gee Chen

IPC分类号： H03M13/00

CPC分类号： H03M13/1105 ,  H03M13/6502

摘要： The present invention discloses a set-cyclic comparison method for an LDPC (Low-Density Parity-Check) decoder, which applies to a CNU (Check Node Unit) or a VNU (Variable Node Unit). In the systematized method of the present invention, all the input elements are initialized to obtain a matrix. Based on the symmetry of the matrix and the similarity between the rows of the matrix are sequentially formed different sets respectively corresponding to the horizontally-continuous elements having the maximum iteration number in the horizontal and vertical directions, the symmetric non-continuous non-boundary elements, and the boundary elements plus the end-around neighboring elements in the same row. The present invention applies to any input number. Via the large intersection between the compared sets, the present invention can effectively reduce the number of comparison calculations and greatly promote the performance of an LDPC decoder.

摘要翻译： 本发明公开了一种适用于CNU（校验节点单元）或VNU（可变节点单元）的LDPC（Low-Density Parity-Check）解码器的集合循环比较方法。 在本发明的系统化方法中，对所有输入元素进行初始化以获得矩阵。 基于矩阵的对称性，并且矩阵的行之间的相似度依次形成为不同的集合，分别对应于在水平和垂直方向上具有最大迭代次数的水平连续的元素，对称非连续非边界元素 ，边界元素加上同一行中的末端相邻元素。 本发明适用于任何输入号码。 通过比较集合之间的大交点，本发明可以有效地减少比较计算的数量，并大大提高LDPC解码器的性能。