betaFeedback

WorksEngineering

MPSi: Neural Extraction of Site-Specific Multipath Propagation Properties for Massive MIMO

Abstract

Accurate extraction of site-specific multipath propagation properties enables a wide range of wireless applications, including initial access, wideband channel reconstruction, and the generation of channel datasets for learning-based and continual-learning systems. Classical parametric channel-sounding algorithms such as RIMAX provide physically interpretable estimates, but their data-dependent model-order selection and iterative nonlinear refinement introduce substantial delay and computational cost. This paper proposes MPSi, a physics-guided neural framework that replaces these costly stages with a compact path-count network and a fixed-depth, deep-unfolded Levenberg-Marquardt refinement. MPSi estimates the complex gain, angle of arrival, and propagation delay of each multipath component while preserving the underlying physical channel model. We evaluate MPSi in two site-specific ray-traced environments, a small cell and a dense urban area, and show that it achieves initial-access and full-channel-estimation performance comparable to an enhanced RIMAX baseline while requiring significantly fewer optimization iterations. The reconstructed channels also yield bit-error-rate performance close to the perfect-channel knowledge reference. These results position MPSi as a promising low-overhead framework for extracting multipath propagation properties in massive-MIMO systems and for generating cell-specific channel pseudo-labels for training when direct ground-truth measurements are unavailable.

Introduction

MODERN wireless systems increasingly rely on accurate knowledge of the underlying communication channel. Physically, the channel is composed of multiple propagation paths whose delays, angles of arrival (AoAs), and complex gains combine to form the observed signal. Different applications in massive multiple-input multiple-output (MIMO) systems require different subsets of this electromagnetic structure: initial access primarily depends on the dominant-path AoA and is typically handled through codebook-based beam searches [1], [2], whereas wideband channel acquisition requires the full set of path parameters to reconstruct the channel across antennas and frequencies [3].

With the rise of machine-learning (ML)–based algorithms in wireless communication, the need for accurate channel representations and reliable data generation has become even more critical to train these models effectively [4]. If a single technique can accurately recover the true multipath structure of the environment, then it can simultaneously support all of these applications. This motivates the search for a unified, physically grounded estimator of the channel’s electromagnetic structure.

A variety of techniques currently address these applications individually. For initial access, codebook-based beam searches are commonly used [1], [2], where multiple beams are probed to identify the strongest initial direction. This procedure introduces delay and prevents the user from quickly operating at full link capacity. For channel acquisition, the complete set of path parameters enables reconstruction over unmeasured subcarriers [3], whereas conventional estimators must compute the channel on every subcarrier, increasing both pilot overhead and computational complexity.

A parametric time-domain model captures the underlying electromagnetic structure using the delay, AoA, and complex gain of each propagation path [3], [5], [6], reducing the dimensionality of the estimation problem while preserving the physical relationships governing how the channel varies across antennas and frequency. A method that extracts this multipath structure from limited pilot observations would therefore serve as a unified physical-layer tool for both initial access and channel estimation.

Separately, a major obstacle in the design of learning-based methods, is obtaining the training data needed for site-specific ML methods. Many ML-enhanced signal-processing frameworks, including learned codebook designs and learned channel estimation, depend on channel state information or other idealized labels as training targets [1], [4], [7], [8]. In practice, extracting these targets purely from field measurements remains challenging. When physical channel data is unavailable, existing studies typically rely on offline ray-tracing simulations or synthetic generative tools, leaving deployment-phase label acquisition unresolved. This bottleneck affects all site-specific ML applications and becomes even more severe

Maryam Rezvani and Raviraj Adve are with the Department of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario M5S 3G4, Canada (e-mail: [email protected]; [email protected]).

Akram bin Sediq and Amr El-Keyi are with Ericsson Canada, Kanata, ON K2K 2V6, Canada (e-mail: [email protected], [email protected]).

Contact [email protected] for further questions about this work. for continual-learning systems [9], [10] that require a real-time stream of fresh ground-truth labels.

While site-specific ray tracing can provide the electromagnetic properties of the communication channel needed for these applications, it incurs prohibitive computational complexity and execution delays [11], preventing its use as an online engine for automated retraining pipelines or real-time wireless operation. Neural-network accelerations have been proposed, but they either rely on an integrated ray-tracing engine to supply fine-grained path parameters such as AoAs on the fly [12], or restrict their scope to predicting macro-level features like path loss from environmental maps [13], [14]. Physics-inspired neural networks embed the propagation model through latent parameters, but they do not explicitly isolate individual active paths; instead, they learn the aggregate geometric effect [8], producing accurate channel estimates but yielding uninterpretable path parameters that cannot be directly mapped to other applications, including initial access and label generation.

Classical physics-based channel-sounding methods such as SAGE [15] and RIMAX [16] can recover multipath parameters accurately using the known sounding sequence, transmit power, and received signal. RiMAX introduced as a more accurate replacement for SAGE, combines data-dependent path-count selection, diffuse-multipath component (DMC) modeling, and iterative nonlinear refinement with cost-based step control. These operations yield high-fidelity estimates but introduce variable control flow and an unknown number of repeated optimization steps, making RIMAX unsuitable for low-delay wireless systems. Therefore, a predictable-depth technique that can extract realistic active-path parameters would be valuable for practical wireless communication.

Motivated by these limitations, we take a gray-box approach [17], [18] that integrates a neural network with a physics-based optimization framework. The proposed method uses deep unfolding and a small fully connected network to reduce the data-dependent complexity of RIMAX while preserving its physical under pinning. The network predicts an effective number of propagation paths, find the initial value for each path parameter, and uses a fixed number of unfolded Levenberg–Marquardt (LM) layers to refine the initial values. This yields a predictable-depth estimator that extracts the delay, AoA, and complex gain of the multipath components from a single pilot observation. The resulting estimates serve both as fixed-depth channel-sounding outputs and as auditable candidate labels for wireless-learning systems when perfect channel knowledge is unavailable.1

We refer to the proposed method as Multi-Path Sensing integrated with neural networks (MPSi).

Contributions: The main contributions of this work are summarized as follows:

  • We introduce MPSi, a deep-unfolded Levenberg–Marquardt (LM) architecture that estimates geometric path parameters from the received pilot signal, the known sounding sequence, and the pilot power.

  • We develop an unfolded LM update with trainable damping, a trainable step-trust schedule, and a Fisher-information-matrix-related positive-definite floor. These controls were introduced to prevent the early training instability observed with unconstrained unfolded updates, while replacing the nondifferentiable accept/reject loop of classical LM with stable, fully differentiable updates.

  • We propose a lightweight path-count network and a differentiable soft-top-kk gate that assigns relevance weights to a fixed set of initialized path candidates. This differentiable path-count mechanism allows model-order information to be learned jointly with the physical channel parameters.

  • We train the complete architecture end to end using a reconstruction objective that combines pilot-domain normalized mean-squared error, deep supervision across LM layers, and a path-count parsimony penalty.

  • We construct training, validation, and test datasets using the Sionna ray tracer [20] and 3D environments derived from OpenStreetMap data [21], with basestation (BS) locations and heights selected from operator deployment maps.

  • We evaluate MPSi for initial access, channel estimation, and pseudo-label generation, showing its versatility across multiple wireless-communication tasks.

  • We release the implementation of MPSi, including the trained models and dataset-generation scripts, as open-source resources to facilitate reproducibility and further research.2

Organization: The remainder of this paper is organized as follows. Section II presents the system model, including the multipath channel representation and the pilot observation model. Section III formulates the channel parameter extraction problem and reviews the classical RIMAX baseline. Section IV introduces the proposed MPSi architecture, its training objective, and the dataset-generation procedure. Section V presents the simulation results and compares MPSi with the considered baselines. Finally, Section VI concludes the paper and discusses directions for future work.

Notation: We use lowercase and uppercase boldface letters to denote vectors and matrices, respectively. The operators (⋅)H(\cdot)^{H}, (⋅)−1(\cdot)^{-1}, and ∥⋅∥2\lVert\cdot\rVert_{2} denote the conjugate transpose, matrix inverse, and second-order norm, respectively. The operators Re⁡{⋅}\operatorname{Re}\{\cdot\} and Im⁡{⋅}\operatorname{Im}\{\cdot\} denote the real and imaginary parts, and E[⋅]\mathbb{E}[\cdot] denotes statistical expectation. We use j=−1j=\sqrt{-1}, C\mathbb{C} for the set of complex numbers, and R\mathbb{R} for the set of real numbers. The notation An,mA_{n,m} denotes the element in the nnth row and mmth column of matrix A\mathbf{A}, while [a]n[\mathbf{a}]_{n} denotes the nnth element of vector a\mathbf{a}. We use

CN(μ,σ)\mathcal{CN}(\mu,\sigma) to denote a complex Gaussian distribution with mean μ\mu and covariance σ\sigma.

System Model

We consider an uplink system in which the BS employs a uniform planar array (UPA) with NxN_x horizontal and NyN_y vertical antenna elements, for a total of N=NxNyN=N_xN_y antennas. The user transmits pilot symbols over MM equispaced measured subcarriers out of a total of NscrN_{\mathrm{scr}} subcarriers of an orthogonal frequency division multiplexing/multiple access (OFDM/OFDMA) symbol. Users are assumed to be stationary and equipped with a single antenna.

The channel is modeled as a superposition of the propagation paths between the user and the BS array [16]:

Hn,m=∑p=1Pαp[a(θp,ϕp)]ne−j2πνmτp,(1)\mathbf{H}_{n,m}=\sum_{p=1}^{P}\alpha_p[\mathbf{a}(\theta_p,\phi_p)]_n e^{-{\rm j}2\pi\nu_m\tau_p}, \tag*{(1)}

