The cooperative communication is one of technologies which can explore the space diversity to resist fading channel. The spatial diversity is achieved by allowing various terminals behaving or a virtual antenna array and forwarding signal for a source terminal in cooperative manner. Under the existence of multiple sources, resource allocation to each source user is even more crucial to enhance the system performance and achieve higher diversity gain. In this work, we proposed a multiuser relaying strategy for a cooperative network with multiple sources sharing the radio resource provided by the cooperative relays simultaneously. Different from the existing work, the set of relays forwards signals of all source users over a common channel to raise spectral efficiency. With full channel information available at relays, the set of sub-optimal precoders and decoders was proposed in terms of maximal the average SNR over all users, subject to eliminating the multiple access interference (MAI) at each destination and satisfying total power constraint among all relays. It shows from the simulation results that, compared with the conventional cooperative strategy and direct transmission, the proposed scheme provides pronounced improvement on the outage capacity. Keywords: user cooperation, multiple access, resource allocation

In this thesis, a precoding scheme is proposed for channel estimation in orthogonal frequency-division multiplexing (OFDM) systems. The precoding scheme utilizes a special code matrix before the inverse fast Fourier transform (IFFT) at the transmitter. The row vectors of the matrix have constant amplitudes in both time domain and frequency domain. With the prcoding scheme, a semi-blind channel estimation method is proposed by using the characteristics of the row code sequences. In the proposed scheme, the channel frequency responses of all sub-carriers can be obtained by using only one pilot sub-carrier, and the proposed architecture can not only increase the data rate, but also avoid interpolation error in channel estimation. In addition, the normalized mean square error (NMSE) function is derived and parameters are optimized to improve system performance. The proposed precoding architecture and channel estimation scheme are shown to have better performances in bit error rate by conducting computer simulation experiments.

This work deals with communication over the AWGN channel with additive discrete interference, where the sequence of interference symbols is known causally at the transmitter. We use Shannon's treatment for channels with side information at the transmitter as a framework to derive ``optimal precoding" and ``channel code design criterion" for the channel with known interference at the transmitter. Communication over Shannon's state-dependent discrete memoryless channel where the state sequence is known causally at the transmitter requires encoding over the so-called \emph{associated} channel which has exponential input alphabet cardinality with respect to the number of states. We show that by using at most linearly many input symbols of the \emph{associated} channel, the capacity is achievable. In particular, we consider $M$-ary signal transmission over the AWGN channel with additive $Q$-ary interference where the sequence of i.i.d. interference symbols is known causally at the transmitter. We investigate the problem of maximization of the transmission rate under the uniformity constraint, where the channel input given any current interference symbol is uniformly distributed over the channel input alphabet. For this setting, we propose the general structure of a communication system with optimal precoding. We also investigate the extension of the proposed precoding scheme to continuous channel input alphabet. We also consider the problem of channel code design with causal side information at the encoder. We derive the code design criterion at high SNR by defining a new distance measure between the input symbols of the Shannon's \emph{associated} channel. For the case of the binary-input channel, i.e., $M=2$, we show that it is sufficient to use only two (out of $2^Q$) input symbols of the \emph{associated} channel in encoding as far as the distance spectrum of code is concerned. This reduces the problem of channel code design for the binary-input AWGN channel with known interference at the encoder to design of binary codes for the binary symmetric channel where the Hamming distance among codewords is the major factor in the performance of the code.

