arXiv subjects

Elisabeth de Carvalho

Publications and source records attributed to Elisabeth de Carvalho.

46 records · Page 3Linked to original sources

arXiv2016

Coded Pilot Access: A Random Access Solution for Massive MIMO Systems

We present a novel access protocol for crowd scenarios in massive MIMO (Multiple-input multiple-output) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereby orthogonal scheduling is infeasible. In such scenarios, random access is a natural choice. The proposed access protocol relies on two essential properties of a massive MIMO system, namely asymptotic orthogonality between user channels and asymptotic invariance of channel powers. Signal processing techniques that take advantage of these properties allow us to view a set of contaminated pilot signals as a graph code on which iterative belief propagation can be performed. This makes it possible to decontaminate pilot signals and increase the throughput of the system. Numerical evaluations show that the proposed access protocol increases the throughput with 36%, when having 400 antennas at the base station, compared to the conventional method of slotted ALOHA. With 1024 antennas, the throughput is increased by 85%.

cs.IT↗

arXiv2016

Full Duplex Emulation via Spatial Separation of Half Duplex Nodes in a Planar Cellular Network

A Full Duplex Base Station (FD-BS) can be used to serve simultaneously two Half-Duplex (HD) Mobile Stations (MSs), one working in the uplink and one in the downlink, respectively. The same functionality can be realized by having two interconnected and spatially separated Half Duplex Base Stations (HD-BSs), which is a scheme termed \emph{CoMPflex} (CoMP for In-Band Wireless Full Duplex). A FD-BS can be seen as a special case of CoMPflex with separation distance zero. In this paper we study the performance of CoMPflex in a two-dimensional cellular scenario using stochastic geometry and compare it to the one achieved by FD-BSs. By deriving the Cumulative Distribution Functions, we show that CoMPflex brings BSs closer to the MSs they are serving, while increasing the distance between a MS and interfering MSs. Furthermore, the results show that CoMPflex brings benefits over FD-BS in terms of communication reliability. Following the trend of wireless network densification, CoMPflex can be regarded as a method with a great potential to effectively use the dense HD deployments.

cs.IT↗

arXiv2016

Random Access Protocol for Massive MIMO: Strongest-User Collision Resolution (SUCR)

Wireless networks with many antennas at the base stations and multiplexing of many users, known as Massive MIMO systems, are key to handle the rapid growth of data traffic. As the number of users increases, the random access in contemporary networks will be flooded by user collisions. In this paper, we propose a reengineered random access protocol, coined strongest-user collision resolution (SUCR). It exploits the channel hardening feature of Massive MIMO channels to enable each user to detect collisions, determine how strong the contenders' channels are, and only keep transmitting if it has the strongest channel gain. The proposed SUCR protocol can quickly and distributively resolve the vast majority of all pilot collisions.

cs.IT↗

arXiv2015

CoMPflex: CoMP for In-Band Wireless Full Duplex

In this letter we consider emulation of a Full Duplex (FD) cellular base station (BS) by using two spatially separated and coordinated half duplex (HD) BSs. The proposed system is termed CoMPflex (CoMP for In-Band Wireless Full Duplex) and at a given instant it serves two HD mobile stations (MSs), one in the uplink and one in the downlink, respectively. We evaluate the performance of our scheme by using a geometric extension of the one-dimensional Wyner model, which takes into account the distances between the devices. The results show that CoMPflex leads to gains in terms of sum-rate and energy efficiency with respect to the ordinary FD, as well as with respect to a baseline scheme based on unidirectional traffic.

cs.NI↗

arXiv2015

Pilot Decontamination Through Pilot Sequence Hopping in Massive MIMO Systems

This work concerns wireless cellular networks applying massive multiple-input multiple-output (MIMO) technology. In such a system, the base station in a given cell is equipped with a very large number (hundreds or even thousands) of antennas and serves multiple users. Estimation of the channel from the base station to each user is performed at the base station using an uplink pilot sequence. Such a channel estimation procedure suffers from pilot contamination. Orthogonal pilot sequences are used in a given cell but, due to the shortage of orthogonal sequences, the same pilot sequences must be reused in neighboring cells, causing pilot contamination. The solution presented in this paper suppresses pilot contamination, without the need for coordination among cells. Pilot sequence hopping is performed at each transmission slot, which provides a randomization of the pilot contamination. Using a modified Kalman filter, it is shown that such randomized contamination can be significantly suppressed. Comparisons with conventional estimation methods show that the mean squared error can be lowered as much as an order of magnitude at low mobility.

cs.IT↗

arXiv2015

Massive MIMO for Crowd Scenarios: A Solution Based on Random Access

This paper presents a new approach to intra-cell pilot contamination in crowded massive MIMO scenarios. The approach relies on two essential properties of a massive MIMO system, namely near-orthogonality between user channels and near-stability of channel powers. Signal processing techniques that take advantage of these properties allow us to view a set of contaminated pilot signals as a graph code on which iterative belief propagation can be performed. This makes it possible to decontaminate pilot signals and increase the throughput of the system. The proposed solution exhibits high performance with large improvements over the conventional method. The improvements come at the price of an increased error rate, although this effect is shown to decrease significantly for increasing number of antennas at the base station.

