公开(公告)号：US5406570A

公开(公告)日：1995-04-11

申请号：US870483

申请日：1992-04-16

Applicant: Claude Berrou ,  Patrick Adde

Inventor： Claude Berrou ,  Patrick Adde

IPC: H03M13/23 ,  H03M13/41 ,  H03M13/45 ,  H01S3/18

CPC classification number: H03M13/4153 ,  H03M13/23

Abstract: A method for the decoding of digital data obtained according to a convolutional coding and transmitted on a noise-ridden channel aimed at improving the methods of maximum likelihood decoding such as the Viterbi algorithm consisting in associating, with each estimation s(t) of the corresponding source digital element a(t), a weighting coefficient m(t) representing the reliability of the estimation s(t), the estimation s(t) taking account of the values of a first series of L received samples, and the weighting m(t) taking account of the values of a second series of N samples received, N being strictly greater than L. In a preferred embodiment, a second trellis is associated with the standard first decoding trellis, a trace-back being done in the second trellis on two concurrent paths, used to revise the weighting coefficients obtained at output of the first trellis.

Abstract translation: 一种用于解码根据卷积编码获得的数字数据的方法，并且用于改进最大似然解码方法的噪声干扰信道，例如维特比算法，其包括与相应的每个估计s（t）相关联 源数字元素a（t），表示估计s（t）的可靠性的加权系数m（t），考虑第一系列L个接收样本的值的估计s（t）以及加权m （t），考虑接收的N个样本的第二系列的值，N严格地大于L.在优选实施例中，第二网格与标准的第一解码网格相关联，在第二个样本中进行追溯 两个并发路径上的网格，用于修改在第一个网格的输出处获得的加权系数。

公开(公告)号：US20080229172A1

公开(公告)日：2008-09-18

申请号：US11994803

申请日：2006-07-05

Applicant: Christophe Jego ,  Patrick Adde

Inventor： Christophe Jego ,  Patrick Adde

IPC: H03M13/05 ,  G06F11/10

CPC classification number: H03M13/2963 ,  H03M13/2771 ,  H03M13/451

Abstract: The invention relates to a Method of decoding a matrix built from concatenated codes, corresponding to at least two elementary codes, with uniform interleaving, this matrix having n1 lines, n2 columns and n1*n2 symbols, characterized in that the method comprises a process of all the lines- and columns-vectors of the matrix by symbols groups, this process comprises a first decoding for simultaneously processing all the symbols of a group of symbols according to their lines and then a second decoding for simultaneously processing all the symbols of the said group of symbols according to their columns, or inversely, the symbols groups being thus successively processed in lines and in columns.

Abstract translation: 本发明涉及一种对由具有均匀交错的至少两个基本代码对应于级联代码构成的矩阵的方法，该矩阵具有n 1行，n 2列和n 1 * n 2个符号，其特征在于该方法 包括按符号组的矩阵的所有行和列向量的处理，该处理包括用于根据它们的行同时处理一组符号的所有符号的第一解码，然后是用于同时处理所有 所述符号组的符号根据它们的列，或者相反地，符号组因此以线和列顺序地处理。

公开(公告)号：US6065147A

公开(公告)日：2000-05-16

申请号：US920038

申请日：1997-08-28

Applicant: Ramesh Pyndiah ,  Patrick Adde

Inventor： Ramesh Pyndiah ,  Patrick Adde

IPC: G06F11/10 ,  H03M13/00 ,  H03M13/23 ,  H03M13/29 ,  H03M13/45

CPC classification number: H03M13/458 ,  H03M13/2906 ,  H03M13/2963

Abstract: The bits transmitted are coded according to the product of at least two systematic block codes. Iterative decoding is applied in order to determine, at each code word search step, a data matrix ({R}) and a decision matrix ({D}) used for the following step. The new decision matrix is determined at each step by decoding the rows or columns of the input matrix, and the new data matrix is determined taking into account the correction terms which increase the reliability of the decoding on each iteration. The coding and decoding circuits (17) are rendered programmable by a puncturing technique allowing selection of the number of bits transmitted per coded block, the punctured bits preferably having uniformly distributed positions according to each dimension of the matrices.

Abstract translation: 发送的比特根据至少两个系统块码的乘积进行编码。 应用迭代解码以便在每个码字搜索步骤中确定用于下一步骤的数据矩阵（{R}）和决策矩阵（{D}）。 通过对输入矩阵的行或列进行解码来确定每个步骤的新决策矩阵，并且考虑在每个迭代上增加解码的可靠性的校正项来确定新的数据矩阵。 编码和解码电路（17）通过删截技术可编程，允许选择每个编码块传输的比特数，根据矩阵的每个维度，穿孔比特优选地具有均匀分布的位置。

