arXiv subjects

Manijeh Bashar

Publications and source records attributed to Manijeh Bashar.

13 recordsLinked to original sources

arXiv2023

Ultra-dense Radio Access Networks for Smart Cities: Cloud-RAN, Fog-RAN and "cell-free" Massive MIMO

In this paper we discuss the requirements for a radio access network architecture for ultra-dense networks for "smart city" applications, and show that coordination is required between access points to overcome the effects of interference. We propose a new paradigm, Fog Massive MIMO, based on a combination of the "cell-free" massive MIMO concept and the Fog Radio Access Network (F-RAN). In particular we analyze the potential benefit of improved coordination between APs over different coordination ranges.

eess.SP↗

arXiv2019

On the Energy Efficiency of Limited-Backhaul Cell-Free Massive MIMO

We investigate the energy efficiency performance of cell-free Massive multiple-input multiple-output (MIMO), where the access points (APs) are connected to a central processing unit (CPU) via limited-capacity links. Thanks to the distributed maximum ratio combining (MRC) weighting at the APs, we propose that only the quantized version of the weighted signals are sent back to the CPU. Considering the effects of channel estimation errors and using the Bussgang theorem to model the quantization errors, an energy efficiency maximization problem is formulated with per-user power and backhaul capacity constraints as well as with throughput requirement constraints. To handle this non-convex optimization problem, we decompose the original problem into two sub-problems and exploit a successive convex approximation (SCA) to solve original energy efficiency maximization problem. Numerical results confirm the superiority of the proposed optimization scheme.

cs.IT↗

arXiv2019

Max-Min Rate of Cell-Free Massive MIMO Uplink with Optimal Uniform Quantization

Cell-free Massive multiple-input multiple-output (MIMO) is considered, where distributed access points (APs) multiply the received signal by the conjugate of the estimated channel, and send back a quantized version of this weighted signal to a central processing unit (CPU). For the first time, we present a performance comparison between the case of perfect fronthaul links, the case when the quantized version of the estimated channel and the quantized signal are available at the CPU, and the case when only the quantized weighted signal is available at the CPU. The Bussgang decomposition is used to model the effect of quantization. The max-min problem is studied, where the minimum rate is maximized with the power and fronthaul capacity constraints. To deal with the non-convex problem, the original problem is decomposed into two sub-problems (referred to as receiver filter design and power allocation). Geometric programming (GP) is exploited to solve the power allocation problem whereas a generalized eigenvalue problem is solved to design the receiver filter. An iterative scheme is developed and the optimality of the proposed algorithm is proved through uplink-downlink duality. A user assignment algorithm is proposed which significantly improves the performance. Numerical results demonstrate the superiority of the proposed schemes.

cs.IT↗

arXiv2019

Evaluation of Low Complexity Massive MIMO Techniques Under Realistic Channel Conditions

A low complexity massive multiple-input multiple-output (MIMO) technique is studied with a geometry-based stochastic channel model, called COST 2100 model. We propose to exploit the discrete-time Fourier transform of the antenna correlation function to perform user scheduling. The proposed algorithm relies on a trade off between the number of occupied bins of the eigenvalue spectrum of the channel covariance matrix for each user and spectral overlap among the selected users. We next show that linear precoding design can be performed based only on the channel correlation matrix. The proposed scheme exploits the angular bins of the eigenvalue spectrum of the channel covariance matrix to build up an "approximate eigenchannels" for the users. We investigate the reduction of average system throughput with no channel state information at the transmitter (CSIT). Analysis and numerical results show that while the throughput slightly decreases due to the absence of CSIT, the complexity of the system is reduced significantly.

eess.SP↗

arXiv2019

On The Uplink Throughput of Zero-Forcing in Cell-Free Massive MIMO with Coarse Quantization

The recently proposed Cell-Free massive MIMO architecture is studied for the uplink. In contrast to most previous works, joint detection is performed using global CSI. Therefore, we study strategies for transferring CSI to the CPU taking into account the fronthaul capacity which limits CSI quantization. Two strategies for pilot-based CSI acquisition are considered: estimate-and-quantize and quantize-and-estimate. These are analysed using the Bussgang decomposition. For a given quantization constraint for the data and CSI the achievable rate per user with Zero-Forcing is determined. Numerical results show that quantize-and-estimate (the simpler strategy) is similar to or better than estimate-and-quantize, especially for 1-bit resolution.

