公开(公告)号：US06842871B2

公开(公告)日：2005-01-11

申请号：US09733965

申请日：2000-12-12

Applicant: Philippe Piret ,  Claude Le Dantec

Inventor： Philippe Piret ,  Claude Le Dantec

IPC: H03M13/00 ,  H03M13/15 ,  H03M13/27 ,  H03M13/29 ,  H03M13/45 ,  H04L1/00 ,  G06F11/00

CPC classification number: H03M13/271 ,  H03M13/2771 ,  H03M13/2903 ,  H03M13/2993 ,  H03M13/6356 ,  H03M13/6362

Abstract: In order to encode an original sequence of binary data (u), a first padding operation (508) is performed, supplementing the original sequence (u) so that the supplemented sequence (u) is divisible by a first divisor polynomial; a first recursive convolutional encoding operation (508) is performed, using the first divisor polynomial, encoding the supplemented original sequence (u); an interleaving operation (506) is performed, permuting the binary data in the original sequence (u) by means of a specific permutation, so as to obtain an interleaved sequence (u*); a second padding operation (510) is performed, supplementing the interleaved sequence (u*) so that the supplemented interleaved sequence (u*) is divisible by a second divisor polynomial (g2); and a second recursive convolutional encoding operation (510) is performed, using the second divisor polynomial, encoding the supplemented interleaved sequence (u*).

Abstract translation: 为了对二进制数据（u）的原始序列进行编码，执行第一填补操作（508），补充原始序列（u），使得补充序列（u）可被第一因子多项式除尽; 使用第一因子多项式，对补充的原始序列（u）进行编码，执行第一递归卷积编码操作（508）; 执行交织操作（506），通过特定置换来排列原始序列（u）中的二进制数据，以获得交织序列（u *）; 执行第二填补操作（510），补充交错序列（u *），使得补充的交错序列（u *）可被第二因子多项式（g2）整除; 并且使用第二因子多项式来执行第二递归卷积编码操作（510），对补充的交错序列（u *）进行编码。

公开(公告)号：US06560362B1

公开(公告)日：2003-05-06

申请号：US09435852

申请日：1999-11-08

Applicant: Philippe Piret ,  Claude Le Dantec

Inventor： Philippe Piret ,  Claude Le Dantec

IPC: G06K936

CPC classification number: H03M13/2972 ,  G06T9/001 ,  H03M13/23 ,  H03M13/27 ,  H03M13/29

Abstract: The encoding method to which the present invention relates takes into account a serial turbo-encoding having at least one permutation operation which retains the divisibility of polynomial representations of sequences by predetermined polynomials and a convolutional encoding operation which includes a division by such a predetermined polynomial.

Abstract translation: 本发明涉及的编码方法考虑了具有至少一个置换操作的串行turbo编码，该排列操作通过预定的多项式保持序列的多项式表示的可分割性，以及包括通过这样的预定多项式进行除法的卷积编码操作。

公开(公告)号：US06510181B1

公开(公告)日：2003-01-21

申请号：US09298828

申请日：1999-04-26

Applicant: Philippe Piret

Inventor： Philippe Piret

IPC: H04K2700

CPC classification number: H04B1/707 ,  H04J13/004 ,  H04J13/18

Abstract: A method of sending information includes sending, on a transmission channel, sequences of symbols. The sequences are of a fixed length that is not a multiple of 4 and are taken from a collection of sequences, at least three of which are orthogonal in pairs and such that any pair of sequences that is not orthogonal to each other comprises opposite sequences. The symbols are taken from an alphabet of non-nil integers.

Abstract translation: 发送信息的方法包括在传输信道上发送符号序列。 序列具有不是4的倍数的固定长度，并且取自序列集合，其中至少三个是成对正交的，并且使得彼此不正交的任何一对序列包含相反的序列。 符号取自非零整数的字母表。

公开(公告)号：US06438112B1

公开(公告)日：2002-08-20

申请号：US09096516

申请日：1998-06-12

Applicant: Philippe Piret ,  Claude Le Dantec

Inventor： Philippe Piret ,  Claude Le Dantec

IPC: H04J1100

CPC classification number: H03M13/39 ,  H03M13/25 ,  H04B1/707 ,  H04L27/34

Abstract: The information coding device has: a first labeling means adapted to associate, with the information to be coded, K “initial” first degree polynomials, a coding means which performs a polynomial calculation: to form K “coded” sequences of P, greater than or equal to K, “coded” polynomials, the first being equal to one of the K initial polynomials and the others to the product of the preceding polynomial and a predetermined polynomial, and to form a “resultant” sequence of P “resultant” polynomials respectively equal to the sums of the coded polynomials of same rank of the K coded sequences, a second one-to-one labeling means adapted to label the points of a quadrature amplitude modulation signal constellation with the Q2 resultant polynomials, for two adjacent points of the constellation, the polynomials labeling them have one identical coefficient and the other coefficient differing only by 1 modulo Q, and a modulator for quadrature amplitude modulation.

