Multiuser MIMO-OFDM for Next-Generation Wireless Systems

This overview portrays the 40-year evolution of orthogonal frequency division multiplexing (OFDM) research. The amelioration of powerful multicarrier OFDM arrangements with multiple-input multiple-output (MIMO) systems has numerous benefits, which are detailed in this treatise. We continue by highlighting the limitations of conventional detection and channel estimation techniques designed for multiuser MIMO OFDM systems in the so-called rank-deficient scenarios, where the number of users supported or the number of transmit antennas employed exceeds the number of receiver antennas. This is often encountered in practice, unless we limit the number of users granted access in the base station’s or radio port’s coverage area. Following a historical perspective on the associated design problems and their state-of-the-art solutions, the second half of this treatise details a range of classic multiuser detectors (MUDs) designed for MIMO-OFDM systems and characterizes their achievable performance. A further section aims for identifying novel cutting-edge genetic algorithm (GA)-aided detector solutions, which have found numerous applications in wireless communications in recent years. In an effort to stimulate the cross pollination of ideas across the machine learning, optimization, signal processing, and wireless communications research communities, we will review the broadly applicable principles of various GA-assisted optimization techniques, which were recently proposed also for employment inmultiuser MIMO OFDM. In order to stimulate new research, we demonstrate that the family of GA-aided MUDs is capable of achieving a near-optimum performance at the cost of a significantly lower computational complexity than that imposed by their optimum maximum-likelihood (ML) MUD aided counterparts. The paper is concluded by outlining a range of future research options that may find their way into next-generation wireless systems

Application of integer quadratic programming in detection of high-dimensional wireless systems

High-dimensional wireless systems have recently generated a great deal of interest due to their ability to accommodate increasing demands for high transmission data rates with high communication reliability. Examples of such large-scale systems include single-input, single-output symbol spread OFDM system, large-scale single-user multi-input multi-output (MIMO) OFDM systems, and large-scale multiuser MIMO systems. In these systems, the number of symbols required to be jointly detected at the receiver is relatively large. The challenge with the practical realization of these systems is to design a detection scheme that provides high communication reliability with reasonable computational complexity, even as the number of simultaneously transmitted independent communication signals becomes very large.^ Most of the optimal or near-optimal detection techniques that have been proposed in the literature of relatively low-dimensional wireless systems, such as MIMO systems in which number of antennas is less than 10, become problematic for high-dimensional detection problems. That is, their performance degrades or the computational complexity becomes prohibitive, especially when higher-order QAM constellations are employed.^ In the first part of this thesis, we propose a near-optimal detection technique which offers a flexible trade-off between complexity and performance. The proposed technique formulates the detection problem in terms of Integer Quadratic Programming (IQP), which is then solved through a controlled Branch and Bound (BB) search tree algorithm. In addition to providing good performance, an important feature of this approach is that its computational complexity remains roughly the same even as we increase the constellation order from 4-QAM to 256-QAM. The performance of the proposed algorithm is investigated for both symbol spread OFDM systems and large-scale MIMO systems with both frequency selective and at fading channels.^ The second part of this work focuses on a reduced complexity version of IQP referred to as relaxed quadratic programming (QP). In particular, QP is used to reformulate two widely used detection schemes for MIMO OFDM: (1) Successive Interference Cancellation (SIC) and (2) Iterative Detecting and Decoding (IDD). First, SIC-based algorithms are derived via a QP formulation in contrast to using a linear MMSE detector at each stage. The resulting QP-SIC algorithms offer lower computational complexity than the SIC schemes that employ linear MMSE at each stage, especially when the dimension of the received signal vector is high. Three versions of QP-SIC are proposed based on various trade-offs between complexity and receiver performance; each of the three QP-SIC algorithms outperforms existing SIC techniques. Second, IDD-based algorithms are developed using a QP detector. We show how the soft information, in terms of the Log Likelihood Ratio (LLR), can be extracted from the QP detector. Further, the procedure for incorporating the a-priori information that is passed from the channel decoder to the QP detector is developed. Simulation results are presented demonstrating that the use of QP in IDD offers improved performance at the cost of a reasonable increase in complexity compared to linear detectors

Multi-input multi-output (MIMO) detection by a colony of ants

The traditional mobile radio channel has always suffered from the detrimental effects of multipath fading. The use of multiple antennae at both ends of the wireless channel has proven to be very effective in combatting fading and enhancing the channel's spectral efficiency. To exploit the benefits offered by Multi-Input Multi-Output (MIMO) systems, both the transmitter and the receiver have to be optimally designed. In this thesis, we are concerned with the problem of receiver design for MIMO systems in a spatial multiplexing scheme. The MIMO detection problem is an NP-hard combinatorial optimization problem. Solving this problem to optimality requires an exponential search over the space of all possible transmitted symbols in order to find the closest point in a Euclidean sense to the received symbols; a procedure that is infeasible for large systems. We introduce a new heuristic algorithm for the detection of a MIMO wireless system based on the Ant Colony Optimization (ACO) metaheuristic. The new algorithm, AntMIMO, has a simple architecture and achieves near maximum likelihood performance in polynomial time

Anwendung von maschinellem Lernen in der optischen Nachrichtenübertragungstechnik

Aufgrund des zunehmenden Datenverkehrs wird erwartet, dass die optischen Netze zukünftig mit höheren Systemkapazitäten betrieben werden. Dazu wird bspw. die kohärente Übertragung eingesetzt, bei der das Modulationsformat erhöht werden kann, erforder jedoch ein größeres SNR. Um dies zu erreichen, wird die optische Signalleistung erhöht, wodurch die Datenübertragung durch die nichtlinearen Beeinträchtigungen gestört wird. Der Schwerpunkt dieser Arbeit liegt auf der Entwicklung von Modellen des maschinellen Lernens, die auf diese nichtlineare Signalverschlechterung reagieren. Es wird die Support-Vector-Machine (SVM) implementiert und als klassifizierende Entscheidungsmaschine verwendet. Die Ergebnisse zeigen, dass die SVM eine verbesserte Kompensation sowohl der nichtlinearen Fasereffekte als auch der Verzerrungen der optischen Systemkomponenten ermöglicht. Das Prinzip von EONs bietet eine Technologie zur effizienten Nutzung der verfügbaren Ressourcen, die von der optischen Faser bereitgestellt werden. Ein Schlüsselelement der Technologie ist der bandbreitenvariable Transponder, der bspw. die Anpassung des Modulationsformats oder des Codierungsschemas an die aktuellen Verbindungsbedingungen ermöglicht. Um eine optimale Ressourcenauslastung zu gewährleisten wird der Einsatz von Algorithmen des Reinforcement Learnings untersucht. Die Ergebnisse zeigen, dass der RL-Algorithmus in der Lage ist, sich an unbekannte Link-Bedingungen anzupassen, während vergleichbare heuristische Ansätze wie der genetische Algorithmus für jedes Szenario neu trainiert werden müssen