where Hn,m\mathbf{H}_{n,m} is the channel coefficient at antenna nn and measured subcarrier mm, PP is the number of resolvable paths, αp\alpha_p is the complex baseband gain (which absorbs the carrier-frequency phase), θp\theta_p and ϕp\phi_p are the elevation and azimuth AoAs, τp\tau_p is the path delay, and νm\nu_m is the signed baseband frequency offset of FFT bin mm. The UPA steering vector is a=ay⊗ax\mathbf{a}=\mathbf{a}_y\otimes\mathbf{a}_x, with

ac(θp,ϕp)=[1,ejuc(θp,ϕp),…,ej(Nc−1)uc(θp,ϕp)]T,(2)\mathbf{a}_c(\theta_p,\phi_p)=\left[1,e^{{\rm j}u_c(\theta_p,\phi_p)},\ldots,e^{{\rm j}(N_c-1)u_c(\theta_p,\phi_p)}\right]^{T}, \tag*{(2)}

where

u(θp,ϕp)=2πdcλ[cos⁡θpcos⁡ϕp,cos⁡θpsin⁡ϕp,sin⁡θp]T\mathbf{u}(\theta_p,\phi_p)=2\pi\frac{d_c}{\lambda}\left[\cos\theta_p\cos\phi_p,\cos\theta_p\sin\phi_p,\sin\theta_p\right]^{T}

is the propagation-direction vector, ucu_c is its component along array axis c∈{x,y}c\in\{x,y\}, NcN_c is the number of elements along that axis, dcd_c is the corresponding inter-element spacing, and k=2π/λk=2\pi/\lambda is the wavenumber. Here, θp\theta_p is measured from the horizontal plane and ϕp∈[−π,π]\phi_p\in[-\pi,\pi] is the azimuth.

We use a constant-modulus quadratic-phase sounding sequence as transmitted pilots [16]. For a pilot length MM and root index ww, the sounding sequence is defined as:

spilot[m]=exp⁡(−jπwm(m+1)M),m=0,…,M−1.(3)s_{\mathrm{pilot}}[m]=\exp\left(-{\rm j}\frac{\pi wm(m+1)}{M}\right),\quad m=0,\ldots,M-1. \tag*{(3)}

The sequence has unit average power and its discrete Fourier transform (DFT) results in the frequency-domain pilot spilot[m]s_{\mathrm{pilot}}[m].

The resulting baseband frequency-domain pilot observation at the BS, Ypilot∈CN×M\mathbf{Y}_{\mathrm{pilot}}\in\mathbb{C}^{N\times M}, is

Ypilot[n,m]=PTHn,mspilot[m]+W[n,m].(4)\mathbf{Y}_{\mathrm{pilot}}[n,m]=\sqrt{P_T}\mathbf{H}_{n,m}s_{\mathrm{pilot}}[m]+\mathbf{W}[n,m]. \tag*{(4)}

Here, PTP_T is the pilot transmit power and W[n,m]\mathbf{W}[n,m] is the circularly symmetric complex Gaussian receiver-noise sample with variance σn2\sigma_n^2. We emphasize that the MM pilot measurements are collected on frequency-domain subcarriers within a single time slot and a single OFDM/OFDMA symbol.

Our goal is to estimate the path set {Φp}p=1P={(αp,θp,ϕp,τp)}p=1P\{\boldsymbol{\Phi}_p\}_{p=1}^{P}=\{(\alpha_p,\theta_p,\phi_p,\tau_p)\}_{p=1}^{P}. These parameters capture the electromagnetic properties of the communication channel and enable several key functions: identifying the dominant arrival direction for beam alignment, providing a low-dimensional representation from which the full spatial-frequency channel H\mathbf{H} can be reconstructed, and generating pseudo-labels for downstream ML algorithms.

Problem Statement

Given Ypilot\mathbf{Y}_{\mathrm{pilot}}, our goal is to estimate the number and parameters of the dominant propagation paths, i.e., solving the following optimization problem:

min⁡P,{Φp}p=1P∑m=0M−1∥Ypilot[:,m]−PTspilot[m]∑p=1Pαpa(ϕp,θp)e−j2πνmτp∥22(5)\min_{P,\{\boldsymbol{\Phi}_p\}_{p=1}^{P}}\sum_{m=0}^{M-1}\left\|\mathbf{Y}_{\mathrm{pilot}}[:,m]-\sqrt{P_T}s_{\mathrm{pilot}}[m]\sum_{p=1}^{P}\alpha_p\mathbf{a}(\phi_p,\theta_p)e^{-{\rm j}2\pi\nu_m\tau_p}\right\|_2^2 \tag*{(5)}
P∈{Pmin⁡,…,Pmax⁡},(6)P\in\{P_{\min},\ldots,P_{\max}\}, \tag*{(6)}
τp∈[0,τmax⁡].(7)\tau_p\in[0,\tau_{\max}]. \tag*{(7)}

The objective in (5) jointly estimates the active path count and the corresponding gains, delays, and AoAs by minimizing the pilot-reconstruction error. Constraint (5b) bounds the model order and (5c)–(5c) specify the physical parameter domains.

Measuring in the frequency domain gives us the opportunity to minimize the delay associated with collecting the data points needed for path-parameter extraction. On the other hand, classical channel-sounding algorithms such as SAGE [15] and RIMAX [6] operate in the time domain. To leverage their insights and algorithmic benefits, we therefore transform the optimization problem in (5) into the time domain as well. The advantages of this transformation will become clearer in the next section. Accordingly, we apply an inverse discrete Fourier transform (IDFT) to the MM frequency-domain measurements and form the equivalent time-domain objective as

min⁡P,{Φp}p=1P∑m=0M−1∥Ytd[:,m]−PT∑p=1Pαpa(ϕp,θp)std(m−τpfs)∥22(8)\min_{P,\{\boldsymbol{\Phi}_p\}_{p=1}^{P}}\sum_{m=0}^{M-1}\left\|\mathbf{Y}_{\mathrm{td}}[:,m]-\sqrt{P_T}\sum_{p=1}^{P}\alpha_p\mathbf{a}(\phi_p,\theta_p)s_{\mathrm{td}}(m-\tau_pf_s)\right\|_2^2 \tag*{(8)}
(5b)−(5c),(9)(5b)-(5c), \tag*{(9)}

where Ytd∈CN×M\mathbf{Y}_{\mathrm{td}}\in\mathbb{C}^{N\times M} is the time domain representation of the measured pilot matrix, fsf_s is the IDFT sampling rate equal to system bandwidth, and τpfs\tau_pf_s represents the path delay expressed in samples.

The main challenge in applying SAGE and RIMAX to solve (6) is their computational complexity. SAGE [15] requires an a priori path count and performs iterative expectation–maximization updates. Each iteration visits the paths sequentially and refines their parameters while holding the remaining estimates fixed, resulting in data-dependent processing time and strict sequential dependencies.

RIMAX [16], by contrast, was designed to achieve higher-accuracy estimation than SAGE by performing joint maximum-likelihood refinement using a prune-and-add model-order strategy combined with an LM nonlinear optimization step. RIMAX operates through an outer loop that manages the model order, where paths are added or pruned based on stability and contribution criteria. Within each outer iteration, an inner LM loop jointly refines all path parameters. The LM update employs a trust-region mechanism to select the step size, evaluating multiple candidate step lengths to prevent divergence and reduce the likelihood of converging to poor local optima. This combination of joint parameter updates, trust-region step-size selection, and dynamic model-order adaptation leads to high computational complexity and long execution times.

It is worth noting that because the objective in (8) is nonconvex, all algorithms are sensitive to initialization. We will discuss this issue in Section IV-B.

This high complexity makes these classical algorithms unsuitable for the real-time demands of modern wireless-communication applications. We therefore integrate neural-network and machine-learning techniques with the algorithmic insights of RIMAX to obtain a high-accuracy, low-complexity estimator for solving (6).

MPSi: Physics-Guided Neural Multipath Sensing

Our proposed technique, MPSi, integrates compact neural components with a physics-based parametric channel model to extract site-specific multipath properties from received pilot measurements. As summarized in Figure 1, at a high level, the framework first converts the transmit-power-normalized frequency-domain pilot into a time-domain sounding observation. A neural network, the PCN, then predicts an effective path count. In parallel, the initializer constructs a fixed set of Pmax⁡P_{\max} candidate paths whose initial gains determine their ranking. The predicted count and candidate ranking together form differentiable soft-top-KK gates. Finally, a fixed-depth unfolded LM refiner updates the candidate geometries and computes ridge-regularized [22] joint gain estimates, while the gates attenuate candidate contributions during reconstruction. The following sections detail each component of this design.

Overall MPSi processing flow

Figure 1. Overall MPSi processing flow.

Path Count Network

The first learned component of MPSi is the path-count network (PCN). Given a fixed maximum number of candidate paths Pmax⁡P_{\max}, the PCN predicts the effective number of active paths. During training, this continuous prediction controls a differentiable gate, while during inference, thresholding the gate yields a discrete retained set. This mechanism provides a soft relaxation of top-KK selection and is related to differentiable ranking and sorting methods [23, 24, 25].

The PCN input is formed using an antenna-averaged power profile computed as

Pavgm=1N∑n=1NPobs(n,m),(10)P_{\mathrm{avg}}^{m} = \frac{1}{N}\sum_{n=1}^{N} P_{\mathrm{obs}}^{(n,m)}, \tag*{(10)}

