Yu, Han, Yi, Xinping 
ORCID: 0000-0001-5163-2364 and Caire, Giuseppe
(2022)
Downlink Precoding for DP-UPA FDD Massive MIMO via Multi-Dimensional Active Channel Sparsification.
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 21 (8).
pp. 6698-6713.
|
Text
TW-May-21-0586.pdf - Author Accepted Manuscript Download (1MB) | Preview |
Abstract
In this paper, we consider user selection and downlink precoding for an over-loaded single-cell massive multiple-input multiple-output (MIMO) system in frequency division duplexing (FDD) mode, where the base station is equipped with a dual-polarized uniform planar array (DP-UPA) and serves a large number of single-antenna users. Due to the absence of uplink-downlink channel reciprocity and the high-dimensionality of channel matrices, it is extremely challenging to design downlink precoders using closed-loop channel probing and feedback with limited spectrum resource. To address these issues, a novel methodology - active channel sparsification (ACS) - has been proposed recently in the literature for uniform linear array (ULA) to design sparsifying precoders, which substantially reduces channel feedback overhead. Pushing forward this line of research, we aim to facilitate the potential deployment of ACS in practical FDD massive MIMO systems, by extending it from ULA to DP-UPA with explicit user selection and making the current ACS implementation simplified. To this end, by leveraging Toeplitz matrix theory, we start with the spectral properties of channel covariance matrices from the lens of their matrix-valued spectral density function. Inspired by these properties, we extend the original ACS using scalar-weight bipartite graph representation to the matrix-weight counterpart. Building upon such matrix-weight bipartite graph representation, we propose a multi-dimensional ACS (MD-ACS) method, which is a generalization of original ACS formulation and is more suitable for DP-UPA antenna configurations. The nonlinear integer program formulation of MD-ACS can be classified as a generalized multi-assignment problem (GMAP), for which we propose a simple yet efficient greedy algorithm to solve it. Simulation results demonstrate the performance improvement of the proposed MD-ACS with greedy algorithm over the state-of-the-art methods based on the QuaDRiGa channel models.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Downlink, Transmission line matrix methods, Covariance matrices, Bipartite graph, Massive MIMO, Sparse matrices, Base stations, FDD massive MIMO, downlink precoding, user selection, active channel sparsification |
| Divisions: | Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science |
| Depositing User: | Symplectic Admin |
| Date Deposited: | 14 Feb 2022 13:55 |
| Last Modified: | 17 Mar 2024 13:27 |
| DOI: | 10.1109/TWC.2022.3152002 |
| Related URLs: | |
| URI: | https://livrepository.liverpool.ac.uk/id/eprint/3148923 |
Dimensions
Dimensions
