Αντικείμενο της παρούσας διδακτορικής διατριβής είναι η μελέτη και ο σχεδιασμός καινοτόμων αλγορίθμων φυσικού επιπέδου σε ασύρματα συστήματα επικοινωνίας που χρησιμοποιούν διαμόρφωση με πολύπλεξη συχνότητας ορθογωνίων φερουσών (Orthogonal Frequency Division Multiplexing - OFDM). Η έρευνα επικεντρώθηκε σε δύο κατηγορίες προβλημάτων, στον σχεδιασμό αλγορίθμων προσαρμοστικής διαμόρφωσης καθώς και αλγορίθμων αντιμετώπισης ισχυρού θορύβου φάσης. Αναπτύχθηκαν αλγόριθμοι εκτίμησης φάσης με γραμμική πολυπλοκότητα, μέσω ενός καινούργιου εναλλακτικού μοντέλου περιγραφής του συστήματος. Το μοντέλο αυτό επιτρέπει την επέκταση των κλασικών αλγορίθμων εκτίμησης της κοινής φάσης με στόχο την εκτίμηση του συνολικού διανύσματος θορύβου φάσης. Επιπλέον, η τεχνική διαγώνιας φόρτωσης (diagonal-loading) προσαρμόστηκε κατάλληλα για τη βελτίωση σύγκλισης της προτεινόμενης λύσης. Τέλος, προτάθηκε και αξιολογήθηκε ένα συνολικό σύστημα OFDM όπου η εκτίμηση του καναλιού, της διαταραχής φάσης και των δεδομένων βασίζονται στο κριτήριο ελαχίστων τετραγώνων, διατηρώντας έτσι τη συνολική πολυπλοκότητα σε χαμηλά επίπεδα. Στο πλαίσιο του σχεδιασμού αλγορίθμων προσαρμοστικής διαμόρφωσης προτείνεται ένα γενικό μοντέλο περιγραφής απόδοσης συστήματος ικανό να περιγράψει τα αναπτυσσόμενα πρωτόκολλα μετάδοσης. Η πρόταση αυτή εντάσσεται στην οικογένεια των τεχνικών ισοδύναμης σηματοθορυβικής απεικόνισης (Εffective SNR Μapping - ESM). Χρησιμοποιώντας τις τεχνικές ESM και κατάλληλους περιορισμούς στην παραμετροποίηση των μεταβλητών μετάδοσης, αναπτύχθηκαν αλγόριθμοι προσαρμοστικής διαμόρφωσης χαμηλής πολυπλοκότητας που ικανοποιούν διαφορετικά κριτήρια βελτιστοποίησης. Επιπρόσθετα, προτείνεται ένα γενικό πλαίσιο για τον σχεδιασμό αλγορίθμων προσαρμοστικής διαμόρφωσης, χρησιμοποιώντας προσεγγιστικά μοντέλα απόδοσης. Ορίστηκαν οι κατάλληλες μετρικές για την ποσοτικοποίηση της σπατάλης ενέργειας που επιφέρει η χρήση προσεγγιστικών μοντέλων. Μελετήθηκε η επίδραση της καθυστέρησης ανατροφοδότησης πληροφορίας καναλιού στους αλγορίθμους και παρήχθησαν κατάλληλα μοντέλα περιγραφής απόδοσης που συμπεριλαμβάνουν το χρόνο καθυστέρησης. Το συνολικό αποτέλεσμα της εργασίας είναι αλγόριθμοι που καταφέρνουν υψηλή απόδοση συστήματος, με χαμηλή πολυπλοκότητα, κάτι το οποίο τους κάνει υλοποιήσιμους σε ρεαλιστικά συστήματα. / The objective of this thesis is to study and develop novel, low complexity physical layer algorithms for Orthogonal Frequency Division Multiplexing (OFDM) based communication systems. The study aims at two algorithmic categories, namely adaptive modulation and coding and compensation of severe phase noise (PHN) errors. A parameterized windowed least-squares (WLS) decision directed phase error estimator is proposed via proper (alternative) system modeling, applied to both channel estimation and data detection stage in OFDM systems. The window is optimized so as to minimize the post-compensation error variance (PCEV) of the residual phase, analytically computed for arbitrary PHN and frequency offset (FO) models. Closed-form expressions for near-optimal windows are derived for zero-mean FO, Wiener and first-order autoregressive PHN models, respectively. Furthermore, the diagonal-loading approach is properly employed, initially proposed for providing robustness to a general class of estimators in the presence of model mismatch, to enhance convergence of the iterative estimation scheme, in those high-SNR regions where the effect of data decision errors dominates performance. In the proposed OFDM scheme, channel, IFO estimation and data equalization are also based on the LS criterion, thus keeping the overall system complexity low. A generic performance description model is proposed and used for AMC algorithmic design, capable of describing most of current and under preparation communication protocols. This model proposition is incorporated to a larger family of performance modelling techniques named Effective SNR Mapping techniques (ESM). Using the ESM techniques and proper parameter adaptation constraints, a number of low-complexity AMC algorithms are developed under a chosen set of optimization scenarios. A framework for the design of AMC algorithms using approximate performance description models is proposed. Specific bounds are derived for quantifying the power loss when using approximate models. The effect of outdated channel state information is also studied by statistically characterizing the effective SNR at the receiver. This description allows parameter adaptation under mobility scenarios. The main value of this collective procedure is the development of low complexity- high performance algorithms, implementable on pragmatic OFDM systems.