where Pobs(n,m)=∣Y~obs(n,m)∣2P_{\mathrm{obs}}^{(n,m)} = \lvert\widetilde{Y}_{\mathrm{obs}}^{(n,m)} \rvert^2 denotes the normalized observed power at measurement index mm and antenna nn, and Y~pilot=Ypilot/PT\widetilde{\mathbf{Y}}_{\mathrm{pilot}} = \mathbf{Y}_{\mathrm{pilot}}/\sqrt{P_{\mathrm{T}}}. This representation is closely related to the power-delay profile, whose shape, spread, and dominant peaks reflect the richness of the underlying multipath environment [26]. Averaging across antennas substantially reduces the input dimension while preserving the large-scale multipath structure. The PCN is therefore trained to infer the effective number of resolvable paths from this power distribution.

To enhance the distinguishability between paths with similar power levels, we compute a logarithmic power feature, which serves as the input to the PCN:

qm=log⁡(Pavgm+ϵ).(11)\mathbf{q}_{m} = \log\left(P_{\mathrm{avg}}^{m}+\epsilon\right). \tag*{(11)}

The small constant ϵ\epsilon ensures numerical stability when PavgmP_{\mathrm{avg}}^{m} approaches zero. The resulting feature vector q\mathbf{q} is then passed through the PCN, which consists of LPCNL_{\mathrm{PCN}} fully connected layers with ReLU activations. The iith hidden layer computes

fi=ReLU⁡(Wifi−1+bi),(12)\mathbf{f}_{i} = \operatorname{ReLU}\left(\mathbf{W}_{i}\mathbf{f}_{i-1}+\mathbf{b}_{i}\right), \tag*{(12)}

where WiW_i and bib_i are the weight matrix and bias of the iith layer, and fi−1f_{i-1} is the output of the (i−1)(i-1)th layer (with f0=qf_0=q).

The output layer of the PCN uses a sigmoid activation, σ(x)=11+e−x\sigma(x)=\frac{1}{1+e^{-x}}, to produce a continuous estimate of the number of paths between the predetermined bounds:

Pest=Pmin⁡+(Pmax⁡−Pmin⁡)σ(WoutfℓPCN+bout).(13)P_{\mathrm{est}}=P_{\min}+(P_{\max}-P_{\min})\sigma\left(\mathbf{W}_{\mathrm{out}}f_{\ell_{\mathrm{PCN}}}+b_{\mathrm{out}}\right). \tag*{(13)}

Thus, PestP_{\mathrm{est}} is a continuous scalar in [Pmin⁡,Pmax⁡][P_{\min},P_{\max}] and is not rounded during training.

Differentiable soft-top-KK path gate: Rather than pruning candidates during training, MPSi assigns each initialized path a continuous activation weight gp∈(0,1)g_p\in(0,1).

The initial values of all path gains (obtained as discussed in Section IV-B) are used to determine the ordering of the candidate paths. After the initializer computes the gains αp\alpha_p (Section IV-B), their magnitudes define the rank ρp\rho_p as

ρp=1+argsort⁡(−∣α∣)p,(14)\rho_p=1+\operatorname{argsort}(-|\alpha|)_p, \tag*{(14)}

where argsort⁡\operatorname{argsort} returns the indices that sort its argument in ascending order. Note that the ranking is used only to establish the ordering of the candidate paths and is treated as a constant during training. Consequently, gradients do not propagate through the argsort⁡\operatorname{argsort} operation.

Given the continuous path-count prediction PestP_{\mathrm{est}}, the differentiable soft-top-KK gate is defined as

gp=σ(Pest−ρpT),(15)g_p=\sigma\left(\frac{P_{\mathrm{est}}-\rho_p}{T}\right), \tag*{(15)}

where TT is a temperature parameter controlling the sharpness of the gating transition. When ρp<Pest\rho_p<P_{\mathrm{est}}, the argument of the sigmoid in (12) is positive, yielding gp≈1g_p\approx1. Conversely, when ρp>Pest\rho_p>P_{\mathrm{est}}, the argument becomes negative and gp≈0g_p\approx0.

During training, the gate values weight the candidate contributions in the channel model:

Hn,mg=∑p=1Pmax⁡gpαpan(θp,ϕp)e−ȷ2πνmτp,(16)\mathbf{H}^{g}_{n,m}=\sum_{p=1}^{P_{\max}}g_p\alpha_p\mathbf{a}_n(\theta_p,\phi_p)e^{-\jmath2\pi\nu_m\tau_p}, \tag*{(16)}

where Hn,mg\mathbf{H}^{g}_{n,m} is the gated channel response at antenna nn and subcarrier mm. Incorporating the gate into the channel model allows candidate paths to be softly selected during training while preserving end-to-end differentiability.

Note that since the sigmoid gate is differentiable with respect to PestP_{\mathrm{est}}, the reconstruction loss and its gradient propagate through the gate to the PCN. Consequently, the network learns the number of paths that contribute to the reconstruction of the communication channel. At inference time, this differentiable mechanism is replaced by a hard selection of the active paths, defined as P={p:gp≥γgate}\mathcal{P}=\{p:g_p\ge\gamma_{\mathrm{gate}}\}, where γgate=0.5\gamma_{\mathrm{gate}}=0.5.

Note that the RIMAX and MPSi path-selection procedures differ fundamentally. RIMAX distinguishes specular multipath components from a dense-multipath component that is represented statistically through a covariance model [16]. Its model-order selection relies on iterative prune-and-add operations that evaluate whether newly introduced components reduce the cost function, adding to the algorithm’s complexity and data-dependent control flow. By contrast, MPSi operates on a finite candidate set and uses a learned gate to retain the components that improve reconstruction under the adopted discrete-path model. Accordingly, the estimated count should be interpreted as the number of effective resolvable components supported by the model and measurement configuration, rather than as a direct count of all physical scattering mechanisms.

In the next section, we detail the procedure used to compute the initial path parameters.

Initialization

The objective in (6a) is nonconvex in both delay and AoA, making initialization critical for the accuracy of the subsequent refinement. We adopt RIMAX’s successive multipath initialization with a coarse angular grid and augment it with an additional Nelder–Mead (NM) refinement step3^{3} [27]. Delay is refined through a one-dimensional search, while the angular update performs a two-dimensional NM search over azimuth and elevation. The resulting initialized angles are then converted to the scaled spatial–frequency coordinates used by the remainder of the MPSi algorithm.

The frequency-domain observation is first normalized by the known pilot-amplitude scale and transformed to the time domain. We denote the resulting matrix by

Y~td=IFFT⁡(Y~pilot)=IFFT⁡(Ypilot/PT).(17)\widetilde{\mathbf{Y}}_{\mathrm{td}}=\operatorname{IFFT}\left(\widetilde{\mathbf{Y}}_{\mathrm{pilot}}\right)=\operatorname{IFFT}\left(\mathbf{Y}_{\mathrm{pilot}}/\sqrt{P_T}\right). \tag*{(17)}

The matrix Y~td∈CN×M\widetilde{\mathbf{Y}}_{\mathrm{td}}\in\mathbb{C}^{N\times M} preserves the NN antenna channels across MM transformed measurement samples. Before extracting the parameters for path pp, the corresponding residual to that path is calculated as:

Rp−1[:,m]=Y~td[:,m]−∑l=1p−1αla(ϕl,θl)std(m−τlfs).(18)\mathbf{R}_{p-1}[:,m]=\widetilde{\mathbf{Y}}_{\mathrm{td}}[:,m]-\sum_{l=1}^{p-1}\alpha_l\mathbf{a}(\phi_l,\theta_l)\mathbf{s}_{\mathrm{td}}(m-\tau_lf_s). \tag*{(18)}

A first candidate delay estimate is obtained by computing the cross-correlation between the residual and the pilot signal:

G=IFFT⁡[FFT⁡(Rp−1)⊙FFT⁡(s)H].(19)\mathbf{G}=\operatorname{IFFT}\left[\operatorname{FFT}(\mathbf{R}_{p-1})\odot\operatorname{FFT}(\mathbf{s})^H\right]. \tag*{(19)}

To define the coarse grid search, let A\mathcal{A} denote the coarse azimuth–elevation grid, let τmax⁡\tau_{\max} be the configured delay cap in samples, and let Dcoarse=min⁡(τmax⁡,M)D_{\mathrm{coarse}}=\min(\tau_{\max},M) denote the usable integer-lag search span. The coarse delay grid is T={0,Δτ,2Δτ,…,(Dcoarse−1)Δτ}\mathcal{T}=\{0,\Delta_\tau,2\Delta_\tau,\ldots,(D_{\mathrm{coarse}}-1)\Delta_\tau\}, Δτ=1/fs\Delta_\tau=1/f_s, where Δτ\Delta_\tau is the sampling period. The fractional-delay NM refinement then searches the continuous interval [0,Dcoarse/fs)[0,D_{\mathrm{coarse}}/f_s), while the NM refinement in the angular domain searches the full azimuth–elevation range.

For each integer delay bin d∈Td\in\mathcal{T}, the initializer evaluates the best beamformed response over the angle grid:

Γ(d)=max⁡(ϕ,θ)∈A∥aH(θ,ϕ)G[:,d]∥.(20)\Gamma(d)=\max_{(\phi,\theta)\in\mathcal{A}}\left\|\mathbf{a}^{H}(\theta,\phi)\mathbf{G}[:,d]\right\|. \tag*{(20)}

3^{3}NM is a derivative-free optimization method similar to pattern search; it dynamically adapts a line or a two-dimensional triangle to locate the function’s minimizer.

Up to eight delay candidates separated by more than two samples are retained. For each retained candidate cc, the algorithm refines the delay by solving

