Detection and Resource Allocation Algorithms for Cooperative MIMO Relay Systems

Cooperative communications and multiple-input multiple-output (MIMO) communication systems are important topics in current research that will play key roles in the future of wireless networks and standards. In this thesis, the various challenges in accurately detecting and estimating data signals and allocating resources in the cooperative systems are investigated. Firstly, we propose a cross-layer design strategy that consists of a cooperative maximum likelihood (ML) detector operating in conjunction with link selection for a cooperative MIMO network. Two new link selection schemes are proposed, along with an iterative detection and decoding (IDD) scheme that utilises channel coding techniques. Simulation results show the performance and potential gains of the proposed schemes. Secondly, a successive interference cancellation (SIC) detector is proposed for a MIMO system that has dynamic ordering based on a reliability ordering (RO), and an alternative multiple feedback (MF) candidate cancellation method. The complexity of these schemes is analysed and a hard decision feedback IDD system is also proposed. Results show that the proposed detector can give gains over existing schemes for a minimal amount of extra complexity. Lastly, a detector is proposed that is based upon the method of widely linear (WL) filtering and a multiple branch (MB) SIC, for an overloaded, multi-user cooperative MIMO system. The use of WL methods is explained, and a new method of choosing cancellation branches for an MB detector is proposed with an analysis of the complexity required. A list-based IDD system is developed, and simulation results show that the proposed detector can operate in an overloaded system and provide improved performance gains

A super-nyquist architecture for rateless underwater acoustic communication

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Cataloged from student-submitted PDF version of thesis.Includes bibliographical references (p. 135-136).Oceans cover about 70 percent of Earth's surface. Despite the abundant resources they contain, much of them remain unexplored. Underwater communication plays a key role in the area of deep ocean exploration. It is also essential in the field of the oil and fishing industry, as well as for military use. Although research on communicating wirelessly in the underwater environment began decades ago, it remains a challenging problem due to the oceanic medium, in which dynamic movements of water and rich scattering are commonplace. In this thesis, we develop an architecture for reliably communicating over the underwater acoustic channel. A notable feature of this architecture is its rateless property: the receiver simply collects pieces of transmission until successful decoding is possible. With this, we aim to achieve capacity-approaching communication under a variety of a priori unknown channel conditions. This is done by using a super-Nyquist (SNQ) transmission scheme. Several other important technologies are also part of the design, among them dithered repetition coding, adaptive decision feedback equalization (DFE), and multiple-input multiple-output (MIMO) communication. We present a complete block diagram for the transmitter and receiver architecture for the SNQ scheme. We prove the sufficiency of the architecture for optimality, and we show through analysis and simulation that as the SNQ signaling rate increases, the SNQ scheme is indeed capacity-achieving. At the end, the performance of the proposed SNQ scheme and its transceiver design are tested in physical experiments, whose results show that the SNQ scheme achieves a significant gain in reliable communication rate over conventional (non-SNQ) schemes.by Qing He.S.M

Space-Time Codes for MIMO systems : Quasi-Orthogonal design and concatenation

