Bien que de nombreux travaux de recherche aient été menés au cours des deux dernières décennies pour résoudre le problème de la synchronisation de la porteuse, il constitue aujourd'hui une thématique de recherche d'une grande importance pour divers systèmes récents de la radiocommunication comme les technologies émergentes de la Radio Logicielle Restreinte (RLR) et de la Radio Intelligente (RI). En effet, les systèmes de la RLR sont multi-fonctionnels et flexibles, dans le sens où ils peuvent traiter une variété de standards et de services tout en offrant des solutions à faible coût. Quant à la technologie RI, c'est une vision futuriste d'une radio visant la conception de dispositifs sans fil dotés de capacités d'apprentissage, d'adaptation, et de reconfiguration. Dans ce contexte, les solutions existantes du problème de synchronisation doivent être adaptées à ces nouvelles générations de technologies radio en vu d'obtenir les meilleures performances. De nombreuses contributions au problème de la synchronisation de phase de la porteuse sont présentées dans cette thèse. Dans la première partie du travail, nous avons effectué une analyse théorique rigoureuse et complète du détecteur de phase DD. En se basant sur les résultats de cette étude, nous avons proposé une boucle de synchronisation optimisée pour la modulation 16-QAM ainsi qu'un nouveau détecteur de verrouillage de phase pour les modulations de type QAM. Par ailleurs, nous avons proposé une structure de synchronisation de phase adaptée aux applications de la RI, qui est capable de récupérer la phase de façon aveugle vis à vis du type de modulation du signal reçu. L'idée consiste à utiliser une mesure dite "fiabilité", extraite du détecteur de phase de la boucle de synchronisation et qui fournit une information sur la modulation du signal entrant. Enfin, nous avons discuté d'une vision SIMO du problème de synchronisation de phase, exploitant les possibilités offertes par une architecture de réception RLR.

<p> A multiple-input multiple-output (MIMO) communication system has the potential to provide reliable transmissions at high data rates. However, the computational cost of achieving this promising performance can be quite substantial. With an emphasis on practical implementations, the MIMO systems employing the low cost linear receivers are studied in this thesis. The optimum space-time block codes (STBC) that enable a linear receiver to achieve its best possible performance are proposed for various MIMO systems. These codes satisfy an intra and inter orthogonality property, and are called unitary trace-orthogonal codes. In addition, several novel transmission schemes are specially designed for linear receivers with the use of the proposed code structure. The applications of the unitary trace-orthogonal code are not restricted to systems employing linear receivers. The proposed code structure can be also applied to the systems employing other types of receivers where several originally intractable code design problems are successfully solved.</p> <p>The communication schemes presented in this thesis are outlined as follows: •For a MIMO system with N ≥ M, where M and N are the number of transmitter and receiver antennas, respectively, the optimal full rate linear STBC for linear receivers is proposed and named unitary trace-orthogonal code. The proposed code structure is proved to be necessary and sufficient to achieve the minimum detection error probability for the system. • When applied to a multiple input single output (MISO) communication system, a special linear unitary trace-orthogonal code, named the Toeplitz STBC, is proposed. The code enables a linear receiver to provide full diversity and to achieve the optimal tradeoff between the detection error and the data transmission rate. This is, thus far, the first code that possesses such properties for an arbitrary MISO system that employs a linear receiver. • In MIMO systems in which N ≥ M and the signals are transmitted at full symbol rate, the highest diversity gain achievable by linear receivers is analyzed and shown to be N - M + 1. To improve the performance of a linear receiver, a multi-block transmission scheme is proposed, in which signals are coded so that they span multiple independent channel realizations. An optimal full rate linear STBC for this system that minimizes the detection error probability is presented. The code is named multi-block unitary trace-orthogonal code. The resulting system has an improved diversity gain. Furthermore, by relaxing the code from the full symbol rate constraint, a special multi-block transmission scheme is proposed. This scheme achieves a much improved diversity gain than those with full symbol rate. • The unitary trace-orthogonal code can also be applied to a system that employs a maximum-likelihood (ML) receiver rather than the simple linear receiver. For such a system, a systematic design of full diversity unitary trace-orthogonal code is presented for an arbitrary data transmission rate. </p> <p>In summary, when a simple linear receiver is employed, unitary trace-orthogonal codes and their optimality properties are exploited for various multiple antenna communication systems. Some members from this code family can also enable an optimal performance of ML detection. </P> / Thesis / Doctor of Philosophy (PhD)

No description available.