τc∗=arg⁡max⁡τ ∥aH(ϕc,θc)z(τ)∥(21)\tau_c^{*} = \underset{\tau}{\arg\max}\ \left\lVert\mathbf{a}^{H}(\phi_c,\theta_c)\mathbf{z}(\tau)\right\rVert \tag*{(21)}

where (ϕc,θc)(\phi_c,\theta_c) is the AoA corresponding to the ccth retained candidate and

z(τ)=Rp−1stdH(τfs).(22)\mathbf{z}(\tau) = \mathbf{R}_{p}^{-1}\mathbf{s}_{\mathrm{td}}^{H}(\tau f_s). \tag*{(22)}

Given τc∗\tau_c^{*} and z(τc∗)\mathbf{z}(\tau_c^{*}), the AoA is updated once more by solving

(ϕ∗,θ∗)=arg⁡max⁡(ϕ,θ) ∥aH(ϕ,θ)z(τc∗)∥.(23)(\phi^{*},\theta^{*}) = \underset{(\phi,\theta)}{\arg\max}\ \left\lVert\mathbf{a}^{H}(\phi,\theta)\mathbf{z}(\tau_c^{*})\right\rVert. \tag*{(23)}

The updates in (21) and (23) alternate for three sweeps. Then we employ NM algorithm once to refine the scalar delay in (21) and the two angular coordinates in (23), producing continuous-valued estimates from the coarse-grid seeds.

Given the refined delay and AoA of candidate pp, its complex gain is calculated by least-squares (LS) projection:

αp=aH(θp∗,ϕp∗)Rp−1stdH(τp∗fs)max⁡(∥a(θp∗,ϕp∗)∥22∥std∥22,ϵinit).(24)\alpha_p = \frac{\mathbf{a}^{H}(\theta_p^{*},\phi_p^{*})\mathbf{R}_{p}^{-1}\mathbf{s}_{\mathrm{td}}^{H}(\tau_p^{*}f_s)}{\max\left(\left\lVert\mathbf{a}(\theta_p^{*},\phi_p^{*})\right\rVert_2^2\left\lVert\mathbf{s}_{\mathrm{td}}\right\rVert_2^2,\epsilon_{\mathrm{init}}\right)}. \tag*{(24)}

Note that in 21, R∈CN×M\mathbf{R} \in\mathbb{C}^{N\times M}, a∈CN×1\mathbf{a} \in\mathbb{C}^{N\times1}, and s∈CM×1\mathbf{s} \in\mathbb{C}^{M\times1}, so the result is a scalar.

Also note that the initializer is executed once per sample outside the differentiable graph and returns a fixed Pmax⁡P_{\max}-candidate state during training and a PestP_{\mathrm{est}}-candidate state during inference. The PCN does not control how many candidates are initialized during training; instead, it uses their initial gain ranking to produce differentiable gates. During inference, the smaller PestP_{\mathrm{est}} reduces the complexity of the unfolded refinement and reconstruction stages.

In the next section, we discuss the proposed unfolded refiner network, which completes the proposed architecture by enabling fully differentiable path-parameter estimation and channel-complexity recovery.

Deep-Unfolded Refiner Network

The refiner is inspired by the classical RIMAX [16] LM procedure and jointly updates the geometric parameters of all Pmax⁡P_{\max} candidates during training and PestP_{\mathrm{est}} candidates during inference. Each layer computes ridge-regularized [22] joint gain estimates from the unweighted candidate basis and applies the gates during signal reconstruction, thereby reducing the computational complexity of the refiner stage. The following subsections describe the individual stages of the refiner.

Geometric State

Following the RIMAX spatial-frequency parameterization, the refiner operates on

x=[uxT,uyT,τsampT]T,(25)\mathbf{x} = \left[\mathbf{u}_{x}^{T},\mathbf{u}_{y}^{T},\boldsymbol{\tau}_{\mathrm{samp}}^{T}\right]^{T}, \tag*{(25)}

which reparameterizes the physical azimuth, elevation, and delay of the fixed candidate set. The initial state x0\mathbf{x}_0 is supplied by the initializer in Section IV-B.

For path pp, the scaled spatial-frequency coordinates are defined as ux,p=2πdxλcos⁡(θp)cos⁡(ϕp)u_{x,p}=2\pi\frac{d_x}{\lambda}\cos(\theta_p)\cos(\phi_p), uy,p=2πdyλcos⁡(θp)sin⁡(ϕp)u_{y,p}=2\pi\frac{d_y}{\lambda}\cos(\theta_p)\sin(\phi_p), and τsamp,p=τpfs\tau_{\mathrm{samp},p}=\tau_p f_s, where dxd_x and dyd_y are the inter-element spacings, λ\lambda is the carrier wavelength, and fsf_s is the sampling frequency.

Ridge-Regularized Joint Gain Estimation

For a given geometric state, the joint ridge-regularized gain estimate is computed using the unweighted candidate basis:

αridge(x)=(G+dridgeIPmax⁡)−1m,(26)\boldsymbol{\alpha}_{\mathrm{ridge}}(\mathbf{x}) = \left(\mathbf{G}+d_{\mathrm{ridge}}\mathbf{I}_{P_{\max}}\right)^{-1}\mathbf{m}, \tag*{(26)}

where G\mathbf{G} is the spatio-temporal Gram matrix, expressed as the Hadamard product of the spatial and temporal Gram matrices:

G=Gs∘Gt,(27)\mathbf{G}=\mathbf{G}^{s}\circ\mathbf{G}^{t}, \tag*{(27)}
Gp,qs=apHaq,(28)G^{s}_{p,q}=\mathbf{a}_{p}^{H}\mathbf{a}_{q}, \tag*{(28)}
Gp,qt=spHsq.(29)G^{t}_{p,q}=\mathbf{s}_{p}^{H}\mathbf{s}_{q}. \tag*{(29)}

Note that since G\mathbf{G} is a rank-1 matrix, the inversion in (26) can be computed efficiently using the matrix inversion lemma. For the current geometric state, each candidate path pp is represented through its steering vector and delayed sounding sequence,

ap=a(ux,p,uy,p)∈CN,(30)\mathbf{a}_{p}=\mathbf{a}(u_{x,p},u_{y,p})\in\mathbb{C}^{N}, \tag*{(30)}
sp=s[τsamp,p]∈CM,(31)\mathbf{s}_{p}=\mathbf{s}[\tau_{\mathrm{samp},p}]\in\mathbb{C}^{M}, \tag*{(31)}

which together define the matched-filter right-hand side,

mp=apHzp,(32)\mathbf{m}_{p}=\mathbf{a}_{p}^{H}\mathbf{z}_{p}, \tag*{(32)}
zp=Ytds‾p.(33)\mathbf{z}_{p}=\mathbf{Y}_{\mathrm{td}}\overline{\mathbf{s}}_{p}. \tag*{(33)}

To stabilize the subsequent gain fit, a trainable raw ridge parameter βαraw\beta_{\alpha}^{\mathrm{raw}} produces the regularization term

dridge=max⁡(softplus⁡(βαraw)Ps,dfloor),(34)d_{\mathrm{ridge}}=\max\left(\operatorname{softplus}(\beta_{\alpha}^{\mathrm{raw}})P_s,d_{\mathrm{floor}}\right), \tag*{(34)}
dfloor=ϵridge×max⁡(Ps,G‾+1),(35)d_{\mathrm{floor}}=\epsilon_{\mathrm{ridge}}\times\max(P_s,\overline{G}+1), \tag*{(35)}

where Ps=∥s∥22P_s=\lVert\mathbf{s}\rVert_2^2 is the sounding-sequence energy, G‾=1Pmax⁡tr⁡(G)\overline{G}=\frac{1}{P_{\max}}\operatorname{tr}(\mathbf{G}), ϵridge=10−6\epsilon_{\mathrm{ridge}}=10^{-6}, and softplus⁡(x)=log⁡(1+ex)\operatorname{softplus}(x)=\log(1+e^x). This regularization is applied when computing the joint ridge-regularized gain estimate αridge\boldsymbol{\alpha}_{\mathrm{ridge}} from the full, unweighted candidate basis. Because this gain-solve is performed before any gate weighting is applied, αridge\boldsymbol{\alpha}_{\mathrm{ridge}} does not minimize the gated LS objective. Instead, it provides a numerically stable intermediate estimate that the unfolded refinement layers subsequently improve.

Gated Residual and Jacobian

The LM step is obtained by linearizing the residual of each path with respect to the geometric parameters, which requires the Jacobian of that residual. Accordingly, we first form the residual and then compute its Jacobian. With soft gates included, the complex residual is

rp(x)=Ytd−∑l=1l≠pPmax⁡glαl(x)al(x)slT(x),(36)\mathbf{r}_{p}(\mathbf{x})=\mathbf{Y}_{\mathrm{td}}-\sum_{\substack{l=1\\l\ne p}}^{P_{\max}}\mathbf{g}_{l}\alpha_{l}(\mathbf{x})\mathbf{a}_{l}(\mathbf{x})\mathbf{s}_{l}^{T}(\mathbf{x}), \tag*{(36)}

where αp(x)=[αridge(x)]p\alpha_p(\mathbf{x})=[\boldsymbol{\alpha}_{\mathrm{ridge}}(\mathbf{x})]_p is the geometry-dependent gain from the ungated ridge fit. At LM layer ℓ\ell, the refiner works with the real-valued residual

rℓ=[Re⁡(r(xℓ))Im⁡(r(xℓ))]∈R2MN,(37)\mathbf{r}_{\ell} = \begin{bmatrix} \operatorname{Re}(\mathbf{r}(\mathbf{x}_{\ell}))\\ \operatorname{Im}(\mathbf{r}(\mathbf{x}_{\ell})) \end{bmatrix} \in\mathbb{R}^{2MN}, \tag*{(37)}

