In this work wireless communication systems with multiple co-channel signals present at the receiver are considered. One of the major challenges in the development of such systems is the computational complexity required for the detection of the transmitted signals. This thesis addresses this problem and develops reduced complexity algorithms for the detection of multiple co-channel signals in receivers with multiple antennas. The signals are transmitted from either a single user employing multiple transmit antennas, from multiple users or in the most general case by a mixture of the two. The receiver is assumed to be overloaded in that the number of transmitted signals exceeds the number of receive antennas. Joint Maximum Likelihood (JML) is the optimum detection algorithm which has exponential complexity in the number of signals. As a result, detection of the signals of interest at the receiver is challenging and infeasible in most practical systems. The thesis presents a framework for the detection of multiple co-channel signals in overloaded receivers. It proposes receiver structures and two list-based signal detection algorithms that allow for complexity reduction compared to the optimum detector while being able to maintain near optimum performance. Complexity savings are achieved by first employing a linear preprocessor at the receiver to reduce the effect of Co-Channel Interference (CCI) and second, by using a detection algorithm that searches only over a subspace of the transmitted symbols. Both algorithms use iterative processing to extract ordered lists of the most likely transmit symbols. Soft information can be obtained from the detector output list and can then be used by error control decoders. The first algorithm named Parallel Detection with Interference Estimation (PD-IE) considers the Additive White Gaussian Noise (AWGN) channel. It relies on a spatially reduced search over subsets of the transmitted symbols in combination with CCI estimation. Computational complexity under overload is lower than that of JML. Performance results show that PD-IE achieves near optimum performance in receivers with Uniform Circular Array (UCA) and Uniform Linear Array (ULA) antenna geometries. The second algorithm is referred to as List Group Search (LGS) detection. It is applied to overloaded receivers that operate in frequency-flat multipath fading channels. The List Group Search (LGS) detection algorithm forms multiple groups of the transmitted symbols over which an exhaustive search is performed. Simulation results show that LGS detection provides good complexity-performance tradeoffs under overload. A union bound for group-wise and list-based group-wise symbol detectors is also derived. It provides an approximation to the error performance of such detectors without the need for simulation. Moreover, the bound can be used to determine some detection parameters and tradeoffs. Results show that the bound is tight in the high Signal to Interference and Noise Ratio (SINR) region.

Wavelet Modulation (WM)---also referred to as fractal modulation---simultaneously sends data at multiple rates through an unknown channel. This novel multirate diversity strategy offers improved message recovery over conventional modulation techniques: if the message is not received at one rate due to the channel disturbances, it can be received at another rate where the channel is clear. Previous research has demonstrated the performance of wavelet modulation in Gaussian channels. This paper extends the investigation to the performance of wavelet modulation in time varying channels. We show that bit error rate (BER) wavelet demodulation performance in the additive, white, Gaussian noise (AWGN) channel is comparable to theoretical binary phase shift keying. Our results depict the improvement in performance that can be realized for time varying channels by utilizing the various rates of wavelet modulation; BER versus SNR curves for each fading channel show how the message at one rate can be more accurately recovered than at another rate. Furthermore, we also present results indicating the dramatic improvement in wavelet demodulation performance when multiple rates are available and utilized for demodulation. This improvement in performance is highly visible in BER performance for the AWGN and flat fading channels. Finally, a comparison of binary phase shift keying (BPSK) and WM in a frequency selective channel is performed. The BER improvement of WM is shown when demodulation is done at rates which are least corrupted by ISI. We illustrate our new algorithm that: identifies the channel characteristics; determines which rates are maximally corrupted by ISI; and, utilizes only those uncorrupted copies in demodulation. / Master of Science

We introduced nested search methods to design (n, k) block codes for arbitrary channels by optimizing an appropriate metric spectrum in each iteration. For a given k, the methods start with a good high rate code, say k/(k + 1), and successively design lower rate codes up to rate k/2^k corresponding to a Hadamard code. Using a full search for small binary codes we found that optimal or near-optimal codes of increasing length can be obtained in a nested manner by utilizing Hadamard matrix columns. The codes can be linear if the Hadamard matrix is linear and non-linear otherwise. The design methodology was extended to the generic complex codes by utilizing columns of newly derived or existing unitary codes. The inherent nested nature of the codes make them ideal for progressive transmission. Extensive comparisons to metric bounds and to previously designed codes show the optimality or near-optimality of the new codes, designed for the fading and the additive white Gaussian noise channel (AWGN). It was also shown that linear codes can be optimal or at least meeting the metric bounds; one example is the systematic pilot-based code of rate k/(k + 1) which was proved to meet the lower bound on the maximum cross-correlation. Further, the method was generalized such that good codes for arbitrary channels can be designed given the corresponding metric or the pairwise error probability. In synchronous multiple-access schemes it is common to use unitary block codes to transmit the multiple users’ information, especially in the downlink. In this work we suggest the use of newly designed non-unitary block codes, resulting in increased throughput efficiency, while the performance is shown not to be substantially sacrificed. The non-unitary codes are again developed through suitable nested searches. In addition, new multiple-access codes are introduced that optimize certain criteria, such as the sum-rate capacity. Finally, the introduction of the asymptotically optimum convolutional codes for a given constraint length, reduces dramatically the search size for good convolutional codes of a certain asymptotic performance, and the consequences to coded code-division multiple access (CDMA) system design are highlighted.