This work deals with communication over the AWGN channel with additive discrete interference, where the sequence of interference symbols is known causally at the transmitter. We use Shannon's treatment for channels with side information at the transmitter as a framework to derive ``optimal precoding" and ``channel code design criterion" for the channel with known interference at the transmitter. Communication over Shannon's state-dependent discrete memoryless channel where the state sequence is known causally at the transmitter requires encoding over the so-called \emph{associated} channel which has exponential input alphabet cardinality with respect to the number of states. We show that by using at most linearly many input symbols of the \emph{associated} channel, the capacity is achievable. In particular, we consider $M$-ary signal transmission over the AWGN channel with additive $Q$-ary interference where the sequence of i.i.d. interference symbols is known causally at the transmitter. We investigate the problem of maximization of the transmission rate under the uniformity constraint, where the channel input given any current interference symbol is uniformly distributed over the channel input alphabet. For this setting, we propose the general structure of a communication system with optimal precoding. We also investigate the extension of the proposed precoding scheme to continuous channel input alphabet. We also consider the problem of channel code design with causal side information at the encoder. We derive the code design criterion at high SNR by defining a new distance measure between the input symbols of the Shannon's \emph{associated} channel. For the case of the binary-input channel, i.e., $M=2$, we show that it is sufficient to use only two (out of $2^Q$) input symbols of the \emph{associated} channel in encoding as far as the distance spectrum of code is concerned. This reduces the problem of channel code design for the binary-input AWGN channel with known interference at the encoder to design of binary codes for the binary symmetric channel where the Hamming distance among codewords is the major factor in the performance of the code.

Multiple antennas combined with cooperative relaying, called multiple-input multiple-output (MIMO) relay communications, can be used to improve the reliability and capacity of wireless communications systems. The precoding design is crucial to realize the full potential of MIMO relay systems. Full-duplex (FD) relay communications has become realistic with the development of effective loop interference (LI) cancellation techniques. The focus of this dissertation is on the precoding design for MIMO FD amplify-and-forward (AF) relay communication systems. First, the transceiver design for MIMO FD AF relay communication systems is considered with residual LI, which will exist in any FD system. Then the precoding design is extended to two-way MIMO FD relay communication systems. Iterative algorithms are presented for both systems based on minimizing the mean squared error (MSE) to obtain the source and relay precoders and destination combiner.Finally, the precoding design for MIMO FD relay communication systems with multiple users is investigated.Two systems are examined, namely a multiuser uplink system and a multiuser paired downlink system. By converting the original problems into convex subproblems, locally optimal solutions are found for these systems considering the existence of residual LI. The performance improvement for the proposed FD systems over the corresponding half-duplex (HD) systems is evaluated via simulation. / Graduate

