公开(公告)号：US06236650B1

公开(公告)日：2001-05-22

申请号：US08723781

申请日：1996-09-30

申请人： Claude Le Dantec ,  Falk Tannhauser

发明人： Claude Le Dantec ,  Falk Tannhauser

IPC分类号： H04J316

CPC分类号： H04L12/413 ,  H04L12/1877 ,  H04L12/403 ,  H04W4/12 ,  H04W74/04 ,  H04W84/12

摘要： In the digital communication systems, devices and methods described, a transmission medium is shared by means of service messages indicating to each digital communication device whether or not that device is authorized to send on the medium once the medium is free after the service message. Certain of these messages are collective authorization-to-send messages indicating to a group of communication devices that each is authorized to send by return. When such a collective message is sent, each receiving device, when attempting to send on the medium, determines whether or not it may send in return, in accordance with a preset rule which preferably involves a random ballot.

摘要翻译： 在数字通信系统中，所描述的设备和方法中，一旦媒体在服务消息之后媒体空闲，就通过服务消息来共享传输介质，该服务消息向每个数字通信设备指示该设备是否被授权在介质上发送。 这些消息中的某些是集体授权发送消息，指示每个被授权通过返回发送的一组通信设备。 当发送这样的集体消息时，每个接收设备在尝试在介质上发送时，根据优选涉及随机投票的预设规则确定是否可以发送。

公开(公告)号：US06625762B1

公开(公告)日：2003-09-23

申请号：US09513468

申请日：2000-02-25

申请人： Claude Le Dantec

发明人： Claude Le Dantec

IPC分类号： G06F1100

CPC分类号： H03M13/2993 ,  H03M13/271 ,  H03M13/2789 ,  H03M13/2957

摘要： The invention proposes interleaving binary symbols representing a physical quantity, used in a coding system with at least two recursive convolutional coders each having a divisor polynomial which all share the same given period, or used in a decoding system corresponding to the coding system, comprising writing binary symbols in a table having a first number of columns, equal to the period of the coders, and a second number of rows, performing first permutations of the symbols on each of the columns, and performing second permutations of the columns with each other, the second permutation preserving the property of return to zero of the coders.

摘要翻译： 本发明提出将代表物理量的二进制符号交织在具有至少两个递归卷积编码器的编码系统中，每个递归卷积编码器具有共享相同给定周期的除数多项式，或者在与编码系统相对应的解码系统中使用，包括写入 在具有等于编码器的周期的第一列数的列表中的二进制符号和第二数量的行，在每个列上执行符号的第一排列，并且彼此执行列的第二排列， 第二个排列保留了编码器返回零的属性。

公开(公告)号：US06578170B1

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

申请号：US09470205

申请日：1999-12-22

申请人： Philippe Piret ,  Claude Le Dantec

发明人： Philippe Piret ,  Claude Le Dantec

IPC分类号： H03M1329

CPC分类号： H04L1/005 ,  H03M13/152 ,  H03M13/271 ,  H03M13/296 ,  H03M13/2966 ,  H04L1/0041 ,  H04L1/0065 ,  H04L1/0066 ,  H04L1/18

摘要： 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.

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

公开(公告)号：US06393065B1

公开(公告)日：2002-05-21

申请号：US09141589

申请日：1998-08-28

申请人： Philippe Piret ,  Claude Le Dantec

发明人： Philippe Piret ,  Claude Le Dantec

IPC分类号： H04L512

CPC分类号： H03M13/1515 ,  H03M13/251 ,  H03M13/611 ,  H04L1/0057

摘要： A coding device that supplied code words, the symbols of which are capable of modulating a physical quantity on a transmission channel making use of symbols of a first alphabet. The decoding of these words uses symbols of a second alphabet containing the first alphabet, the cardinal of the second alphabet being strictly greater than that of the first alphabet and not being an integer power of the cardinal of the first alphabet. The coding device has an input of the “primary” symbols belonging to the first alphabet, a processor which determines redundant symbols capable of allowing decoding of the code words formed from primary symbols and redundant symbols, by a decoder working on the second alphabet, and solves a system of equations expressing the constraints to be met so that the redundant symbols are in the first alphabet, and an output of the symbols of the code words.

摘要翻译： 提供码字的编码装置，其符号能够利用第一字母表的符号来调制传输信道上的物理量。 这些字的解码使用包含第一字母表的第二字母表的符号，第二字母的基数严格地大于第一字母表的基数，而不是第一字母的基数的整数幂。 编码装置具有属于第一字母表的“主要”符号的输入，处理器，通过在第二字母表上工作的解码器来确定能够允许从主符号和冗余符号形成的码字的解码的冗余符号;以及 解决表达要满足的约束的等式的系统，使得冗余符号在第一字母表中，以及代码字的符号的输出。

公开(公告)号：US06766489B1

公开(公告)日：2004-07-20

申请号：US09435351

申请日：1999-11-08

申请人： Philippe Piret ,  Claude Le Dantec

发明人： Philippe Piret ,  Claude Le Dantec

IPC分类号： H03M1300

CPC分类号： H03M13/271 ,  H03M13/2789 ,  H03M13/2993

