Source-linked AI summary
Cascaded Channel Estimation for Large Intelligent Metasurface Assisted Massive MIMO
Zhen-Qing He, Xiaojun Yuan
TL;DR
The paper addresses cascaded channel estimation when a LIM passively reflects signals without signal-processing capability. It proposes joint sparse bilinear factorization and matrix completion, and reports accurate estimation in simulations, with performance depending on the sampling-rate tradeoff.
Problem
Estimating BS-LIM and LIM-receiver cascaded channels is needed for LIM-assisted beamforming and energy-efficient designs, but the all-passive LIM cannot process signals.
Method
The JBF-MC algorithm first uses sparse bilinear matrix factorization to estimate G and partial Z, then applies rank-based matrix completion to recover H.
Results
Accurate cascaded channel estimation is achieved in simulations, while the sampling rate presents a tradeoff between sparse factorization and matrix completion.
Takeaways & Limitations
The proposed two-stage framework provides a channel-estimation approach for LIM-assisted massive MIMO systems with entirely passive LIM elements.
Abstract
from arXiv · showhide
In this letter, we consider the problem of channel estimation for large intelligent metasurface (LIM) assisted massive multiple-input multiple-output (MIMO) systems. The main challenge of this problem is that the LIM integrated with a large number of low-cost metamaterial antennas can only passively reflect the incident signal by a certain phase shift, and does not have any signal processing capability. To deal with this, we introduce a general framework for the estimation of the transmitter-LIM and LIM-receiver cascaded channel, and propose a two-stage algorithm that includes a sparse matrix factorization stage and a matrix completion stage. Simulation results illustrate that the proposed method can achieve accurate channel estimation for LIM-assisted massive MIMO systems.
I. INTRODUCTION
LIM-assisted massive MIMO is motivated by the need to reduce energy and hardware costs while retaining massive-MIMO communication benefits. The paper addresses cascaded CSI estimation despite the LIM's passive, non-processing nature and distinguishes its all-passive setting from prior work.
- Massive MIMO supports high data traffic and many wireless connections, but large-scale arrays create high hardware costs and power consumption.
- LIMs are proposed as energy-efficient surfaces that manipulate electromagnetic waves through controllable reflection for wireless communications.
- CSI for both BS-LIM and LIM-receiver links is essential for reflect beamforming, energy-efficient design, and simultaneous passive beamforming and information transfer.
- Because the LIM only passively reflects waves without signal processing, cascaded estimation is formulated as sparse matrix factorization followed by matrix completion.
- The paper claims the first cascaded-channel estimation attempt for LIM-assisted MIMO with all LIM elements passive, unlike prior work using a few active elements.
II. SYSTEM MODEL
The system contains a passive LIM between a multi-antenna BS and a multi-antenna user, with programmable element states and phases. The BS-LIM and LIM-user channels are modeled as rank-deficient under block fading.
- The LIM has N low-cost passive elements, the BS has M transmit antennas, and each user has L receive antennas.
- The direct BS-user link is neglected or estimated separately and cancelled, while channels remain unchanged during each coherence block of length T.
- Each LIM element uses an on/off state and a phase shift, enabling programmable passive beamforming based on environmental changes.
- The block-fading model allows channel variation between transmission blocks, including cases involving node motion or millimeter-wave weather effects.
- The BS-LIM channel H and LIM-user channel G are assumed rank-deficient, consistent with far-field and limited-scattering massive-MIMO models.
III. PROBLEM STATEMENT
The paper seeks to estimate the BS-LIM and LIM-user channels from known pilot observations. Because the model is invariant under an invertible diagonal transformation, training must recover the channels only up to that ambiguity.
- The objective is to estimate cascaded channel matrices H and G from Y when pilot symbols X and S are known at the receiver.
- Knowledge of H and G supports reflect beamforming, energy-efficient design, and simultaneous passive beamforming and information transfer.
- Constant LIM phase-shift vectors within a block yield effective channels G′ and H′ related by an invertible diagonal matrix Φ.
- Training must therefore estimate G and H up to the diagonal ambiguity induced by Φ through appropriate designs of LIM and BS pilots.
IV. PROPOSED CHANNEL ESTIMATION ALGORITHM
The proposed JBF-MC method uses varying LIM pilots to create a sparse bilinear observation, first factors that observation to estimate G and then completes missing entries to recover H.
- Constant LIM states do not provide sufficient structure for cascaded estimation because the resulting problem is affine matrix factorization.
- The received signal is recast as a bilinear model with Z = S ⊙(HX), and the method estimates G and Z before recovering H.
- Random Bernoulli on/off LIM pilots expose partial samples of Z, while the transmitted pilot X must be full-rank.
- The sparse-factorization stage recovers G and Z using techniques such as BiG-AMP, while the matrix-completion stage fills missing Z entries using H's rank deficiency.
- The JBF-MC algorithm retains the diagonal ambiguity because it does not need to be removed for the beamforming-related objective.
A. Sparse Matrix Factorization
The sparse matrix factorization stage estimates G and the sparse matrix Z from Y using BiG-AMP, with known on/off states and specified priors. Its output retains a diagonal ambiguity that is addressed in the subsequent matrix-completion stage.
- Sparse Matrix Factorization: BiG-AMP approximately computes MMSE estimates of G and Z from Y using marginal posterior means.The algorithm uses sum-product loopy belief propagation with approximate marginal posteriors.
- Sparse Matrix Factorization: The method uses independent Gaussian priors for G and independent Bernoulli-Gaussian priors for Z.The prior parameters include the average variances ν_g and ν_z.
- Sparse Matrix Factorization: The JBF-MC algorithm takes Y, S, X, and prior distributions p(G) and p(Z) as inputs before sparse factorization and matrix completion.
- Sparse Matrix Factorization: Sparse matrix factorization has a diagonal ambiguity: (ĜΦ, Φ^-1Ẑ) is also valid when Φ is an invertible diagonal matrix.This ambiguity motivates using matrix completion to recover the remaining channel information.
B. Matrix Completion
The matrix completion stage recovers missing entries of Ẑ by exploiting the low-rank structure of H, then estimates H from the completed matrix and pilot matrix X.
- Matrix Completion: RGrad solves a matrix completion problem to recover missing entries of Ẑ using the rank-deficient property of H.The matrix completion procedure is summarized in Lines 25 to 32 of Algorithm 1.
- Matrix Completion: The algorithm projects updates onto the left singular-vector subspace associated with the first r eigenvalues of the current estimate.
- Matrix Completion: The hard-thresholding operator H_r retains the best rank-r approximation obtained from the singular value decomposition.
- Matrix Completion: After RGrad outputs Â, the estimate of H is computed using ÂX†, assuming T ≥ M and rank(X) = M.These conditions ensure that X† exists.
C. Computational Complexity
The computational cost combines BiG-AMP, RGrad, and the final computation of H, with complexity governed by matrix dimensions, rank, and iteration limits.
- Computational Complexity: BiG-AMP requires at most I_maxJ_maxO(LNT) flops because its dominant operations are basic matrix multiplications.
- Computational Complexity: RGrad costs at most K_maxO(rNT) flops, using r < min{N,T}.Its dominant per-iteration operations require O(rNT) and O(r^3) flops.
- Computational Complexity: Computing the final H estimate requires O(M^2T) + O(M^3) + O(MNT) flops.
V. SIMULATION RESULTS
Simulations model low-rank BS-LIM and LIM-user channels with ULA arrays and evaluate NMSE over 200 trials. JBF-MC outperforms baselines, while sampling rate creates a tradeoff between the two estimation stages.
- Simulation Setup: The simulations use half-wavelength ULA configurations at the BS, LIM, and receiver, with channel matrices generated by superposing propagation paths.
- Simulation Setup: The BS-LIM channel uses few enough paths to have a low-rank structure, facilitating its estimation in the matrix completion stage.
- Simulation Setup: NMSE is averaged over 200 independent trials, with SNR defined as 10 log10(1/σ^2) dB.Diagonal ambiguities in the outputs are removed using the true G and H values when calculating NMSE.
- Simulation Results: Under λ = 0.2, JBF-MC has a significant performance gain over baseline methods, especially for estimating G, while H has lower NMSE than G.Figure 2 varies SNR and pilot number with N = 70 and M = L = 64.
- Simulation Results: The sampling rate has a tradeoff: too small causes matrix completion to fail, while too large causes sparse matrix factorization to fail.Larger λ supplies more matrix-completion samples but increases the random variables estimated during BiG-AMP.
VI. CONCLUSIONS
The paper formulates cascaded channel estimation for LIM-assisted massive MIMO using combined bilinear sparse matrix factorization and matrix completion. Its two-stage approach achieves accurate cascaded channel estimation according to experimental evidence.
- The framework combines bilinear sparse matrix factorization with matrix completion for cascaded channel estimation.
- The proposed two-stage algorithm includes generalized bilinear message passing for matrix factorization and a Riemannian manifold gradient-based algorithm for matrix completion.
- The proposed approach achieves accurate cascaded channel estimation for LIM-assisted massive MIMO systems.