Enabling multiple base stations to utilize the spatial dimension in a coordinated manner has been shown to be a fruitful technique for improving the spectral efficiency in wireless interference networks. This thesis considers multicell systems where base stations and mobile stations are equipped with multiple antennas. The base stations coordinate their spatial precoding, but individually serve their mobile stations with data. For such coordinated precoding systems, interference alignment (IA) is a useful theoretical tool, due to its ability to serve the maximum number of interference-free data streams. Three topics related to interference alignment and coordinated precoding are studied. First, the feasibility of IA over a joint space-frequency signal space is studied. A necessary condition for space-frequency IA feasibility is derived, and the possible gain over space-only IA is analyzed. An upper bound on the degree of freedom gain is shown to increase in the number of subcarriers, but decrease in the number of antennas. Numerical studies, using synthetically generated channels and real-world channels obtained from indoors and outdoors channel measurements, are used for sum rate performance evaluation. The results show that although a degree of freedom gain is noticeable due to the space-frequency precoding, the sum rate of the system is mainly improved due to a power gain. Second, distributed channel state information (CSI) acquisition techniques are proposed, which provide estimates of the information necessary to perform distributed coordinated precoding. The methods are based on pilot-assisted channel estimation in the uplink and downlink, and correspond to different tradeoffs between feedback and signaling, backhaul use, and computational complexity. Naively applying the existing WMMSE algorithm for distributed coordinated precoding together with the estimated CSI however results in poor performance. A robustification of the algorithm is therefore proposed, relying on the well known diagonal loading technique. An inherent property of the WMMSE solutions is derived and, when enforced onto solutions with imperfect CSI, results in diagonally loaded receive filters. Numerical simulations show the effectiveness of the proposed robustification. Further, the proposed robustified and distributed WMMSE algorithm performs well compared to existing state-of-the-art robust WMMSE algorithms. In contrast to our approach, the existing methods however rely on centralized CSI acquisition. Third, coordinated precoding systems with hardware impairments are studied. Assuming that impairment compensation techniques have been applied, a model is used to describe the aggregate effect of the residual hardware impairments. An iterative resource allocation method accounting for the residual hardware impairments is derived, based on an existing resource allocation framework. Numerical simulations show that the proposed method outperforms all benchmarks. In particular, the gain over impairments-aware time-division multiple access is substantial. / Genom att låta flera radiobasstationer samarbeta är det möjligt att förbättra spektraleffektiviteten i trådlösa interferensnätverk. Fokus i denna licentiatavhandling ligger på multicellnätverk där både radiobasstationer och mobilenheter har flera antenner. Radiobasstationerna väljer sina spatiella förkodare gemensamt, men skickar data individuellt till sina respektive mobilenheter. För sådana system med koordinerad förkodning ('coordinated precoding') är interferensupprätning ('interference alignment') ett användbart teoretiskt verktyg, eftersom det möjliggör överföring av maximalt antal dataströmmar i nätverket. I avhandlingen studeras tre aspekter av interferensupprätning och koordinerad förkodning. Först undersöks interferensupprätning när signalrummet består av en kombination av rymd- och frekvensdimensioner. Ett nödvändigt villkor härleds för existensen av rymd/frekvens-interferensupprätning, och prestandavinsten analyseras i jämförelse med system där enbart rymddimensionerna används för interferensupprätning. Det föreslagna systemet utvärderas med hjälp av numeriska simuleringar och uppmätta inomhus- och utomhuskanaler. Resultaten visar att rymd/frekvens-interferensupprätning ger upphov till ett ökat antal frihetsgrader, men att summadatatakten främst förbättras tack vare en upplevd effektförstärkning. Därefter undersöks tekniker för skattning av den nödvändiga kanalkännedom som krävs för att genomföra koordinerad förkodning. Det finns flera sätt att erhålla den nödvändiga informationen, t.ex. genom olika kombinationer av kanalskattning, feedback, signalering och användning av backhaulnätverk. Speciellt söks distribuerade metoder, eftersom dessa är fördelaktiga vid praktisk implementering. Tre metoder för skattning av kanalkännedom föreslås. Dessa motsvarar olika avvägningar mellan kanalskattning och signalering, och en av metoderna är helt distribuerad. När den skattade informationen används med en existerande algoritm för koordinerad förkodning blir prestandan undermålig. Därför föreslås två förändringar av algoritmen, vilka leder till mer robusta prestanda. Förändringarna bygger på den välkända diagonal loading-tekniken. Utvärdering av det föreslagna systemet, som består av distribuerad erhållning av kanalkännedom samt den förbättrade algoritmen för koordinerad förkodning, genomförs med numerisk simulering. Resulterande prestanda är i nivå med ett tidigare föreslaget system, som dock kräver centraliserad tillgång till kanalskattningarna, till skillnad från vår nya lösning. Slutligen studeras ett system med koordinerad förkodning och icke-perfekt radiohårdvara. En modell för distortionsbruset orsakad av bristerna i radiohårdvaran används, och en iterativ resurstilldelningsteknik föreslås baserad på ett existerande ramverk. Den föreslagna algoritmen kan implementeras distribuerat över mobilenheterna, men kan i allmänhet inte implementeras distribuerat över radiobasstationerna. Den föreslagna algoritmen utvärderas med numeriska simuleringar, och resultaten visar att prestanda är bättre än alla referensmetoder. Detta visar betydelsen av att hantera bristerna i radiohårdvaran i resurstilldelningen. Sammantaget visar avhandlingen på möjligheterna att öka spektraleffektiviteten i framtida multicellnätverk med hjälp av koordinerad förkodning. / <p>QC 20140512</p>