Resource allocation in wireless networks is one of the most studied class of problems. Generally, these problems are formulated as utility maximization problems under relevant constraints. The challenges posed by these problems vary widely depending on the nature of the utility function under consideration. Recently, the widespread prevalence of wireless devices prompted researchers and engineers to delve into the security issues of wireless communication. As compared to the wired medium, ensuring security for the wireless medium is more challenging mainly due to the broadcast nature of the transmission. But the ongoing research on physical layer security promises robust and reliable security schemes for wireless communication. Contrary to conventional cryptographic schemes, physical layer security techniques are impregnable as the security is ensured by the inherent randomness present in the wireless medium. In this thesis, we consider several wireless scenarios and propose secrecy enhancing resource allocation schemes for them in the first few chapters. We initially address the problem of secure transmission by following the conventional approach in the secrecy literature|secrecy rate maximization. Needless to say, in these chapters, secrecy rate is the utility function and the constraints are posed by the available power budget. Then we consider a pragmatic approach where we target the signal-to-noise ratio (SNR) of participating nodes and ensure information secrecy by appropriately constraining the SNRs of those nodes. In those SNR based formulations, SNR at the destination is the utility function and we are interested in maximizing it. In the last two chapters, we study two scenarios in a non-secrecy setting. In one of them, end-to-end data rate is the utility, whereas, in the other one, two utility functions|based on revenue generated|are defined for two rational agents in a game-theoretic setting. In the second chapter, we study parallel independent Gaussian channels with imperfect channel state information (CSI) for the eavesdropper. Firstly, we evaluate the probability of zero secrecy rate in this system for (i) given instantaneous channel conditions and (ii) a Rayleigh fading scenario. Secondly, when non-zero secrecy is achievable in the low SNR regime, we aim to solve a robust power allocation problem which minimizes the outage probability at a target secrecy rate. In the third, fourth and fifth chapters, we consider scenarios where the source node transmits a message to the destination using M parallel amplify-and-forward (AF) relays in the presence of a single or multiple eavesdroppers. The third chapter addresses the problem of the maximum achievable secrecy rate for two specific network models: (a) degraded eavesdropper channel with complex channel gain and (b) scaled eavesdropper channel with real-valued channel gains. In the fourth chapter, we consider the SNR based approach and address two problems: (i) SNR maximization at the destination and (ii) Total relay power minimization. In the fifth chapter, we assume that the relay nodes are untrusted and to counter them, we deliberately introduce artificial noise in the source message. For this model, we propose and solve SNR maximization problems for the following two scenarios: (i) Total power constraint on all the relay nodes and (ii) Individual power constraints on each of the relay nodes. In the sixth chapter, we address the problem of passive eavesdroppers in multi-hop wire-less networks using the technique of friendly jamming. Assuming decode-and-forward (DF) relaying, we consider a scheduling and power allocation (PA) problem for a multiple-source multiple-sink scenario so that eavesdroppers are jammed, and source-destination throughput targets are met. When channel state information (CSI) of all the node are available, we intend to minimize the total power consumption of all the transmitting nodes. In the absence of eavesdroppers CSI, we minimize vulnerability region of the network. In chapter seven, the problem of cooperative beamforming for maximizing the achievable data rate of two-hop amplify-and-forward (AF) network (in the absence of eavesdropper(s)) is considered. Along with an individual power constraint on each of the relay nodes, we consider a weighted sum power constraint. To solve this problem, we propose a novel algorithm based on the Quadratic Eigenvalue Problem (QEP) and discuss its convergence. In chapter eight, we study a Stackelberg game between a base station and a multi-antenna power beacon for wireless energy harvesting in a multiple sensor node scenario. Assuming imperfect CSI between the sensor nodes and the power beacon, we propose a utility function that is based on throughput non-outage probability at the base station. We find the optimal strategies for the base station and the power beacon that maximize their respective utility functions.