It is well known that communication systems employing multiple transmit and multiple receive antennas provide high data rates along with increased reliability. It has been shown that coding across both spatial and temporal domains together, called Space-Time Coding (STC), achieves, a diversity order equal to the product of the number of transmit and receive antennas. Space-Time Block Codes (STBC) achieving the maximum diversity is called full-diversity STBCs. An STBC is called information-lossless, if the structure of it is such that the maximum mutual information of the resulting equivalent channel is equal to the capacity of the channel. This thesis deals with high-rate and information-lossless STBCs obtained from certain matrix algebras called Crossed-Product Algebras. First we give constructions of high-rate STBCs using both commutative and non-commutative matrix algebras obtained from appropriate representations of extensions of the field of rational numbers. In the case of commutative algebras, we restrict ourselves to fields and call the STBCs obtained from them as STBCs from field extensions. In the case of non-commutative algebras, we consider only the class of crossed-product algebras. For the case of field extensions, we first construct high-rate; full-diversity STBCs for arbitrary number of transmit antennas, over arbitrary apriori specified signal sets. Then we obtain a closed form expression for the coding gain of these STBCs and give a tight lower bound on the coding gain of some of these STBCs. This lower bound in certain cases indicates that some of the STBCs from field extensions are optimal m the sense of coding gain. We then show that the STBCs from field extensions are information-lossy. However, we also show that the finite-signal-set capacity of the STBCs from field extensions can be improved by increasing the symbol rate of the STBCs. The simulation results presented show that our high-rate STBCs perform better than the rate-1 STBCs in terms of the bit error rate performance. Then we proceed to present a construction of high-rate STBCs from crossed-product algebras. After giving a sufficient condition on the crossed-product algebras under which the resulting STBCs are information-lossless, we identify few classes of crossed-product algebras that satisfy this sufficient condition and also some classes of crossed-product algebras which are division algebras which lead to full-diversity STBCs. We present simulation results to show that the STBCs from crossed-product algebras perform better than the well-known codes m terms of the bit error rate. Finally, we introduce the notion of asymptotic-information-lossless (AILL) designs and give a necessary and sufficient condition under which a linear design is an AILL design. Analogous to the condition that a design has to be a full-rank design to achieve the point corresponding to the maximum diversity of the optimal diversity-multiplexing tradeoff, we show that a design has to be AILL to achieve the point corresponding to the maximum multiplexing gain of the optimal diversity-multiplexing tradeoff. Using the notion of AILL designs, we give a lower bound on the diversity-multiplexing tradeoff achieved by the STBCs from both field extensions and division algebras. The lower bound for STBCs obtained from division algebras indicates that they achieve the two extreme points, 1 e, zero multiplexing gain and zero diversity gain, of the optimal diversity-multiplexing tradeoff. Also, we show by simulation results that STBCs from division algebras achieves all the points on the optimal diversity-multiplexing tradeoff for n transmit and n receive antennas, where n = 2, 3, 4.

Les systèmes MIMO (Multiple Input Multiple Output) ont été proposés par le laboratoire Bell afin d'augmenter le débit des transmissions. Par la suite ces systèmes ont été utilisés pour augmenter la fiabilité de la transmission en utilisant des codes introduisant de la redondance. Cette thèse CIFRE est menée en collaboration entre la société IPSIS-IT Link (Ingénierie Pour Signaux et Systèmes) et l'équipe SCEE de Supélec membre du laboratoire IETR. L'objectif de cette thèse est de proposer des techniques d'estimation, en aveugle, des symboles transmis sur des canaux MIMO. La séparation aveugle de sources, ou BSS pour Blind Source Separation, permet d'estimer de manière aveugle, i.e. sans connaissance du canal de transmission et de symboles pilotes, les symboles transmis. C'est ce type de méthode que nous utiliserons principalement dans cette thèse. Cependant, la BSS estime les sources à une rotation et permutation près. D'autre part, les méthodes de BSS utilisant un gradient stochastique sont lentes à converger, ce qui les rend difficilement utilisables sur des canaux variant rapidement dans le temps. Ainsi, les axes de recherche exploités durant cette thèse sont : - L'exploitation de la redondance introduite par les codes STBC pour lever les ambiguïtés introduites par la BSS. - L'implémentation de certains critères de manière analytique. Les méthodes analytiques implémentées de manière adaptative convergent rapidement dans le temps, permettant ainsi une utilisation sur des canaux qui varient rapidement dans le temps. - L'initiatisation du filtre de Kalman, connu pour ses qualités de poursuite, par la séparation aveugle de sources. Ce type d'association permet de poursuivre des canaux instantanés ou convolutifs variant dans le temps.

No description available.

Employing an error control code is one of the techniques to reduce the Peak-to-Average Power Ratio (PAPR) in an Orthogonal Frequency Division Multiplexing system; a well known class of such codes being the cosets of Reed-Muller codes. In this thesis, classes of such coset-codes of arbitrary linear codes are considered. It has been proved that the size of such a code can be doubled with marginal/no increase in the PAPR. Conditions for employing this method iteratively have been enunciated. In fact this method has enabled to get the optimal coset-codes. The PAPR of the coset-codes of the extended codes is obtained from the PAPR of the corresponding coset-codes of the parent code. Utility of a special type of lengthening is established in PAPR studies

