Optimization of Massive Full-Dimensional MIMO for Positioning and Communication

Massive Full-Dimensional multiple-input multiple-output (FD-MIMO) base stations (BSs) have the potential to bring multiplexing and coverage gains by means of three-dimensional (3D) beamforming. Key technical challenges for their deployment include the presence of limited-resolution front ends and the acquisition of channel state information (CSI) at the BSs. This paper investigates the use of FD-MIMO BSs to provide simultaneously high-rate data communication and mobile 3D positioning in the downlink. The analysis concentrates on the problem of beamforming design by accounting for imperfect CSI acquisition via Time Division Duplex (TDD)-based training and for the finite resolution of analog-to-digital converter (ADC) and digital-to-analog converter (DAC) at the BSs. Both \textit{unstructured beamforming} and a low-complexity \textit{Kronecker beamforming} solution are considered, where for the latter the beamforming vectors are decomposed into separate azimuth and elevation components. The proposed algorithmic solutions are based on Bussgang theorem, rank-relaxation and successive convex approximation (SCA) methods. Comprehensive numerical results demonstrate that the proposed schemes can effectively cater to both data communication and positioning services, providing only minor performance degradations as compared to the more conventional cases in which either function is implemented. Moreover, the proposed low-complexity Kronecker beamforming solutions are seen to guarantee a limited performance loss in the presence of a large number of BS antennas.Comment: 30 pages, 6 figure

Echo State Networks for Proactive Caching in Cloud-Based Radio Access Networks with Mobile Users

In this paper, the problem of proactive caching is studied for cloud radio access networks (CRANs). In the studied model, the baseband units (BBUs) can predict the content request distribution and mobility pattern of each user, determine which content to cache at remote radio heads and BBUs. This problem is formulated as an optimization problem which jointly incorporates backhaul and fronthaul loads and content caching. To solve this problem, an algorithm that combines the machine learning framework of echo state networks with sublinear algorithms is proposed. Using echo state networks (ESNs), the BBUs can predict each user's content request distribution and mobility pattern while having only limited information on the network's and user's state. In order to predict each user's periodic mobility pattern with minimal complexity, the memory capacity of the corresponding ESN is derived for a periodic input. This memory capacity is shown to be able to record the maximum amount of user information for the proposed ESN model. Then, a sublinear algorithm is proposed to determine which content to cache while using limited content request distribution samples. Simulation results using real data from Youku and the Beijing University of Posts and Telecommunications show that the proposed approach yields significant gains, in terms of sum effective capacity, that reach up to 27.8% and 30.7%, respectively, compared to random caching with clustering and random caching without clustering algorithm.Comment: Accepted in the IEEE Transactions on Wireless Communication