Abstract Multiple-input multiple-output transmitted signal design for the partially coherent Rayleigh fading channels with discrete inputs under a given average transmit power constraint is consider in this thesis. The objective is to design the space-time constellations and linear precoders to adapt to the degradation caused by the imperfect channel estimation at the receiver and the transmit-receive antenna correlation. The system is partially coherent so that the multiple-input multiple-output channel coefficients are estimated at the receiver and its error covariance matrix is fed back to the transmitter. Two constellation design criteria, one for the single and another for the multiple transmit antennae are proposed. An upper bound on the average bit error probability for the single transmit antenna and cutoff rate, i.e., a lower bound on the mutual information, for multiple transmit antennae are derived. Both criteria are functions of channel estimation error covariance matrix. The designed constellations are called as partially coherent constellation. Additionally, to use the resulting constellations together with forward error control codes requires efficient bit mapping schemes. Because these constellations lack geometrical symmetry in general, the Gray mapping is not always possible in the majority of the constellations obtained. Moreover, different mapping schemes may lead to highly different bit error rate performances. Thus, an efficient bit mapping algorithm called the modified binary switching algorithm is proposed. It minimizes an upper bound on the average bit error probability. It is shown through computer simulations that the designed partially coherent constellation and their optimized bit mapping algorithm together with turbo codes outperform the conventional constellations. Linear precoder design was also considered as a simpler, suboptimal alternative. The cutoff rate expression is again used as a criterion to design the linear precoder. A linear precoder is obtained by numerically maximizing the cutoff rate with respect to the precoder matrix with a given average transmit power constraint. Furthermore, the precoder matrix is decomposed using singular-value-decomposition into the input shaping, power loading, and beamforming matrices. The beamforming matrix is found to coincide with the eigenvectors of the transmit correlation matrix. The power loading and input shaping matrices are solved numerically using the difference of convex functions programming algorithm and optimization under the unitary constraint, respectively. Computer simulations show that the performance gains of the designed precoders are significant compared to the cutoff rate optimized partially coherent constellations without precoding. / Tiivistelmä Väitöskirjassa tarkastellaan lähetyssignaalien suunnittelua osittain koherenteissa Rayleigh-häipyvissä kanavissa toimiviin monitulo-monilähtöjärjestelmiin (MIMO). Lähettimen keskimääräinen lähetysteho oletetaan rajoitetuksi ja lähetyssignaali diskreetiksi. Tavoitteena on suunnitella tila-aikakonstellaatioita ja lineaarisia esikoodereita jotka mukautuvat epätäydellisen kanavaestimoinnin aiheuttamaan suorituskyvyn heikkenemiseen sekä lähetin- ja vastaanotinantennien väliseen korrelaatioon. Tarkasteltavien järjestelmien osittainen koherenttisuus tarkoittaa sitä, että MIMO-kanavan kanavakertoimet estimoidaan vastaanottimessa, josta niiden virhekovarianssimatriisi lähetetään lähettimelle. Työssä esitetään kaksi konstellaatiosuunnittelukriteeriä, toinen yhdelle lähetinantennille ja toinen moniantennilähettimelle. Molemmat kriteerit ovat kanavan estimaatiovirheen kovarianssimatriisin funktioita. Työssä johdetaan yläraja keskimääräiselle bittivirhetodennäköisyydelle yhden lähetinantennin tapauksessa sekä rajanopeus (cutoff rate), joka on alaraja keskinäisinformaatiolle, usean lähetinantennin tapauksessa. Konstellaatioiden käyttö yhdessä virheenkorjauskoodien kanssa edellyttää tehokaita menetelmiä, joilla bitit kuvataan konstellaatiopisteisiin. Koska tarvittavat konstellaatiot eivät ole tyypillisesti geometrisesti symmetrisiä, Gray-kuvaus ei ole yleensä mahdollinen.Lisäksi erilaiset kuvausmenetelmät voivat johtaa täysin erilaisiin bittivirhesuhteisiin. Tästä johtuen työssä esitetään uusi kuvausalgoritmi (modified bit switching algorithm), joka minimoi keskimääräisen bittivirhetodennäköisyyden ylärajan. Simulointitulokset osoittavat, että työssä kehitetyt konstellaatiot antavat paremman suorituskyvyn turbokoodatuissa järjestelmissä kuin perinteiset konstellaatiot. Työssä tarkastellaan myös lineaarista esikoodausta yksinkertaisena, alioptimaalisena vaihtoehtona uusille konstellaatioille. Esikoodauksen suunnittelussa käytetään samaa kriteeriä kuin konstellaatioiden kehityksessä eli rajanopeutta. Lineaarinen esikooderi löydetään numeerisesti maksimoimalla rajanopeus kun rajoitusehtona on lähetysteho. Esikoodausmatriisi hajotetaan singulaariarvohajotelmaa käyttäen esisuodatus, tehoallokaatio ja keilanmuodostusmatriiseiksi, jonka havaitaan vastaavan lähetyskorrelaatiomatriisin ominaisvektoreita. Tehoallokaatiomatriisi ratkaistaan numeerisesti käyttäen difference of convex functions -optimointia ja esisuodatusmatriisi optimoinnilla unitaarista rajoitusehtoa käyttäen. Simulaatiotulokset osoittavat uusien esikoodereiden tarjoavan merkittävän suorituskykyedun sellaisiin rajanopeusoptimoituihin osittain koherentteihin konstellaatioihin nähden, jotka eivät käytä esikoodausta.

