Searcharxiv⌕ Search

arXiv subjects

Elisabeth de Carvalho

Publications and source records attributed to Elisabeth de Carvalho.

At least 37 records · Page 2Linked to original sources

Deep Learning Based Spatial User Mapping on Extra Large MIMO Arrays

In an extra-large scale MIMO (XL-MIMO) system, the antenna arrays have a large physical size that goes beyond the dimensions in traditional MIMO systems. Because of this large dimensionality, the optimization of an XL-MIMO system leads to solutions with prohibitive complexity when relying on conventional optimization tools. In this paper, we propose a design based on machine learning for the downlink of a multi-user setting with linear pre-processing, where the goal is to select a limited mapping area per user, i.e. a small portion of the array that contains the beamforming energy to the user. We refer to this selection as spatial user mapping (SUM). Our solution relies on learning using deep convolutional neural networks with a distributed architecture that is built to manage the large system dimension. This architecture contains one network per user where all the networks work in parallel and exploit specific non-stationary properties of the channels along the array. Our results show that, once the parallel networks are trained, they provide the optimal SUM solution in more than $80\%$ of the instances, resulting in a negligible sum-rate loss compared to a system using the optimal SUM solution while providing an insightful approach to rethink these kinds of problems that have no closed-form solution.

eess.SP↗

Low-Complexity Distributed XL-MIMO for Multiuser Detection

In this paper, the zero-forcing and regularized zero-forcing schemes operating in crowded extra-large MIMO (XL-MIMO) scenarios with a fixed number of subarrays have been emulated using the randomized Kaczmarz algorithm (rKA). For that, non-stationary properties have been deployed through the concept of visibility regions when considering two different power normalization methods of non-stationary channels. We address the randomness design of rKA based on the exploitation of spatial non-stationary properties. Numerical results show that, in general, the proposed rKA-based combiner applicable to XL-MIMO systems can considerably decrease computational complexity of the signal detector by paying with small performance losses.

eess.SP↗

Achieving Fair Random Access Performance in Massive MIMO Crowded Machine-Type Networks

The use of massive multiple-input multiple-output (MIMO) to serve a crowd of user equipments (UEs) is challenged by the deficit of pilots. Assuming that the UEs are intermittently active, this problem can be addressed by a shared access to the pilots and a suitable random access (RA) protocol. The strongest-user collision resolution (SUCRe) is a previously proposed RA protocol that often privileges the UEs closer to the base station (BS). In contrast, we propose a novel RA protocol using a decentralized pilot power allocation method that aims at a fairer performance. The proposed access class barring with power control (ACBPC) protocol allows each UE to estimate, without additional overhead, how many UEs collided for the chosen pilot and calculate an ACB factor, which is then used to determine the pilot retransmission probability in the next protocol step. The results show that the proposed ACBPC protocol is superior to SUCRe in terms of providing a fair connectivity for very crowded networks, although still being distributed and uncoordinated as the original SUCRe protocol.

eess.SP↗

A Message Passing Based Receiver for Extra-Large Scale MIMO

We consider a massive MIMO system where the array at the access point reaches a dimension that is much larger than the array in current systems. Transitioning to an extremely large dimension and hence large number of antennas implies a need to scale up the multi-antenna processing while maintaining a reasonable computational complexity. In this paper, we study the receiver of such an extra-large scale MIMO (XL-MIMO) system. We propose to base the reception on Variational Message Passing (VMP). The motivation is that the complexity of VMP scales (almost) linearly with the number of antennas and number of users, hence enabling low-complexity reception in crowd scenarios. Furthermore, VMP adapts to the non-stationarities of the MIMO channel that appear due to the large dimension of the array. Through numerical results, we show significant performance improvement and computational complexity reduction compared to a zero-forcing receiver.

eess.SP↗

Massive MIMO for Internet of Things (IoT) Connectivity

