International Telemetering Conference Proceedings / October 26-29, 1998 / Town & Country Resort Hotel and Convention Center, San Diego, California / This paper analyzes the pseudo-random characteristic of m-sequence and proposes a spread spectrum communication scheme in which the phase-shifting sequences of msequence can be used as the spread spectrum code under given condition. Therefore, the available spread spectrum code set is expanded. It is theoretically proved that there are some advantages in using phase-shifting sequences instead of the conventional msequences or GOLD-sequences in spread spectrum communication system.

International Telemetering Conference Proceedings / October 27-30, 1997 / Riviera Hotel and Convention Center, Las Vegas, Nevada / This paper analyzes the performance of an M-ary spread spectrum system with orthogonal codes. A new scheme of M-ary spread spectrum communication with phase shifted msequence is proposed, and the method to implement code synchronization in the scheme is given. The performance of the new scheme is analyzed, and compared to conventional spread spectrum systems and orthogonal code M-ary systems. The results show that stronger anti-interference ability, and better data transmission efficiency, and lower complexity is achieved in the system employing phase shifted m-sequence.

Maximum linear feedback shift registers (LFSRs) based on primitive polynomials are commonly used to generate maximum length sequences (m-sequences). An m-sequence is a pseudorandom sequence that exhibits ideal randomness properties like balance, run and autocorrelation but has low linear complexity. One-dimensional Cellular Automata (1D CA) have been used to generate m-sequences and pseudorandom sequences that have high linear complexity and good randomness. This thesis considers the use of two-dimensional Cellular Automata (2D CA) to generate m-sequences and psuedorandom sequences that have high linear complexity and good randomness. The properties of these sequences are compared with those of the corresponding m-sequences and the best sequences generated by 1D CAs. / Graduate

In recent years, ultra-wideband (UWB) radars are gaining popularity in the radar field mainly inindustrial and commercial areas. The UWB radar has the potential of dramatically improving thecontrol and surveillance of industrial processes in confined areas.The report provides an introduction to radar systems and detail working principle of M-sequenceUWB radar and methodology of how detection of targets is carried out. First two chapters of thereport describes the working of radar systems and M-sequence radar whereas in the later part ofthe report, different detection algorithms are discussed which has been implemented in thepresent radar simulations. In conventional radar the main detection algorithm is matched filteringwhere the transmitted signal is correlated with the received signal. Whereas UWB signal is nonsinusoidalthat is vulnerable to change in its shape during entire radar operation. This is thereason, the traditional signal processing methods like matched filtering or correlation process arenot advisable for UWB signals. Therefore, a different detection scheme known as Inter-periodcorrelation process (IPCP) has been studied.IPCP technique had been implemented and a comparison was made with the conventional targetdetection algorithm. On the basis of comparison made in this project, it has been observed thatthe conventional target detection methods are not effective in case of M-sequence UWB radar.The simulation results shows that by implementing IPCP method, performance close to 8-bitADC can be achievable with 1-bit comparator, also with IPCP implementation system resolutioncan be enhance effectively.Main focus was to analyze how close the system can detect two targets, therefore in all themeasurements i.e. practical and simulated measurements, only two targets were used.

Synthetic Aperture Radar (SAR) is an emerging technique in remote sensing. The technology is capable of producing high-resolution images of the earth surface in all-weather conditions. Thesis work describes the present available methods for positioning and imaging targets using M-sequence UWB (Ultra-Wideband) radar signals with moving antennas and SAR algorithm to retrieve position and image of the target. M-sequence UWB radar technology used as signal source for transmission and receiving echoes of target. Pseudo random binary sequence is used as a transmitted signal. These radars have an ability to penetrate signal through natural and unnatural objects. It offers low cost and quality security system. Among a number of techniques of image retrieval in Synthetic Aperture Radar, study of Global back projection (GBP) algorithm is presented. As a time domain algorithm, GBP possesses inherent advantages over frequency domain algorithm like ability to handle long integration angle, wider bandwidth and unlimited aperture size. GBP breaks the full synthesis aperture into numbers of sub-apertures. These sub-apertures are treated pixel by pixel. Each sub-aperture is converted to a Cartesian image grid to form an image.  During this conversion the signal is treated with linear interpolation methods in order to achieve the best quality of the images. The objective of this thesis is the imaging of target using M-sequence UWB radar and processing SAR raw data using Global back projection algorithm.

International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada / In this paper, based on the parallel move equivalent sequence of m sequence ,one type of CDM telemetry system is issued. Also the method for anti multi-path interference(MPI) of the system is proposed and its performance is analyzed. We proved that this system not only holds the merits which are inherent in common spread-spectrum communication system, but also has better transmission efficiency.

