Jean-Louis Dornstetter - Academia.edu (original) (raw)
Papers by Jean-Louis Dornstetter
We show that a basic property of the parity check matrix of Reed-Solomon codes yields a new key-e... more We show that a basic property of the parity check matrix of Reed-Solomon codes yields a new key-equation for the decoding problem that is different from the classical one given by Berlekamp . We present an efficient algorithm for solving this new key-equation .On montre qu'une propriété fondamentale de la matrice de contrôle de parité des codes de Reed-Solomon permet de formuler une équation caractéristique du décodage différente de l'équation classique due à Berlekam p W. On présente un algorithme efficace pour la résolution de cette nouvelle équation
In accordance with the CDMA technique, in forming a digital signal in basic band by summing relat... more In accordance with the CDMA technique, in forming a digital signal in basic band by summing relative contributions to several channels and convolution by a forming pulse. The inventive method consists modulating a carrier frequency with the digital signal in basic band with limited amplitude, in accordance with a linear radio modulation, and amplifying the radio signal derived from the modulation before transmitting it. In order to avoid saturation of the power amplifier (11), the digital signal amplitude in basic band is limited. This is achieved by subtracting from the digital signal in basic band a correction signal spectrally formed with said forming impulsion.
The invention relates to a method for managing digital data transmissions in a remote metering sy... more The invention relates to a method for managing digital data transmissions in a remote metering system comprising a plurality of counting devices equipped with a radio module for communication with a transmitting / receiving radio frequency of a gateway system of said installation, said method comprising a step of transmitting a digital signal from said module to said radio frequency transmit / receive radio frequency device and / or said transmission / reception radio frequency to said radio module, said transmission being effected via a carrier modulated in a frequency-shift keying, said method being characterized in that said modulation is modulation index exactly equal to an integer value divided by two and in that it comprises a signal receiving step emitted along said modulation, comprising operations generat ion of a synchronization signal synchronized with the received signal and synchronous detection of the received signal by said sync signal.
PURPOSE: To shorten the time for synchronization between a mobile station and a fixed station by ... more PURPOSE: To shorten the time for synchronization between a mobile station and a fixed station by measuring the time lag and the propagation time in reception by the mobile station of synchronizing signals from first and second fixed stations and calculating the time lag in transmission of synchronizing signals from first and second fixed stations. CONSTITUTION: A preliminarily calculated transmission time lag TRij between synchronizing signals from first and second fixed stations F 1 and F 2 and a propagation time ti of the synchronizing signal from the first fixed station F 1 to a mobile station M are transmitted to the mobile station M, and a reception time lag TMij between synchronizing signals from first and second fixed stations F 1 and F 2 is calculated, and a propagation time tj of the synchronizing signal from the second fixed station F 2 to the mobile station M in accordance with relations tj=ti-TRij+TMij, and transmission from the mobile station M to the mobile station F 2...
The procedure consists of STAGES OF MEASURING THE POSTING OF RECEIPT TM ONE STATION MOBILE synchr... more The procedure consists of STAGES OF MEASURING THE POSTING OF RECEIPT TM ONE STATION MOBILE synchronization signals from a first and a second fixed STATIONS, MEASURING propagation times (T1, T2) of a synchronization signal between stations FIXED AND MOBILE STATION, AND SLIDING EMISSION ESTIMATING BETWEEN TR synchronization signals according to the ratio TR = TM + T1-T2.
L'invention concerne un procede de transmission, avec possibilite de correction de paquets d&... more L'invention concerne un procede de transmission, avec possibilite de correction de paquets d'erreurs, de messages d'information et des dispositifs de codage et de decodage pour la mise en oeuvre de ce procede. Selon l'invention, on prevoit des circuits de codage (101 a 141, 101' a 121') permettant d'emettre des blocs m i (X) ≡ M(X) A i (X) [ P i (X) ] ou P i (X) represente les polynomes de la decomposition X n +1, A i (X) est le reciproque du polynome P i (X) derive de P i (X) et ou M(X) est le polynome dont les coefficients sont les bits utiles du message a transmettre. Les circuits de decodage comportent des circuits (201' a 221', 201 a 243) de calcul d'un polynome S(X), somme du polynome X u M(X) et d'un syndrome d'erreur et qui est egal a ou m i (X) represente les blocs recus et R i (X) des polynomes de reconstitution, et des circuits de correction d'erreurs permettant de calculer des bits de correction pour les bits utiles a p...
Traitement Du Signal, 1984
We show that a basic property of the parity check matrix of Reed-Solomon codes yields a new key-e... more We show that a basic property of the parity check matrix of Reed-Solomon codes yields a new key-equation for the decoding problem that is different from the classical one given by Berlekamp . We present an efficient algorithm for solving this new key-equation .
We show that a basic property of the parity check matrix of Reed-Solomon codes yields a new key-e... more We show that a basic property of the parity check matrix of Reed-Solomon codes yields a new key-equation for the decoding problem that is different from the classical one given by Berlekamp . We present an efficient algorithm for solving this new key-equation .On montre qu'une propriété fondamentale de la matrice de contrôle de parité des codes de Reed-Solomon permet de formuler une équation caractéristique du décodage différente de l'équation classique due à Berlekam p W. On présente un algorithme efficace pour la résolution de cette nouvelle équation
In accordance with the CDMA technique, in forming a digital signal in basic band by summing relat... more In accordance with the CDMA technique, in forming a digital signal in basic band by summing relative contributions to several channels and convolution by a forming pulse. The inventive method consists modulating a carrier frequency with the digital signal in basic band with limited amplitude, in accordance with a linear radio modulation, and amplifying the radio signal derived from the modulation before transmitting it. In order to avoid saturation of the power amplifier (11), the digital signal amplitude in basic band is limited. This is achieved by subtracting from the digital signal in basic band a correction signal spectrally formed with said forming impulsion.
The invention relates to a method for managing digital data transmissions in a remote metering sy... more The invention relates to a method for managing digital data transmissions in a remote metering system comprising a plurality of counting devices equipped with a radio module for communication with a transmitting / receiving radio frequency of a gateway system of said installation, said method comprising a step of transmitting a digital signal from said module to said radio frequency transmit / receive radio frequency device and / or said transmission / reception radio frequency to said radio module, said transmission being effected via a carrier modulated in a frequency-shift keying, said method being characterized in that said modulation is modulation index exactly equal to an integer value divided by two and in that it comprises a signal receiving step emitted along said modulation, comprising operations generat ion of a synchronization signal synchronized with the received signal and synchronous detection of the received signal by said sync signal.
PURPOSE: To shorten the time for synchronization between a mobile station and a fixed station by ... more PURPOSE: To shorten the time for synchronization between a mobile station and a fixed station by measuring the time lag and the propagation time in reception by the mobile station of synchronizing signals from first and second fixed stations and calculating the time lag in transmission of synchronizing signals from first and second fixed stations. CONSTITUTION: A preliminarily calculated transmission time lag TRij between synchronizing signals from first and second fixed stations F 1 and F 2 and a propagation time ti of the synchronizing signal from the first fixed station F 1 to a mobile station M are transmitted to the mobile station M, and a reception time lag TMij between synchronizing signals from first and second fixed stations F 1 and F 2 is calculated, and a propagation time tj of the synchronizing signal from the second fixed station F 2 to the mobile station M in accordance with relations tj=ti-TRij+TMij, and transmission from the mobile station M to the mobile station F 2...
The procedure consists of STAGES OF MEASURING THE POSTING OF RECEIPT TM ONE STATION MOBILE synchr... more The procedure consists of STAGES OF MEASURING THE POSTING OF RECEIPT TM ONE STATION MOBILE synchronization signals from a first and a second fixed STATIONS, MEASURING propagation times (T1, T2) of a synchronization signal between stations FIXED AND MOBILE STATION, AND SLIDING EMISSION ESTIMATING BETWEEN TR synchronization signals according to the ratio TR = TM + T1-T2.
L'invention concerne un procede de transmission, avec possibilite de correction de paquets d&... more L'invention concerne un procede de transmission, avec possibilite de correction de paquets d'erreurs, de messages d'information et des dispositifs de codage et de decodage pour la mise en oeuvre de ce procede. Selon l'invention, on prevoit des circuits de codage (101 a 141, 101' a 121') permettant d'emettre des blocs m i (X) ≡ M(X) A i (X) [ P i (X) ] ou P i (X) represente les polynomes de la decomposition X n +1, A i (X) est le reciproque du polynome P i (X) derive de P i (X) et ou M(X) est le polynome dont les coefficients sont les bits utiles du message a transmettre. Les circuits de decodage comportent des circuits (201' a 221', 201 a 243) de calcul d'un polynome S(X), somme du polynome X u M(X) et d'un syndrome d'erreur et qui est egal a ou m i (X) represente les blocs recus et R i (X) des polynomes de reconstitution, et des circuits de correction d'erreurs permettant de calculer des bits de correction pour les bits utiles a p...
Traitement Du Signal, 1984
We show that a basic property of the parity check matrix of Reed-Solomon codes yields a new key-e... more We show that a basic property of the parity check matrix of Reed-Solomon codes yields a new key-equation for the decoding problem that is different from the classical one given by Berlekamp . We present an efficient algorithm for solving this new key-equation .