专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

41. 发明申请

US20050204268A1 Decoding and error correction for algebraic geometric codes 失效
标题翻译：代数几何代码的解码和纠错
公开(公告)号：US20050204268A1
公开(公告)日：2005-09-15
申请号：US11067067
申请日：2005-02-25
申请人： Philippe Piret , Frederic Lehobey , Philippe Le Bars
发明人： Philippe Piret , Frederic Lehobey , Philippe Le Bars
IPC分类号： H03M13/05 , H03M13/15 , 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, comprises, for any received word, a step of locating transmission errors affecting said received word. The correction of errors in said 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.
摘要翻译：在由X中的度数b和Y表示的程度a表示的类型C（a，b）的代数曲线上定义的一点代数几何代码的方法包括对于任何接收到的字，定位影响所述接收字的传输错误的步骤。然后，属于代数几何代码的所述单词中的错误校正被减少为属于里德 - 所罗门码的单词的一定数量，最多等于a的误差校正。还描述了适于实现该方法的装置和装置。

42. 发明申请

US20050188291A1 Error locating methods and devices for algebraic geometric codes 失效
标题翻译：定位代数几何代码的方法和设备出错
公开(公告)号：US20050188291A1
公开(公告)日：2005-08-25
申请号：US11012092
申请日：2004-12-16
申请人： Philippe Piret , Frederic Lehobey , Philippe Le Bars
发明人： Philippe Piret , Frederic Lehobey , Philippe Le Bars
IPC分类号： H03M13/13 , H03M13/00
CPC分类号： H03M13/132
摘要： In a method of decoding a one-point algebraic geometric code of dimension k and length n, in order to identify the position of the errors in a received word, the syndromes matrix S, of dimension (n−k)×(n−k) is defined, of which the elements Sij of each line i are calculated, for j between 1 and w(i), where the boundary w is a decreasing function, using the syndrome s of the received word, as well as the matrix S* obtained by “extending” the matrix S, that is to say by calculating the value of certain elements S*ij where j is greater than w(i). This method makes it possible in certain favorable cases to find the erroneous positions of the received word when the number of errors is greater than (n−k+1−g)/2, even if it is not possible to calculate all the elements of S* conventionally required by a two-stage algorithm to perform that correction. Devices and apparatuses adapted to implement this method are also discussed.
摘要翻译：在解码尺寸k和长度为n的一点代数几何代码的方法中，为了识别接收到的字中的错误的位置，定义尺寸（nk）×（nk）的校正矩阵S，对于i和w（i）之间的j，计算每行i的元素S ij ij，其中边界w是递减函数，使用综合征 s，以及通过“扩展”矩阵S而获得的矩阵S *，也就是说通过计算某些元素S * 其中j大于w的值一世）。该方法使得当误差数大于（n-k + 1-g）/ 2时，在某些有利的情况下可以发现接收字的错误位置，即使不可能计算出所有元素的全部元素 S *通常由两级算法执行该校正所要求的。还讨论了适用于实现该方法的装置和装置。

43. 发明授权

US06842871B2 Encoding method and device, decoding method and device, and systems using them 失效
标题翻译：编码方法和设备，解码方法和设备，以及使用它们的系统
公开(公告)号：US06842871B2
公开(公告)日：2005-01-11
申请号：US09733965
申请日：2000-12-12
申请人： Philippe Piret , Claude Le Dantec
发明人： Philippe Piret , Claude Le Dantec
IPC分类号： H03M13/00 , H03M13/15 , H03M13/27 , H03M13/29 , H03M13/45 , H04L1/00 , G06F11/00
CPC分类号： H03M13/271 , H03M13/2771 , H03M13/2903 , H03M13/2993 , H03M13/6356 , H03M13/6362
摘要： 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*).
摘要翻译：为了对二进制数据（u）的原始序列进行编码，执行第一填补操作（508），补充原始序列（u），使得补充序列（u）可被第一因子多项式除尽; 使用第一因子多项式，对补充的原始序列（u）进行编码，执行第一递归卷积编码操作（508）; 执行交织操作（506），通过特定置换来排列原始序列（u）中的二进制数据，以获得交织序列（u *）; 执行第二填补操作（510），补充交错序列（u *），使得补充的交错序列（u *）可被第二因子多项式（g2）整除; 并且使用第二因子多项式来执行第二递归卷积编码操作（510），对补充的交错序列（u *）进行编码。

44. 发明授权

US06578171B1 Method of correcting residual errors at the output of a turbodecoder 失效
标题翻译：纠正Turbodecoder输出端残余误差的方法
公开(公告)号：US06578171B1
公开(公告)日：2003-06-10
申请号：US09500425
申请日：2000-02-09
申请人： Mohamed Braneci , Patrice Nezou , Pascal Rousseau , Philippe Piret , Claude Le Dantec
发明人： Mohamed Braneci , Patrice Nezou , Pascal Rousseau , Philippe Piret , Claude Le Dantec
IPC分类号： H03M1300
CPC分类号： H04L1/00 , H03M13/1515 , H03M13/19 , H03M13/29 , H03M13/2906 , H03M13/2915 , H03M13/2966
摘要： A method of transmitting binary data by a sender to a receiver over a transmission channel includes a formatting function integrated with a function of external coding of the binary data. The method applies in particular to the case where the sender uses a turbocoder with an interleaver of the “x to xe” type, and where the receiver uses a turbodecoder with an interleaver of the “x to xe” type.
摘要翻译：通过传输信道将发送方发送二进制数据的方法包括与二进制数据的外部编码功能集成的格式化功能。该方法特别适用于发送器使用具有“x至xe”类型的交织器的turbo编码器，并且其中接收机使用具有“x至xe”类型的交织器的Turbodecoder的情况。