Der Nachfrage an Mobilfunksystemen mit hoher Datenrate und Übertragungsqualität für eine Vielfalt von Anwendungen ist in den letzten Jahren dramatisch gestiegen. Zur Deckung des hohen Bedarfs werden jedoch neue Konzepte und Technologien benötigt, die den Beeinträchtigungen des Mobilfunkkanals entgegenwirken oder sich diese zu Nutze machen und die knappen Ressourcen wie Bandbreite und Leistung optimal ausnutzen. Eine effiziente Maßnahme zur Erhöhung der Performanz stellen Mehrantennensysteme dar. Um das große Potenzial von solchen Mehrantennensystemen auszunutzen, wurden neue Sendestrategien, so genannte Raum-Zeit Codes entworfen und analysiert, die neben der zeitlichen und spektralen auch die räumliche Komponente ausnutzen sollen. In dieser Arbeit wird die Leistungsfähigkeit solcher Raum-Zeit Codes zunächst isoliert und später, im zweiten Teil der Arbeit, in Kombination mit herkömmlichen Kanalcodierungsverfahren untersucht. Im ersten Abschnitt, d.h. im Fall ohne herkömmliche Kanalcodierung liegt der Fokus auf diversitäts-orientierten Raum-Zeit Codes. Zunächst werden basierend auf den Raum-Zeit Codes mit orthogonaler Struktur (OSTBC) Raum-Zeit Codes mit quasi-orthogonaler Struktur für eine beliebige Anzahl von Sende-und Empfangsantennen entworfen. Aus der Konstruktion resultieren dann zwei Gruppen von Codes. Die wesentliche Charakteristik der ersten Gruppe ist es, dass sie Verbindungen mit hoher Qualität gewährleistet. Dies wird erreicht, indem räumliche und zeitliche Redundanz eingebracht wird und daraus die volle Diversität (entspricht dem maximalen Abfall der Bitfehlerratenkurve) resultiert. Volle Diversität wird auch von den OSTBC erreicht, die aufgrund ihrer Struktur den matrix-wertigen Kanal für Mehrantennensysteme, so genannte Multiple-Input-Multiple-Output (MIMO)-Kanäle in parallele skalare Ersatzkanäle, so genannte Single-Input-Single-Output (SISO)-Kanäle, transformieren. Die Anzahl der parallelen Ersatzkanäle entspricht dabei der Anzahl der Sendeantennen. Diese Erkenntnis und die Einsicht in die Eigenschaften dieser Ersatzkanäle waren ein wichtiger Meilenstein und ermöglichten es, die Leistungsfähigkeit der OSTBC zu analysieren. Die Bestimmung der Ersatzkanalstuktur ist daher auch hier von zentraler Bedeutung. Im Falle von Raum-Zeit Codes mit quasi-orthogonaler Struktur wird in dieser Arbeit gezeigt, dass der MIMO-Kanal in einen block-diagonalen MIMO-Kanal zerlegt wird, dessen Eigenvektoren konstant und Blöcke identisch sind. Weiterhin konnte gezeigt werden, dass die Eigenwerte von jedem Block voneinander unabhängig sind und einer nichtzentralen Chi-Quadrat-Verteilung mit einer Anzahl von Freiheitsgraden, die dem Vierfachen der Anzahl der Empfangsantennen entspricht, folgen. Durch Lockerung der Anforderung von voller Diversität an die zu entwerfenden Codes gelangt man zu der zweiten Gruppe der Raum-Zeit Codes mit quasi-orthogonaler Stuktur, welche eine Verallgemeinerung der OSTBC darstellen. Insbesondere wird in dieser Arbeit gezeigt, dass nicht nur das Alamouti-Schema, ein OSTBC für zwei Sendeantennen, sondern auch eine verallgemeinerte Version dieses Alamouti-Schemas, die Kapazität im Falle einer Empfangsantenne erreicht. Die in dieser Arbeit entworfenen Raum-Zeit Codes werden schließlich hinsichtlich ihrer Fehlerraten-Performanz und ihrer spektralen Effizienz mit optimalen als auch mit suboptimalen Empfängerstrukturen analysiert. Im zweiten Teil dieser Arbeit werden verschiedene Raum-Zeit Codes mit herkömmlichen Kanalcodierungsverfahren kombiniert. Dabei werden neue Empfängerstrukturen vorgestellt und die Leistungsfähigkeit der Raum-Zeit Codes mit iterativen Algorithmen zur so genannten Soft-Input-Soft-Output-Decodierung mit Hilfe von neuen Analysetechniken, den so genannten EXIT-Charts, untersucht und optimiert. Im Falle von OSTBC werden zusätzlich Kriterien für die optimale Abbildung von Bitsequenzen auf Sendesymbole hergeleitet.The demand for mobile communication systems with high data rates and improved link quality for a variety of applications has dramatically increased in recent years. New concepts and methods are necessary in order to cover this huge demand, which counteract or take advantage of the impairments of the mobile communication channel and optimally exploit the limited resources such as bandwidth and power. Multiple antenna systems are an efficient means for increasing the performance. In order to utilize the huge potential of multiple antenna concepts, it is necessary to resort to new transmit strategies, referred to as Space-Time Codes, which, in addition to the time and spectral domain, also use the spatial domain. The performance of such Space-Time Codes is analyzed in this thesis with and without conventional channel coding strategies. In case without conventional channel codes, the focus is on diversity-oriented Space-Time Codes. Based on Space-Time Block Codes from orthogonal designs (OSTBC), the Space-Time Block Codes from quasi-orthogonal designs are developed for any number of transmit and receive antennas. The outcome of this construction are two groups of codes. The main property of the first group is the support of links with high quality. This is achieved by incorporating spatial and temporal redundancy, which results in full diversity or in other words, in the maximum decay of the bit error rate curves. Full diversity is also achieved by OSTBC, which due to their structure transform the matrix-valued channel for multi-antenna systems, so called multiple-input-multiple-output (MIMO)-channels, into several parallel, scalar single-input-single-output (SISO)-channels. This insight and the understanding of the properties of the equivalent SISO-channels were the key results in order to analyze the performance of the OSTBC. The determination of the structure of the equivalent channel is also a matter of vital importance in this work. To this end, we show that the MIMO-channel in the case of Space-Time Codes from quasi-orthogonal designs is transformed into an equivalent block-diagonal MIMO-channel with identical blocks having constant eigenvectors, independent of the channel realization. Furthermore, we show that the eigenvalues of each block are pairwise independent and follow a non-central chi-square distribution, where the number of degrees of freedom equals four times the number of receive antennas. By relaxing the requirement of full diversity one arrives at the second group of Space-Time Codes from quasi-orthogonal designs. These codes represent a generalization of Space-Time Codes from orthogonal designs. Particularly, we show in this work, that not only the Alamouti-scheme, a OSTBC for two transmit antennas, but also its generalized version achieves capacity in the case of one receive antenna. The drafted codes are then analyzed with respect to the error rate performance and the spectral efficiency with optimal as well as suboptimal receiver structures. In the second part of this work the combination of Space-Time Codes with conventional channel coding techniques is considered. New receiver structures are presented and the performance of Space-Time Codes with iterative algorithms for soft-input-soft-output-decoding is analyzed and optimized with the help of new analytical tools, the so called EXIT-charts. Furthermore, some criteria for the optimal mapping strategy are derived in the case of OSTBC