where vectorization is implicit and the real representation enables a real-valued LM system. Therefore, the corresponding Jacobian is

Jℓ=∂r∂xℓ∈R2MN×3Pmax⁡.(38)\mathbf{J}_{\ell} = \frac{\partial\mathbf{r}}{\partial\mathbf{x}_{\ell}} \in\mathbb{R}^{2MN \times3P_{\max}}. \tag*{(38)}

Because the gain estimates αp(x)\alpha_p(\mathbf{x}) depend on the geometric state through the ridge-regularized least-squares solve, automatic differentiation propagates through both the gain computation and the gated synthesis. As a result, the Jacobian captures the sensitivity of the gains as well as the residual. Importantly, it is not the profiled Jacobian associated with variable-projection methods, as used in RIMAX, because αridge(x)\alpha_{\mathrm{ridge}}(\mathbf{x}) is obtained from an ungated ridge-regularized solve rather than as the conditional minimizer of the gated LS objective:

Jℓ=∂∂xℓr(xℓ,αridge(xℓ)).(39)\mathbf{J}_{\ell} = \frac{\partial}{\partial\mathbf{x}_{\ell}}\mathbf{r}(\mathbf{x}_{\ell},\alpha_{\mathrm{ridge}}(\mathbf{x}_{\ell})). \tag*{(39)}

This Jacobian is obtained directly via automatic differentiation.

Gauss-Newton Matrix and Score

Given the gain-coupled residual Jacobian at layer ℓ\ell, the Gauss-Newton curvature approximation and residual score are

Fℓ=JℓTJℓ, and Sℓ=JℓTrℓ.(40)\mathbf{F}_{\ell} = \mathbf{J}_{\ell}^{\mathsf{T}}\mathbf{J}_{\ell}, \text{ and } \mathbf{S}_{\ell} = \mathbf{J}_{\ell}^{\mathsf{T}}\mathbf{r}_{\ell}. \tag*{(40)}

Here the matrix Fℓ\mathbf{F}_{\ell} is positive semidefinite and approximates the local curvature of the LS objective, while Sℓ\mathbf{S}_{\ell} provides the corresponding score. We retain the symbol Fℓ\mathbf{F}_{\ell} because this matrix is like Fisher-information (FIM) under the adopted Gaussian residual model.

Learned Damping and Positive-Definite Floor

Each LM layer of the refiner network introduces trainable parameters that control the stability and effectiveness of the LM update. These parameters enter the LM system matrix, which is constructed from the FIM and governs the curvature of the GN step. We begin by describing the learned damping parameters and their role.

In classical LM, the damping parameter is adjusted adaptively through an accept/reject loop [16], which increases algorithmic complexity and introduces nondifferentiable behavior. In the proposed deep-unfolded LM refiner, this mechanism is replaced by trainable, layer-wise damping parameters, i.e., λℓraw∈R3\boldsymbol{\lambda}_{\ell}^{\mathrm{raw}} \in\mathbb{R}^{3}. To ensure positivity, these raw parameters are passed through a softplus activation, i.e., λℓ=softplus⁡(λℓraw)∈R>03\boldsymbol{\lambda}_{\ell}=\operatorname{softplus}(\boldsymbol{\lambda}_{\ell}^{\mathrm{raw}})\in\mathbb{R}_{>0}^{3}.

Because (ux,uy,τsamp)(u_x,u_y,\tau_{\mathrm{samp}}) have different scales and curvature, each layer uses one damping value per parameter type. During training, these values are expanded to length 3Pmax⁡3P_{\max}:

λℓ(Pmax⁡)=[λℓ,x1Pmax⁡λℓ,y1Pmax⁡λℓ,τ1Pmax⁡],(41)\boldsymbol{\lambda}_{\ell}^{(P_{\max})} = \begin{bmatrix} \lambda_{\ell,x}\mathbf{1}_{P_{\max}}\\ \lambda_{\ell,y}\mathbf{1}_{P_{\max}}\\ \lambda_{\ell,\tau}\mathbf{1}_{P_{\max}} \end{bmatrix}, \tag*{(41)}

where 1n\mathbf{1}_n denotes a vector of ones of length nn. These damping values are shared across all candidate paths within a layer, ensuring consistent regularization for each parameter type while keeping the LM system well-scaled.

To further enhance numerical stability, especially during training, and to prevent near-singularity of the LM system matrix, a Fisher-information-relative floor is added:

μℓ=λfloor,rel⋅max⁡(13Pmax⁡tr⁡(Fℓ),10−12).(42)\mu_{\ell}=\lambda_{\mathrm{floor,rel}}\cdot\max\left(\frac{1}{3P_{\max}}\operatorname{tr}(\mathbf{F}_{\ell}),10^{-12}\right). \tag*{(42)}

This term scales with the average GN curvature and improves conditioning of the LM system.

Combining all components, the LM system matrix at layer ℓ\ell is described as:

Aℓ=Fℓ+diag⁡(λℓ(Pmax⁡))+μℓI3Pmax⁡.(43)\mathbf{A}_{\ell}=\mathbf{F}_{\ell}+\operatorname{diag}\left(\boldsymbol{\lambda}_{\ell}^{(P_{\max})}\right)+\mu_{\ell}\mathbf{I}_{3P_{\max}}. \tag*{(43)}

The resulting system replaces online cost-based damping adaptation of classical LM with a fixed, trainable layer-wise schedule.

LM Update

Given the LM system matrix Aℓ\mathbf{A}_{\ell} and the score vector Sℓ\mathbf{S}_{\ell}, the LM update direction at layer ℓ\ell is obtained by solving the linear system

Aℓδℓ=Sℓ,(44)\mathbf{A}_{\ell}\boldsymbol{\delta}_{\ell}=\mathbf{S}_{\ell}, \tag*{(44)}

where δℓ∈R3Pmax⁡\boldsymbol{\delta}_{\ell}\in\mathbb{R}^{3P_{\max}} is the ridge-regularized GN direction used to update the geometric parameters at that layer.

Each LM layer also includes a trainable step-trust scalar that controls the magnitude of the update:

ηℓ=σ(ηℓraw)∈(0,1),(45)\eta_{\ell}=\sigma(\eta_{\ell}^{\mathrm{raw}})\in(0,1), \tag*{(45)}

where σ(⋅)\sigma(\cdot) is the sigmoid function. The scalar is learned for each layer and is shared across samples and candidate paths.

The geometric state is then updated according to

xℓ+1=xℓ−ηℓδℓ,(46)\mathbf{x}_{\ell+1}=\mathbf{x}_{\ell}-\eta_{\ell}\boldsymbol{\delta}_{\ell}, \tag*{(46)}

Deep Supervision

At each layer ℓ\ell, the current geometric state (ux,ℓ,uy,ℓ,τsamp,ℓ)(u_{x,\ell},u_{y,\ell},\tau_{\mathrm{samp},\ell}) and the ridge-regularized gain estimates αridge,ℓ\boldsymbol{\alpha}_{\mathrm{ridge},\ell} are used to synthesize a reconstruction of the received pilot matrix using (4) and (16), i.e.,

Y^ℓ=Synthesis⁡(ux,ℓ,uy,ℓ,τsamp,ℓ,αridge,ℓ,g).(47)\widehat{\mathbf{Y}}_{\ell}=\operatorname{Synthesis}(u_{x,\ell},u_{y,\ell},\tau_{\mathrm{samp},\ell},\boldsymbol{\alpha}_{\mathrm{ridge},\ell},\mathbf{g}). \tag*{(47)}

where g\mathbf{g} is the gate vector defined in Section IV-A. The gates weight all candidate contributions continuously during training.

Each reconstruction is then compared to the measured time domain signal in the pilot Ytd\mathbf{Y}_{\mathrm{td}}, and the resulting discrepancy contributes to the LM supervision loss defined as:

LLM=1L∑ℓ=1L∥Ytd−Y^ℓ∥F2max⁡(∥Ytd∥F2,ϵtiny).(48)\mathcal{L}_{\mathrm{LM}}=\frac{1}{L}\sum_{\ell=1}^{L}\frac{\left\lVert\mathbf{Y}_{\mathrm{td}}-\widehat{\mathbf{Y}}_{\ell}\right\rVert_{F}^{2}}{\max\left(\left\lVert\mathbf{Y}_{\mathrm{td}}\right\rVert_{F}^{2},\epsilon_{\mathrm{tiny}}\right)}. \tag*{(48)}

Here, Y^ℓ\widehat{\mathbf{Y}}_{\ell} denotes the reconstructed received signal obtained from the geometric state and ridge-regularized gain estimates at layer ℓ\ell. This term provides a reconstruction objective at every unfolded depth and directly trains the damping and step-trust schedules.

Training Loss

The training objective combines final reconstruction accuracy, layer-wise LM deep supervision, and path-count parsimony.

Final Reconstruction NMSE

The normalized mean-squared error (NMSE) between the measured and reconstructed time-domain pilot is given by

Lch=∥Y−Y^∥F2max⁡(∥Y∥F2,ϵtiny)(49)\mathcal{L}_{\mathrm{ch}} = \frac{\left\lVert\mathbf{Y} - \widehat{\mathbf{Y}} \right\rVert_{F}^{2}}{\max\left(\left\lVert\mathbf{Y} \right\rVert_{F}^{2}, \epsilon_{\mathrm{tiny}}\right)} \tag*{(49)}

where Y^\widehat{\mathbf{Y}} is the reconstructed received signal obtained from the final estimated path parameters, and ϵtiny\epsilon_{\mathrm{tiny}} is a small numerical stability constant.

