中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

75 records (took 0.026 seconds)

    Decoding method for algebraic geometric codes and associated device
    24.
    发明授权
    Decoding method for algebraic geometric codes and associated device 有权
    代数几何代码和相关设备的解码方法

    公开(公告)号：US08132078B2

    公开(公告)日：2012-03-06

    申请号：US11722465

    申请日：2005-12-22

    Applicant: Philippe Piret ,  Philippe Le Bars

    Inventor： Philippe Piret ,  Philippe Le Bars

    IPC: H03M13/00

    CPC classification number: H03M13/132

    Abstract: A method of decoding a one-point algebraic geometric code defined on an algebraic curve of type C(a,b) represented by an equation F(X,Y) =0 of degree b in X and of degree a in Y over Fq, includes calculating extended error syndromes (σj(i)) associated with a received word (r) and determining the values of errors in each component r(x,yp,(x)) of the received word r, on the basis of the extended error syndromes calculated.

    Abstract translation: 对由X中的b度的方程F（X，Y）= 0表示的类型C（a，b）的代数曲线上定义的一点代数几何代码的方法和在Fq上的Y中的度a， 包括计算与接收到的字（r）相关联的扩展误差综合征（＆sgr; j（i）），并且基于接收字r的每个分量r（x，yp，（x））中的误差值确定 扩展错误综合征计算。

    METHOD, DEVICE AND SOFTWARE APPLICATION FOR TRANSMITTING DATA PACKETS IN A COMMUNICATION SYSTEM
    25.
    发明申请
    METHOD, DEVICE AND SOFTWARE APPLICATION FOR TRANSMITTING DATA PACKETS IN A COMMUNICATION SYSTEM 失效
    用于在通信系统中发送数据分组的方法，设备和软件应用

    公开(公告)号：US20090271681A1

    公开(公告)日：2009-10-29

    申请号：US12441101

    申请日：2007-09-26

    Applicant: Philippe Piret ,  Philippe Le Bars ,  Julien Sevin-Renault

    Inventor： Philippe Piret ,  Philippe Le Bars ,  Julien Sevin-Renault

    IPC: H04L1/18 ,  H03M13/00

    CPC classification number: H04L1/1819 ,  H04L69/16 ,  H04L69/163

    Abstract: The invention relates to a method for transmitting a plurality of data packets to a receiver in a data communication system. The method comprises the steps of transmitting one or more data packets from a list of data packets to be transmitted (300); determining whether an acknowledgment is received for each transmitted data packet (301), and further comprises the following steps executed when it is determined at the determining step that an acknowledgement has not been received for at least one data packet, referred to as an unacknowledged data packet: selecting one or more additional data packets from the list of data packets to be transmitted (302); generating one or more parity packets by encoding a block of data containing a combination of the selected one or more additional data packets and at least one unacknowledged data packet using a forward error correction scheme (304); and transmitting at least one of the generated parity packets (305).The invention also relates to software applications for transmitting a plurality of data packets and for receiving them. Furthermore, the invention relates to a transmitting device and a receiving device implementing respectively the software application for transmitting the plurality of data packets and the software application for receiving those data packets, and to a memory medium for storing the code of such software applications.

    Abstract translation: 本发明涉及一种用于在数据通信系统中向接收机发送多个数据分组的方法。 该方法包括以下步骤：从要发送的数据分组列表发送一个或多个数据分组（300）; 确定是否为每个发送的数据分组（301）接收到确认，并且还包括当在所述确定步骤确定对于至少一个数据分组（被称为未确认数据）尚未接收到确认时执行的以下步骤 分组：从要发送的数据分组的列表中选择一个或多个附加数据分组（302）; 通过使用前向纠错方案（304）对包含所选择的一个或多个附加数据分组的组合的数据块和至少一个未确认的数据分组进行编码来生成一个或多个奇偶分组; 以及发送所生成的奇偶校验分组（305）中的至少一个。 本发明还涉及用于发送多个数据分组并用于接收它们的软件应用。 此外，本发明涉及分别实现用于发送多个数据分组的软件应用和用于接收那些数据分组的软件应用的发送设备和接收设备，以及用于存储这些软件应用的代码的存储介质。

    Channel encoding adapted to error bursts
    26.
    发明授权
    Channel encoding adapted to error bursts 失效
    通道编码适用于错误突发

    公开(公告)号：US07461329B2

    公开(公告)日：2008-12-02

    申请号：US11085129

    申请日：2005-03-22

    Applicant: Philippe Piret ,  Frédéric Lehobey ,  Philippe Le Bars

    Inventor： Philippe Piret ,  Frédéric Lehobey ,  Philippe Le Bars

    IPC: G06F11/00 ,  G08C25/00

    CPC classification number: H03M13/132

    Abstract: A method of encoding information symbols comprises a step in which a word v, orthogonal to a matrix H, the element Hαβ of which is equal to the value taken by some monomial hα=YjXi at the point Pβ of some locating set, is associated with every block of k information symbols belonging to a Galois field Fq. The method chooses the set of monomials hα so as to define codes which can be decoded with an algorithm by aggregates of low complexity, and which provides a very good error correction capability, in particular for channels in which the errors tend to occur in bursts. Devices and apparatuses adapted to implement this method are also disclosed.

    Abstract translation: 编码信息符号的方法包括一个步骤，其中与矩阵H正交的单词，其元素Halphabeta等于在点Pbeta处的一些单项式Halpha = YjXi取的值 某些定位集合与属于伽罗瓦域Fq的k个信息符号的每个块相关联。 该方法选择一组单项式，以便定义可以通过低复杂度聚合的算法解码的代码，并且其提供非常好的纠错能力，特别是对于其中错误倾向于在突发中发生的信道。 还公开了适于实现该方法的装置和装置。

    Method of interleaving a binary sequence
    27.
    发明授权
    Method of interleaving a binary sequence 失效

    公开(公告)号：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.)

    Encoding/decoding device using a reed-solomon encoder/decoder
    29.
    发明申请
    Encoding/decoding device using a reed-solomon encoder/decoder 失效
    使用芦苇编码器/解码器的编码/解码装置

    公开(公告)号：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）。

    Coding device and method, decoding device and method and systems using them
    30.
    发明授权
    Coding device and method, decoding device and method and systems using them 失效
    编码装置和方法，解码装置及使用它们的方法和系统

    公开(公告)号：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）的操作。

Patent Agency Ranking