cs.IT↗

arXiv2018

On the Performance of Backhaul Constrained Cell-Free Massive MIMO with Linear Receivers

Limited-backhaul cell-free Massive multiple-input multiple-output (MIMO), in which the fog radio access network (F-RAN) is implemented to exchange the information between access points (APs) and the central processing unit (CPU), is investigated. We introduce a novel approach where the APs estimate the channel and send back the quantized version of the estimated channel and the quantized version of the received signal to the central processing unit. The Max algorithm and the Bussgang theorem are exploited to model the optimum uniform quantization. The ergodic achievable rates are derived. We show that exploiting microwave wireless backhaul links and using a small number of bits to quantize the estimated channel and the received signal, the performance of limited-backhaul cell-free Massive MIMO closely approaches the performance of cell-free Massive MIMO with perfect backhaul links.

cs.IT↗

arXiv2018

A Study of Dynamic Multipath Clusters at 60 GHz in a Large Indoor Environment

The available geometry-based stochastic channel models (GSCMs) at millimetre-wave (mmWave) frequencies do not necessarily retain spatial consistency for simulated channels, which is essential for small cells with ultra-dense users. In this paper, we work on cluster parameterization for the COST 2100 channel model using mobile channel simulations at 61 GHz in Helsinki Airport. The paper considers a ray-tracer which has been optimized to match measurements, to obtain double-directional channels at mmWave frequencies. A joint clustering-tracking framework is used to determine cluster parameters for the COST 2100 channel model. The KPowerMeans algorithm and the Kalman filter are exploited to identify the cluster positions and to predict and track cluster positions respectively. The results confirm that the joint clustering-and-tracking is a suitable tool for cluster identification and tracking for our ray-tracer results. The movement of cluster centroids, cluster lifetime and number of clusters per snapshot are investigated for this set of ray-tracer results. Simulation results show that the multipath components (MPCs) are grouped into clusters at mmWave frequencies.

eess.SP↗

arXiv2018

Mixed Quality of Service in Cell-Free Massive MIMO

Cell-free massive multiple-input multiple-output (MIMO) is a potential key technology for fifth generation wireless communication networks. A mixed quality-of-service (QoS) problem is investigated in the uplink of a cell-free massive MIMO system where the minimum rate of non-real time users is maximized with per user power constraints whilst the rate of the real-time users (RTUs) meet their target rates. First an approximated uplink user rate is derived based on available channel statistics. Next, the original mixed QoS problem is formulated in terms of receiver filter coefficients and user power allocations which can iteratively be solved through two sub-problems, namely, receiver filter coefficient design and power allocation, which are dealt with using a generalized eigenvalue problem and geometric programming, respectively. Numerical results show that with the proposed scheme, while the rates of RTUs meet the QoS constraints, the $90\%$-likely throughput improves significantly, compared to a simple benchmark scheme.

eess.SP↗

arXiv2018

Cooperative access networks: Optimum fronthaul quantization in distributed Massive MIMO and cloud RAN

We consider cooperative radio access network architectures, especially distributed massive MIMO and Cloud RAN, considering their similarities and differences. We address in particular the major challenge posed to both by the implementation of a high capacity fronthaul network to link the distributed access points to the central processing unit, and consider the effect on uplink performance of quantization of received signals in order to limit fronthaul load. We use the Bussgang decomposition along with a new approach to MMSE estimation of both channel and data to provide the basis of our analysis.

cs.IT↗

arXiv2018

Robust Geometry-Based User Scheduling for Large MIMO Systems Under Realistic Channel Conditions