摘要： The coding method to which the present invention relates takes into account at least one selection criterion related to a transmission of binary symbols representing a physical quantity, for selecting at least one transmission parameter. Each said selected transmission parameter is in the set of parameters comprising: a number K, greater than or equal to 1, of sequences ai (i=1, . . . , K) of binary symbols, to be coded, an integer M1, equal to or greater than 2, a divisor polynomial gi(x), an integer M, an interleaver, and a multiplier polynomial fij(x). It uses an interleaver which maintains the divisibility by a polynomial gi(x).

摘要翻译： 本发明涉及的编码方法考虑到与表示物理量的二进制符号的传输相关的至少一个选择准则，用于选择至少一个传输参数。每个所述选择的传输参数在参数集中，包括： 要编码的二进制符号的序列ai（i = 1，...，K）的数目K大于或等于1，等于或大于2的整数M1，除数多项式gi（x ），整数M，交织器和乘法器多项式fij（x）。它使用通过多项式gi（x）维持可除性的交织器。

公开(公告)号：US06697855B1

公开(公告)日：2004-02-24

申请号：US09246171

申请日：1999-02-08

申请人： Claude Le Dantec ,  Pascal Rousseau

发明人： Claude Le Dantec ,  Pascal Rousseau

IPC分类号： G06F900

CPC分类号： H04W74/02 ,  H04L12/403 ,  H04L12/413 ,  H04W12/08 ,  H04W74/008 ,  H04W74/0833

摘要： The invention concerns a method for access to a transmission channel shared between several stations, characterised in that it includes iteratively: an operation (302) of estimating requirements of each of the stations for access to the transmission channel, an operation of determining groups (303 and 307) of stations taking into account the estimated access requirements of the stations, at least one of the groups of stations being said to be “collective”, an operation of allocating (308), to each of the groups, access rights each corresponding to an interval of time during which the stations which do not form part of the group are not authorised to access the transmission channel, and during which, if the group is collective, each station which it includes gains access to the transmission channel according to a contention method.

摘要翻译： 本发明涉及一种用于访问在几个站之间共享的传输信道的方法，其特征在于，它包括迭代地：估计每个站点对于传输信道的访问的需求的操作（302），确定组的操作（303 和307），考虑到车站的估计的接入要求，至少一组被称为“集体”的车站，对每个组分配（308）的操作，每个对应的接入权限 到不构成组的一部分的站的时间间隔不被授权访问传输信道，并且在该时间段期间，如果组是集合的，则其包括的每个站根据一个 争用方法。

公开(公告)号：US06229799B1

公开(公告)日：2001-05-08

申请号：US08723867

申请日：1996-09-30

申请人： Alain Caillerie ,  Claude Le Dantec ,  Pascal Rousseau

发明人： Alain Caillerie ,  Claude Le Dantec ,  Pascal Rousseau

IPC分类号： H04L316

CPC分类号： H04L12/40143 ,  H04L12/403

摘要： The device according to the invention shares a transmission medium between communication devices by allocation of authorizations to send on the medium, to each communication device. It has: a memory (65) for storing a table (64) representing communication devices (7) sharing the medium, each assigned a priority level (435, 438, 441, 444) for access to the medium; a device (94, 460, 462, 529, 543, 544, 545, 559A) for updating the access priority levels according to an estimated requirement for transmission on the medium by the communication devices under consideration.

摘要翻译： 根据本发明的设备通过分配授权在通信设备之间共享传输介质，以在介质上发送到每个通信设备。 它具有：存储器（65），用于存储表示共享介质的通信设备（7）的表（64），每个分配有用于访问介质的优先级（435,438,444,444）;设备（94， 460,462,529,543,544,545,559A），用于根据由所考虑的通信设备在介质上估计的传输需求来更新接入优先级。

公开(公告)号：US06993085B2

公开(公告)日：2006-01-31

申请号：US09826148

申请日：2001-04-05

申请人： Claude Le Dantec

发明人： Claude Le Dantec

IPC分类号： H04L27/20 ,  H03M13/23

CPC分类号： H03M13/296 ,  H03M13/2771 ,  H03M13/2996

摘要： For encoding a source sequence of symbols (u) as an encoded sequence, the source sequence (u) is divided into p1 first sub-sequences (Ui), p1 being a positive integer, and each of the first sub-sequences (Ui) is encoded in a first circular convolutional encoding method. The source sequence (u) is interleaved into an interleaved sequence (u*), and the interleaved sequence (u*) is divided into p2 second sub-sequences (U′i), p2 being a positive integer. Each of the second sub-sequences (U′i) is encoded in a second circular convolutional encoding method. At least one of the integers p1 and p2 is strictly greater than 1 and at least one of the first sub-sequences (Ui) is not interleaved into any of the second sub-sequences (U′j).(It is noted that the above underlining of the following symbols is original, and is meant to be permanent: u, Ui, u*, U′i, U′j).

摘要翻译： 为了将源序列符号（ u）编码为编码序列，源序列（ u）首先被划分为p <1> 子序列（ U ），p <1>是正整数，并且每个第一子序列（ U ）被编码在第一圆形卷积编码方法中。 源序列（ u）被交织到交织序列（ u *）中，并且交织序列（ u *）是 被分成p <2> 2个子序列（ U'，i），p 2> 2是正整数。 第二子序列（ U“>）中的每一个被编码在第二圆形卷积编码方法中。 整数p 1和p 2 2中的至少一个严格地大于1，并且至少一个第一子序列（ U ）不与第二子序列（ U“>）中的任何一个交错。 （注意，以下符号的上述下划线是原始的，并且是永久性的： u， U u *， U'， U'