公开(公告)号：US07069492B2

公开(公告)日：2006-06-27

申请号：US10386722

申请日：2003-03-13

Applicant: Philippe Piret

Inventor： Philippe Piret

IPC: H03M13/00

CPC classification number: H03M13/2771 ,  H03M13/2993

Abstract: To interleave a binary sequence a represented by the polynomial a ⁡ ( x ) = ∑ i = 0 n - 1 ⁢ a i ⁢ x i , where n=R.M with R≧M, i being an integer which may be written i=r.M+c, r and c being integers, r≧0 and c ε [0, M−1], there is obtained, from the sequence a, an interleaved binary sequence a*. The interleaved binary data sequence a* represented by the polynomial a * ⁡ ( x ) = ∑ i = 0 n - 1 ⁢ a i ⁢ x i * where i*=[r−h(c)].M+c mod n, the h(c) being obtained by the choice of an M-tuple h0=[h0(0), . . . , h0(M−1)] of non-negative integers less than R−1 such that, given a predetermined set Π of circulating matrices P of dimension M×M, for any matrix P of Π, the residues modulo R of the components of the vector h0.P are not nil; and the corresponding choice of an M-tuple h obtained from h0 by the application of a permutation moving h0(c) to position L×c mod M, the integer L being relatively prime with M. (It is noted that the above underlining of the variables, and the above single bracketing, is in the original and is meant to be permanent.)

公开(公告)号：USD521813S1

公开(公告)日：2006-05-30

申请号：US29223997

申请日：2005-02-23

Applicant: Philippe Piret

Designer： Philippe Piret

公开(公告)号：US20050138533A1

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

申请号：US10952597

申请日：2004-09-29

Applicant: Philippe Le Bars ,  Philippe Piret ,  Frederic Lehobey

Inventor： Philippe Le Bars ,  Philippe Piret ,  Frederic Lehobey

IPC: G11B20/18 ,  H03M13/15 ,  H03M13/00

CPC classification number: H03M13/132 ,  G11B20/18 ,  H03M13/1515 ,  H03M13/153 ,  H03M13/154 ,  H03M13/155

Abstract: The present invention concerns a device (10) for the encoding of information symbols to transmit or to record, and for the correction of errors among the symbols received or read, according to codes defined over a Galois field Fq, where q is an integer greater than 2 and equal to a power of a prime number, and in which a set of elements of Fq are considered which are denoted yl(j), where j=1, . . . , R with 1≦R≦q−1 and l=0, . . . , p−1 with p>1. Said device (10) comprises a Reed-Solomon encoder (210), a Reed-Solomon decoder (220) and a unit (500) serving to calculate the inverse of a Vandermonde matrix as well as: registers “A” (420, 430, 440, 450) in which are stored, for the encoding, said information symbols, and, for the error correction, the symbols received or read after they have been corrected, registers “S” (280, 285, 290, 295) in which are stored, for the encoding, the symbols output from said Reed-Solomon encoder (210), and, for the error correction, the symbols entering said Reed-Solomon decoder (220), and registers “Y” (410, 411, 412, 413) in which said quantities yl(j) are stored.

Abstract translation: 本发明涉及一种用于编码信息符号的设备（10），用于根据Galois域F 中定义的代码对接收或读取的符号进行传输或记录以及纠正错误的信息符号 >，其中q是大于2并且等于素数的幂的整数，并且其中考虑了一组表示为Q 1的元素的集合。 >（j），其中j = 1。 。 。 ，R 1具有1≤R= q-1且l = 0。 。 。 ，p-1，p> 1。 所述设备（10）包括Reed-Solomon编码器（210），Reed-Solomon解码器（220）和用于计算Vandermonde矩阵的逆的单元（500），以及：寄存器“A”（420,430 ，440,450），其中存储有用于编码所述信息符号的数据，并且对于在纠正之后接收或读取的符号进行纠错，将“S”（280,285,290,295）注册在 用于编码从所述里德 - 所罗门编码器（210）输出的符号，以及对于进入所述里德 - 所罗门解码器（220）的符号进行纠错，并将“Y”（410,411,411） 412，413），其中存储了所述量（yl）。

公开(公告)号：US06578170B1

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

申请号：US09470205

申请日：1999-12-22

Applicant: Philippe Piret ,  Claude Le Dantec

Inventor： Philippe Piret ,  Claude Le Dantec

IPC: H03M1329