Path-Count Parsimony

To encourage sparse path selection, a path-count penalty is included:

Lcount=PestPmax⁡.(50)\mathcal{L}_{\mathrm{count}} = \frac{P_{\mathrm{est}}}{P_{\max}}. \tag*{(50)}

Complete Training Objective

The reconstruction NMSE, the deep-supervision loss defined in (48), and the path-count parsimony together form the training objective:

L=Lch+λLMLLM+λcountLcount,(51)\mathcal{L} = \mathcal{L}_{\mathrm{ch}} + \lambda_{\mathrm{LM}}\mathcal{L}_{\mathrm{LM}} + \lambda_{\mathrm{count}}\mathcal{L}_{\mathrm{count}}, \tag*{(51)}

where λLM\lambda_{\mathrm{LM}} and λcount\lambda_{\mathrm{count}} are regularization weights that balance the contributions of the different loss components.

Training, Validation, and Test Data Acquisition

MPSi requires the received signal matrix in the pilot phase Ytd\mathbf{Y}_{\mathrm{td}}, the known sounding sequence, and the pilot transmit power. In a practical deployment, these observations could be collected at different user locations throughout a serving cell.

Because measured BS data were unavailable for this study, we relied on simulated channels to evaluate the proposed method. We used the Sionna ray tracer [20] with 3D environments constructed from OpenStreetMap data [21]; user locations were uniformly sampled across each environment, and the BS position and height were selected based on publicly available operator deployment information.

For each user position, the ray tracer produced the geometric path parameters (AoA, delays, and path gains). These parameters were then used to synthesize the channel and generate the corresponding received pilot matrices according to the system model in (4), with additive noise applied as described in Section II. This process effectively emulates placing users throughout the environment and measuring the resulting channels.

Importantly, the ray-traced path parameters are not used as training labels. Training relies solely on the received pilot measurements, the known sounding sequence, and the transmit power through the loss function defined in Section IV-D. The role of the ray tracer is only to generate the pilot observations used in this study. Consequently, while Sionna is used here to create realistic

training and test datasets, the proposed MPSi framework can be trained using real measurement data whenever received pilot observations are available.

A Note on the Complexity of MPSi

The proposed MPSi algorithm provides low-complexity yet accurate estimation of communication-path parameters. To contextualize its complexity, we compare MPSi with classical RIMAX, an accurate but computationally heavier algorithm designed for related geometric channel-estimation tasks.

Classical RIMAX performs data-dependent model-order updates together with cost-checked LM refinement [16], resulting in a variable number of iterations across observations. Its prune-and-add strategy keeps the LM complexity in check: the number of active paths is initialized conservatively, and at each outer iteration the stability of the current paths is evaluated. Paths are then added or removed until convergence, causing the iteration count to depend on the information content of the received signal.

By contrast, at inference, the estimated number of active paths PestP_{\mathrm{est}} in MPSi directly reduces the LM system to a 3Pest×3Pest3P_{\mathrm{est}} \times3P_{\mathrm{est}} matrix, lowering complexity relative to the training phase. Figure 2 compares the average number of iterations used by both methods: RIMAX reports the sum of its inner iterations across all outer iterations, whereas MPSi always performs a fixed number LLM=2\mathcal{L}_{\mathrm{LM}} = 2 of unfolded layers used in the experiments. For this comparison, RIMAX-NM uses the initialization method described in Section IV-B, while classical RIMAX uses its standard initialization without NM.

Figure 2. The number of iterations in proposed MPSi compared to the RIMAX algorithm in Bahen and Dundas scenarios, respectively.

As depicted in Figure 2, the number of RIMAX iterations depends on the information content of the received signal: higher transmit power yields stronger resolvable paths and therefore fewer iterations. MPSi, by construction, executes a fixed number of unfolded layers at every pilot power, independent of PTP_{\mathrm{T}}. This comparison shows that MPSi achieves a bounded and substantially smaller refinement depth than RIMAX. It is worth noting that iteration count does not represent algorithmic latency; in this paper it is used solely as a control-flow complexity indicator. Deployment-level latency claims require operation counts and timing measurements on a specified hardware and software platform with optimized implementations of both algorithms [28], which is beyond the scope of this paper.

Simulation Results

This section evaluates MPSi for initial access, full-channel estimation, and pseudo-label generation. The BS employs a 32-element UPA with eight horizontal and four vertical elements, half-wavelength spacing, a carrier frequency of 5 GHz, and a nominal baseband measurement bandwidth of 100 MHz.

For each realization, a user is placed at a sampled map location, and Sionna RT [20] generates the propagation paths for the configured scene. These parameters are used with (1) and (4) to synthesize the channel and the corresponding noisy pilot observation. The receiver-noise power is set to −95 dBm. We consider two Toronto environments: the Bahen Centre at the University of Toronto and the Yonge-Dundas intersection in the city core, referred to as the Bahen and Dundas scenarios, respectively. These environments, therefore, represent a small cell and a dense urban area, as shown in Figure 3. The Bahen and Dundas scenarios use M=64M = 64 and M=256M = 256 pilot FFT bins, respectively, with bin spacings 100100 MHz/MM; full-band channel and BER evaluation uses 1024 FFT bins over the same bandwidth. MPSi is trained separately for each environment using 512 realizations, a batch size of 32, and the Adam optimizer [29] with a learning rate of 0.0003. The test results are obtained from 100 additional realizations generated independently of the training data. Table I summarizes the principal learning parameters.

Figure 3. Analyzed maps and corresponding BS coverage zones. The BS locations are shown with blue dots: (a) the University of Toronto campus (Bahen Centre), and (b) the Yonge–Dundas intersection in downtown Toronto, ON, Canada.

Note that in the following analysis, the empirical cumulative distribution function (CDF) for a metric xx evaluated over RR realizations is defined as F^x(z)=1R∑r=1R1[xr≤z]\widehat{F}_x(z) = \frac{1}{R}\sum_{r=1}^{R}\mathbb{1}[x_r \le z]. Here xrx_r denotes the metric value for realization rr and 1[A]\mathbb{1}[A] is the indicator function, which equals one if its argument is true and zero otherwise.

ParameterBahenDundas
Training PTP_T10 dBm30 dBm
MM64256
Configured delay cap τmax⁡\tau_{\max} [samples]80350
PCN structureM×64×32×1M \times64 \times32 \times1; MM-sample inputM×64×32×1M \times64 \times32 \times1; MM-sample input
Pmin⁡,Pmax⁡P_{\min}, P_{\max}2, 202, 20
ℓPCN\ell_{\mathrm{PCN}}22
λLM\lambda_{\mathrm{LM}}0.50.5
λcount\lambda_{\mathrm{count}}0.020.02
λfloor,rel\lambda_{\mathrm{floor,rel}}0.0010.001
ϵtiny\epsilon_{\mathrm{tiny}}1.18×10−381.18 \times10^{-38} (float32 minimum)1.18×10−381.18 \times10^{-38} (float32 minimum)
Total number of subcarriers NscN_{\mathrm{sc}}10241024

Table I. Simulation Parameters

Initial Access Analyses

To demonstrate the performance of the MPSi in initial access application, we compare its performance with three beam-search baselines representing different accuracy-overhead tradeoffs:

  • DFT codebook (dense-search reference): This baseline exhaustively searches a fixed 32 × 16 azimuth-elevation grid containing 512 DFT-style beams. Each beam is projected onto the received pilot, and the beam with the largest projected power is selected. It provides a dense angular-quantization reference at high search overhead.

  • Hierarchical codebook (coarse-to-fine search): This method first evaluates an 8 × 4 coarse grid containing 32 beams. It then allocates the remaining 32 checks from a shared 64-beam budget to local refinement around the strongest coarse direction. The final direction is selected from all beams evaluated across both stages.

  • 3GPP-inspired SSB sweep: This baseline searches a fixed codebook of 64 uniformly distributed beams and selects the beam with maximum received pilot power. Each modeled synchronization signal block (SSB) occasion is assigned four OFDM symbols and 240 resource elements.

Figure 4 compares estimator-based and codebook-based initial access in the Bahen and Dundas scenarios using empirical cumulative distribution functions (CDFs) of achievable spectral efficiency and dominant-path angular error.

Figure 4. Initial access performance comparison across codebook-based and estimator-based designs when PT=−10P_T=-10 dBm in Bahen and PT=10P_T=10 dBm in Dundas scenario. Subfigures (a) and (b) show the CDF of the dominant-path angular error, while (c) and (d) present the CDF of the achievable spectral efficiency for the Bahen and Dundas maps, respectively.

Estimator-based methods generally achieve lower angular error and higher achievable rates than lower-resolution codebooks because they recover continuous AoAs, whereas codebooks are restricted to predefined beam directions. Among the codebook baselines, the dense DFT codebook attains the closest accuracy to estimator-based methods by using a finer angular grid, but it requires 512 beam checks. By contrast, the hierarchical and 3GPP-inspired designs operate with much smaller search budgets and therefore exhibit larger quantization errors. Among the estimator-based approaches, MPSi delivers initial-access performance comparable to RIMAX while using a fixed number of unfolded LM layers and thus, as described earlier, lower complexity.

As depicted in Figure 4(d), the achievable rates in the dense urban environment of Dundas are very similar across both codebook and estimator-based methods. This is because the multipath richness in this environment is extremely high, so only a small fraction of the received power is carried by the dominant path. The resolution of the codebook search and the array beamforming are therefore sufficient to capture the dominant-path contribution accurately, resulting in comparable achievable rates across all methods.