Motivated by the increasing demand for higher data rates, coverage, and spectral efficiency, current and next generation wireless systems adapt transmission parameters and even who is being transmitted to, based on the instantaneous channel states. For example, frequency-domain scheduling(FDS) is an instance of adaptation in orthogonal frequency division multiple access(OFDMA) systems in which the base station opportunistically assigns different subcarriers to their most appropriate user. Likewise ,transmit antenna selection(AS) is another form of adaptation in which the transmitter adapts which subset of antennas it transmits with. Cognitive radio(CR), which is a next generation technology, itself is a form of adaptation in which secondary users(SUs) adapt their transmissions to avoid interfering with the licensed primary users(PUs), who own the spectrum. However, adaptation requires channel state information(CSI), which might not be available apriori at the node or nodes that are adapting. Further, the CSI might not be perfect due to noise or feedback delays. This can result in suboptimal adaptation in OFDMA systems or excessive interference at the PUs due to transmissions by the SUs in CR. In this thesis, we focus on adaptation techniques in current and next generation wireless systems and evaluate the impact of CSI –both perfect and imperfect –on it. We first develop a novel model and analysis for characterizing the performance of AS in frequency-selective OFDMA systems. Our model is unique and comprehensive in that it incorporates key LTE features such as imperfect channel estimation based on dense, narrow band demodulation reference signal and coarse, broad band sounding reference signal. It incorporates the frequency-domain scheduler, the hardware constraint that the same antenna must be used to transmit over all the subcarriers that are allocated to a user, and the scheduling constraint that the allocated subcarriers must all be contiguous. Our results show the effectiveness of combined AS and FDS in frequency-selective OFDMA systems even at lower sounding reference signal powers. We then investigate power adaptation in underlay CR, in which the SU can transmit even when the primary is on but under stringent interference constraints. The nature of the interference constraint fundamentally decides how the SU adapts its transmit power. To this end, assuming perfect CSI, we propose optimal transmit power adaptation policies that minimize the symbol error probability of an SU when they are subject to different interference and transmit power constraints. We then study the robustness of these optimal policies to imperfections in CSI. An interesting observation that comes out of our study is that imperfect CSI can not only increase the interference at the PU but can also decrease it, and this depends on the choice of the system parameters, interference, and transmit power constraints. The regimes in which these occur are characterized.