On étudie le problème de la transmission de l'information à travers le canal AWGN en utilisant des réseaux. On commence par considérer des constellations infinies. Une nouvelle famille de réseaux obtenus par Construction A à partir de codes linéaires non binaires est proposée. Ces réseaux sont appelés LDA ("Low-Density Construction A") et sont caractérisés par des matrices de parité p-aires creuses, qui les mettent en relation directe avec les codes LPDC. Deux résultats sur leur possibilité d'atteindre la capacité de Poltyrev sont provés ; cela est d'abord démontré pour des poids des lignes logarithmiques des matrices de parité associées, puis pour des poids constants. Le deuxième résultat est basé sur certaines propriétés d'expansion des graphes de Tanner correspondants à ces matrices. Un autre sujet de ce travail concerne les constellations finies de réseaux. une nouvelle preuve est donnée du fait que des réseaux aléatoires obtenus par Construction A generale atteignent la capacité avec décodage de type "lattice decoding". Cela prolonge et améliore le travail de Erez et Zamir (2004), Ordentlich et Edrez (2012) Ling et Belfiore (2013). Cette preuve est basée sur les constellations de Coronoï et la multiplication par le coefficient de Wiener ("MMSE scaling") du siganl en sortie du canal. Finalement, ce résultat est adapté au cas des réseaux LDA, qui eux aussi atteignent la capacité avec le même procédé de transmission. Encore une fois, il est nécessaire d'exploiter les propriétés d'expansion des graphes de Tanner. A la fin de la dissertation, on présente un algorithme de décodage itératif et de type "message-passing" approprié au décodage des LDA en grandes dimensions. / The probleme of transmission of information over the AWGN channel using lattices is addressed. Firstly, infinite constellations are considered. A nex family of integer lattices built by means of construction A with non-binary linear condes is introduced. These lattices are called LPA (Low-Density Construction A) and are characterised by sparse p-ary parity-chedk matrices, that put them in direct relation with LPDC codes. Two results about the Poltyrev-capacity-archieving qualities of this family are proved, respectively for logarithmic row degree and constant row degree of the associated parity-check matrices. The second result is based on some expansion poperties of the Tanner graphs related to these matrices. Another topic of this work concerns finite lattice constellations. A new proff that heneral random Construction A lattices achieve capacity under lattice deconding is provided, continuing and pimproving the work of Erez and Zamir (2004), Ordentlich an Erez (2012), and Ling and Belfiore (2013). This proof is based on Voronoi lattice constellations and MMSE scaling of the channel output. Finally, this approach is adapted to the LDA case abd ut us scgiwn tgat LDA lattices achive capacity with the ame transmission scheme, too. Once again, it is necessary to exploit the expansion properties of the Tanner graphs. At he end of the dissertation, an iterative message-passing algorithm suitable for decoding LDA lattices in high dimensions is presented.