The problem of user scheduling with reduced overhead of channel estimation in the uplink of Massive multiple-input multiple-output (MIMO) systems has been considered. A geometry-based stochastic channel model (GSCM), called the COST 2100 channel model has been used for realistic analysis of channels. In this paper, we propose a new user selection algorithm based on knowledge of the geometry of the service area and location of clusters, without having full channel state information (CSI) at the base station (BS). The multi-user link correlation in the GSCMs arises from the common clusters in the area. The throughput depends on the position of clusters in the GSCMs and users in the system. Simulation results show that although the BS does not require the channel information of all users, by the proposed geometry-based user scheduling algorithm the sum-rate of the system is only slightly less than the well-known greedy weight clique scheme. Finally, the robustness of the proposed algorithm to the inaccuracy of cluster localization is verified by the simulation results.

cs.IT↗

arXiv2018

Robust User Scheduling with COST 2100 Channel Model for Massive MIMO Networks

This paper considers a Massive multiple-input multiple-output (MIMO) network, where the base station (BS) with a large number of antennas communicates with a smaller number of users. The signals are transmitted using frequency division duplex (FDD) mode. The problem of user scheduling with reduced overhead of channel estimation in the uplink of Massive MIMO systems has been investigated. We consider the COST 2100 channel model. In this paper, we first propose a new user selection algorithm based on knowledge of the geometry of the service area and of location of clusters, without having full channel state information (CSI) at the BS. We then show that the correlation in geometry-based stochastic channel models (GSCMs) arises from the common clusters in the area. In addition, exploiting the closed-form Cramer-Rao lower bounds (CRLB)s, the analysis for the robustness of the proposed scheme to cluster position errors is presented. It is shown by analysing the capacity upper-bound that the capacity strongly depends on the position of clusters in the GSCMs and users in the system. Simulation results show that although the BS receiver does not require the channel information of all users, by the proposed geometry-based user scheduling (GUS) algorithm the sum-rate of the system is only slightly less than the well-known greedy weight clique (GWC) scheme \cite{SUSGoldsmithGlobcom,ITC09_Userselection_GWC}. {Finally, the robustness of the proposed algorithm to cluster localization is verified by the simulation results.

cs.IT↗

arXiv2018

Enhanced Max-Min SINR for Uplink Cell-Free Massive MIMO Systems

In this paper, we consider the max-min signal-to-interference plus noise ratio (SINR) problem for the uplink transmission of a cell-free Massive multiple-input multiple-output (MIMO) system. Assuming that the central processing unit (CPU) and the users exploit only the knowledge of the channel statistics, we first derive a closed-form expression for uplink rate. In particular, we enhance (or maximize) user fairness by solving the max-min optimization problem for user rate, by power allocation and choice of receiver coefficients, where the minimum uplink rate of the users is maximized with available transmit power at the particular user. Based on the derived closed-form expression for the uplink rate, we formulate the original user max-min problem to design the optimal receiver coefficients and user power allocations. However, this max-min SINR problem is not jointly convex in terms of design variables and therefore we decompose this original problem into two sub-problems, namely, receiver coefficient design and user power allocation. By iteratively solving these sub-problems, we develop an iterative algorithm to obtain the optimal receiver coefficient and user power allocations. In particular, the receiver coefficients design for a fixed user power allocation is formulated as generalized eigenvalue problem whereas a geometric programming (GP) approach is utilized to solve the power allocation problem for a given set of receiver coefficients. Numerical results confirm a three-fold increase in system rate over existing schemes in the literature.

cs.IT↗

arXiv2018

Cell-Free Massive MIMO with Limited Backhaul

We consider a cell-free Massive multiple-input multiple-output (MIMO) system and investigate the system performance for the case when the quantized version of the estimated channel and the quantized received signal are available at the central processing unit (CPU), and the case when only the quantized version of the combined signal with maximum ratio combining (MRC) detector is available at the CPU. Next, we study the max-min optimization problem, where the minimum user uplink rate is maximized with backhaul capacity constraints. To deal with the max-min non-convex problem, we propose to decompose the original problem into two sub-problems. Based on these sub-problems, we develop an iterative scheme which solves the original max-min user uplink rate. Moreover, we present a user assignment algorithm to further improve the performance of cell-free Massive MIMO with limited backhaul links.

cs.IT↗