A further distinction between the two methods is that estimators recover the parameters of multiple propagation paths, whereas codebook methods typically provide only a selected beam direction or dominant-path AoA. This richer multipath representation can support higher communication rates during initial access, particularly at low pilot powers. As shown in Figure 5, with PT=−20P_T=-20 dBm, MPSi achieves a substantially higher data rate than the estimator- and codebook-based baselines. This improvement results from its ability to identify multiple active paths, estimate their parameters, and reconstruct the full communication channel.

Figure 5. Empirical CDF of the uplink achievable rate obtained using all communication paths for (a) Bahen and (b) Dundas.

To compare the initial-access resource requirements, Table II summarizes the time-frequency usage and modeled air-interface latency for the Bahen scenario. The “Time” column denotes the number of pilot transmissions or beam occasions, while “Freq/tx” gives the number of frequency-domain resource elements per transmission. Their product gives the total pilot-resource count. The estimator-based methods use a single transmission over 64 frequency elements, corresponding to 64 pilot elements

MethodTimeFreq/txPilot length# of SymbolsAir Latency [ms]
MPSi1646420.018
RIMAX NM1646420.018
RIMAX1646420.018
3GPP-SSB64240153603202.858
Hierarchical646440961281.143
DFT512643276810249.144

Table II. Resource usage of different methods in initial access evaluated on Bahen scenario

and two modeled air-interface symbols when one sounding and one feedback symbol are counted. Each air-interface latency is set to 0.018 ms.

The codebook-based methods require substantially more pilot transmissions because they evaluate multiple beam directions to select the strongest one. By contrast, the estimator-based methods obtain the received signal over multiple subcarriers in a single transmission and estimate the dominant-path AoA from that observation, albeit with higher computational complexity. Note that the resource accounting in Table II represents air-interface overhead and not the computational complexity. A codebook check primarily involves beam projection or matched filtering, whereas the estimator-based methods require nonlinear multipath estimation resulting in much higher computational complexity.

Full Multipath-Channel Estimation Performance

Beyond dominant-path estimation for initial access, MPSi reconstructs the full modeled multipath channel. We evaluate the reconstruction over all 1024 subcarriers using channel normalized mean-square error (NMSE) and bit-error rate (BER). We compare MPSi with RIMAX variants, perfect channel knowledge, and least-squares (LS) channel estimation.

Figure 6 shows that MPSi and RIMAX with NM initialization achieve low channel NMSE across the evaluated subcarriers. In the Bahen and Dundas scenarios, the NMSE reaches approximately −30 dB and −20 dB, respectively, demonstrating the accuracy of the proposed estimator. These results indicate that the estimated path parameters are sufficiently accurate to reconstruct the frequency-dependent channel. Delay estimates are particularly important for frequency extrapolation because each path’s phase varies with subcarrier frequency, while accurate AoA estimates support reconstruction of the spatial channel response across the BS array.

MPSi also outperforms RIMAX with NM initialization, partly because MPSi treats scattering components as resolvable paths that contribute to communication performance, whereas RIMAX models them as noise. Treating these components as noise introduces additional channel-modeling error within the evaluated fading window. By contrast, LS estimation and RIMAX without NM initialization exhibit higher channel NMSE. The LS baseline does not model parametric path delays and is therefore less suited to reconstructing unmeasured frequencies. The difference between the RIMAX variants further illustrates the sensitivity of nonlinear path refinement to initialization.

We further evaluate the practical impact of channel-estimation accuracy through the bit-error rate (BER) achieved in a single-user uplink scenario with maximum-ratio combining (MRC). Equiprobable bits are Gray mapped to the selected 64-quadrature amplitude modulation (64-QAM) constellation and detected using each channel estimate.

The resulting BER performance is shown in Fig. 7. MPSi approaches the perfect-channel benchmark in both the Bahen and Dundas scenarios, consistent with its low channel-estimation NMSE, whereas the RIMAX–NM variant falls short in the dense urban area of Dundas. RIMAX without NM initialization and the LS baseline exhibit higher BER in the reported configurations. Overall, MPSi achieves comparable BER while using a smaller, fixed refinement depth than the observed RIMAX iteration count.

Note that MPSi uses pilot observations on 64 and 256 of the 1024 subcarriers in the Bahen and Dundas scenarios, respectively. These values correspond to pilot fractions of 6.25% and 25%, both lower than the dense comb-type reference considered in [30]. Thus, MPSi reduces pilot overhead and leaves a larger fraction of the available subcarriers for data transmission. Combined with the accuracy of its channel reconstruction, this reduced overhead can improve overall communication performance.

MPSi as a Model-Based Data Source for Wireless Learning

As a final application, we demonstrate how MPSi can generate pseudo-labels for the training of wireless learning systems. In practice, training datasets are often collected as received pilot measurements without corresponding ground-truth channel responses. Although such measurements can support self-supervised reconstruction objectives, they do not directly provide the target channels required for supervised tasks such as channel prediction or beam selection (e.g., [1], [8]). Moreover, applying continual learning concepts to dynamic wireless environments [9], [10] requires a continuous stream of true channel labels that reflect the current propagation conditions. Obtaining such labels traditionally relies on ray tracing [8], which is computationally expensive and demands precise, up-to-date maps of all stationary and moving scatterers along with their material properties, making it a highly complex process.

MPSi addresses this bottleneck by generating physically interpretable candidate labels directly from received pilots and a known sounding sequence. This workflow is particularly beneficial when site-specific channel state information is unavailable: a localized MPSi model can process measured pilots to produce high-fidelity environment estimates, which can then supervise downstream ML-enhanced algorithms for repeated training and inference within the deployment area.

Figure 6a. Full-band channel NMSE versus pilot transmit power for (a) Bahen and (b) Dundas.

Figure 6b. Full-band channel NMSE versus pilot transmit power for (a) Bahen and (b) Dundas.

Figure 7a. BER versus pilot transmit power for single-user MRC detection: (a) Bahen, (b) Dundas.

Figure 7b. BER versus pilot transmit power for single-user MRC detection: (a) Bahen, (b) Dundas.

To evaluate the fidelity of the generated pseudo-labels, Figure 8 shows the empirical CDF of the per-realization full-band channel NMSE in the Bahen and Dundas scenarios. The pilot transmit powers are set to PT=10P_T = 10 dBm for Bahen and PT=30P_T = 30 dBm for Dundas, respectively. In the Bahen scenario, all realizations have an NMSE below −30-30 dB, while more than 80% of the realizations in the denser Dundas scenario have an NMSE below −20-20 dB. These results indicate that MPSi can produce accurate channel estimates across the evaluated site-specific environments and, under these configurations, achieves lower error than the RIMAX baselines.

Figure 8. Empirical CDF of the per-realization channel NMSE: (a) Bahen at PT=10P_T = 10 dBm and (b) Dundas at PT=30P_T = 30 dBm.

The received-signal fit quality is evaluated in Figure 9 using the normalized residual, i.e.,

Figure 9. Empirical CDF of the received-signal fit residual normalized by the realized noise energy for (a) Bahen and (b) Dundas.

ρ=∥Ypilot−Y^pilot∥F2∥Ypilot−Ytrue∥F2,(52)\rho= \frac{\left\|\mathbf{Y}_{\mathrm{pilot}}-\widehat{\mathbf{Y}}_{\mathrm{pilot}}\right\|_{F}^{2}}{\left\|\mathbf{Y}_{\mathrm{pilot}}-\mathbf{Y}_{\mathrm{true}}\right\|_{F}^{2}}, \tag*{(52)}

where Y^pilot\widehat{\mathbf{Y}}_{\mathrm{pilot}} is the received signal reconstructed from the estimated paths and Ytrue\mathbf{Y}_{\mathrm{true}} is the corresponding noiseless received signal. Note that the residual analysis is an offline validation measure because the denominator uses the realized noise energy obtained from the known noiseless simulation signal. In a practical deployment, the same filter would require a calibrated or independently

estimated noise level rather than access to Ytrue\mathbf{Y}_{\mathrm{true}}. The horizontal axis in Figure 9 is ρ\rho, expressed in dB. Thus, ρ=1\rho= 1 (0 dB) corresponds to a reconstruction residual equal to the realized noise energy indicating that the estimated channel explains the observation down to the noise floor. Further, ρ=2\rho= 2 corresponds to the filtering threshold used in the analysis. We use ρth=2\rho_{\mathrm{th}} = 2 as a practical initial quality-control threshold, rather than as a universal statistical limit. This choice permits the residual to be at most twice the noise energy, approximately 3 dB above the noise floor. This tolerance allows for moderate model mismatch while rejecting substantially poorer fits.

As depicted in Figure 9, MPSi is concentrated close to the noise floor in both scenarios, whereas the RIMAX baselines exhibit larger residuals. This agreement between low channel NMSE and a residual close to the noise floor supports the use of MPSi estimates as candidate pseudo-labels.

Table III summarizes the offline quality-control results. A candidate label is retained when its fit residual satisfies ρ≤2\rho\le2 and its pilot-estimated signal-to-noise ratio (SNR) is at least 0 dB. MPSi retains all Bahen realizations and 89% of the Dundas realizations, with median retained-label NMSE values of −39.2-39.2 and −33.4-33.4 dB, respectively. RIMAX-NM retains fewer realizations and yields higher retained-label NMSE in both environments. These results support using MPSi estimates as candidate pseudo-labels, while the retained fraction and retained-label NMSE quantify label quality.

MapMethodRetained fractionMedian NMSE keptWorst NMSE kept
BahenMPSi1.00−39.2−31.8
BahenRIMAX NM0.56−34.3−25.6
DundasMPSi0.89−33.4−19.4
DundasRIMAX NM0.29−18.6−9.7

Table III. Quality-controlled candidate labels.

Conclusion