La performance de démodulation des signaux GNSS existants, GPS L1 C/A, L2C ou L5, est satisfaisante en environnements ouverts où le C/N0 disponible est assez élevé. Cependant, en milieu urbain, le niveau de C/N0 du signal reçu est souvent très bas et est affecté de variations rapides qui peuvent nuire la démodulation des messages GNSS. Donc, car les applications du marché de masse sont appelées à être déployées dans ces environnements, il est nécessaire d'étudier et de chercher des méthodes de démodulation/décodage qui améliorent la performance de démodulation des messages GNSS dans ces environnements. Il est aussi nécessaire de considérer les nouveaux signaux GPS L1C et GALILEO E1. Ces signaux doivent fournir un service de positionnement par satellite dans tout type d'environnement, et spécifiquement en milieu urbain. Ainsi, cette thèse analyse aussi les performances de démodulation des nouveaux signaux GNSS tels que définis dans les documents publics actuels. De plus, de nouvelles structures de message GALILEO E1 sont proposées et analysées afin d'optimiser la performance de démodulation ainsi que la quantité d'information diffusée. En conséquence, le but principal de cette thèse est d'analyser et améliorer la performance de démodulation des signaux GNSS ouverts au public, spécifiquement en milieu urbain, et de proposer de nouvelles structures de messages de navigation pour GALILEO E1. La structure détaillée des chapitres de cette thèse est donnée ci-après. En premier lieu, le sujet de cette thèse est introduit, ses contributions originales sont mises en avant, et le plan du rapport est présenté. Dans le 2ième chapitre, la thèse décrit la structure actuelle des signaux GNSS analysés, en se concentrant sur la structure du message de navigation, les codages canal implantés et leurs techniques de décodage. Dans le 3ième chapitre, deux types de modèles de canal de propagation sont présentés pour deux différents types de scénarios. D'un côté, un canal AWGN est choisi pour modéliser les environnements ouverts. De l'autre côté, le modèle mathématique de Perez-Fontan d'un canal mobile est choisi pour représenter les environnements urbains et indoor. Dans le 4ième chapitre, une tentative pour effectuer une prédiction binaire d'une partie du message de navigation GPS L1 C/A est présentée. La prédiction est essayée en utilisant les almanachs GPS L1 C/A, grâce à un programme de prédiction à long terme fourni par TAS-F, et des méthodes de traitement du signal: estimation spectrale, méthode de PRONY et réseau de neurones. Dans le 5ème chapitre, des améliorations à la performance de démodulation du message de GPS L2C et L5 sont apportées en utilisant leur codage canal de manière non traditionnelle. Deux méthodes sont analysées. La première méthode consiste à combiner les codages canal internes et externes du message afin de corriger davantage de mots reçus. La deuxième méthode consiste à utiliser les probabilités des données d'éphémérides afin d'améliorer le décodage traditionnel de Viterbi. Dans le 6ième chapitre, la performance de démodulation des messages de GPS L1C et du Open Service GALILEO E1 est analysée dans différents environnements. D'abord, une étude de la structure de ces deux signaux est présentée pour déterminer le C/N0 du signal utile reçu dans un canal AWGN. Puis, la performance de démodulation de ces signaux est analysée grâce à des simulations dans différents environnements, avec un récepteur se déplaçant à différentes vitesses et avec différentes techniques d'estimation de la phase porteuse du signal. / The demodulation performance achieved by any of the existing GPS signals, L1 C/A, L2C or L5, is satisfactory in open environments where the available C/N0 is quite high. However, in indoor/urban environments, the C/N0 level of the received signal is often very low and suffers fast variations which can further affect the GNSS messages demodulation. Therefore, since the mass-market applications being designed nowadays are aimed at these environments, it is necessary to study and to search alternative demodulation/decoding methods which improve the GNSS messages demodulation performance in these environments. Moreover, new GNSS signals recently developed, such as GPS L1C and GALILEO E1, must also be considered. These signals aim at providing satellite navigation positioning service in any kind of environment, giving special attention to indoor and urban environments. Therefore, the demodulation performances of the new GNSS signals as they are defined in the current public documents is also analysed. Moreover, new GALILEO E1 message structures are proposed and analysed in order to optimize the demodulation performance as well as the quantity of broadcasted information. Therefore, the main goal of this dissertation is to analyse and to improve the demodulation performance of the current open GNSS signals, specifically in indoor and urban environments, and to propose new navigation message structures for GALILEO E1. A detailed structure of this dissertation sections is given next. First, the subject of this thesis is introduced, original contributions are highlighted, and the outline of the report is presented. Second, this dissertation begins by a description of the current structure of the different analysed GNSS signals, paying special attention to the navigation message structure, implemented channel code and their decoding techniques. In the third section, two types of transmission channel models are presented for two different types of environments. On one hand, an AWGN channel is used to model the signal transmission in an open environments. On the other hand, the choice of a specific mobile channel, the Perez-Fontan channel model, is chosen to model the signal transmission in an urban environment. In the fourth section, a tentative to make a binary prediction of the broadcasted satellite ephemeris of the GPS L1 C/A navigation message is presented. The prediction is attempted using the GPS L1 C/A almanacs data, a long term orbital prediction program provided by TAS-F, and some signal processing methods: spectral estimation, the PRONY method, and a neural network. In the fifth section, improvements to the GPS L2C and GPS L5 navigation message demodulation performance are brought by using their channel codes in a non-traditional way. Two methods are inspected. The first method consists in sharing information between the message inner and outer channel codes in order to correct more received words. The second method consists in using the ephemeris data probabilities in order to improve the traditional Viterbi decoding. In the sixth section, the GPS L1C and GALILEO E1 Open Service demodulation performance is analysed in different environments. First, a brief study of the structure of both signals to determine the received C/N0 in an AWGN channel is presented. Second, their demodulation performance is analysed through simulations in different environments, with different receiver speeds and signal carrier phase estimation techniques.

The dissertation thesis deals with a WLAN and Bluetooth systems coexistence. A Bluetooth standard works in an unlicensed frequency band 2,402 – 2,480 GHz. This frequency band is also used by an IEEE 802.11b/g standard (Wi-Fi) which is the most extended representative of WLAN networks. Because Bluetooth and Wi-Fi systems operate in the same frequency band, a mutual signal degradation may appear, when devices are collocated in the same area. In the first part of the dissertation thesis there is a brief summary of 2,402 - 2,480 GHz frequency band regulations and its usage. There are described physical layers of Bluetooth and IEEE 802.11b/g standards and techniques used for a collision avoidance. The main part of the dissertation thesis deals with a development of a new Matlab Simulink model for investigations of the Bluetooth and Wi-Fi standards coexistence. Physical layer models and results of the coexistence simulations are verified by a measurement in real conditions with a help of a modern vector signal analyzer. The results are presented in a graphical form and a brief summary is attached at the end of each chapter. Corresponding tables of simulated and measured values are available in the enclosed CD.