Pseudorandom sequences have many applications in fields such as wireless communication, cryptography and built-in self test of integrated circuits. Maximal length sequences (m-sequences) are commonly employed pseudorandom sequences because they have ideal randomness properties like balance, run and autocorrelation. However, the linear complexity of m-sequences is poor. This thesis considers the use of one-dimensional Cellular Automata (CA) to generate pseudorandom sequences that have high linear complexity and good randomness. The properties of these sequences are compared with those of the corresponding m-sequences to determine their suitability. / Graduate

No description available.

La conjugaison de phase ultrasonore à couplage par l’air basée sur une céramique magnétostrictive et une membrane de filtration poreuse pour la microscopie et la vélocimétrie de micro écoulements a été développée. Dans ce but, dans le cadre de l’acoustique géométrique un système d’équations pour décrire mathématiquement le passage par l’interface entre l’élément actif du système de conjugaison de phase confocale – milieu de propagation a été développé.On a développé et réalisé une technique de codage de phase par m-séquence pour l’enregistrement des faibles signaux conjugués en phase. Cette technique a permis de travailler plus efficacement avec fort bruit et des signaux qui se trouvent sous le niveau de bruit. Aussi cette technique a permis d’améliorer une méthode de vélocimétrie des écoulements gazeux.On a développé et réalisé une technique d’adaptation d’impédance acoustique basée sur la membrane de filtration poreuse imprégnée par de l’huile. Cette technique a permis d’optimiser les conditions de transmission de l’onde à l’interface air–ferrite aux fréquences basse dans bande du MHz.Les applications possibles de l’effet de conjugaison de phase paramétrique à la vélocimétrie des écoulements gazeux et à la microscopie à couplage par l’air ont été présentées. L’application de l’effet de conjugaison de phase permet d’améliorer les performances des méthodes de vélocimétrie et de microscopie ultrasonores à couplage par l’air. Les méthodes élaborées a repoussé les limites d’applications pratiques de l’effet de conjugaison de phase et peuvent être utilisées pour le développement des dispositifs en vélocimétrie, microscopie et tomographie ultrasonore des écoulements gazeux / Air-coupled wave phase conjugation technique, based on magneto-acoustic interaction and porous membrane filters, for microscopy and velocity measurements of gas micro flows is under investigation. For this reason in the frame of ray acoustics the base system of equations for mathematical model of phase conjugate wave passage through the interface active element of con-focal WPC system – medium of propagation is developed. The phase coding technique by pseudonoise M-sequence was used for registration of weak acoustical phase conjugate signals. This method has allowed to work more effectively with strong noisy and being under noise level phase conjugate signals. Also this method has allowed improving a method of gas flow velocimetry.It is developed and realized the technology of acoustical matching on base of thin polycarbonate porous membrane filters impregnated by oil. This technology has allowed optimizing the conditions of wave transmission through the interface air–ferrite in the low megahertz frequency range.Possible applications of phase conjugate waves in air are shown. Results of investigations of air-coupled wave phase conjugation technics can serve for drawing up of new methods ultrasonic velocimetry and microscopy in technical industrial applications. The elaborated methods expand limits of application and can be used for development of devices of ultrasonic microscopy, tomography and velocimetry of gas micro flows

