-
1.发明授权Method, device and software application for transmitting data packets in a communication system 失效用于在通信系统中传输数据分组的方法，设备和软件应用公开(公告)号：US08386901B2
公开(公告)日：2013-02-26
申请号：US12441101
申请日：2007-09-26
IPC分类号： G06F11/00
CPC分类号： H04L1/1819 , H04L69/16 , H04L69/163
摘要： A transmitting apparatus transmits a plurality of data packets to a receiver in a communication system, by transmitting one or more data packets from a list of data packets to be transmitted, and determining whether an acknowledgment is received for each transmitted data packet. When it is determined that an acknowledgement has not been received for at least one data packet, referred to as an unacknowledged data packet, the apparatus selects one or more additional data packets from the list of data packets to be transmitted, generates 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, and transmits at least one of the generated parity packets.
摘要翻译： 发送装置通过从要发送的数据分组的列表发送一个或多个数据分组，并且确定是否为每个发送的数据分组接收到确认，在通信系统中向接收机发送多个数据分组。 当确定至少一个称为未确认数据分组的数据分组的确认尚未被接收时，该装置从要发送的数据分组列表中选择一个或多个附加数据分组，产生一个或多个奇偶校验 通过使用前向纠错方案对包含所选择的一个或多个附加数据分组的组合的数据块和至少一个未确认的数据分组进行编码来发送分组，并且发送所生成的奇偶分组中的至少一个。
-
2.发明申请METHOD, DEVICE AND SOFTWARE APPLICATION FOR TRANSMITTING DATA PACKETS IN A COMMUNICATION SYSTEM 失效用于在通信系统中发送数据分组的方法，设备和软件应用公开(公告)号：US20090271681A1
公开(公告)日：2009-10-29
申请号：US12441101
申请日：2007-09-26
CPC分类号： H04L1/1819 , H04L69/16 , H04L69/163
摘要： 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.
摘要翻译： 本发明涉及一种用于在数据通信系统中向接收机发送多个数据分组的方法。 该方法包括以下步骤：从要发送的数据分组列表发送一个或多个数据分组（300）; 确定是否为每个发送的数据分组（301）接收到确认，并且还包括当在所述确定步骤确定对于至少一个数据分组（被称为未确认数据）尚未接收到确认时执行的以下步骤 分组：从要发送的数据分组的列表中选择一个或多个附加数据分组（302）; 通过使用前向纠错方案（304）对包含所选择的一个或多个附加数据分组的组合的数据块和至少一个未确认的数据分组进行编码来生成一个或多个奇偶分组; 以及发送所生成的奇偶校验分组（305）中的至少一个。 本发明还涉及用于发送多个数据分组并用于接收它们的软件应用。 此外，本发明涉及分别实现用于发送多个数据分组的软件应用和用于接收那些数据分组的软件应用的发送设备和接收设备，以及用于存储这些软件应用的代码的存储介质。
-
公开(公告)号：US07502988B2
公开(公告)日：2009-03-10
申请号：US11067067
申请日：2005-02-25
IPC分类号： H03M13/00
CPC分类号： H03M13/132 , H03M13/05 , H03M13/1515 , H03M13/1525
摘要： A method of decoding a one-point algebraic geometric code defined on an algebraic curve of the kind C(a,b), represented by an equation of degree b in X and of degree a in Y. For any received word, transmission errors affecting the received word are located. The correction of errors in the word, which belongs to an algebraic geometric code, is then reduced to the correction of errors in a certain number, at most equal to a, of words belonging to a Reed-Solomon code. Devices and apparatuses adapted to implement this method are also described.
摘要翻译： 对由C类（a，b）的代数曲线定义的一点代数几何代码进行解码的方法，由X中的程度b的等式表示，并且在Y中为a度。对于任何接收到的字，影响传输错误 收到的单词位于。 然后将属于代数几何代码的单词中的错误的校正减少为属于里德 - 所罗门码的单词的一定数量，最多等于a的错误校正。 还描述了适于实现该方法的装置和装置。
-
公开(公告)号：US20080270873A1
公开(公告)日：2008-10-30
申请号：US11722465
申请日：2005-12-22
申请人： Philippe Piret , Philippe Le Bars
发明人： Philippe Piret , Philippe Le Bars
IPC分类号： H03M13/13
CPC分类号： H03M13/132
摘要： The present invention relates to 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, comprising the following steps: —calculating extended error syndromes (σj(i)) associated with a received word (r); —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. Since the error value is determined for each component, it is not necessary to have recourse to an error locating step. The invention also relates to devices and apparatuses associated with the method.
摘要翻译： 本发明涉及一种解码在由X的等级b的等式F（X，Y）= 0表示的类型C（a，b）的代数曲线上定义的一点代数几何码的方法， 包括以下步骤：计算与接收到的字（r）相关联的扩展错误综合征（sigma）（i））。 基于所计算的扩展误差综合征，确定接收到的字r的每个分量（r（x，y，p（x）））中的错误值。 由于为每个组件确定了错误值，因此无需追求错误定位步骤。 本发明还涉及与该方法相关联的装置和装置。
-
公开(公告)号：US08132078B2
公开(公告)日：2012-03-06
申请号：US11722465
申请日：2005-12-22
申请人： Philippe Piret , Philippe Le Bars
发明人： Philippe Piret , Philippe Le Bars
IPC分类号： H03M13/00
CPC分类号： H03M13/132
摘要： 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.
摘要翻译： 对由X中的b度的方程F（X，Y）= 0表示的类型C（a，b）的代数曲线上定义的一点代数几何代码的方法和在Fq上的Y中的度a， 包括计算与接收到的字（r）相关联的扩展误差综合征（＆sgr; j（i）），并且基于接收字r的每个分量r（x，yp，（x））中的误差值确定 扩展错误综合征计算。
-
公开(公告)号：US07461329B2
公开(公告)日：2008-12-02
申请号：US11085129
申请日：2005-03-22
CPC分类号： H03M13/132
摘要： 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.
摘要翻译： 编码信息符号的方法包括一个步骤，其中与矩阵H正交的单词，其元素Halphabeta等于在点Pbeta处的一些单项式Halpha = YjXi取的值 某些定位集合与属于伽罗瓦域Fq的k个信息符号的每个块相关联。 该方法选择一组单项式，以便定义可以通过低复杂度聚合的算法解码的代码，并且其提供非常好的纠错能力，特别是对于其中错误倾向于在突发中发生的信道。 还公开了适于实现该方法的装置和装置。
-
公开(公告)号：US20050138533A1
公开(公告)日：2005-06-23
申请号：US10952597
申请日：2004-09-29
CPC分类号： H03M13/132 , G11B20/18 , H03M13/1515 , H03M13/153 , H03M13/154 , H03M13/155
摘要： 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.
摘要翻译： 本发明涉及一种用于编码信息符号的设备（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）。
-
公开(公告)号：US07464323B2
公开(公告)日：2008-12-09
申请号：US10746144
申请日：2003-12-29
IPC分类号： H03M13/00
CPC分类号： H03M13/132 , H03M13/17
摘要： The present invention concerns channel codes particularly well adapted to transmission in channels in which errors tend to occur in bursts. Moreover, the codes according to one embodiment of the invention using an algebraic geometric curve are easy to decode and have a relatively high minimum distance. The invention also relates to the corresponding encoding and decoding methods, as well as the devices and apparatuses adapted to implement those methods. Application is in particular to mass storage, and to systems of communication by OFDM.
摘要翻译： 本发明涉及特别适用于其中在突发中倾向于发生错误的信道中的传输的信道码。 此外，根据使用代数几何曲线的本发明的一个实施例的代码易于解码并且具有相对较高的最小距离。 本发明还涉及相应的编码和解码方法以及适于实现这些方法的装置和装置。 应用特别是大容量存储，以及通过OFDM的通信系统。
-
公开(公告)号：US07398456B2
公开(公告)日：2008-07-08
申请号：US10565280
申请日：2004-07-21
IPC分类号： H03M13/00
CPC分类号： H03M13/159 , H03M13/1515 , H03M13/1535 , H03M13/155
摘要： The present invention concerns an encoding method in which encoding is performed of any information word a of length k in the form of a word ν belonging to a Reed-Solomon code C of dimension k′ and length n′ (with n′−k′=n−k) such that the components of ν′ situated in (n′−n) arbitrary predetermined positions be systematically equal to respective predetermined constants (for example, all zero). The possibility then exists of deleting those components of fixed value to obtain a word ν of length n belonging to a code C, which thus constitutes a code that is shortened with respect to code C. The invention also relates to devices and apparatuses adapted to implement the encoding method. The invention may be used for encoding by means of an algebraic geometric code, when such encoding may be implemented by encoding by means of a plurality of shortened Reed-Solomon codes.
摘要翻译： 本发明涉及一种编码方法，其中以属于尺寸k'和长度n'（n'-k'）的Reed-Solomon码C的单词nu的形式的任何长度为k的信息字a执行编码， = nk），使得位于（n'-n）任意预定位置的nu'的分量系统地等于相应的预定常数（例如，全零）。 然后存在删除固定值的那些分量的可能性以获得属于代码C的长度为n的字nu，这样构成相对于代码C被缩短的代码。本发明还涉及适于实现的设备和装置 编码方法。 本发明可以用于通过代数几何码的编码，当这种编码可以通过借助于多个缩短的里德 - 所罗门码的编码来实现时。
-
公开(公告)号：US07392461B2
公开(公告)日：2008-06-24
申请号：US11034009
申请日：2005-01-13
IPC分类号： H03M13/00
CPC分类号： H03M13/132
摘要： The present invention concerns a method and apparatus of decoding a one-point algebraic geometric code defined on an algebraic curve represented by an equation in X and Z of degree 2μφ in Z, where φ is a strictly positive integer and μ an integer greater than 1, obtained by taking the fiber product of μ component algebraic equations, each of said component equations governing the unknown X and an unknown Yi, where i=0, . . . , μ−1, and being of degree 2φ in Yi. This method comprises the decoding of 2(μ−1)φ “clustered” codes, all defined on the same algebraic curve represented by one of said component equations.
摘要翻译： 本发明涉及一种解码在由Z中的程度2 Muphi 的X和Z表示的代数曲线上定义的一点代数几何代码的方法和装置，其中phi是严格正数 通过获取μ分量代数方程的纤维积，通过控制未知X的每个组分方程和其中i = 0的未知Y i i，得到整数和μa大于1的整数。 。 。 ，mu-1，并且在YII中具有2级的phi 。 该方法包括对由所述分量方程之一表示的相同代数曲线上定义的2（μ-1）个“聚集”码的解码。 本发明还涉及适于实现该方法的装置和装置。
-
-
-
-
-
-
-
-
-
搜索结果
75 条记录 (耗时 0.025 秒)