In this paper, we introduced MPSi, a physics-guided neural framework to estimate the effective number and parameters of active propagation paths from received pilot observations and known transmitted pilot power. MPSi combines a differentiable path-count network, soft-top-kk gating, and fixed-depth unfolded Levenberg-Marquardt refinement while preserving a physically interpretable channel model. The resulting path-level representation supports initial access, wideband channel reconstruction, and the generation of candidate pseudo-labels for wireless-learning systems. Across the evaluated Bahen and Dundas ray-traced scenarios, MPSi achieved low channel NMSE and BER close to the perfect-CSI reference. Its initial-access performance was comparable to classical channel sounding algorithms, e.g., RIMAX, while its fixed refinement depth provided predictable control-flow complexity and substantially lower modeled air-interface overhead than dense codebook search. The residual-based quality-control analysis further showed how MPSi estimates can be screened as candidate pseudo-labels when measured pilots are available but perfect channel knowledge is not.

These conclusions are limited to the two site-specific ray-traced environments representing small-cell and dense-urban scenarios. Possible future works include evaluating a broader range of environments and larger test sets, measuring platform-specific runtime, investigating MPSi-generated labels in downstream learning tasks, and extend the path model to include Doppler for mobile scenarios and channel prediction.

References

  1. [1]R. M. Dreifuerst and R. W. Heath, “Machine learning codebook design for initial access and CSI type-II feedback in sub-6-GHz 5G NR,” IEEE Transactions on Wireless Communications, vol. 23, no. 6, pp. 6411–6424, 2021.
  2. [2]Y. Chen, J. Palacios, N. González-Prelcic, T. Shimizu, and H. Lu, “Joint initial access and localization in millimeter wave vehicular networks: a hybrid model/data driven approach,” in 2022 IEEE 12th Sensor Array and Multichannel Signal Processing Workshop (SAM). IEEE, 2022, pp. 355–359.arxiv.org/abs/2204.01510
  3. [3]H. Minn and V. K. Bhargava, “An investigation into time-domain approach for OFDM channel estimation,” IEEE Transactions on broadcasting, vol. 46, no. 4, pp. 240–248, 2000.DOI
  4. [4]Y. Sun, M. Peng, Y. Zhou, Y. Huang, and S. Mao, “Application of machine learning in wireless networks: Key techniques and open issues,” IEEE Communications Surveys & Tutorials, vol. 21, no. 4, pp. 3072–3108, 2019.arxiv.org/abs/1809.08707
  5. [5]Y. Li, L. Cimini, and N. Sollenberger, “Robust channel estimation for OFDM systems with rapid dispersive fading channels,” IEEE Transactions on Communications, vol. 46, no. 7, pp. 902–915, 1998.
  6. [6]J. Mirzaei, R. S. Adve, and S. Shahbazpanahi, “Semi-blind time-domain channel estimation for frequency-selective multiuser massive MIMO systems,” IEEE Transactions on Communications, vol. 67, no. 2, pp. 1045–1058, 2018.
  7. [7]J. Mirzaei, S. S. Panahi, R. S. Adve, and N. K. M. Gopal, “Deep generative models for downlink channel estimation in fdd massive MIMO systems,” IEEE Transactions on Signal Processing, vol. 70, pp. 2000–2014, 2022.DOI
  8. [8]Z. Xiao, Z. Zhang, C. Huang, X. Chen, C. Zhong, and M. Debbah, “C-GRBFNet: A physics-inspired generative deep neural network for channel representation and prediction,” IEEE Journal on Selected Areas in Communications, vol. 40, no. 8, pp. 2282–2299, 2022.arxiv.org/abs/2112.02615
  9. [9]M. A. Mohsin, M. Umer, A. Bilal, M. I. Qadir, M. A. Jamshed, D. F. Hougen, and J. M. Cioffi, “Channel prediction under network distribution shift using continual learning-based loss regularization,” in ICASSP 2026 - 2026 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2026, pp. 21 101–21 105.
  10. [10]H. Sun, W. Pu, X. Fu, T.-H. Chang, and M. Hong, “Learning to continuously optimize wireless resource in a dynamic environment: A bilevel optimization perspective,” IEEE Transactions on Signal Processing, vol. 70, pp. 1900–1917, 2022.DOI
  11. [11]Z. Yun and M. F. Iskander, “Ray tracing for radio propagation modeling: Principles and applications,” IEEE Access, vol. 3, pp. 1089–1100, 2015.DOI
  12. [12]T. Orekondy, P. Kumar, S. Kadambi, H. Ye, J. Soriaga, and A. Behboodi, “Winert: Towards neural ray tracing for wireless channel modelling and differentiable simulations,” in The Eleventh International Conference on Learning Representations, 2023.
  13. [13]A. Seretis, T. Hashimoto, K. Zeng, and C. D. Sarris, “Ray-tracing driven ann propagation models for indoor environments at 28 GHz,” in 2020 IEEE International Symposium on Antennas and Propagation and North American Radio Science Meeting. IEEE, 2020, pp. 1029–1030.DOI
  14. [14]A. Seretis and C. D. Sarris, “Toward physics-based generalizable convolutional neural network models for indoor propagation,” IEEE Transactions on Antennas and Propagation, vol. 70, no. 6, pp. 4112–4126, 2022.DOI
  15. [15]B. H. Fleury, M. Tschudin, R. Heddergott, D. Dahlhaus, and K. I. Pedersen, “Channel parameter estimation in mobile radio environments using the SAGE algorithm,” IEEE Journal on selected areas in communications, vol. 17, no. 3, pp. 434–450, 1999.DOI
  16. [16]A. Richter, “Estimation of radio channel parameters: Models and algorithms.” ISLE Blacksburg, VA, USA, 2005.
  17. [17]T. Bohlin, Practical grey-box process identification: theory and applications. Springer, 2006.DOI
  18. [18]A. Yousry, S. Todd, P. Murton, M. J. Arshad, N. Werren, A. Peruzzo, and C. Bonato, “Bayesian quantum sensing using graybox machine learning,” arXiv preprint arXiv:2601.17465, 2026.
  19. [19]Z. Xiao, Z. Zhang, Z. Chen, Z. Yang, C. Huang, and X. Chen, “From data-driven learning to physics-inspired inferring: A novel mobile MIMO channel prediction scheme based on neural ODE,” IEEE Transactions on Wireless Communications, vol. 23, no. 7, pp. 7186–7199, 2023.arxiv.org/abs/2304.04267
  20. [20]J. Hoydis, S. Cammerer, F. Ait Aoudia, A. Vem, N. Binder, G. Marcus, and A. Keller, “Sionna: An open-source library for next-generation physical layer research,” arXiv preprint arXiv:2203.11854, 2022.arxiv.org/abs/2203.11854
  21. [21]OpenStreetMap contributors, “OpenStreetMap data,” https://openstreetmap.org, 2026, accessed: 2026-09-22; Distributed under the Open Data Commons Open DataBase License (ODbL).
  22. [22]A. E. Hoerl and R. W. Kennard, “Ridge regression: Biased estimation for nonorthogonal problems,” Technometrics, vol. 12, no. 1, pp. 55–67, 1970.
  23. [23]K. Wijk, R. Vinuesa, and H. Azizpour, “Differentiable top-k: From one-hot to k-hot,” in EurIPS Workshop on Differentiable Systems and Scientific Machine Learning, 2025, workshop paper. [Online]. Available: https://openreview.net/pdf?id=VMaljH1oF
  24. [24]A. Grover, E. Wang, G. Zweig, and S. Ermon, “Stochastic optimization of sorting networks via continuous relaxations,” in International Conference on Learning Representations, 2019. [Online]. Available: https://openreview.net/forum?id=H1eSS3CcKXarxiv.org/abs/1903.08850
  25. [25]M. Cuturi, O. Teboul, and J.-P. Vert, “Differentiable ranking and sorting using optimal transport,” in Advances in Neural Information Processing Systems, H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alché-Buc, E. Fox, and R. Garnett, Eds., vol. 32. Curran Associates, Inc., 2019. [Online]. Available: https://proceedings.neurips.cc/paper_files/paper/2019/file/d8c24ca8f23c562a5600876ca2a550ce-Paper.pdfarxiv.org/abs/1905.11885
  26. [26]ITU Radiocommunication Sector, “Recommendation ITU-R P.1407-8: Multipath propagation and parameterization of its characteristics,” International Telecommunication Union, Geneva, Switzerland, Tech. Rep. P.1407-8, 2021. [Online]. Available: https://www.itu.int/dms_pubrec/itu-r/rec/p/R-REC-P.1407-8-202109-!!!PDF-E.pdf
  27. [27]J. A. Nelder and R. Mead, “A simplex method for function minimization,” The computer journal, vol. 7, no. 4, pp. 308–313, 1965.DOI
  28. [28]I. McInerney, G. A. Constantinides, and E. C. Kerrigan, “A survey of the implementation of linear model predictive control on FPGAs,” IFAC-PapersOnLine, vol. 51, no. 20, pp. 381–387, 2018.
  29. [29]D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv preprint arXiv:1412.6980, 2014.arxiv.org/abs/1412.6980
  30. [30]ETSI, “5G; NR; Physical channels and modulation (3GPP TS 38.211 version 18.2.0 Release 18),” European Telecommunications Standards Institute (ETSI), Technical Specification (TS) 138 211, 5 2024. [Online]. Available: https://www.etsi.org/deliver/etsi_ts/138200_138299/138211/18.02.00_60/ts_138211v180200p.pdf

Paper details

vlnc:W_6ffabsca
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 3

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Engineering

Not recorded for this paper

View statement
Looking for related papers…
Contents