CPC classification number: H04L1/005 ,  H03M13/152 ,  H03M13/271 ,  H03M13/296 ,  H03M13/2966 ,  H04L1/0041 ,  H04L1/0065 ,  H04L1/0066 ,  H04L1/18

Abstract: The decoding method to which the present invention relates takes into account: at least one predetermined polynomial, and a received sequence r capable of being the result of the coding of a sequence of information symbols of polynomial representation u(x) representing a physical quantity, the coding including a turbocoding, and guaranteeing the divisibility of a sequence to be turbocoded, a(x) representing the sequence u(x), by each predetermined polynomial, This method includes: an operation of turbodecoding (601) the received sequence r into an estimated sequence â, at least one operation of calculating the remainder (602, 606) of the division of the polynomial representation â(x) of the estimated sequence â, by a said predetermined polynomial.

Abstract translation: 本发明涉及的解码方法考虑到：至少一个预定多项式，以及能够作为表示物理量的多项式表示u（x）的信息符号序列的编码结果的接收序列r， 编码，包括turbo编码，并且通过每个预定的多项式来保证要被turbo编码的序列的可分性，表示序列u（x）的一个（x）。该方法包括：将接收到的序列r转换成 估计序列â至少一个计算所述预定序列的多项式表示â（x）除以所述预定多项式的余数（602,606）的操作。

公开(公告)号：US06543021B1

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

申请号：US09353155

申请日：1999-07-14

Applicant: Philippe Piret

Inventor： Philippe Piret

IPC: H03M1300

CPC classification number: H03M13/2963 ,  H03M13/152 ,  H03M13/19 ,  H03M13/2717 ,  H03M13/2721

Abstract: A method is provided for coding information representing a physical quantity and represented by first binary symbols, having an operation of calculating second binary symbols from the information, the second binary symbols being called calculated binary symbols and being provided in order to be disposed in a square table. For each calculated binary symbol, there exist at least three distinct diagonals in the table which contain this calculated binary symbol and which, deprived of this calculated binary symbol, still allow each one on its own to recalculate the calculated binary symbol. A coding device, a decoding method, a decoding device, a transmission method, and a transmission device are provided, as well as a camera, a facsimile machine, photographic apparatus, and a computer, implementing the invention.

Abstract translation: 提供了一种用于编码表示物理量并由第一二进制符号表示的信息的方法，其具有从信息计算第二二进制符号的操作，第二二进制符号被称为计算的二进制符号，并且被提供以便被布置在正方形 表。 对于每个计算的二进制符号，在表中存在至少三个不同的对角线，其中包含该计算的二进制符号，并且被剥夺该计算的二进制符号仍然允许每个独立的对角线重新计算所计算的二进制符号。 提供了一种编码装置，解码方法，解码装置，传输方法和传输装置，以及实现本发明的照相机，传真机，照相装置和计算机。

公开(公告)号：US06400726B1

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

申请号：US08997335

申请日：1997-12-24

Applicant: Philippe Piret ,  Pascal Rousseau

Inventor： Philippe Piret ,  Pascal Rousseau

IPC: H04L12413

CPC classification number: H04L63/101 ,  H04W4/24 ,  H04W12/08 ,  H04W72/044

Abstract: The invention proposes a method for allocating, to a plurality of elements, authorisations for access to a shared resource, including the step (E4) of storing the address of elements capable of accessing the shared resource, characterised in that it includes the steps of determining (E6), for the plurality of elements, a number (TTJ) of authorisations for access to the resource, the said authorisations together forming a cycle, then successively assigning (E8, E80) each of the said authorisations to the elements, during the said cycle, an access authorisation being assigned to an element according to at least the number of times the element under consideration accessed the resource during the preceding cycle, and finally storing (E88, E890) the number of times each element accesses the resource during the said cycle.

Abstract translation: 本发明提出了一种用于向多个元件分配用于访问共享资源的授权的方法，包括存储能够访问共享资源的元素的地址的步骤（E4），其特征在于，其包括以下步骤：确定 （E6），对于所述多个元素，用于访问所述资源的授权的数量（TTJ），所述授权在一起形成循环，然后在所述元素期间将每个所述授权连续地分配（E8，E80）到所述元素 所述周期，根据至少在所考虑的元件访问资源的次数，至少分配给元素的访问授权被分配给元素，并且最后在（E88，E890）期间存储每个元素在 说周期。