Abstract
This paper introduces a tensor-based framework for channel parameter estimation in dual-polarized (DP) massive MIMO systems. By modeling the double-directional channel as a low-rank tensor, the proposed approach enables the identification of key parameters, such as angles of arrival and departure, even when the number of signal paths exceeds the number of antennas. Furthermore, a "frugal pilot" design is introduced to significantly reduce training overhead without compromising estimation accuracy.
Introduction
In the evolution toward 5G and 6G, massive MIMO systems utilize large antenna arrays to achieve high data rates. Dual-polarized (DP) arrays are increasingly common as they allow for higher antenna density and capacity by exploiting both horizontal and vertical signal orientations. However, estimating the Channel State Information (CSI) in these systems is challenging. The standard Double Directional (DD) model, while efficient, becomes mathematically complex with the addition of polarization. Traditional matrix-based estimation methods often require extensive pilot data and fail when the number of multipath signals exceeds the number of antennas at one end of the link.
Methodology
The authors propose a shift from traditional matrix algebra to tensor algebra to better capture the multi-dimensional nature of DP-MIMO channels. This approach preserves the multi-way structure of horizontal/vertical transmit and receive dimensions, typically resulting in a 4th-order tensor representation.
Tensor Modeling and Decomposition
For full channel estimation, an Alternating Least Squares (ALS) based PARAFAC decomposition is employed to extract array manifolds and path losses. The geometric relationship between the array and the signal paths is defined by angles of arrival and departure, which are critical parameters for the model.
Frugal Pilot Design and Compressed Tensor Decomposition (CTD)
To minimize bandwidth consumption, a "frugal" pilot structure is proposed using a time-division strategy between polarizations. A Compressed Tensor Decomposition (CTD) framework then recovers channel parameters from these compressed observations. In these scenarios, a "Smoothed ESPRIT" algorithm is adapted to exploit the Vandermonde structure of uniform arrays, providing high-resolution estimates of angles of arrival (DOA) and departure (DOD).
Experimental Setup
The framework was evaluated using Monte-Carlo simulations based on 3GPP "urban propagation" specifications. The setup included Rician fading ($\kappa = 13.2$ dB) with DP-Uniform Rectangular Arrays (URA) at the Base Station and DP-Uniform Linear Arrays (ULA) at the Mobile Station. The proposed methods were benchmarked against Least Squares (LS), Iterative Multi-Dimensional Filtering (IMDF), Unitary ESPRIT, and Compressed Sensing (CS) techniques.
Key Results and Insights
- Multi-dimensional Advantage: Tensors preserve the structural integrity of polarized data, allowing for parameter identification under milder conditions than matrix-based methods.
- Capacity Beyond Antennas: A significant theoretical finding is that tensor decomposition can identify more paths ($K$) than receive antennas ($M_r$), breaking a fundamental limit of traditional subspace methods.
- Accuracy and Efficiency: The PARAFAC (ALS) method consistently outperformed competitors in Normalized Mean Squared Error (NMSE), particularly at low SNR. The CTD method achieved parameter recovery with significantly shorter pilot sequences and was approximately 11x faster than Joint Orthogonal Matching Pursuit (J-OMP).
- Dictionary-Free Estimation: Unlike grid-based CS methods, the tensor approach treats angles as continuous variables, avoiding "grid leakage" errors and reducing memory requirements.
Conclusion
While the proposed tensor framework offers significant advantages in accuracy and pilot efficiency, it currently assumes a quasi-static channel and perfect synchronization. Future work may involve extending the model to high-mobility scenarios using higher-order tensors to account for Doppler effects and refining the algorithms for non-standard array geometries.
Summary updated