Communication over a wireless channel is a challenging task because of the inherent fading effects. Any wireless communication system employs some form of diversity improving techniques in order to improve the reliability of the channel. This thesis deals with efficient code design for two different spatial diversity techniques, viz, diversity by employing multiple antennas at the transmitter and/or the receiver, and diversity through cooperative commu- nication between users. In other words, this thesis deals with efficient code design for (1) multiple-input multiple-output (MIMO) channels, and (2) wireless relay channels. Codes for the MIMO channel are termed space-time (ST) codes and those for the relay channels are called distributed ST codes. The first part of the thesis focuses on ST code construction for MIMO fading channel with perfect channel state information (CSI) at the receiver, and no CSI at the transmitter. As a measure of performance we use the rate-diversity tradeoff and the Diversity-Multiplexing Gain (D-MG) Tradeoff, which are two different tradeoffs characterizing the tradeoff between the rate and the reliability achievable by any ST code. We provide two types of code constructions that are optimal with respect to the rate-diversity tradeoff; one is based on the rank-distance codes which are traditionally applied as codes for storage devices, and the second construction is based on a matrix representation of a cayley algebra. The second contribution in ST code constructions is related to codes with a certain nonvanishing determinant (NVD) property. Motivation for these constructions is a recent result on the necessary and sufficient conditions for an ST code to achieve the D-MG tradeoff. Explicit code constructions satisfying these conditions are provided for certain number of transmit antennas. The second part of the thesis focuses on distributed ST code construction for wireless relay channel. The transmission protocol follows a two-hop model wherein the source broadcasts a vector in the first hop and in the second hop the relays transmit a vector that is a transformation of the received vector by a relay-specific unitary transformation. While the source and relays do not have CSI, at the destination we assume two different scenarios (a) destina- tion with complete CSI (b) destination with only the relay-destination CSI. For both these scenarios, we derive a Chernoff bound on the pair-wise error probability and propose code design criteria. For the first case, we provide explicit construction of distributed ST codes with lower decoding complexity compared to codes based on some earlier system models. For the latter case, we propose a novel differential encoding and differential decoding technique and also provide explicit code constructions. At the heart of all these constructions is the cyclic division algebra (CDA) and its matrix representations. We translate the problem of code construction in each of the above scenarios to the problem of constructing CDAs satisfying certain properties. Explicit examples are provided to illustrate each of these constructions.

Space-Time Block Coding is an efficient communication technique used in multiple-input multiple-output wireless systems. The complexity with which a Space-Time Block Code (STBC) can be decoded is important from an implementation point of view since it directly affects the receiver complexity and speed. In this thesis, we address the problem of designing low complexity decoding techniques for STBCs, and constructing STBCs that achieve high rate and full-diversity with these decoders. This thesis is divided into two parts; the first is concerned with the optimal decoder, viz. the maximum-likelihood (ML) decoder, and the second with non-ML decoders. An STBC is said to be multigroup ML decodable if the information symbols encoded by it can be partitioned into several groups such that each symbol group can be ML decoded independently of the others, and thereby admitting low complexity ML decoding. In this thesis, we first give a new framework for constructing low ML decoding complexity STBCs using codes over the Klein group, and show that almost all known low ML decoding complexity STBCs can be obtained by this method. Using this framework we then construct new full-diversity STBCs that have the least known ML decoding complexity for a large set of choices of number of transmit antennas and rate. We then introduce the notion of Asymptotically-Good (AG) multigroup ML decodable codes, which are families of multigroup ML decodable codes whose rate increases linearly with the number of transmit antennas. We give constructions for full-diversity AG multigroup ML decodable codes for each number of groups g > 1. For g > 2, these are the first instances of g-group ML decodable codes that are AG or have rate more than 1. For g = 2 and identical delay, the new codes match the known families of AG codes in terms of rate. In the final section of the first part we show that the upper triangular matrix R encountered during the sphere-decoding of STBCs can be rank-deficient, thus leading to higher sphere-decoding complexity, even when the rate is less than the minimum of the number of transmit antennas and the number receive antennas. We show that all known AG multigroup ML decodable codes suffer from such rank-deficiency, and we explicitly derive the sphere-decoding complexities of most known AG multigroup ML decodable codes. In the second part of this thesis we first study a low complexity non-ML decoder introduced by Guo and Xia called Partial Interference Cancellation (PIC) decoder. We give a new full-diversity criterion for PIC decoding of STBCs which is equivalent to the criterion of Guo and Xia, and is easier to check. We then show that Distributed STBCs (DSTBCs) used in wireless relay networks can be full-diversity PIC decoded, and we give a full-diversity criterion for the same. We then construct full-diversity PIC decodable STBCs and DSTBCs which give higher rate and better error performance than known multigroup ML decodable codes for similar decoding complexity, and which include other known full-diversity PIC decodable codes as special cases. Finally, inspired by a low complexity essentially-ML decoder given by Sirianunpiboon et al. for the two and three antenna Perfect codes, we introduce a new non-ML decoder called Adaptive Conditional Zero-Forcing (ACZF) decoder which includes the technique of Sirianunpiboon et al. as a special case. We give a full-diversity criterion for ACZF decoding, and show that the Perfect codes for two, three and four antennas, the Threaded Algebraic Space-Time code, and the 4 antenna rate 2 code of Srinath and Rajan satisfy this criterion. Simulation results show that the proposed decoder performs identical to ML decoding for these five codes. These STBCs along with ACZF decoding have the best error performance with least complexity among all known STBCs for four or less transmit antennas.