Ces dernières années, le développement des réseaux de communication indoor et outdoor et l'augmentation du nombre d'applications conduisent à un besoin toujours croissant de transmission de données à haut débit. Parmi les nombreuses technologies concurrentes, les communications par courant porteur en ligne (CPL) ont leur place en raison des infrastructures déjà disponibles. La motivation principale de cette thèse est d'augmenter le débit et la robustesse des systèmes CPL à porteuses multiples afin qu'ils puissent être utilisés efficacement dans les réseaux domestiques et pour la domotique. Le thème de ce travail de recherche est d'explorer différentes approches de modulation et de codage de canal en liaison avec plusieurs schémas d'allocation et d'optimisation des ressources. L'objectif est ici d'améliorer les capacités des CPL et d'être concurrent face aux autres solutions de communication à haut débit et de faire face efficacement aux inconvénients inhérents au réseau d'alimentation. Un certain nombre de stratégies d'allocation des ressources et d'optimisation sont étudiées pour améliorer les performances globales des systèmes CPL. La performance d'un système de communication est généralement mesurée en termes de débit, de marge de bruit et de taux d'erreur binaire (TEB) de la liaison. La maximisation de débit (RM) est étudiée pour les systèmes OFDM (en anglais orthogonal frequency division multiplexing) et LP-OFDM (en anglais linear precoded OFDM) sous la contrainte de densité spectrale de puissance (DSP). Deux contraintes différentes de taux d'erreur ont été appliquées au problème RM. La première contrainte est la contrainte de TEB crête où toutes les sous-porteuses ou séquences de précodage doivent respecter le TEB cible. Avec la deuxième contrainte, contrainte de TEB moyen, différentes sous-porteuses ou séquences de précodage sont affectées par des valeurs différentes de TEB et une contrainte de TEB moyen est imposée sur le symbole complet OFDM ou LP-OFDM. Les algorithmes d'allocation sont également proposés en prenant en compte les gains de codage de canal dans le processus d'allocation des ressources. En outre, un nouveau schéma de minimisation de TEB moyen est introduit qui minimise le TEB moyen de systèmes pour un débit donné et un masque imposé de DSP. Pour l'allocation des ressources dans un système à porteuses multiples, il est généralement supposé que l'état du canal (CSI) est parfaitement connu par l'émetteur. En réalité, les informations de CSI disponibles au point d'émission sont imparfaites. Aussi, nous avons également étudié des schémas d'allocation des ressources dans le cas de systèmes OFDM et LP-OFDM en prenant compte, et de manière efficace, les impacts des estimations bruitées. Plusieurs chaînes de communication sont aussi développées pour les systèmes OFDM et LP-OFDM.