arXiv subjects

Haralabos Papadopoulos

Publications and source records attributed to Haralabos Papadopoulos.

13 recordsLinked to original sources

arXiv2018

On-the-fly Large-scale Channel-Gain Estimation for Massive Antenna-Array Base Stations

We propose a novel scheme for estimating the large-scale gains of the channels between user terminals (UTs) and base stations (BSs) in a cellular system. The scheme leverages TDD operation, uplink (UL) training by means of properly designed non-orthogonal pilot codes, and massive antenna arrays at the BSs. Subject to Q resource elements allocated for UL training and using the new scheme, a BS is able to estimate the large-scale channel gains of K users transmitting UL pilots in its cell and in nearby cells, provided K<=Q^2. Such knowledge of the large-scale channel gains of nearby out-of-cells users can be exploited at the BS to mitigate interference to the out-of-cell users that experience the highest levels of interference from the BS. We investigate the large-scale gain estimation performance provided by a variety of non-orthogonal pilot codebook designs. Our simulations suggest that among all the code designs considered, Grassmannian line-packing type codes yield the best large-scale channel gain estimation performance.

cs.IT↗

arXiv2018

On-the-fly Uplink Training and Pilot Code Sequence Design for Cellular Networks

Cellular networks of massive MIMO base-stations employing TDD/OFDM and relying on uplink training for both downlink and uplink transmission are viewed as an attractive candidate for 5G deployments, as they promise high area spectral and energy efficiencies with relatively simple low-latency operation. We investigate the use of non-orthogonal uplink pilot designs as a means for improving the area spectral efficiency in the downlink of such massive MIMO cellular networks. We develop a class of pilot designs that are locally orthogonal within each cell, while maintaining low inner-product properties between codes in different cells. Using channel estimates provided by observations on these codes, each cell independently serves its locally active users with MU-MIMO transmission that is also designed to mitigate interference to a subset of `strongly interfered' out-of-cell users. As our simulation-based analysis shows, such cellular operation based on the proposed codes yields user-rate CDF improvement with respect to conventional operation, which can be exploited to improve cell and/or cell-throughput performance.

cs.IT↗

arXiv2018

A Graph Theoretic Approach for Training Overhead Reduction in FDD Massive MIMO Systems

The overheads associated with feedback-based channel acquisition can greatly compromise the achievable rates of FDD based massive MIMO systems. Indeed, downlink (DL) training and uplink (UL) feedback overheads scale linearly with the number of base station (BS) antennas, in sharp contrast to TDD-based massive MIMO, where a single UL pilot trains the whole BS array. In this work, we propose a graph-theoretic approach to reducing DL training and UL feedback overheads in FDD massive MIMO systems. In particular, we consider a single-cell scenario involving a single BS with a massive antenna array serving to single-antenna mobile stations (MSs) in the DL. We assume the BS employs two-stage beamforming in the DL, comprising DFT pre-beamforming followed by MU-MIMO precoding. The proposed graph-theoretic approach exploits knowledge of the angular spectra of the BS-MS channels to construct DL training protocols with reduced overheads. Simulation results reveal that the proposed training-resources allocation method can provide approximately 35% sum-rate performance gain compared to conventional orthogonal training. Our analysis also sheds light into the impact of overhead reduction on channel estimation quality, and, in turn, achievable rates.

cs.IT↗

arXiv2018

Predicting Wireless Channel Features using Neural Networks

We investigate the viability of using machine-learning techniques for estimating user-channel features at a large-array base station (BS). In the scenario we consider, user-pilot broadcasts are observed and processed by the BS to extract angle-of-arrival (AoA) specific information about propagation-channel features, such as received signal strength and relative path delay. The problem of interest involves using this information to predict the angle-of-departure (AoD) of the dominant propagation paths in the user channels, i.e., channel features not directly observable at the BS. To accomplish this task, the data collected in the same propagation environment are used to train neural networks. Our studies rely on ray-tracing channel data that have been calibrated against measurements from Shinjuku Square, a famous hotspot in Tokyo, Japan. We demonstrate that the observed features at the BS side are correlated with the angular features at the user side. We train neural networks that exploit different combinations of measured features at the BS to infer the unknown parameters at the users. The evaluation based on standard statistical performance metrics suggests that such data-driven methods have the potential to predict unobserved channel features from observed ones.

eess.SP↗

arXiv2018

Efficient C-RAN Random Access for IoT Devices: Learning Links via Recommendation Systems

We focus on C-RAN random access protocols for IoT devices that yield low-latency high-rate active-device detection in dense networks of large-array remote radio heads. In this context, we study the problem of learning the strengths of links between detected devices and network sites. In particular, we develop recommendation-system inspired algorithms, which exploit random-access observations collected across the network to classify links between active devices and network sites across the network. Our simulations and analysis reveal the potential merit of data-driven schemes for such on-the-fly link classification and subsequent resource allocation across a wide-area network.

cs.IT↗

arXiv2017

SINR-Threshold Scheduling with Binary Power Control for D2D Networks

In this paper, we consider a device-to-device communication network in which $K$ transmitter-receiver pairs are sharing spectrum with each other. We propose a novel but simple binary scheduling scheme for this network to maximize the average sum rate of the pairs. According to the scheme, each receiver predicts its Signal-to-Interference-plus-Noise Ratio (SINR), assuming \emph{all} other user pairs are active, and compares it to a preassigned threshold to decide whether its corresponding transmitter to be activated or not. For our proposed scheme, the optimal threshold that maximizes the expected sum rate is obtained analytically for the two user-pair case and empirically in the general $K$ user-pair case. Simulation results reveal that our proposed SINR-threshold scheduling scheme outperforms ITLinQ \cite{navid}, FlashLinQ \cite{flash} and the method presented in \cite{G} in terms of the expected sum rate (network throughput). In addition, the computational complexity of the proposed scheme is $O(K)$, outperforming both ITLinQ and FlashLinQ that have $O(K^2)$ complexity requirements. Moreover, we also discuss the application of our proposed new scheme into an operator-assisted cellular D2D heterogeneous network.

cs.IT↗

arXiv2017

Directional Training and Fast Sector-based Processing Schemes for mmWave Channels

We consider a single-cell scenario involving a single base station (BS) with a massive array serving multi-antenna terminals in the downlink of a mmWave channel. We present a class of multiuser user MIMO schemes, which rely on uplink training from the user terminals, and on uplink/downlink channel reciprocity. The BS employs virtual sector-based processing according to which, user-channel estimation and data transmission are performed in parallel over non-overlapping angular sectors. The uplink training schemes we consider are non-orthogonal, that is, we allow multiple users to transmit pilots on the same pilot dimension (thereby potentially interfering with one another). Elementary processing allows each sector to determine the subset of user channels that can be resolved on the sector (effectively pilot contamination free) and, thus, the subset of users that can be served by the sector. This allows resolving multiple users on the same pilot dimension at different sectors, thereby increasing the overall multiplexing gains of the system. Our analysis and simulations reveal that, by using appropriately designed directional training beams at the user terminals, the sector-based transmission schemes we present can yield substantial spatial multiplexing and ergodic user-rates improvements with respect to their orthogonal-training counterparts.

cs.IT↗

arXiv2017

A novel alternative to Cloud RAN for throughput densification: Coded pilots and fast user-packet scheduling at remote radio heads

We consider wireless networks of remote radio heads (RRH) with large antenna-arrays, operated in TDD, with uplink (UL) training and channel-reciprocity based downlink (DL) transmission. To achieve large area spectral efficiencies, we advocate the use of methods that rely on rudimentary scheduling, decentralized operation at each RRH and user-centric DL transmission. A slotted system is assumed, whereby users are randomly scheduled (e.g., via shuffled round robin) in slots and across the limited pilot dimensions per slot. As a result, multiple users in the vicinity of an RRH can simultaneously transmit pilots on the same pilot dimension (and thus interfering with one another). Each RRH performs rudimentary processing of the pilot observations in "sectors". In a sector, the RRH is able to resolve a scheduled user's channel when that user is determined to be the only one among the scheduled users (on the same pilot dimension) with significant received power in the sector. Subsequently, only the subset of scheduled users whose channels are resolved in at least one sector can be served by the system. We consider a spatially consistent evaluation of the area multiplexing gains by means of a Poisson Point Process (PPP) problem formulation where RRHs, blockers, scatterers and scheduled user terminals are all PPPs with individual intensities. Also, we study directional training at the user terminals. Our simulations suggest that, by controlling the intensity of the scheduled user PPP and the user-pilot beam-width, many fold improvements can be expected in area multiplexing gains with respect to conventional spatial pilot reuse systems.

cs.IT↗

arXiv2016

Compressed Sensing-based Pilot Assignment and Reuse for Mobile UEs in mmWave Cellular Systems

Technologies for mmWave communication are at the forefront of investigations in both industry and academia, as the mmWave band offers the promise of orders of magnitude additional available bandwidths to what has already been allocated to cellular networks. The much larger number of antennas that can be supported in a small footprint at mmWave bands can be leveraged to harvest massive-MIMO type beamforming and spatial multiplexing gains. Similar to LTE systems, two prerequisites for harvesting these benefits are detecting users and acquiring user channel state information (CSI) in the training phase. However, due to the fact that mmWave channels encounter much harsher propagation and decorrelate much faster, the tasks of user detection and CSI acquisition are both imperative and much more challenging than in LTE bands. In this paper, we investigate the problem of fast user detection and CSI acquisition in the downlink of small cell mmWave networks. We assume TDD operation and channel-reciprocity based CSI acquisition. To achieve densification benefits we propose pilot designs and channel estimators that leverage a combination of aggressive pilot reuse with fast user detection at the base station and compressed sensing channel estimation. As our simulations show, the number of users that can be simultaneously served by the entire mmWave-band network with the proposed schemes increases substantially with respect to traditional compressed sensing based approaches with conventional pilot reuse.

cs.IT↗

arXiv2016

RRH based Massive MIMO with "on the Fly" Pilot Contamination Control

Dense large-scale antenna deployments are one of the most promising technologies for delivering very large throughputs per unit area in the downlink (DL) of cellular networks. We consider such a dense deployment involving a distributed system formed by multi-antenna remote radio head (RRH) units connected to the same fronthaul serving a geographical area. Knowledge of the DL channel between each active user and its nearby RRH antennas is most efficiently obtained at the RRHs via reciprocity based training, that is, by estimating a user's channel using uplink (UL) pilots transmitted by the user, and exploiting the UL/DL channel reciprocity. We consider aggressive pilot reuse across an RRH system, whereby a single pilot dimension is simultaneously assigned to multiple active users. We introduce a novel coded pilot approach, which allows each RRH unit to detect pilot collisions, i.e., when more than a single user in its proximity uses the same pilot dimensions. Thanks to the proposed coded pilot approach, pilot contamination can be substantially avoided. As shown, such strategy can yield densification benefits in the form of increased multiplexing gain per UL pilot dimension with respect to conventional reuse schemes and some recent approaches assigning pseudorandom pilot vectors to the active users.

cs.IT↗

arXiv2015

Scalable Synchronization and Reciprocity Calibration for Distributed Multiuser MIMO

Large-scale distributed Multiuser MIMO (MU-MIMO) is a promising wireless network architecture that combines the advantages of "massive MIMO" and "small cells." It consists of several Access Points (APs) connected to a central server via a wired backhaul network and acting as a large distributed antenna system. We focus on the downlink, which is both more demanding in terms of traffic and more challenging in terms of implementation than the uplink. In order to enable multiuser joint precoding of the downlink signals, channel state information at the transmitter side is required. We consider Time Division Duplex (TDD), where the {\em downlink} channels can be learned from the user uplink pilot signals, thanks to channel reciprocity. Furthermore, coherent multiuser joint precoding is possible only if the APs maintain a sufficiently accurate relative timing and phase synchronization. AP synchronization and TDD reciprocity calibration are two key problems to be solved in order to enable distributed MU-MIMO downlink. In this paper, we propose novel over-the-air synchronization and calibration protocols that scale well with the network size. The proposed schemes can be applied to networks formed by a large number of APs, each of which is driven by an inexpensive 802.11-grade clock and has a standard RF front-end, not explicitly designed to be reciprocal. Our protocols can incorporate, as a building block, any suitable timing and frequency estimator. Here we revisit the problem of joint ML timing and frequency estimation and use the corresponding Cramer-Rao bound to evaluate the performance of the synchronization protocol. Overall, the proposed synchronization and calibration schemes are shown to achieve sufficient accuracy for satisfactory distributed MU-MIMO performance.

cs.NI↗

arXiv2015

Optimal User-Cell Association for Massive MIMO Wireless Networks

The use of a very large number of antennas at each base station site (referred to as "Massive MIMO") is one of the most promising approaches to cope with the predicted wireless data traffic explosion. In combination with Time Division Duplex and with simple per-cell processing, it achieves large throughput per cell, low latency, and attractive power efficiency performance. Following the current wireless technology trend of moving to higher frequency bands and denser small cell deployments, a large number of antennas can be implemented within a small form factor even in small cell base stations. In a heterogeneous network formed by large (macro) and small cell BSs, a key system optimization problem consists of "load balancing", that is, associating users to BSs in order to avoid congested hot-spots and/or under-utilized infrastructure. In this paper, we consider the user-BS association problem for a massive MIMO heterogeneous network. We formulate the problem as a network utility maximization, and provide a centralized solution in terms of the fraction of transmission resources (time-frequency slots) over which each user is served by a given BS. Furthermore, we show that such a solution is physically realizable, i.e., there exists a sequence of integer scheduling configurations realizing (by time-sharing) the optimal fractions. While this solution is optimal, it requires centralized computation. Then, we also consider decentralized user-centric schemes, formulated as non-cooperative games where each user makes individual selfish association decisions based only on its local information. We identify a class of schemes such that their Nash equilibrium is very close to the global centralized optimum. Hence, these user-centric algorithms are attractive not only for their simplicity and fully decentralized implementation, but also because they operate near the system "social" optimum.

cs.NI↗

arXiv2009

MIMO Broadcast Channel Optimization under General Linear Constraints

The optimization of the transmit parameters (power allocation and steering vectors) for the MIMO BC under general linear constraints is treated under the optimal DPC coding strategy and the simple suboptimal linear zero-forcing beamforming strategy. In the case of DPC, we show that "SINR duality" and "min-max duality" yield the same dual MAC problem, and compare two alternatives for its efficient solution. In the case of zero-forcing beamforming, we provide a new efficient algorithm based on the direct optimization of a generalized inverse matrix. In both cases, the algorithms presented here address the problems in the most general form and can be applied to special cases previously considered, such as per-antenna and per-group of antennas power constraints, "forbidden interference direction" constraints, or any combination thereof.

cs.IT↗