Signal Processing and Learning for Next Generation Multiple Access in 6G

Wireless communication systems to date primarily rely on the orthogonality of resources to facilitate the design and implementation, from user access to data transmission. Emerging applications and scenarios in the sixth generation (6G) wireless systems will require massive connectivity and transmission of a deluge of data, which calls for more flexibility in the design concept that goes beyond orthogonality. Furthermore, recent advances in signal processing and learning have attracted considerable attention, as they provide promising approaches to various complex and previously intractable problems of signal processing in many fields. This article provides an overview of research efforts to date in the field of signal processing and learning for next-generation multiple access, with an emphasis on massive random access and non-orthogonal multiple access. The promising interplay with new technologies and the challenges in learning-based NGMA are discussed

Joint precoding and antenna selection in massive mimo systems

This thesis presents an overview of massive multiple-input multiple-output (MIMO) systems and proposes new algorithms to jointly precode and select the antennas. Massive MIMO is a new technology, which is candidate for comprising the fifth-generation (5G) of mobile cellular systems. This technology employs a huge amount of antennas at the base station and can reach high data rates under favorable, or asymptotically favorable, propagation conditions, while using simple linear processing. However, massive MIMO systems have some drawbacks, such as the high cost related to the base stations. A way to deal with this issue is to employ antenna selection algorithms at the base stations. These algorithms reduce the number of active antennas, decreasing the deployment and maintenance costs related to the base stations. Moreover, this thesis also describes a class of nonlinear precoders that are rarely addressed in the literature; these techniques are able to generate precoded sparse signals in order to achieve joint precoding and antenna selection. This thesis proposes two precoders belonging to this class, where the number of selected antennas is controlled by a design parameter. Simulation results show that the proposed precoders reach a lower bit-error rate than the classical antenna selection algorithms. Furthermore, simulation results show that the proposed precoders present a linear relation between the aforementioned design parameter that controls the signals’ sparsity and the number of selected antennas. Such relation is invariant to the number of base station’s antennas and the number of terminals served by this base station.Esta dissertação apresenta uma visão geral sobre MIMO (do termo em inglês, multiple-input multiple-output) massivo e propõe novos algoritmos que permitem a pré-codificacão de sinais e a seleção de antenas de forma simultânea. MIMO massivo é uma nova tecnologia candidata para compor a quinta geração (5G) dos sistemas celulares. Essa tecnologia utiliza uma quantidade muito grande de antenas na estação-base e, sob condições de propagação favorável ou assintoticamente favorável, pode alcançar taxas de transmissão elevadas, ainda que utilizando um simples processamento linear. Entretanto, os sistemas MIMO massivo apresentam algumas desvantagens, como por exemplo, o alto custo de implementação das estações-bases. Uma maneira de lidar com esse problema é utilizar algoritmos de seleção de antenas na estação-base. Com esses algoritmos é possível reduzir o número de antenas ativas e consequentemente reduzir o custo nas estações-bases. Essa dissertação também apresenta uma classe pouco estudada de pré-codificadores não-lineares que buscam sinais pré-codificados esparsos para realizar a seleção de antenas conjuntamente com a pré-codificação. Além disso, este trabalho propõem dois novos pré-codificadores pertencentes a essa classe, para os quais o número de antenas selecionadas é controlado por um parâmetro de projeto. Resultados de simulações mostram que os pré-codificadores propostos conseguem uma BER (do termo em inglês, bit-error rate) menor que os algoritmos clássicos usados para selecionar antenas. Além disso, resultados de simulações mostram que os pré-codificadores propostos apresentam uma relação linear com o parâmetro de projeto que controla a quantidade de antenas selecionadas; tal relação independe do número de antenas na estação-base e do número de terminais servidos por essa estação

A survey on 5G massive MIMO Localization

Massive antenna arrays can be used to meet the requirements of 5G, by exploiting different spatial signatures of users. This same property can also be harnessed to determine the locations of those users. In order to perform massive MIMO localization, refined channel estimation routines and localization methods have been developed. This paper provides a brief overview of this emerging field

Two-phase Unsourced Random Access in Massive MIMO: Performance Analysis and Approximate Message Passing Decoder

In this paper, we design a novel two-phase unsourced random access (URA) scheme in massive multiple input multiple output (MIMO). In the first phase, we collect a sequence of information bits to jointly acquire the user channel state information (CSI) and the associated information bits. In the second phase, the residual information bits of all the users are partitioned into sub-blocks with a very short length to exhibit a higher spectral efficiency and a lower computational complexity than the existing transmission schemes in massive MIMO URA. By using the acquired CSI in the first phase, the sub-block recovery in the second phase is cast as a compressed sensing (CS) problem. From the perspective of the statistical physics, we provide a theoretical framework for our proposed URA scheme to analyze the induced problem based on the replica method. The analytical results show that the performance metrics of our URA scheme can be linked to the system parameters by a single-valued free entropy function. An AMP-based recovery algorithm is designed to achieve the performance indicated by the proposed theoretical framework. Simulations verify that our scheme outperforms the most recent counterparts.Comment: 16pages,7 figure