Mobile and Wireless Communications

Mobile and Wireless Communications have been one of the major revolutions of the late twentieth century. We are witnessing a very fast growth in these technologies where mobile and wireless communications have become so ubiquitous in our society and indispensable for our daily lives. The relentless demand for higher data rates with better quality of services to comply with state-of-the art applications has revolutionized the wireless communication field and led to the emergence of new technologies such as Bluetooth, WiFi, Wimax, Ultra wideband, OFDMA. Moreover, the market tendency confirms that this revolution is not ready to stop in the foreseen future. Mobile and wireless communications applications cover diverse areas including entertainment, industrialist, biomedical, medicine, safety and security, and others, which definitely are improving our daily life. Wireless communication network is a multidisciplinary field addressing different aspects raging from theoretical analysis, system architecture design, and hardware and software implementations. While different new applications are requiring higher data rates and better quality of service and prolonging the mobile battery life, new development and advanced research studies and systems and circuits designs are necessary to keep pace with the market requirements. This book covers the most advanced research and development topics in mobile and wireless communication networks. It is divided into two parts with a total of thirty-four stand-alone chapters covering various areas of wireless communications of special topics including: physical layer and network layer, access methods and scheduling, techniques and technologies, antenna and amplifier design, integrated circuit design, applications and systems. These chapters present advanced novel and cutting-edge results and development related to wireless communication offering the readers the opportunity to enrich their knowledge in specific topics as well as to explore the whole field of rapidly emerging mobile and wireless networks. We hope that this book will be useful for students, researchers and practitioners in their research studies

