Cooperative Transmission for Downlink Distributed Antenna in Time Division Duplex System

Multi-user distributed antenna system (MU-DAS) systems play the essential role in improving throughput performance in wireless communications. This improvement can be achieved by exploiting the spatial domain and without the need of additional power and bandwidth. In this thesis, three main issues which are of importance to the data rate transmission have been investigated. Firstly, user clustering in MU-DAS downlink systems has been considered, where this technique can be effciently used to reduce the complexity and cost caused by radio frequency chains, associated with antennas while keeping most of the diversity advantages of the system. The proposed user clustering algorithm which can select an optimal set of antennas for transmission. The capacity achieved by the proposed algorithm is almost same as the capacity of the optimum search method, with much lower complexity. Secondly, interference alignment in MU-DAS downlink systems has been studied. The inter-cluster interference is uncoordinated and limits the system performance. The inter-cluster interference should be eliminated or minimized carefully. The interference alignment is proposed to consolidate the strong inter-cluster interference into smaller dimensions of signal space at each user and use the remaining dimensions to transmit the desired signals without any interference. The performance of single cluster is better than the proposed algorithm due to the absence of intercluster interference in the single cluster. The numerical shows that the proposed algorithm is more suitable in multi-cell DAS environment due to the presence of inter-cell interference. Finally, the impact of different user mobility on TDD downlink MUDAS has been studied. The downlink data transmission in time division duplex (TDD) systems is optimized according to the channel state information (CSI) which is obtained at the uplink time slot. However, the actual channel at downlink time slot may be different from the estimated channel due to channel variation in mobility environment. Based on mobility state information (MSI), an autocorrelation based feedback interval adjustment technique is proposed. The proposed technique adjusts the CSI update interval and mitigates the performance degradation imposed by the user mobility and the transmission delay. Cooperative clusters are formed to maximize sum rate. In order to reduce the computational complexity, a channel gain based antenna selection and signal-to-interference plus noise ratio (SINR) based user clustering are developed. A downlink ergodic capacity is derived in single user clustering. The derived analytical expressions of the downlink ergodic capacity are verified by system simulations. Numerical results show that the proposed scheme can improved sum rate over the non cooperative system and no MSI knowledge. The proposed technique has good performance for a wide range of user speed and suitable for future wireless communications systems

Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems based on Game Theory-Part I: Nash Equilibria

In this two-parts paper we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-multipoint communication system composed of a set of wideband links sharing the same physical resources, i.e., time and bandwidth. We assume, as optimality criterion, the achievement of a Nash equilibrium and consider two alternative optimization problems: 1) the competitive maximization of mutual information on each link, given constraints on the transmit power and on the spectral mask imposed by the radio spectrum regulatory bodies; and 2) the competitive maximization of the transmission rate, using finite order constellations, under the same constraints as above, plus a constraint on the average error probability. In Part I of the paper, we start by showing that the solution set of both noncooperative games is always nonempty and contains only pure strategies. Then, we prove that the optimal precoding/multiplexing scheme for both games leads to a channel diagonalizing structure, so that both matrix-valued problems can be recast in a simpler unified vector power control game, with no performance penalty. Thus, we study this simpler game and derive sufficient conditions ensuring the uniqueness of the Nash equilibrium. Interestingly, although derived under stronger constraints, incorporating for example spectral mask constraints, our uniqueness conditions have broader validity than previously known conditions. Finally, we assess the goodness of the proposed decentralized strategy by comparing its performance with the performance of a Pareto-optimal centralized scheme. To reach the Nash equilibria of the game, in Part II, we propose alternative distributed algorithms, along with their convergence conditions.Comment: Paper submitted to IEEE Transactions on Signal Processing, September 22, 2005. Revised March 14, 2007. Accepted June 5, 2007. To be published on IEEE Transactions on Signal Processing, 2007. To appear on IEEE Transactions on Signal Processing, 200

Low complexity detection for SC-FDE massive MIMO systems

Nowadays we continue to observe a big and fast growth of wireless com-munication usage due to the increasing number of access points, and fields of application of this technology. Furthermore, these new usages can require higher speed and better quality of service in order to create market. As example we can have: live 4K video transmission, M2M (Machine to Machine communication), IoT (Internet of Things), Tactile Internet, between many others. As a consequence of all these factors, the spectrum is getting overloaded with communications, increasing the interference and affecting the system's per-formance. Therefore a different path of ideas has been followed and the commu-nication process has been taken to the next level in 5G by the usage of big arrays of antennas and multi-stream communication (MIMO systems) which in a greater scale are called massive MIMO schemes. These systems can be combined with an SC-FDE (Single-Carrier Frequency Domain Equalization) scheme to im-prove the power efficiency due to the low envelope fluctuations. This thesis focused on the equalization in massive MIMO systems, more specifically in the FDE (Frequency Domain Equalization), studying the perfor-mance of different approaches, namely ZF (Zero Forcing), EGD (Equal Gain De-tector), MRD (Maximum Ratio Detector), IB-DFE (Iterative Block Decision Feed-back Equalizer) and a proposed receiver combining MRD (or EGD) and IB-DFE.With this approach we want to minimize the ICI (Inter Carrier Interference) in order to have almost independent data streams and to produce a low complexity code, so that the receiver's performance doesn't affect the total system's perfor-mance, with a final objective of increasing the data throughput in a great scale