Τα τελευταία χρόνια και κυρίως μετά το 1996 έχει παρουσιαστεί ένα έντονο ενδιαφέρον γύρω από τα ασύρματα συστήματα MIMO (Συστήματα Πολλών Εισόδων και Πολλών Εξόδων). Η βασική αιτία που δημιούργησε αυτό το ενδιαφέρον ήταν η θεωρητική ανάλυση της χωρητικότητας που επιτυγχάνεται με τη χρήση πολλαπλών κεραιών τόσο στο δέκτη όσο και στον πομπό. Ωστόσο πέρα από την αύξηση της χωρητικότητας τα συστήματα MIMΟ έχουν μια σειρά από επιπλέον πλεονεκτήματα, επιτυγχάνουν ανεκτικότητα στην εξασθένιση, αυξάνουν την φασματική αποδοτικότητα, μειώνουν την κατανάλωση ενέργειας καθώς και το κόστος χρήσης και κατασκευής ασύρματων δικτύων. Έχοντας λάβει υπ’ όψιν τα παραπάνω και έχοντας κάνει ήδη μια αρχική έρευνα στο τι υπάρχει στην επιστημονική βιβλιογραφία γύρω από τα συστήματα MIMO, επιλέξαμε να ασχοληθούμε με την συγκεκριμένη τεχνολογία και πιο συγκεκριμένα με την προ-κωδικοποίηση πομπού, όταν τα κανάλια που διαθέτουμε είναι συχνοτικά επιλεκτικά (frequency selective). Το πρόβλημα που μας απασχόλησε είναι η διερεύνηση τεχνικών κωδικοποίησης των δεδομένων του πομπού, πριν αυτά μεταδοθούν, ούτως ώστε να μπορέσει να απλοποιηθεί η σχεδίαση του δέκτη. Στην περίπτωση των συχνοτικά επιλεκτικών καναλιών πέρα από τον πανταχού παρόντα Γκαουσιανό θόρυβο έχουμε να αντιμετωπίσουμε και τη διασυμβολική παρεμβολή (Intersymbol Interference - ISI) . Στόχος μας είναι να μπορέσουμε να μετατοπίσουμε τη διαδικασία της ισοστάθμισης από το δέκτη στον πομπό, όπου, στην περίπτωση που ο πομπός είναι ένας σταθμός βάσης, η δυνατότητα υλοποίησης πολύπλοκων διεργασιών είναι μεγαλύτερη, τόσο μεγαλύτερης ανοχής στην κατανάλωση ενέργειας όσο κυρίως, και στη δυνατότητα χρήσης πολύπλοκου υλικού. Το πρόβλημα που τίθεται στην περίπτωση που η ισοστάθμιση γίνει στην μεριά του πομπού είναι η ποιότητα και η ποσότητα της γνώσης του πραγματικού καναλιού. Είναι σχεδόν αδύνατο ο πομπός να έχει πλήρη γνώση του πραγματικού καναλιού, με αποτέλεσμα να πρέπει να αρκεστεί σε γνώση, που στην καλύτερη περίπτωση προσεγγίζει αυτή του πραγματικού καναλιού. Επίσης, πολλές φορές, η ποσότητα της γνώσης που μπορεί να αποσταλεί από το δέκτη – όταν δεν ισχύει η αρχή της αμοιβαιότητας (reciprocity) – είναι περιορισμένη. Από τα παραπάνω καταλαβαίνουμε ότι θα είχε ενδιαφέρον η μελέτη τεχνικών που παρουσιάζουν ανοχή στην ποιότητα της γνώσης του καναλιού καθώς και η συμπεριφορά τους όταν αυτές διαθέτουν μερική ή και περιορισμένη γνώση του πραγματικού καναλιού. Ένας από τους τρόπου αντιμετώπισης όταν συναντούνται συχνοτικά επιλεκτικά κανάλια είναι η χρήση του OFDM με όσα αρνητικά αυτό συνεπάγεται (π.χ. η δυσκολία συγχρονισμού πομπού και δέκτη). Ένας άλλος τρόπος αντιμετώπισης, στην περίπτωση μονής φέρουσας (single carrier), είναι η χρήση προκωδικοποιητων Bezout. Επιλέξαμε να ασχοληθούμε με αυτόν τον τύπου προκωδικοποίητων. Πιο συγκεκριμένα, όταν ο αριθμός των κεραιών του πομπού είναι μεγαλύτερος από τον αριθμό των κεραιών του δέκτη, είναι δυνατόν να εφαρμόσουμε την ταυτότητα Bezout (Bezout Identity) στην μεριά του δέκτη. Με απλά λόγια θα εφαρμόσουμε ένα προ-ισοσταθμιστή επιβολής μηδενικών (zero forcing). Όπως είναι αναμενόμενο, μιας και ο προκωδικοποιητής εφαρμόζεται στην μεριά του πομπού, πριν εμφανιστεί ο Γκαουσιανός θόρυβος, δεν έχουμε ενίσχυση αυτού του θορύβου, ωστόσο είναι δυνατόν να έχουμε σημαντική αύξηση της μεταδιδόμενης ισχύος. Για να λυθεί αυτό το πρόβλημα έχει προταθεί στη βιβλιογραφία η σχεδίαση προκωδικοποιητών Bezout με την χρήση περιορισμών ισχύος. Αυτό που εμείς μελετήσαμε στην περίπτωση των προκωδικοποιητών Bezout (ή FIR προκωδικοποιητών), είναι η συμπεριφορά τους στην περίπτωση που ο πομπός διαθέτει πλήρη ή μερική γνώση του καναλιού. Είδαμε την περίπτωση του σχεδιασμού ενός FIR προκωδικοποιητή κάτω από τον περιορισμό ισχύος μετάδοσης μέσω της μεθόδου Tikhonov Regularization, ενός σημαντικού εργαλείου επίλυσης του προβλήματος των ελαχίστων τετραγώνων κάτω από τη δι-κριτήριο διατύπωση. Τέλος, προτείναμε δύο FIR σχεδιασμούς προκωδικοποιητών για την περίπτωση που ο πομπός διαθέτει παραμετρική (στατιστική) περιγραφή του καναλιού. / The last years, but mainly after 1996 there is an intensive interest in MIMO systems. The reason that created this interest was the capacity that can be achieved by the use of multiple antennas to the transmitter and to receiver. Furthermore, the use of multiple antennas has a number of advantages except from the capacity increase; MIMO can achieve tolerance to fading, spectral efficiency, increased coverage etc. By having considered the above information we decided to work with MIMO systems and especially with precoding techniques for frequency selective channels. In the case of frequency selective channels except from the Gaussian noise we have to treat and with intersymbol interference (ISI) which is an important degradation factor. A very serious reason to handle intersymbol interference at the transmitter side - especially when transmitter is a base station - is to simplify receiver's design. When transmitter is a base station there is a tolerance in power consuming and in the implementation of more complicated hardware. After an extensive bibliographical we concluded to use the theory of Bezout Identity. In the case where the number of antennas at the transmitter is greater than the number of antennas at the receiver it is formed a left-coprime FIR channel. By using the Bezout identity matrix, it is possible to be designed a FIR MIMO precoder that reduce intersymbol interference. Bezout precoder (pre-equalizer) is a zero-forcing (ZF) equalizer. As it is known from bibliography ZF equalizer has the disadvantage that amplifies noise power in deep fades. For the case of Bezout precoder it is not true since there is no noise - noise will appear at the receiver. But there is another disadvantage, Bezout precoder may increase transmit power significantly to overcome deep fades in the singular values of the channel matrix. The solution to the previous phenomenon can be taken by designing ZF precoders under power constraints. The main problem in the case of transmit precoding is the channel knowledge - when reciprocity principle is not valid. In most cases it is not possible to have perfect channel knowledge or even the knowledge that we have may be of bad quality. Another drawback that appears in the case of frequency selective channels is the amounts of information (number of bits) that can be send back to the transmitter - limited feedback. Many works assumed a quasi-static channel - channel doesn't changes for a number of symbols - and perfect channel knowledge. In real world this may not be true. In this master thesis we investigated three things. Firstly, the behavior of Bezout precoders under channel mismatch at the side of transmitter. Secondly, ways that will allows us to decrease channel feedback. And thirdly, which was the most interesting, we proposed two FIR designs that uses statistical channel knowledge.