45. 发明授权

US06560362B1 Encoding and interleaving device and method for serial or hybrid turbocodes 有权
标题翻译：用于串行或混合式turbo码的编码和交织设备和方法
公开(公告)号：US06560362B1
公开(公告)日：2003-05-06
申请号：US09435852
申请日：1999-11-08
申请人： Philippe Piret , Claude Le Dantec
发明人： Philippe Piret , Claude Le Dantec
IPC分类号： G06K936
CPC分类号： H03M13/2972 , G06T9/001 , H03M13/23 , H03M13/27 , H03M13/29
摘要： 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.
摘要翻译：本发明涉及的编码方法考虑了具有至少一个置换操作的串行turbo编码，该排列操作通过预定的多项式保持序列的多项式表示的可分割性，以及包括通过这样的预定多项式进行除法的卷积编码操作。

46. 发明授权

US06510181B1 Method and device for transmitting information, method and device for receiving information 失效
标题翻译：用于发送信息的方法和装置，用于接收信息的方法和装置
公开(公告)号：US06510181B1
公开(公告)日：2003-01-21
申请号：US09298828
申请日：1999-04-26
申请人： Philippe Piret
发明人： Philippe Piret
IPC分类号： H04K2700
CPC分类号： H04B1/707 , H04J13/004 , H04J13/18
摘要： 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.
摘要翻译：发送信息的方法包括在传输信道上发送符号序列。序列具有不是4的倍数的固定长度，并且取自序列集合，其中至少三个是成对正交的，并且使得彼此不正交的任何一对序列包含相反的序列。符号取自非零整数的字母表。

47. 发明授权

US06438112B1 Device and method for coding information and device and method for decoding coded information 失效
标题翻译：用于编码信息的装置和方法以及用于对编码信息进行解码的装置和方法
公开(公告)号：US06438112B1
公开(公告)日：2002-08-20
申请号：US09096516
申请日：1998-06-12
申请人： Philippe Piret , Claude Le Dantec
发明人： Philippe Piret , Claude Le Dantec
IPC分类号： H04J1100
CPC分类号： H03M13/39 , H03M13/25 , H04B1/707 , H04L27/34
摘要： 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.
摘要翻译：信息编码装置具有：适于与要编码的信息相关联的第一标记装置K“初始”第一级多项式，执行多项式计算的编码装置：形成P的K个“编码”序列，大于或等于K个“编码”多项式，第一个等于K个初始多项式中的一个等于前一个多项式和预定多项式的乘积，并分别形成“合成”P个“合成”多项式序列等于K个编码序列的相同等级的编码多项式的和，适用于将正交幅度调制信号星座的点与Q2合成多项式标记的第二一对一标记装置，用于星座图，标注它们的多项式具有一个相同的系数，而另一个系数只有1个模Q不同，而一个用于正交幅度调制的调制器。

48. 外观设计

USD460655S1 Electric toaster 失效
标题翻译：电烤箱
公开(公告)号：USD460655S1
公开(公告)日：2002-07-23
申请号：US29126168
申请日：2000-07-12
申请人： Philippe Piret
设计人： Philippe Piret

49. 发明授权

US06370670B1 Interlacer, coding device, permutation method, coding method, decoding device and method and systems using them 失效
标题翻译：交织器，编码装置，置换方法，编码方法，解码装置及使用它们的方法和系统
公开(公告)号：US06370670B1
公开(公告)日：2002-04-09
申请号：US09222849
申请日：1998-12-30
申请人： Claude Le Dantec , Philippe Piret
发明人： Claude Le Dantec , Philippe Piret
IPC分类号： G06F1100
CPC分类号： H03M13/2993 , H03M13/271 , H03M13/2771
摘要： 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).
摘要翻译：一种用于填补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）的等效循环码的性质的排列。

50. 发明授权

US5867508A Method and device for the correction of errors in the transmission of series of information items 失效
标题翻译：用于纠正传输系列信息项目中的错误的方法和装置
公开(公告)号：US5867508A
公开(公告)日：1999-02-02
申请号：US840820
申请日：1997-04-16
申请人： Philippe Piret
发明人： Philippe Piret
IPC分类号： H03M7/14 , H04B14/04 , H04L1/00 , H03M13/00
CPC分类号： H04L1/0054 , H04L1/0041
摘要： 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.
摘要翻译：根据本发明，对于被称为“代码字”的信息项的序列的传输，其中选择了称为“操作字”的序列，在接收到表示接收到的字的信号时，每个由数字序列形成具有至少三个值中的一个并且表示码字，实现以下功能：组合两个序列的功能，其中一个是一个操作字，所述组合提供所谓的“结果”序列; 这样做的测量结果使得与每个序列相对应的表示序列一致性的实数; 对于收到的每一个字; 从所述接收到的字和从操作字产生的至少一个序列被迭代地计算，并且从后者的相干程度的测量指示相干度的相关性小于那一点的时刻，所述接收到的字被所述结果序列替换。将所得到的序列称为“替换序列”，直到最后一个替换序列与任何手术词的新组合不存在其测量值小于所述最后替换序列的相干程度; 所述最后一个替换序列然后被认为表示所接收的字与其表示的码字之间的差异。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式