Application of evolutionary computation techniques in emerging optimization problems in 5G and beyond wireless systems

Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia Elétrica, Florianópolis, 2021.Os sistemas comunicação sem fio 5G e além (B5G, do inglês Beyong 5G) permitirão a plena implantação de aplicações existentes, como carros autônomos, redes de sensores massivas e casas inteligentes. Para tornar essas aplicações possíveis, requisitos rigorosos, como alta eficiência espectral e ultra baixa latência de comunicação, devem ser atendidos. Para atender a esses requisitos, diferentes tecnologias-chave estão em desenvolvimento, como comunicações de Ondas Milimétricas (mmWave, do inglês Millimeter Wave) e Superfícies Refletivas Inteligentes (IRS, do inglês Intelligent Reflecting Surfaces). As comunicações mmWave têm atraído grande interesse devido ao abundante espectro de frequência disponível, ao contrário das bandas congestionadas adotadas nas redes 4G. No entanto, as bandas mmWave apresentam características de propagação desfavoráveis. Para superar tais problemas de propagação, o uso de beamforming altamente direcional é uma solução eficaz. Além disso, recentemente, uma tecnologia de baixo custo e alta eficiência energética denominada IRS, uma meta-superfície equipada com um grande número de elementos passivos de baixo custo, capaz de refletir o sinal incidente com uma dada mudança de fase/amplitude, foi desenvolvida para otimizar a capacidade da rede. Implantando densamente IRSs em redes de comunicação sem fio e coordenando seus elementos de maneira inteligente, os canais sem fio entre o transmissor e o receptor podem ser intencional e deterministicamente controlados para melhorar a qualidade do sinal no receptor. Embora essas tecnologias tenham inúmeros benefícios para o desempenho do sistema, elas apresentam muitos desafios em sua implantação. Mais especificamente, embora as bandas mmWave permitam considerar o uso de beamforming altamente direcional tanto na BS quanto no UE, isto pode representar um desafio para o processo de Acesso Inicial (IA, do inglês Initial Access) pois, uma vez que a transmissão omnidirecional não pode ser aplicada, devido ao seu baixo ganho de potência e SNR recebido, a duração geral do IA pode ser muito longa. O atraso causado pela busca direcional deve ser pequeno para atender a alguns dos requisitos das redes B5G como baixa latência de ponta-a-ponta. Além disso, apesar da capacidade das IRSs de controlar os canais sem fio, o projeto do beamforming na BS e na IRS é um problema desafiador devido à necessidade de estimar a informação de estado do canal (CSI, do inglês Channel State Information) de todos os links do sistema. No entanto, para estimar o CSI entre a IRS e a BS ou entre a IRS e o UE, cada elemento da IRS precisa ser equipado com uma cadeia de radiofrequência (RF, do inglês Radio Frequency), o que aumenta consideravelmente o custo e o consumo de energia do sistema e vai contra algumas das principais vantagens de utilizar IRSs em sistemas de comunicação sem fio. Portanto, motivados pelos problemas emergentes acima, nesta tese, pretendemos desenvolver novos métodos baseados em técnicas de Computação Evolutiva tais como, Algoritmos Genéticos (GA, do inglês Genetic Algorithm) e Otimização por Enxame de Partículas (PSO, do inglês Particle Swarm Optimization), visando resolver o problema de IA e realizar o projeto do beamforming na BS e IRS sem conhecimento prévio do CSI na BS. Os resultados obtidos nesta tese mostram que os métodos desenvolvidos podem reduzir consideravelmente o atraso e alcançar um desempenho próximo ao ótimo no problema de projeto do beamforming na BS e IRS com sobrecarga de treinamento reduzida.Abstract: Beyond 5G (B5G) wireless systems will enable the deployment of demanding applications such as autonomous cars, massive sensor networks, and smart homes. To make these applications possible, stringent requirements such as improved spectrum efficiency and low communication latency must be fulfilled. In order to meet these requirements, different key technologies are in development such as millimeter Wave (mmWave) communications and Intelligent Reflecting Surfaces (IRS). The mmWave communications have attracted great interest due to the abundant available spectrum, unlike the congested bands adopted in the 4G networks. However, the mmWave bands present poor propagation characteristics. To overcome these propagation issues, the use of highly directional beamforming is an effective solution. In addition, recently, an energy-efficient and low-cost technology named IRS, which is a meta-surface equipped with a large number of low-cost passive elements, capable of reflecting the incident signal with a given phase/amplitude shift, was developed to increase the network capacity. By densely deploying IRSs in wireless communication networks and intelligently coordinating their elements, the wireless channels between the transmitter and receiver can be intentionally and deterministically controlled to improve the signal quality at the receiver. Although these technologies have uncountable benefits for the system performance, they present many challenges in their deployment. More specifically, although the mmWave bands allow to consider highly directional beamforming at the BS and UE, this can be challenging for the Initial Access (IA) process. Since omnidirectional transmission may not be applied, due to its low power gain and received SNR, the overall duration of IA can be very long. The delay caused by directional search must be small to meet some of the B5G requirements for low end-to-end latency. Moreover, despite the capacity of controlling the wireless channels of the IRSs, designing the beamforming at the BS and at the IRS is a challenging problem due to the necessity of estimating the channel state information (CSI) of all system links. However, to estimate the CSI between IRS and BS or between IRS and UE, each element of the IRS needs to be equipped with one radio-frequency (RF) chain which greatly increases the cost and energy consumption of the system and goes against some of the original advantages of using an IRS. Therefore, motivated by the above emerging problems, in this thesis, we intend to develop new methods based on Evolutionary Computation techniques, i.e., Genetic Algorithms (GA) and Particle Swarm Optimization (PSO), to solve the IA problem and to design the beamforming at the BS and IRS without CSI. Results show that the developed methods can reduce the IA delay and achieve a close-to-optimal performance in the IRS beamforming problem with reduced training overhead