arXiv subjects

Bruno Sokal

Publications and source records attributed to Bruno Sokal.

At least 19 recordsLinked to original sources

arXiv2026

Deconstructing the Composite Channel for Beyond Diagonal RIS: Channel Estimation and Beamforming Design

As beyond-diagonal reconfigurable intelligent surfaces (BD-RISs) gain increasing attention in high-frequency wireless communications, accurate and scalable channel-estimation methods become essential. This paper develops a parametric channel-estimation and beamforming framework that deconstructs the composite BD-RIS channel into its generating directional factors, revealing the tensor structure induced jointly by propagation geometry and beyond-diagonal scattering. We propose two tensor-based estimators: Fourth-Order Tucker Channel Estimation (FORTE), which models the partially structured channel as a fourth-order Tucker tensor, and Fourth-Order PARAFAC Channel Estimation (FORPE), which captures the fully structured channel through a fourth-order PARAFAC model. By exploiting partial and full channel geometry, the proposed methods achieve higher estimation accuracy than Least Squares and Block Tucker Kronecker Factorization benchmarks. In particular, FORTE outperforms FORPE due to its more compact representation, attaining an NMSE of about 10^{-4} at 5 dB SNR. In contrast, FORPE provides essentially unique estimates of the composite-channel factor matrices, whereas FORTE identifies their subspaces. The proposed deconstruction also provides a structured representation useful for sensing-oriented parameter extraction and tensor-structured system optimization. Finally, the Tensor Optimization Framework for Beamforming, Combining, and Scattering (TenFormer) achieves spectral efficiency comparable to the benchmark design while significantly reducing computational complexity through parallel tensor-structured optimization.

eess.SP↗

arXiv2026

Low-Complexity Tensor-Based Monostatic Sensing for IRS-Assisted Communication Systems

This paper proposes a tensor-based parameter estimation algorithm for sensing in an intelligent reflecting surface-assisted system. We present a higher-order singular value decomposition-based solution that exploits the tensor structure of the received echo signal to jointly estimate the target's delay, Doppler, and angular information. Our tensor-based solution can estimate the parameters individually at low complexity, benefiting from parallel computation. Complexity analysis is carried out in comparison with a baseline scheme that does not exploit the intrinsic multilinear structure of the sensed signal. Simulation results show that our proposed tensor-based method can achieve the same performance as the reference method while drastically reducing the computational complexity.

eess.SP↗

arXiv2026

PARAFAC-Based Time-Varying Channel Estimation for IRS-Aided Communications

This paper proposes a tensor-based parametric channel estimation technique for IRS-assisted communication systems with time-varying channel parameters. We exploit the multidimensional structure of the received signal by developing a $3$rd-order PARAFAC tensor model that is solved by employing the iteratively ALS algorithm. Our simulation results show that the proposed approach provides enhanced performance in terms of NMSE of the concatenated channel compared to the competing solutions by capitalizing on the intrinsic tensor structure of the received signal without increasing the computational complexity of the channel estimation.

eess.SP↗

arXiv2026

Decoupled Delay-Doppler and Angle Estimation in BD-RIS Sensing via Nested Tucker Decomposition

We study single-target localization in a group-connected beyond-diagonal reconfigurable intelligent surface (BD-RIS)-assisted monostatic network with K element groups. We propose a Nested Tensor Factorization and Estimation (NTFE) algorithm that models the received signal as a 3rd-order nested Tucker tensor, decoupling the delay-Doppler and angle domains. The resulting two-stage procedure estimates the target-bearing tensor factors and then extracts the other physical parameters using subspace and closed-form steps. We also analyze identifiability and uniqueness conditions. Simulations show that NTFE exploits the group-connected BD-RIS structure and outperforms state-of-the-art sensing benchmarks.

eess.SP↗

arXiv2026

Low-Complexity Tensor Beamforming for RIS-Aided Multiuser Multistream MIMO Systems

We address joint active and passive beamforming for uplink RIS-assisted multi-user multi-stream MIMO systems with joint detection. The coupled design of the receive combiner, block-diagonal user precoders, and RIS phase vector is formulated through a third-order composite channel tensor. Exploiting this multilinear structure, we propose a multi-stream tensor alternating optimization method that updates the combiner, user precoders, and RIS coefficients via low-dimensional tensor projections. Simulations show that the proposed method approaches a multi-start alternating-optimization benchmark while reducing computational complexity and improving large-RIS scaling.

eess.SP↗

arXiv2026

Multi-Target Estimation via Tensor Decomposition for Beyond Diagonal RIS-Aided Bistatic Sensing