High Capacity CDMA and Collaborative Techniques

The thesis investigates new approaches to increase the user capacity and improve the error performance of Code Division Multiple Access (CDMA) by employing adaptive interference cancellation and collaborative spreading and space diversity techniques. Collaborative Coding Multiple Access (CCMA) is also investigated as a separate technique and combined with CDMA. The advantages and shortcomings of CDMA and CCMA are analysed and new techniques for both the uplink and downlink are proposed and evaluated. Multiple access interference (MAI) problem in the uplink of CDMA is investigated first. The practical issues of multiuser detection (MUD) techniques are reviewed and a novel blind adaptive approach to interference cancellation (IC) is proposed. It exploits the constant modulus (CM) property of digital signals to blindly suppress interference during the despreading process and obtain amplitude estimation with minimum mean squared error for use in cancellation stages. Two new blind adaptive receiver designs employing successive and parallel interference cancellation architectures using the CM algorithm (CMA) referred to as ‘CMA-SIC’ and ‘BA-PIC’, respectively, are presented. These techniques have shown to offer near single user performance for large number of users. It is shown to increase the user capacity by approximately two fold compared with conventional IC receivers. The spectral efficiency analysis of the techniques based on output signal-to interference-and-noise ratio (SINR) also shows significant gain in data rate. Furthermore, an effective and low complexity blind adaptive subcarrier combining (BASC) technique using a simple gradient descent based algorithm is proposed for Multicarrier-CDMA. It suppresses MAI without any knowledge of channel amplitudes and allows large number of users compared with equal gain and maximum ratio combining techniques normally used in practice. New user collaborative schemes are proposed and analysed theoretically and by simulations in different channel conditions to achieve spatial diversity for uplink of CCMA and CDMA. First, a simple transmitter diversity and its equivalent user collaborative diversity techniques for CCMA are designed and analysed. Next, a new user collaborative scheme with successive interference cancellation for uplink of CDMA referred to as collaborative SIC (C-SIC) is investigated to reduce MAI and achieve improved diversity. To further improve the performance of C-SIC under high system loading conditions, Collaborative Blind Adaptive SIC (C-BASIC) scheme is proposed. It is shown to minimize the residual MAI, leading to improved user capacity and a more robust system. It is known that collaborative diversity schemes incur loss in throughput due to the need of orthogonal time/frequency slots for relaying source’s data. To address this problem, finally a novel near-unity-rate scheme also referred to as bandwidth efficient collaborative diversity (BECD) is proposed and evaluated for CDMA. Under this scheme, pairs of users share a single spreading sequence to exchange and forward their data employing a simple superposition or space-time encoding methods. At the receiver collaborative joint detection is performed to separate each paired users’ data. It is shown that the scheme can achieve full diversity gain at no extra bandwidth as inter-user channel SNR becomes high. A novel approach of ‘User Collaboration’ is introduced to increase the user capacity of CDMA for both the downlink and uplink. First, collaborative group spreading technique for the downlink of overloaded CDMA system is introduced. It allows the sharing of the same single spreading sequence for more than one user belonging to the same group. This technique is referred to as Collaborative Spreading CDMA downlink (CS-CDMA-DL). In this technique T-user collaborative coding is used for each group to form a composite codeword signal of the users and then a single orthogonal sequence is used for the group. At each user’s receiver, decoding of composite codeword is carried out to extract the user’s own information while maintaining a high SINR performance. To improve the bit error performance of CS-CDMA-DL in Rayleigh fading conditions, Collaborative Space-time Spreading (C-STS) technique is proposed by combining the collaborative coding multiple access and space-time coding principles. A new scheme for uplink of CDMA using the ‘User Collaboration’ approach, referred to as CS-CDMA-UL is presented next. When users’ channels are independent (uncorrelated), significantly higher user capacity can be achieved by grouping multiple users to share the same spreading sequence and performing MUD on per group basis followed by a low complexity ML decoding at the receiver. This approach has shown to support much higher number of users than the available sequences while also maintaining the low receiver complexity. For improved performance under highly correlated channel conditions, T-user collaborative coding is also investigated within the CS-CDMA-UL system