cs.IT↗

arXiv2014

Using Wireless Network Coding to Replace a Wired with Wireless Backhaul

Cellular networks are evolving towards dense deployment of small cells. This in turn demands flexible and efficient backhauling solutions. A viable solution that reuses the same spectrum is wireless backhaul where the Small Base Station (SBS) acts as a relay. In this paper we consider a reference system that uses wired backhaul and each Mobile Station (MS) in the small cell has its uplink and downlink rates defined. The central question is: if we remove the wired backhaul, how much extra power should the wireless backhaul use in order to support the same uplink/downlink rates? We introduce the idea of wireless-emulated wire (WEW), based on two-way relaying and network coding. Furthermore, in a scenario where two SBSs are served simultaneously, WEW gives rise to new communication strategies, partially inspired by the private/public messages from the Han-Kobayashi scheme for interference channel. We formulate and solve the associated optimization problems. The proposed approach provides a convincing argument that two-way communication is the proper context to design and optimize wireless backhauling solutions.

cs.IT↗

arXiv2012

Transmission Schemes for Four-Way Relaying in Wireless Cellular Systems

Two-way relaying in wireless systems has initiated a large research effort during the past few years. While one-way relay with a single data flow introduces loss in spectral efficiency due to its half-duplex operation, two-way relaying based on wireless network coding regains part of this loss by simultaneously processing the two data flows. In a broader perspective, the two-way traffic pattern is rather limited and it is of interest to investigate other traffic patterns where such a simultaneous processing of information flows can bring performance advantage. In this paper we consider a scenario beyond the usual two-way relaying: a four-way relaying, where each of the two Mobile Stations (MSs) has a two-way connection to the same Base Station (BS), while each connection is through a dedicated Relay Station (RS). While both RSs are in the range of the same BS, they are assumed to have antipodal positions within the cell, such that they do not interfere with each other. We introduce and analyze a two-phase transmission scheme to serve the four-way traffic pattern defined in this scenario. Each phase consists of combined broadcast and multiple access. We analyze the achievable rate region of the new schemes for two different operational models for the RS, Decode-and-Forward (DF) and Amplify-and-Forward (AF), respectively. We compare the performance with a state-of-the-art reference scheme, time sharing is used between the two MSs, while each MS is served through a two-way relaying scheme. The results indicate that, when the RS operates in a DF mode, the achievable rate regions are significantly enlarged. On the other hand, for AF relaying, the gains are rather modest. The practical implication of the presented work is a novel insight on how to improve the spatial reuse in wireless cellular networks by coordinating the transmissions of the antipodal relays.

cs.IT↗

arXiv2012

Sum-Rate Optimization in a Two-Way Relay Network with Buffering

A Relay Station (RS) uses a buffer to store and process the received data packets before forwarding them. Recently, the buffer has been exploited in one-way relaying to opportunistically schedule the two different links according to their channel quality. The intuition is that, if the channel to the destination is poor, then RS stores more data from the source, in order to use it when the channel to the destination is good. We apply this intuition to the case of half-duplex two-way relaying, where the interactions among the buffers and the links become more complex. We investigate the sum-rate maximization problem in the Time Division Broadcast (TDBC): the users send signals to the RS in different time slots, the RS decodes and stores messages in the buffers. For downlink transmission, the RS re-encodes and sends using the optimal broadcast strategy. The operation in each time slot is not determined in advance, but depends on the channel state information (CSI). We derive the decision function for adaptive link selection with respect to CSI using the Karush-Kuhn-Tucker (KKT) conditions. The thresholds of the decision function are obtained under Rayleigh fading channel conditions. The numerical results show that the sum-rate of the adaptive link selection protocol with buffering is significantly larger compared to the reference protocol with fixed transmission schedule.

cs.IT↗

arXiv2010

Coordinated Transmissions to Direct and Relayed Users in Wireless Cellular Systems

The ideas of wireless network coding at the physical layer promise high throughput gains in wireless systems with relays and multi-way traffic flows. This gain can be ascribed to two principles: (1) joint transmission of multiple communication flows and (2) usage of \emph{a priori} information to cancel the interference. In this paper we use these principles to devise new transmission schemes in wireless cellular systems that feature both users served directly by the base stations (direct users) and users served through relays (relayed users). We present four different schemes for \emph{coordinated transmission} of uplink and downlink traffic in which one direct and one relayed user are served. These schemes are then used as building blocks in multi-user scenarios, where we present several schemes for scheduling pairs of users for coordinated transmissions. The optimal scheme involves exhaustive search of the best user pair in terms of overall rate. We propose several suboptimal scheduling schemes, which perform closely to the optimal scheme. The numerical results show a substantial increase in the system--level rate with respect to the systems with non--coordinated transmissions.

cs.IT↗