Two of the most prominent techniques to meet the next generation wireless communication system's demands are cognitive radio and massive MIMO systems. Cognitive radio systems improve radio spectrum utilization either by spectrum sharing or by opportunistically utilizing the spectrum of the licensed users. Employing multiple antennas at the transmitter and/or the receiver of the radio can further improve the overall performance of the wireless systems. Massive MIMO systems, on the other hand, improve the spectral and energy efficiencies of currently deployed systems by reaping all the benefits of the multi-antenna systems at a very large scale. The price paid for employing a large number of antennas either at the transmitter or receiver is the high hardware cost. Judicious transmit or receive antenna selection can reduce this cost, while retaining most of the benefits offered by multiple antennas. In my doctoral research, we have presented both upper and lower bounds on the capacity of a general selection diversity system. These novel bounds are simple to compute and can be used in a variety of different fading environments. We have also proposed and analyzed the performance of different antenna selection schemes for both an underlay cognitive radio and a massive MIMO system. Specifically, we have considered both receive and transmit antenna selection in an underlay cognitive radio based on the maximization of secondary link signal-to-interference plus noise ratio. Exact and asymptotic performance analyses of the secondary system with such selections are carried out, and numerical examples are presented to verify the correctness of the analytical results. Several sub-optimal antenna subset selection schemes for both a single-cell and a multi-cell multi-user massive MIMO system are also proposed. Numerical results on the sum rate of the system in different scenarios are presented to verify the superior performance of the proposed schemes over the existing sub-optimal antenna subset selection schemes. Lastly, we have also presented three novel hybrid analog/digital precoding schemes to reduce the hardware and software complexities of a sub-connected massive MIMO system. / Graduate / 0544