Abstract translation: 信息编码装置具有：适于与要编码的信息相关联的第一标记装置K“初始”第一级多项式，执行多项式计算的编码装置：形成P的K个“编码”序列，大于 或等于K个“编码”多项式，第一个等于K个初始多项式中的一个等于前一个多项式和预定多项式的乘积，并分别形成“合成”P个“合成”多项式序列 等于K个编码序列的相同等级的编码多项式的和，适用于将正交幅度调制信号星座的点与Q2合成多项式标记的第二一对一标记装置，用于 星座图，标注它们的多项式具有一个相同的系数，而另一个系数只有1个模Q不同，而一个用于正交幅度调制的调制器。

公开(公告)号：USD460655S1

公开(公告)日：2002-07-23

申请号：US29126168

申请日：2000-07-12

Applicant: Philippe Piret

Designer： Philippe Piret

公开(公告)号：US06370670B1

公开(公告)日：2002-04-09

申请号：US09222849

申请日：1998-12-30

Applicant: Claude Le Dantec ,  Philippe Piret

Inventor： Claude Le Dantec ,  Philippe Piret

IPC: G06F1100

CPC classification number: H03M13/2993 ,  H03M13/271 ,  H03M13/2771

Abstract: A coding method for padding K information sequences ui (i=1, 2, . . . , K) to produce K+M1 binary sequences ai (i=1, 2, . . . , K) and ci (i=1, 2, . . . , M1) so that the sequences ai are divisible by a set of K predetermined generator polynomials gi(x) (i=1, 2, . . . , K) each dividing (XN0+1) and the M1 sequences ci are obtained in a calculation involving permutations of the sequences ai (i=1, 2, . . . , K); the permutations having the property of transforming a cyclic code of length N0 with generator polynomial gi(x) to an equivalent cyclic code with a predetermined generator polynomial gij(x).

Abstract translation: 一种用于填补K个信息序列ui（i = 1,2，...，K）以产生K + M1二进制序列ai（i = 1,2，...，K）和ci（i = 1， 2，...，M1），使得序列ai可以通过每个划分（XN0 + 1）和M1的一组K个预定生成多项式gi（x）（i = 1,2，...，K） 在包括序列ai（i = 1,2，...，K）的排列的计算中获得序列ci; 具有将具有生成多项式gi（x）的长度为N0的循环码变换为具有预定生成多项式gij（x）的等效循环码的性质的排列。

公开(公告)号：US5867508A

公开(公告)日：1999-02-02

申请号：US840820

申请日：1997-04-16

Applicant: Philippe Piret

Inventor： Philippe Piret

IPC: H03M7/14 ,  H04B14/04 ,  H04L1/00 ,  H03M13/00

CPC classification number: H04L1/0054 ,  H04L1/0041

Abstract: According to the invention, for the transmission of sequences of information items referred to as "code words", among which sequences referred to as "operative words" are selected, on reception of a signal representing received words, each formed from a sequence of numbers having one of at least three values, and representing a code word, the following are implemented: a function of combining two sequences, one of which is an operative word, the said combination providing a so-called "resultant" sequence; a measurement whereby there is made to correspond to each sequence a real number representing the degree of coherence of the sequence; and, for each word received; at least one sequence resulting from the said received word and from an operative word is calculated iteratively and the said received word is replaced by the said resultant sequence from the moment when the measurement of the degree of coherence of the latter indicates a coherence less than that of the received word, this resultant sequence being referred to as a "replacement sequence", until no new combination of the last replacement sequence with any operative word exhibits a degree of coherence whose measurement is less than that of the said last replacement sequence,; the said last replacement sequence then being considered as representing the difference between the word received and the code word which it represents.

Abstract translation: 根据本发明，对于被称为“代码字”的信息项的序列的传输，其中选择了称为“操作字”的序列，在接收到表示接收到的字的信号时，每个由数字序列形成 具有至少三个值中的一个并且表示码字，实现以下功能：组合两个序列的功能，其中一个是一个操作字，所述组合提供所谓的“结果”序列; 这样做的测量结果使得与每个序列相对应的表示序列一致性的实数; 对于收到的每一个字; 从所述接收到的字和从操作字产生的至少一个序列被迭代地计算，并且从后者的相干程度的测量指示相干度的相关性小于那一点的时刻，所述接收到的字被所述结果序列替换。 将所得到的序列称为“替换序列”，直到最后一个替换序列与任何手术词的新组合不存在其测量值小于所述最后替换序列的相干程度; 所述最后一个替换序列然后被认为表示所接收的字与其表示的码字之间的差异。