Massive MIMO is considered to be one of the key technologies in the emerging 5G systems, but also a concept applicable to other wireless systems. Exploiting the large number of degrees of freedom (DoFs) of massive MIMO essential for achieving high spectral efficiency, high data rates and extreme spatial multiplexing of densely distributed users. On the one hand, the benefits of applying massive MIMO for broadband communication are well known and there has been a large body of research on designing communication schemes to support high rates. On the other hand, using massive MIMO for Internet-of-Things (IoT) is still a developing topic, as IoT connectivity has requirements and constraints that are significantly different from the broadband connections. In this paper we investigate the applicability of massive MIMO to IoT connectivity. Specifically, we treat the two generic types of IoT connections envisioned in 5G: massive machine-type communication (mMTC) and ultra-reliable low-latency communication (URLLC). This paper fills this important gap by identifying the opportunities and challenges in exploiting massive MIMO for IoT connectivity. We provide insights into the trade-offs that emerge when massive MIMO is applied to mMTC or URLLC and present a number of suitable communication schemes. The discussion continues to the questions of network slicing of the wireless resources and the use of massive MIMO to simultaneously support IoT connections with very heterogeneous requirements. The main conclusion is that massive MIMO can bring benefits to the scenarios with IoT connectivity, but it requires tight integration of the physical-layer techniques with the protocol design.

cs.IT↗

Linear Receivers in Non-stationary Massive MIMO Channels with Visibility Regions

In a massive MIMO system with large arrays, the channel becomes spatially non-stationary. We study the impact of spatial non-stationarity characterized by visibility regions (VRs) where the channel energy is significant on a portion of the array. Relying on a channel model based on VRs, we provide expressions of the signal-to-interference-plus-noise ratio (SINR) of conjugate beamforming (CB) and zero-forcing (ZF) precoders. We also provide an approximate deterministic equivalent of the SINR of ZF precoders. We identify favorable and unfavorable multi-user configurations of the VRs and compare the performance of both stationary and non-stationary channels through analysis and numerical simulations.

eess.SP↗

Wireless Access in Ultra-Reliable Low-Latency Communication (URLLC)

The future connectivity landscape and, notably, the 5G wireless systems will feature Ultra-Reliable Low Latency Communication (URLLC). The coupling of high reliability and low latency requirements in URLLC use cases makes the wireless access design very challenging, in terms of both the protocol design and of the associated transmission techniques. This paper aims to provide a broad perspective on the fundamental tradeoffs in URLLC as well as the principles used in building access protocols. Two specific technologies are considered in the context of URLLC: massive MIMO and multi-connectivity, also termed interface diversity. The paper also touches upon the important question of the proper statistical methodology for designing and assessing extremely high reliability levels.

cs.IT↗

Extremely Large Aperture Massive MIMO: Low Complexity Receiver Architectures

This paper focuses on new communication paradigms arising in massive multiple-input-multiple-output systems where the antenna array at the base station is of extremely large dimension (xMaMIMO). Due to the extreme dimension of the array, xMaMIMO is characterized by spatial non-stationary field properties along the array; this calls for a multi-antenna transceiver design that is adapted to the array dimension but also its non-stationary properties. We address implementation aspects of xMaMIMO, with computational efficiency as our primary objective. To reduce the computational burden of centralized schemes, we distribute the processing into smaller, disjoint subarrays. Then, we consider several low-complexity data detection algorithms as candidates for uplink communication in crowded xMaMIMO systems. Drawing inspiration from coded random access, one of the main contributions of the paper is the design of low complexity scheme that exploits the non-stationary nature of xMaMIMO systems and where the data processing is decentralized. We evaluate the bit-error-rate performance of the transceivers in crowded xMaMIMO scenarios. The results confirm their practical potential.

eess.SP↗

Towards Massive Connectivity Support for Scalable mMTC Communications in 5G networks

The fifth generation of cellular communication systems is foreseen to enable a multitude of new applications and use cases with very different requirements. A new 5G multiservice air interface needs to enhance broadband performance as well as provide new levels of reliability, latency and supported number of users. In this paper we focus on the massive Machine Type Communications (mMTC) service within a multi-service air interface. Specifically, we present an overview of different physical and medium access techniques to address the problem of a massive number of access attempts in mMTC and discuss the protocol performance of these solutions in a common evaluation framework.

cs.IT↗