INTERFERENCE MANAGEMENT IN LTE SYSTEM AND BEYOUND

The key challenges to high throughput in cellular wireless communication system are interference, mobility and bandwidth limitation. Mobility has never been a problem until recently, bandwidth has been constantly improved upon through the evolutions in cellular wireless communication system but interference has been a constant limitation to any improvement that may have resulted from such evolution. The fundamental challenge to a system designer or a researcher is how to achieve high data rate in motion (high speed) in a cellular system that is intrinsically interference-limited. Multi-antenna is the solution to data on the move and the capacity of multi-antenna system has been demonstrated to increase proportionally with increase in the number of antennas at both transmitter and receiver for point-to-point communications and multi-user environment. However, the capacity gain in both uplink and downlink is limited in a multi-user environment like cellular system by interference, the number of antennas at the base station, complexity and space constraint particularly for a mobile terminal. This challenge in the downlink provided the motivation to investigate successive interference cancellation (SIC) as an interference management tool LTE system and beyond. The Simulation revealed that ordered successive interference (OSIC) out performs non-ordered successive interference cancellation (NSIC) and the additional complexity is justified based on the associated gain in BER performance of OSIC. The major drawback of OSIC is that it is not efficient in network environment employing power control or power allocation. Additional interference management techniques will be required to fully manage the interference.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format

Applications of Lattice Codes in Communication Systems

In the last decade, there has been an explosive growth in different applications of wireless technology, due to users' increasing expectations for multi-media services. With the current trend, the present systems will not be able to handle the required data traffic. Lattice codes have attracted considerable attention in recent years, because they provide high data rate constellations. In this thesis, the applications of implementing lattice codes in different communication systems are investigated. The thesis is divided into two major parts. Focus of the first part is on constellation shaping and the problem of lattice labeling. The second part is devoted to the lattice decoding problem. In constellation shaping technique, conventional constellations are replaced by lattice codes that satisfy some geometrical properties. However, a simple algorithm, called lattice labeling, is required to map the input data to the lattice code points. In the first part of this thesis, the application of lattice codes for constellation shaping in Orthogonal Frequency Division Multiplexing (OFDM) and Multi-Input Multi-Output (MIMO) broadcast systems are considered. In an OFDM system a lattice code with low Peak to Average Power Ratio (PAPR) is desired. Here, a new lattice code with considerable PAPR reduction for OFDM systems is proposed. Due to the recursive structure of this lattice code, a simple lattice labeling method based on Smith normal decomposition of an integer matrix is obtained. A selective mapping method in conjunction with the proposed lattice code is also presented to further reduce the PAPR. MIMO broadcast systems are also considered in the thesis. In a multiple antenna broadcast system, the lattice labeling algorithm should be such that different users can decode their data independently. Moreover, the implemented lattice code should result in a low average transmit energy. Here, a selective mapping technique provides such a lattice code. Lattice decoding is the focus of the second part of the thesis, which concerns the operation of finding the closest point of the lattice code to any point in N-dimensional real space. In digital communication applications, this problem is known as the integer least-square problem, which can be seen in many areas, e.g. the detection of symbols transmitted over the multiple antenna wireless channel, the multiuser detection problem in Code Division Multiple Access (CDMA) systems, and the simultaneous detection of multiple users in a Digital Subscriber Line (DSL) system affected by crosstalk. Here, an efficient lattice decoding algorithm based on using Semi-Definite Programming (SDP) is introduced. The proposed algorithm is capable of handling any form of lattice constellation for an arbitrary labeling of points. In the proposed methods, the distance minimization problem is expressed in terms of a binary quadratic minimization problem, which is solved by introducing several matrix and vector lifting SDP relaxation models. The new SDP models provide a wealth of trade-off between the complexity and the performance of the decoding problem