Wireless systems with multiple antennas at both the transmitter and receiver (MIMO systems) have been the focus of research in the recent past due to their ability to provide higher data rates and better reliability than their single antenna counterparts. Designing a communication system for MIMO frequency selective channels provides many signal processing challenges. Popular methods like MIMOOFDM and space-time precoding linearly process blocks of data at both the transmitter and the receiver. Independence between the blocks is ensured by introducing sufficient redundancy between successive blocks. This approach has many pitfalls, including the limit on achievable data rate due to redundancy requirements and the need for additional coding/processing. In this thesis, we provide a filterbank precoding framework (FBP) for communication over MIMO frequency selective channels. By viewing the channel as a polynomial matrix, we derive the minimum redundancy required for achieving FIR equalization of the precoded channel. It is shown that, for most practical channels, a nominal redundancy is enough. The results are general, and hold for channels of any dimension and order. We derive the zero-forcing and MMSE equalizers for the precoded channel. The role of equalizer delay in system performance is analyzed. We extend the minimum redundancy result to the case of space-time filterbank precoding (STFP). Introducing the time dimension allows the channel to be represented by a block pseudocirculant matrix. By using the Smith form of block pseudocirculant matrices, we show that very high data rates can be achieved with STFP. When channel information is available at the transmitter, we derive an iterative algorithm for obtaining the MMSE optimal precoder-equalizer pair. We then provide a comparison of FBP with the block processing methods. It is shown that FBP provides better BER performance than the block processing methods at a lower computational cost. The reasons for the better performance of FBP are discussed.

Multi-user wireless systems with multiple antennas can drastically increase the capac- ity while maintaining the quality of service requirements. The best performance of these systems is obtained at the presence of instantaneous channel knowledge. Since uplink-downlink channel reciprocity does not hold in frequency division duplex and broadband time division duplex systems, efficient channel quantization becomes important. This thesis focuses on different quantization techniques in a linearly precoded multi-user wireless system. Our work provides three major contributions. First, we come up with an end-to-end transceiver design, incorporating precoder, receive combining and feedback policy, that works well at low feedback overhead. Second, we provide optimal bit allocation across the gain and shape of a complex vector to reduce the quantization error and investigate its effect in the multiuser wireless system. Third, we design an adaptive differential quantizer that reduces feedback overhead by utilizing temporal correlation of the channels in a time varying scenario.