We investigate the performance of beyond-diagonal reconfigurable intelligent surfaces (BD-RIS) for bistatic MIMO multi-target sensing using a two-stage tensor Doppler-delay-angle estimation (TenDAE). The first stage solves a Kronecker sum approximation (KSA) with a rank equal to the number of targets. The second stage employs a nested tensor factorization estimation (NTFE) that exploits the inherent multidimensional structure via two tensor decompositions that are solved in parallel. The first employs a PARAFAC decomposition to extract the targets' angles, and the second uses a nested PARAFAC decomposition to find the targets' delay and Doppler parameters. This two-stage approach decouples acquisition of the angles and delays/Dopplers using either alternating least squares or a higher-order singular value decomposition, followed by a high-resolution subspace technique, such as ESPRIT. We further compare the performance of a BD-RIS with a classical diagonal RIS. For the latter, we solve a Khatri-Rao sum approximation problem rather than the KSA due to the specific structure of the received signal. Notably, our NTFE framework remains blind to the underlying RIS architecture while simultaneously estimating all targets with minimal sensing resources. Additionally, we show that employing a nested-PARAFAC decomposition enables the decoupling of the delay-Doppler and angle domains. We also derive the Cram\'er-Rao lower bound to further assess the performance of the TenDAE framework. Finally, we numerically evaluate the solutions presented in this paper and demonstrate their efficiency in terms of RMSE compared with state-of-the-art approaches.

eess.SP↗

arXiv2026

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

eess.SP↗

arXiv2026

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.

eess.SP↗

arXiv2025

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.

eess.SP↗

arXiv2025

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.

eess.SP↗

arXiv2024

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.

eess.SP↗

arXiv2024

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.

eess.SP↗

arXiv2024

Structured Channel Estimation for RIS-Assisted THz Communications

This paper proposes tensor-based 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 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 than competing state-of-the-art tensor-based RIS channel estimation, Khatri-Rao factorization, and least squares methods. For higher-rank channels, the HDR method shows similar spectral efficiency compared to its competitors while having similar computational complexity to the classical least squares estimator.

eess.SP↗

arXiv2023

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.

eess.SP↗

arXiv2023

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.

eess.SP↗

arXiv2023

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ér-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.

eess.SP↗

arXiv2022

Channel Estimation in RIS-Assisted MIMO Systems Operating Under Imperfections

Reconfigurable intelligent surface is a potential technology component of future wireless networks due to its capability of shaping the wireless environment. The promising MIMO systems in terms of extended coverage and enhanced capacity are, however, critically dependent on the accuracy of the channel state information. However, traditional channel estimation schemes are not applicable in RIS-assisted MIMO networks, since passive RISs typically lack the signal processing capabilities that are assumed by channel estimation algorithms. This becomes most problematic when physical imperfections or electronic impairments affect the RIS due to its exposition to different environmental effects or caused by hardware limitations from the circuitry. While these real-world effects are typically ignored in the literature, in this paper we propose efficient channel estimation schemes for RIS-assisted MIMO systems taking different imperfections into account. Specifically, we propose two sets of tensor-based algorithms, based on the parallel factor analysis decomposition schemes. First, by assuming a long-term model in which the RIS imperfections, modeled as unknown phase shifts, are static within the channel coherence time we formulate an iterative alternating least squares (ALS)-based algorithm for the joint estimation of the communication channels and the unknown phase deviations. Next, we develop the short-term imperfection model, which allows both amplitude and phase RIS imperfections to be non-static with respect to the channel coherence time. We propose two iterative ALS-based and closed-form higher order singular value decomposition-based algorithms for the joint estimation of the channels and the unknown impairments. Moreover, we analyze the identifiability and computational complexity of the proposed algorithms and study the effects of various imperfections on the channel estimation quality.

cs.IT↗

arXiv2022

Reducing the Control Overhead of Intelligent Reconfigurable Surfaces Via a Tensor-Based Low-Rank Factorization Approach

Passive intelligent reconfigurable surfaces (IRS) are becoming an attractive component of cellular networks due to their ability of shaping the propagation environment and thereby improving the coverage. While passive IRS nodes incorporate a great number of phase-shifting elements and a controller entity, the phase-shifts are typically determined by the cellular base station (BS) due to its computational capability. Since the fine granularity control of the large number of phase-shifters may become prohibitive in practice, it is important to reduce the control overhead between the BS and the IRS controller. To this end, in this paper we propose a low-rank approximation of the near-optimal phase-shifts, which would incur prohibitively high communication overhead on the BS-IRS controller links. The key idea is to represent the potentially large IRS phase-shift vector using a low-rank tensor model. This is achieved by factorizing a tensorized version of the IRS phase-shift vector, where each component is modeled as the Kronecker product of a predefined number of factors of smaller sizes, which can be obtained via tensor decomposition algorithms. We show that the proposed low-rank models drastically reduce the required feedback requirements associated with the BS-IRS control links. Our simulation results indicate that the proposed method is especially attractive in scenarios with a strong line of sight component, in which case nearly the same spectral efficiency is reached as in the cases with near-optimal phase-shifts, but with a drastically reduced communication overhead.

eess.SP↗