公开(公告)号：US07219291B2

公开(公告)日：2007-05-15

申请号：US10416484

申请日：2001-11-09

Applicant: Patrick Adde ,  Ramesh Pyndiah

Inventor： Patrick Adde ,  Ramesh Pyndiah

IPC: H03M13/29

CPC classification number: H03M13/6577 ,  H03M13/2963 ,  H03M13/6566

Abstract: The invention concerns a module for decoding a concatenated code, corresponding at least to two elementary codes C1 and C2, using storage means (81, 83, 90, 111, 113) wherein are stored samples of data to be decoded, comprising at least two elementary decoders (821, 822, . . . 82m) of at least one of the elementary codes, the elementary decoders associated with one of the elementary codes simultaneously processing, in parallel separate code words contained in the storage means.

Abstract translation: 本发明涉及一种用于使用存储装置（81,83,90,111，...，111）解码连接代码的模块，对应于至少两个基本代码C 1和C 2， 113），其中存储要解码的数据的样本，包括至少两个基本解码器（82＆lt; 1＆gt;，82＆lt; 2＆gt;，... 82＆lt; 所述基本代码中的至少一个，所述基本解码器与所述基本代码中的一个相关联地同时处理，并行地包含在所述存储装置中。

公开(公告)号：US6122763A

公开(公告)日：2000-09-19

申请号：US919969

申请日：1997-08-28

Applicant: Ramesh Pyndiah ,  Patrick Adde

Inventor： Ramesh Pyndiah ,  Patrick Adde

IPC: G06F11/10 ,  H03M13/00 ,  H03M13/23 ,  H03M13/25 ,  H03M13/29

CPC classification number: H03M13/6362 ,  H03M13/251 ,  H03M13/2909 ,  H03M13/2963 ,  H03M13/453 ,  H03M13/6502

Abstract: The bits transmitted are coded according to the product of at least two systematic block codes. Iterative decoding is applied in order to determine, at each code word search step, a data matrix ({R}) and a decision matrix ({D}) used for the following step. The new decision matrix is determined at each step by decoding the lines or columns of the input matrix, and the new data matrix is determined taking into account the correction terms which increase the reliability of the decoding on each iteration. The coding and decoding circuits (17) are rendered programmable by a shortening technique allowing selection of the number k-X of non-redundant information bits per block to be coded. Known values are assigned to the other bits, the positions of which are uniformly distributed according to each dimension of the matrices.

Abstract translation: 发送的比特根据至少两个系统块码的乘积进行编码。 应用迭代解码以便在每个码字搜索步骤中确定用于下一步骤的数据矩阵（{R}）和决策矩阵（{D}）。 通过对输入矩阵的行或列进行解码来确定每个步骤的新决策矩阵，并且考虑在每次迭代时增加解码的可靠性的校正项来确定新的数据矩阵。 编码和解码电路（17）通过缩短技术被编程，允许选择要编码的每个块的非冗余信息比特数k-X。 已知值被分配给其他位，其位置根据矩阵的每个维度均匀分布。

公开(公告)号：US08332716B2

公开(公告)日：2012-12-11

申请号：US11994803

申请日：2006-07-05

Applicant: Christophe Jego ,  Patrick Adde

Inventor： Christophe Jego ,  Patrick Adde

IPC: H03M13/00

CPC classification number: H03M13/2963 ,  H03M13/2771 ,  H03M13/451

Abstract: The invention relates to a method of decoding a matrix built from concatenated codes, corresponding to at least two elementary codes, with uniform interleaving, the matrix having n1 lines, n2 columns and n1*n2 symbols, the method comprising processing all the lines- and columns-vectors of the matrix by symbol groups, the processing comprising a first decoding to simultaneously process all the symbols of a group of symbols according to their lines and then a second decoding to simultaneously process all the symbols of said group of symbols according to their columns, the symbol groups being thus successively processed in lines and in columns, or conversely.

Abstract translation: 本发明涉及一种对具有n1行，n2列和n1 * n2符号的矩阵进行均匀交织的对应于至少两个基本代码的级联代码构建的矩阵的方法，该方法包括处理所有行和 按照符号组对矩阵的列向量，该处理包括第一解码，以根据它们的行同时处理一组符号的所有符号，然后进行第二解码，以根据它们同时处理所述符号组的所有符号 列，因此符号组因此以线和列连续处理，或相反地。