Massive MIMO for Ultra-reliable Communications with Constellations for Dual Coherent-noncoherent Detection

The stringent requirements of ultra-reliable low-latency communications (URLLC) require rethinking of the physical layer transmission techniques. Massive antenna arrays are seen as an enabler of the emerging $5^\text{th}$ generation systems, due to increases in spectral efficiency and degrees of freedom for transmissions, which can greatly improve reliability under demanding latency requirements. Massive array coherent processing relies on accurate channel state information (CSI) in order to achieve high reliability. In this paper, we investigate the impact of imperfect CSI in a single-input multiple-output (SIMO) system on the coherent receiver. An amplitude-phase keying (APK) symbol constellation is proposed, where each two symmetric symbols reside on distinct power levels. The symbols are demodulated using a dual-stage non-coherent and coherent detection strategy, in order to improve symbol reliability. By means of analysis and simulation, we find an adequate scaling of the constellation and show that for high signal-to-noise ratio (SNR) and inaccurate CSI regime, the proposed scheme enhances receiver performance.

cs.IT↗

Short Packet Structure for Ultra-Reliable Machine-type Communication: Tradeoff between Detection and Decoding

Machine-type communication requires rethinking of the structure of short packets due to the coding limitations and the significant role of the control information. In ultra-reliable low-latency communication (URLLC), it is crucial to optimally use the limited degrees of freedom (DoFs) to send data and control information. We consider a URLLC model for short packet transmission with acknowledgement (ACK). We compare the detection/decoding performance of two short packet structures: (1) time-multiplexed detection sequence and data; and (2) structure in which both packet detection and data decoding use all DoFs. Specifically, as an instance of the second structure we use superimposed sequences for detection and data. We derive the probabilities of false alarm and misdetection for an AWGN channel and numerically minimize the packet error probability (PER), showing that for delay-constrained data and ACK exchange, there is a tradeoff between the resources spent for detection and decoding. We show that the optimal PER for the superimposed structure is achieved for higher detection overhead. For this reason, the PER is also higher than in the preamble case. However, the superimposed structure is advantageous due to its flexibility to achieve optimal operation without the need to use multiple codebooks.

cs.IT↗

Wireless Access for Ultra-Reliable Low-Latency Communication (URLLC): Principles and Building Blocks

Ultra-reliable low latency communication (URLLC) is an important new feature brought by 5G, with a potential to support a vast set of applications that rely on mission-critical links. In this article, we first discuss the principles for supporting URLLC from the perspective of the traditional assumptions and models applied in communication/information theory. We then discuss how these principles are applied in various elements of the system design, such as use of various diversity sources, design of packets and access protocols. The important messages are that there is a need to optimize the transmission of signaling information, as well as a need for a lean use of various sources of diversity.

cs.IT↗

Cramér-Rao Bounds for Blind Multichannel Estimation

In some estimation problems, not all the parameters can be identified, which results in singularity of the Fisher Information Matrix (FIM). The Cramér-Rao Bound (CRB), which is the inverse of the FIM, is then not defined. To regularize the estimation problem, one can impose constraints on the parameters and derive the corresponding CRBs. The correspondence between local identifiability and FIM regularity is studied here. Furthermore the number of FIM singularities is shown to be equal to the number of independent constraints necessary to have a well-defined constrained CRB and local identifiability. In general, many sets of constraints can render the parameters identifiable, giving different values for the CRB, that are not always relevant. When the constraints can be chosen, we propose a constrained CRB, the pseudo-inverse of the FIM, which gives, for a minimum number of constraints, the lowest bound on the mean squared estimation error. These results are applied to two approaches to blind FIR multichannel estimation which allow identification of the channel up to a scale or phase factor. These two approaches correspond to deterministic and Gaussian models for the unknown channel inputs. The singularities of the FIMs and local identifiability are studied and the corresponding constrained CRBs are derived and interpreted.

cs.IT↗

Random Pilot and Data Access in Massive MIMO for Machine-type Communications

