Search arXivSearch

arXiv · 2304.03873

Improving Spectral Efficiency via Pilot Assignment and Subarray Selection Under Realistic XL-MIMO Channels

Abstract

The main requirements for 5G and beyond connectivity include a uniform high quality of service, which can be attained in crowded scenarios by extra-large MIMO (XL-MIMO) systems. Another requirement is to support increasing connected users in (over)crowded machine-type communication (mMTC). In such scenarios, pilot assignment (PA) becomes paramount to reduce pilot contamination and consequently improve spectral efficiency (SE). We propose a novel quasi-optimal low-complexity iterative pilot assignment strategy for XL-MIMO systems based on a genetic algorithm (GA). The proposed GA-based PA procedure turns the quality of service more uniform, taking into account the normalized mean-square error (NMSE) of channel estimation from each candidate of the population. The simulations reveal that the proposed iterative procedure minimizes the channel estimation NMSE averaged over the UEs. The second procedure is the subarray (SA) selection. In XL-MIMO systems, commonly, a UE is close to a SA antenna subset such that a sufficient data rate can be achieved if only a specific SA serves that UE. Thus, a SA selection procedure is investigated to make the system scalable by defining the maximum number of UEs each SA can help. Hence, the SA clusters are formatted based on the PA decision. Furthermore, we introduce an appropriate channel model for XL-MIMO, which considers a deterministic LoS component with a distance-dependent probability of existence combined with a stochastic spatially correlated Rayleigh NLoS fading component. The developed simulations and analyses rely on this suitable channel model under realistic assumptions of pilot contamination and correlated channels.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gabriel Avanzi Ubiali, Taufik Abrao, Jose Carlos Marinello. 2023-04-08. Improving Spectral Efficiency via Pilot Assignment and Subarray Selection Under Realistic XL-MIMO Channels. https://doi.org/10.1016/j.phycom.2023.102062

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT