PARAFAC-Based Channel Estimation for Beyond Diagonal Reconfigurable Surfaces

Channel estimation is a central bottleneck in BD-RIS-assisted MIMO systems. The richer inter-element coupling that enables large performance gains also makes training and hardware control substantially harder than in diagonal RIS architectures. Existing estimators either target only cascaded channels or require block-by-block reconfiguration of the BD-RIS interconnections, which is costly and difficult to implement in practice. To overcome this limitation, we propose a pilot-assisted tensor framework for group-connected BD-RIS under a two-timescale protocol, where the scattering structure is designed as a low-rank PARAFAC model with fixed factor matrices. This design keeps the interconnection topology constant across blocks and updates only phase shifts, enabling practical operation without sacrificing estimation quality. Building on this structure, we develop a PARAFAC-based alternating least-squares (PALS) receiver that recovers the individual channels. Numerical results confirm that PALS delivers markedly lower composite-channel NMSE than conventional LS, matches the accuracy of state-of-the-art tensor receivers, and sharply reduces BD-RIS design complexity

Channel Estimation via Tensor Decomposition for Dynamic Metasurface Antennas with Known Mutual Coupling: Algorithms and Experiments

Dynamic metasurface antennas (DMAs) are an emerging hybrid-MIMO technology distinguished by an ultrathin form factor, low cost, and low power consumption. In real-world DMA prototypes, mutual coupling (MC) between meta-elements is generally non-negligible; some architectures even deliberately exploit strong MC to enhance wave-domain flexibility. In this paper, we address channel estimation (CE) for DMAs with known MC by formulating it as a tensor-decomposition problem. We develop a generalized block Tucker alternating least squares (BTALS) algorithm, together with specialized variants for cases with known direct and/or feed channel. We also develop a reciprocity-aware bilinear factorization method for the case with known direct channel. We experimentally validate our algorithms using an 18 GHz DMA prototype whose 7 feeds and 96 meta-elements are strongly coupled via a chaotic cavity. Our general BTALS algorithm reaches an accuracy of 43.1 dB, only 0.3 dB below the upper bound imposed by experimental noise. All proposed algorithms generally outperform the prior-art reference scheme thanks to the superior noise rejection enabled by the tensor-based framework. We further study the minimum number of required measurements as a function of the number of feeds and demonstrate the importance of MC awareness by comparison with an MC-unaware benchmark. Finally, we apply BTALS to a second setup enabling the prediction of the DMA's full dual-polarization 3D radiation diagram. We also measure the latter for DMA configurations optimized for channel-gain enhancement based on the estimated channels. Altogether, our work establishes the practical relevance of MC-aware tensor methods; beyond DMAs, it applies to all wireless systems with wave-domain programmability enabled by tunable lumped elements.

Performance Evaluation of Beyond Diagonal RIS under Hardware Impairments

Beyond diagonal reconfigurable intelligent surface (BD-RIS) improves the traditional reconfigurable intelligent surface (RIS) architecture functionality by interconnecting elements for advanced wave control. However, real-world implementations face hardware imperfections, such as impedance mismatches and varactor nonidealities, which can degrade overall system performance. In this paper, we propose three hardware impairment models that directly affect the BD-RIS scattering matrix structure and evaluate their impact on the channel estimation accuracy using the normalized mean square error (NMSE) as a performance metric. The proposed impairment models consider imperfections affecting self-impedances, mutual impedances, or both. Our results reveal how each impairment type degrades the system performance, allowing us to identify scenarios where the traditional RIS can outperform the BD-RIS.

A Decoupled Channel Estimation Method for Beyond Diagonal RIS

Beyond diagonal reconfigurable intelligent surface (BD-RIS) is a new architecture for RIS where elements are interconnected to provide more wave manipulation flexibility than traditional single connected RIS, enhancing data rate and coverage. However, channel estimation for BD-RIS is challenging due to the more complex multiple-connection structure involving their scattering elements. To address this issue, this paper proposes a decoupled channel estimation method for BD-RIS that yields separate estimates of the involved channels to enhance the accuracy of the overall combined channel by capitalizing on its Kronecker structure. Starting from a least squares estimate of the combined channel and by properly reshaping the resulting filtered signal, the proposed algorithm resorts to a Khatri-Rao Factorization (KRF) method that teases out the individual channels based on simple rank-one matrix approximation steps. Numerical results show that the proposed decoupled channel estimation yields more accurate channel estimates than the classical least squares scheme.

RIS-Assisted Sensing: A Nested Tensor Decomposition-Based Approach

We study a monostatic multiple-input multiple-output sensing scenario assisted by a reconfigurable intelligent surface using tensor signal modeling. We propose a method that exploits the intrinsic multidimensional structure of the received echo signal, allowing us to recast the target sensing problem as a nested tensor-based decomposition problem to jointly estimate the delay, Doppler, and angular information of the target. We derive a two-stage approach based on the alternating least squares algorithm followed by the estimation of the signal parameters via rotational invariance techniques to extract the target parameters. Simulation results show that the proposed tensor-based algorithm yields accurate estimates of the sensing parameters with low complexity.

Channel Estimation for Beyond Diagonal RIS via Tensor Decomposition

This paper addresses the channel estimation problem for beyond diagonal reconfigurable intelligent surface (BD-RIS) from a tensor decomposition perspective. We first show that the received pilot signals can be arranged as a three-way tensor, allowing us to recast the cascaded channel estimation problem as a block Tucker decomposition problem that yields decoupled estimates for the involved channel matrices while offering a substantial performance gain over the conventional (matrix-based) least squares (LS) estimation method. More specifically, we develop two solutions to solve the problem. The first one is a closed-form solution that extracts the channel estimates via a block Tucker Kronecker factorization (BTKF), which boils down to solving a set of parallel rank-one matrix approximation problems. Exploiting such a low-rank property yields a noise rejection gain compared to the standard LS estimation scheme while allowing the two involved channels to be estimated separately. The second solution is based on a block Tucker alternating least squares (BTALS) algorithm that directly estimates the involved channel matrices using an iterative estimation procedure. We discuss the uniqueness and identifiability issues and their implications for training design. We also propose a tensor-based design of the BD-RIS training tensor for each algorithm that ensures unique decoupled channel estimates under trivial scaling ambiguities. Our numerical results shed light on the tradeoffs offered by BTKF and BTALS methods. Specifically, while the first enjoys fast and parallel extraction of the channel estimates in closed form, the second has a more flexible training design, allowing for a significantly reduced training overhead compared to the state-of-the-art LS method.

Tensor-based modeling/estimation of static channels in IRS-assisted MIMO systems

This paper proposes a tensor-based parametric modeling and estimation framework in multiple-input multiple-output (MIMO) systems assisted by intelligent reflecting surfaces (IRSs). We present two algorithms that exploit the tensor structure of the received pilot signal to estimate the concatenated channel. The first one is an iterative solution based on the alternating least squares algorithm. In contrast, the second method provides closed-form estimates of the involved parameters using the high order single value decomposition. Our numerical results show that our proposed tensor-based methods provide improved performance compared to competing state-of-the-art channel estimation schemes, thanks to the exploitation of the algebraic tensor structure of the combined channel without additional computational complexity.

Tensor-Based Channel Estimation and Data-Aided Tracking in IRS-Assisted MIMO Systems

This letter proposes a model for symbol detection in the uplink of IRS-assisted networks in the presence of channel aging. During the first stage, we model the received pilot signal as a tensor, which serves as a basis for both estimating the channel and configuring the IRS. In the second stage, the proposed tensor approach tracks the aging process to detect and estimate the transmitted data symbols. Our evaluations show that our proposed channel and symbol estimation schemes improve the performance of IRS-assisted systems in terms of the achieved bit error rate and mean squared error of the received data, compared to state of the art schemes.

Two-Dimensional Channel Parameter Estimation for IRS-Assisted Networks

This paper proposes a pilot decoupling-based two-dimensional channel parameter estimation method for intelligent reflecting surface (IRS)-assisted networks. We exploit the combined effect of Terahertz sparse propagation and the geometrical structure of arrays deployed at the base station, the IRS, and the user equipment to develop a low-complexity channel parameter estimation method. By means of a new pilot design along the horizontal and vertical domains, the overall channel parameter estimation problem is decoupled into different domains. Furthermore, with this decoupling, it is possible to simultaneously sense/estimate the channel parameters and to communicate with the sensed node. Specifically, we derive two estimators by decoupling the global problem into sub-problems and exploiting the built-in tensor structure of the sensing/estimation problem by means of multiple rank-one approximations. The Cram\'er-Rao lower bound is derived to assess the performance of the proposed estimators. We show that the two proposed methods yield accurate parameter estimates and outperform state-of-the-art methods in terms of complexity. The tradeoffs between performance and complexity offered by the proposed methods are discussed and numerically assessed.

Tensor-Based High-Resolution Channel Estimation for RIS-Assisted Communications

This letter proposes a high-resolution channel estimation for reconfigurable intelligent surface (RIS)-assisted communication networks. We exploit the inherent geometrical structure of the Terahertz propagation channel, including the antenna array geometries at the base station, the RIS, and the user equipment to design a tensor-based high-resolution channel estimator, referred to as the higher-dimensional rank-one approximations (HDR) method. By exploiting the geometrical structure of the combined base station-RIS-user equipment channel, the proposed HDR estimator recasts parametric channel estimation as a single sixth-order rank-one tensor approximation problem, which can be efficiently solved using higher-order singular value decomposition to deliver parallel estimates of each channel component vector. Numerical results show that the proposed method provides significantly more accurate parameter estimates compared to the competing state-of-the-art Khatri-Rao factorization and least squares methods. The HDR method also leads to higher spectral efficiency than its competitors, especially in the low signal-to-noise ratio regime, while having similar computational complexity as the classical least squares method.