A massive MIMO system, represented by a base station with hundreds of antennas, is capable of spatially multiplexing many devices and thus naturally suited to serve dense crowds of wireless devices in emerging applications, such as machine-type communications. Crowd scenarios pose new challenges in the pilot-based acquisition of channel state information and call for pilot access protocols that match the intermittent pattern of device activity. A joint pilot assignment and data transmission protocol based on random access is proposed in this paper for the uplink of a massive MIMO system. The protocol relies on the averaging across multiple transmission slots of the pilot collision events that result from the random access process. We derive new uplink sum rate expressions that take pilot collisions, intermittent device activity, and interference into account. Simplified bounds are obtained and used to optimize the device activation probability and pilot length. A performance analysis indicates how performance scales as a function of the number of antennas and the transmission slot duration.

cs.IT↗

Random Access Protocols for Massive MIMO

5G wireless networks are expected to support new services with stringent requirements on data rates, latency and reliability. One novel feature is the ability to serve a dense crowd of devices, calling for radically new ways of accessing the network. This is the case in machine-type communications, but also in urban environments and hotspots. In those use cases, the high number of devices and the relatively short channel coherence interval do not allow per-device allocation of orthogonal pilot sequences. This article motivates the need for random access by the devices to pilot sequences used for channel estimation, and shows that Massive MIMO is a main enabler to achieve fast access with high data rates, and delay-tolerant access with different data rate levels. Three pilot access protocols along with data transmission protocols are described, fulfilling different requirements of 5G services.

cs.IT↗

A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems

The Massive MIMO (multiple-input multiple-output) technology has great potential to manage the rapid growth of wireless data traffic. Massive MIMO achieves tremendous spectral efficiency by spatial multiplexing of many tens of user equipments (UEs). These gains are only achieved in practice if many more UEs can connect efficiently to the network than today. As the number of UEs increases, while each UE intermittently accesses the network, the random access functionality becomes essential to share the limited number of pilots among the UEs. In this paper, we revisit the random access problem in the Massive MIMO context and develop a reengineered protocol, termed strongest-user collision resolution (SUCRe). An accessing UE asks for a dedicated pilot by sending an uncoordinated random access pilot, with a risk that other UEs send the same pilot. The favorable propagation of Massive MIMO channels is utilized to enable distributed collision detection at each UE, thereby determining the strength of the contenders' signals and deciding to repeat the pilot if the UE judges that its signal at the receiver is the strongest. The SUCRe protocol resolves the vast majority of all pilot collisions in crowded urban scenarios and continues to admit UEs efficiently in overloaded networks.

cs.IT↗

Performance Limits of Energy Detection Systems with Massive Receiver Arrays

Energy detection (ED) is an attractive technique for symbol detection at receivers equipped with a large number of antennas, for example in millimeter wave communication systems. This paper investigates the performance bounds of ED with pulse amplitude modulation (PAM) in large antenna arrays under single stream transmission and fast fading assumptions. The analysis leverages information-theoretic tools and semi-numerical approach to provide bounds on the information rate, which are shown to be tight in the low and high signal-to-noise ratio (SNR) regimes, respectively. For a fixed constellation size, the impact of the number of antennas and SNR on the achievable information rate is investigated. Based on the results, heuristics are provided for the choice of the cardinality of the adaptive modulation scheme as a function of the SNR and the number of antennas.

cs.IT↗

Random Access for Massive MIMO Systems with Intra-Cell Pilot Contamination

Massive MIMO systems, where the base stations are equipped with hundreds of antenna elements, are an attractive way to attain unprecedented spectral efficiency in future wireless networks. In the "classical" massive MIMO setting, the terminals are assumed fully loaded and a main impairment to the performance comes from the inter-cell pilot contamination, i.e., interference from terminals in neighboring cells using the same pilots as in the home cell. However, when the terminals are active intermittently, it is viable to avoid inter-cell contamination by pre-allocation of pilots, while same-cell terminals use random access to select the allocated pilot sequences. This leads to the problem of intra-cell pilot contamination. We propose a framework for random access in massive MIMO networks and derive new uplink sum rate expressions that take intra-cell pilot collisions, intermittent terminal activity, and interference into account. We use these expressions to optimize the terminal activation probability and pilot length.

cs.IT↗