Les séquences binaires pseudo-aléatoires sont couramment employées par les systèmes de transmissions numériques ou des mécanismes de chiffrement. On les retrouve en particulier dans les transmissions par étalement de spectre par séquence direct (e.g. 3G ou GPS)) ou pour construire des séquences d'apprentissage pour faciliter la synchronisation ou l'estimation du canal (e.g. LTE). Un point commun à toutes ces applications est la nécessité de se synchroniser avec la séquence émise. La méthode conventionnelle consiste à générer la même séquence au niveau du récepteur et la corréler avec le signal reçu. Si le résultat dépasse un seuil pré-défini, la synchronisation est déclarée acquise. On parle alors de détection par corrélation.Cette thèse aborde une autre voie : la détection des séquences binaires pseudo-aléatoire par des techniques de décodage canal. Ceci permet par exemple de détecter des séquences longues (e.g. de période 242), contrairement aux techniques par corrélation qui sont trop complexes à implémenter. Cela nécessite néanmoins que le récepteur connaisse au préalable le polynôme générateur de la séquence.Nous avons montré que le décodage d'une séquence pseudo-aléatoire est une problématique du type 'détecte et décode'. Le récepteur détecte la présence de la séquence et simultanément estime son état initial. Ceci correspond dans la théorie classique de la détection à un détecteur de type GLRT qui ne connaît pas la séquence émise, mais qui connaît sa méthode de construction. L'algorithme implémente alors un GLRT qui utilise un décodeur pour estimer la séquence reçue. Ce dernier est implémenté avec un algorithme de décodage par passage de messages qui utilise une matrice de parité particulière. Elle est construite avec des équations de parités différentes, chacune ayant un poids de Hamming valant t.Il correspond au nombre de variables participants à l'équation.Les équations de parité sont un constituant indispensable du décodeur. Nous avons donné leur nombre pour les m-séquences et les séquences de Gold. Pour le cas particulier des séquences de Gold, nous avons calculé le nombre d'équations de parité de poids t=5 lorsque le degré du polynôme générateur r est impair. Ce calcul est important car il n'y a pas d'équations de parité de poids t < 5 lorsque r est impair. Le nombre d'équations de parité est aussi utilisé pour estimer le degré minimal des équations d'un poids t donné. Nous avons montré que le modèle de prédiction estime correctement la valeur moyenne du degré minimal de l'ensemble des séquences de Gold. Nous avons néanmoins mis en évidence une grande variabilité du degré minimal des séquences autour de cette valeur moyenne.Nous avons ensuite identifié les ensembles absorbants complets de plus petite taille lorsque le décodeur emploie plusieurs polynômes de parité. Ces ensembles bloquent la convergence du décodeur lorsque celui-ci est alimenté avec du bruit. Ceci évite les fausses alarmes lors du processus de détection. Nous avons montré que des cycles 'transverses' détruisent ces ensembles absorbants, ce qui génère des fausses alarmes. Nous en avons déduit un algorithme qui minimise le nombre de cycles transverses de longueur 6 et 8, ce qui minimise la probabilité de fausse alarme lorsque le poids des équations de parité vaut t=3. Notre algorithme permet de sélectionner les équations de parité qui minimisent la probabilité de fausse alarme et ainsi réduire notablement le temps d'acquisition d'une séquence de Gold.Nous avons enfin proposé deux algorithmes de détection du code d'embrouillage pour les systèmes WCDMA et CDMA2000. Ils exploitent les propriétés des m-séquences constituant les séquences de Gold, ainsi que les mécanismes de décodage par passage de messages. Ces algorithmes montrent les vulnérabilités des transmissions par étalement de spectre. / Pseudo-random binary sequences are very common in wireless transmission systems and ciphering mechanisms. More specifically, they are used in direct sequence spread spectrum transmission systems like UMTS or GPS, or to construct preamble sequences for synchronization and channel estimation purpose like in LTE. It is always required to synchronize the receiver with the transmitted sequence. The usual way consists in correlating the received signal with a replica of the sequence. If the correlation exceeds a predefined threshold, the synchronization is declared valid.This thesis addresses a different approach: the binary sequence is detected with a forward error correction decoding algorithm. This allows for instance to detect very long sequences.In this thesis, we show that decoding a pseudo-random sequence is a problematic of the kind ‘detect and decode'. The decoder detects the presence of the transmitted sequence and simultaneously estimates its initial state. In conventional detection theory, this corresponds to a GLRT detector that uses a decoder to estimate the unknown parameter which is the transmitted sequence. For pseudo-random sequences, the decoder implements an iterative message-passing algorithm. It uses a parity check matrix to define the decoding graph on which the algorithm applies. Each parity check equation has a weight t, corresponding to the number of variables in the equation.Parity check equations are thus an essential component of the decoder. The decoding procedure is known to be sensitive to the weight t of the parity check equations. For m-sequences, the number of parity check equations is already known. It is given by the number of codewords of weight t of the corresponding Hamming dual code. For Gold sequences, the number of parity check equations of weight t = 3 and 4 has already been evaluated by Kasami. In this thesis we provide an analytical expression for the number of parity check equations of weight t = 5 when the degree of the generator polynomial r is odd. Knowing this number is important because there is no parity check equation of weight t < 5 when r is odd. This enumeration is also used to provide an estimation of the least degree of parity check equations of weight t.We have then addressed the problem of selecting the parity check equations used by the decoder. We observed the probability of false alarm is very sensitive to this selection. It is explained by the presence or absence of absorbing sets which block the convergence of the decoder when it is fed only with noise. These sets are known to be responsible for error floor of LDPC codes. We give a method to identify these sets according to the parity check equations used by the decoder. The probability of false alarm can increase dramatically if these absorbing sets are destroyed. Then we propose an algorithm for selecting these parity check equations. It relies on the minimization of the number of cycles of length 6 and 8. Simulation show that the algorithm allows to improve significantly the probability of false alarm and the average acquisition time.Eventually, we propose 2 algorithms for the detection of the scrambling codes used in the uplink of UMTS-FDD and CDMA2000 systems. They highlights a new vulnerability of DSSS transmission systems. It is now conceivable to detect these transmission if the sequence's generator is known.