betaFeedback

WorksComputer Science

Neural Network-Assisted CLEAN for Efficient Multipath Parameter Estimation in MIMO Systems

Abstract

High-resolution multipath estimation in wideband multiple-input multiple-output (MIMO) channels requires repeated searches over angle of arrival, angle of departure, and propagation distance. This paper presents neural network-assisted CLEAN (NN-CLEAN), which replaces the multidimensional search at each extraction step with a multi-head classifier while retaining least-squares (LS) estimation of the complex path gain, parametric reconstruction, and residual cancellation. The same classifier is applied to successive residuals, allowing the extraction depth to vary without changing its output structure. With the number of iterations prescribed by the reference multipath-component (MPC) count, off-grid synthetic tests show that NN-CLEAN slightly exceeds grid-search CLEAN (GS-CLEAN) in path accuracy for one and two MPCs, although its accuracy declines more rapidly at larger path counts. For complete three-MPC extraction at a batch size of eight, NN-CLEAN achieves an approximately 27×27\times speedup and a 5252-fold reduction in peak GPU memory relative to GS-CLEAN. Applied without retraining to two-MPC line-of-sight (LOS) and non-line-of-sight (NLOS) Sionna ray-tracing channels within a coded MIMO link, NN-CLEAN substantially reduces channel-reconstruction mean-squared error (MSE) and bit error rate (BER) relative to interpolated LS channel estimation. GS-CLEAN retains an accuracy advantage on these channels, indicating the estimation cost associated with the computational savings.

Introduction

Accurate multipath channel characterization is essential to wideband multiple-input multiple-output (MIMO) communication, channel sounding, localization, and integrated sensing and communication (ISAC). Measurements across multiple antennas and frequencies enable individual multipath components (MPCs) to be distinguished through their spatial and frequency-dependent signatures. Estimating physically meaningful parameters, including the angle of arrival (AoA), angle of departure (AoD), propagation distance or delay, and complex path gain, is therefore important for channel reconstruction, beamforming, spatial multiplexing, and sensing. Reliable parameter extraction remains difficult in complex propagation environments, particularly at low signal-to-noise ratio (SNR), where noise and inter-path interference obscure weak components and reduce the separability of closely spaced paths [1, 2].

Conventional high-resolution parameter estimation is predominantly model based. Subspace methods such as MUSIC [3, 4] and ESPRIT [5, 6] exploit the structure of the signal and noise subspaces to estimate propagation parameters without an exhaustive likelihood search. Their performance, however, depends on reliable model-order selection and subspace separation. Correlated or coherent MPCs can reduce the effective signal-subspace rank, while low-SNR observations can cause subspace leakage or subspace swaps, resulting in substantial estimation degradation [7, 8].

Maximum-likelihood estimation (MLE) provides an alternative model-based formulation by identifying the propagation parameters that best explain the observed channel under an assumed physical model. Although MLE does not rely on the same subspace-separation conditions, joint estimation becomes computationally prohibitive when several parameters and MPCs must be optimized simultaneously. CLEAN [9] reduces the joint problem to a sequence of dominant-path estimation and subtraction steps. Each iteration, however, generally requires a multidimensional parameter search, causing the runtime and memory requirements to grow with the grid resolution, number of search dimensions, and channel-observation size [10, 11]. This scaling limits the applicability of grid-search CLEAN in systems requiring high-throughput or low-latency channel processing.

Deep learning (DL) has been investigated as a means of reducing the computational cost of multipath parameter estimation [12, 13, 14, 15, 16, 17, 18]. Existing approaches can be broadly divided into direct DL estimators and DL-assisted model-based methods. A direct DL estimator uses a neural network (NN) to map the received signal or channel observation to the desired propagation parameters in one forward pass. Although inference can be performed efficiently, simultaneous estimation of a complete multipath channel remains difficult. A fixed output structure must identify the active paths, preserve the association among the parameters belonging to each path, and remain valid when the path count differs from the training condition [18]. Classification-based estimators are further limited by their finite output grids and can degrade when the true parameters lie between the predefined grid points [17].

DL-assisted model-based methods instead replace selected computational operations within an established signal-processing algorithm. This approach retains the physical channel model and structured parameter updates while using learned inference to reduce the cost of the most demanding operation. Such a formulation is well suited to CLEAN, whose reconstruction and successive-cancellation steps are analytically defined but whose repeated multidimensional searches are computationally intensive. To the best of our knowledge, neural inference has not previously been integrated directly into the iterative CLEAN procedure for joint AoA, AoD, and propagation-distance estimation.

This work proposes NN-assisted CLEAN (NN-CLEAN), a hybrid multipath parameter estimator in which a multi-head classifier replaces the exhaustive parameter search at each CLEAN iteration. The remaining operations are model based: the complex path gain is obtained through least-squares (LS) projection, the estimated MPC is reconstructed from the parametric channel model, and the reconstructed response is subtracted from the current residual. The updated residual is then supplied to the same single-MPC classifier for the next extraction. Reusing one classifier across iterations permits different extraction depths without changing the NN output dimension.

The replacement of grid search with NN inference also changes the computational scaling under concurrent processing. Grid-search CLEAN must evaluate the complete candidate space for every channel realization, whereas NN-CLEAN can process multiple residual channels using batched tensor operations on parallel hardware. The computational benefit is therefore expected to become most significant when several channel realizations are processed simultaneously, as may occur in centralized MIMO and ISAC systems serving multiple communication links or sensing targets within the same processing interval.

NN-CLEAN is evaluated using both statistically synthesized channels and geometry-dependent channels generated with the NVIDIA Sionna ray-tracing (RT) package. The synthetic experiments examine off-grid estimation over different path counts, SNRs, antenna dimensions, and numbers of frequency samples. Runtime and peak memory are measured as the concurrent processing batch increases. The RT channels are incorporated into a coded MIMO communication link, where path accuracy, channel-reconstruction mean-squared error (MSE), and bit-error rate (BER) quantify how parameter-estimation errors propagate to downstream equalization and decoding.

A preliminary conference paper introduced the core NN-CLEAN concept under a controlled synthetic configuration [19]. This journal article extends the evaluation to off-grid channels with different path counts and SNRs, adds conditional parameter-precision analysis, and examines observation dimensions and search-grid resolution. GPU profiling distinguishes single-path search from complete multipath extraction and measures runtime and peak memory under increasing batch workloads. Two-MPC LOS and NLOS Sionna RT channels further assess reconstruction and BER within a coded MIMO link, while three-MPC LOS ablations examine label smoothing, angular conditioning, distance-loss weighting, and the training curriculum.

The main contributions of this work are summarized as follows:

  1. NN-Assisted CLEAN Framework: We develop an NN-CLEAN estimator that replaces the exhaustive AoA–AoD–distance search within each CLEAN iteration with a multi-head neural classifier. The proposed method retains LS gain estimation, parametric channel reconstruction, and successive residual cancellation, providing a structured alternative to both exhaustive grid search and fully data-driven one-shot estimation.

  1. Sequential Extraction with Variable Depth: The same single-MPC classifier is applied repeatedly to the evolving channel residual. This formulation supports a variable extraction depth without changing the network output dimension and reduces the cross-path association burden encountered by one-shot multipath estimators. Its robustness is evaluated on off-grid synthetic channels across different path counts and SNRs.

  1. Computational and System-Level Validation: The proposed method is evaluated in terms of path accuracy, conditional parameter precision, channel-reconstruction fidelity, runtime, and peak memory. Geometry-dependent Sionna RT channels are further incorporated into a coded MIMO link, where channel-reconstruction MSE and BER are used to quantify the effect of parameter-estimation errors on downstream communication performance.

System Model and CLEAN Algorithm

Multipath Channel Model

Consider a quasi-static double-directional radio channel between an NTN_T-element transmitter (Tx) uniform linear array (ULA) and an NRN_R-element receiver (Rx) ULA, as illustrated in Figure 1. The channel comprises NMPCN_{\mathrm{MPC}} resolvable multipath components (MPCs), including a possible line-of-sight (LOS) component and reflected or scattered paths. Each MPC is characterized by its angle of arrival (AoA), angle of departure (AoD), propagation distance, and complex path gain.

Channel Model Visualization

Figure 1. Channel Model Visualization

The geometric parameters of an MPC are collected in

θ=[ϕR,ϕT,d]T,(1)\boldsymbol{\theta} = [\phi_R, \phi_T, d]^{\mathrm{T}}, \tag*{(1)}

where ϕR\phi_R, ϕT\phi_T, and dd denote the azimuth AoA, azimuth AoD, and propagation distance, respectively.

Let fkf_k, k=1,…,Nfk = 1, \ldots, N_f, denote the kkth frequency point. Following the double-directional channel formulation in [9], let bT(ϕT,fk)∈CNT×1\mathbf{b}_T(\phi_T, f_k) \in\mathbb{C}^{N_T \times1} and bR(ϕR,fk)∈C1×NR\mathbf{b}_R(\phi_R, f_k) \in\mathbb{C}^{1 \times N_R} denote the calibrated vertically polarized beam-pattern responses of the Tx and Rx arrays, respectively. The spatial-frequency response associated with a candidate MPC is then defined as

P(θ,fk)=bT(ϕT,fk)bR(ϕR,fk)exp⁡(−j2πfkdc),(2)P(\boldsymbol{\theta}, f_k) = \mathbf{b}_T(\phi_T, f_k)\mathbf{b}_R(\phi_R, f_k)\exp\left(-j2\pi f_k\frac{d}{c}\right), \tag*{(2)}

where cc is the speed of light and P(θ,fk)∈CNT×NRP(\boldsymbol{\theta}, f_k) \in\mathbb{C}^{N_T \times N_R}.

The channel transfer function between the Tx and Rx arrays at frequency fkf_k is modeled as the superposition of the individual MPC responses:

H(fk)=∑l=1NMPCαlPT(θl,fk)+N(fk),1≤k≤Nf,(3)\mathbf{H}(f_k) = \sum_{l=1}^{N_{\mathrm{MPC}}} \alpha_l \mathbf{P}^{\mathrm{T}}(\boldsymbol{\theta}_l, f_k) + \mathbf{N}(f_k), \qquad1 \leq k \leq N_f, \tag*{(3)}

where θl\theta_l and αl∈C\alpha_l \in\mathbb{C} denote the geometric parameter vector and complex path gain of the llth MPC, respectively. The transpose establishes the receive-by-transmit channel orientation, such that H(fk)∈CNR×NT\mathbf{H}(f_k) \in\mathbb{C}^{N_R \times N_T}. The matrix N(fk)∈CNR×NT\mathbf{N}(f_k) \in\mathbb{C}^{N_R \times N_T} represents AWGN with independent and identically distributed complex Gaussian entries.

MLE-Based MPC Extraction Using CLEAN

Under the AWGN assumption, multipath parameter estimation can be formulated as a deterministic maximum-likelihood estimation (MLE) problem. For a known number of MPCs, maximizing the likelihood is equivalent to minimizing the reconstruction error between the observed channel and the noise-free parametric component of (3). The joint estimator is therefore given by

{α^l,θ^l}l=1NMPC=arg⁡min⁡{αl,θl}∑k=1Nf∥H(fk)−∑l=1NMPCαlPT(θl,fk)∥F2,(4)\left\{\hat{\alpha}_l,\hat{\theta}_l\right\}_{l=1}^{N^{\mathrm{MPC}}} = \underset{\{\alpha_l,\theta_l\}}{\arg\min} \sum_{k=1}^{N_f} \left\| \mathbf{H}(f_k) - \sum_{l=1}^{N^{\mathrm{MPC}}} \alpha_l \mathbf{P}^{\mathrm{T}}(\theta_l,f_k) \right\|_F^2, \tag*{(4)}

where ∥⋅∥F\|\cdot\|_F denotes the Frobenius norm. Directly solving (4) requires simultaneous optimization over the geometric parameters and complex gains of all MPCs, resulting in a high-dimensional nonlinear problem whose complexity increases rapidly with the path count.

CLEAN provides a practical alternative by decomposing the joint problem into a sequence of single-MPC estimation steps [9], [20]. At each iteration, the dominant component in the current residual is estimated, reconstructed, and subtracted before the next component is extracted. In this work, the CLEAN implementation that identifies each dominant MPC through an exhaustive discretized search over AoA, AoD, and distance is referred to as grid-search CLEAN (GS-CLEAN).

Let Hrem(i)(fk)\mathbf{H}_{\mathrm{rem}}^{(i)}(f_k) denote the residual channel at extraction iteration ii. The residual is initialized using the observed channel as

Hrem(1)(fk)=H(fk).(5)\mathbf{H}_{\mathrm{rem}}^{(1)}(f_k) = \mathbf{H}(f_k). \tag*{(5)}

In GS-CLEAN, the AoA, AoD, and distance dimensions are discretized over ΘAoA\Theta_{\mathrm{AoA}}, ΘAoD\Theta_{\mathrm{AoD}}, and Θdist\Theta_{\mathrm{dist}}, containing NϕRN_{\phi_R}, NϕTN_{\phi_T}, and NdN_d candidate values, respectively. The resulting joint search space is

Θ=ΘAoA×ΘAoD×Θdist,\Theta= \Theta_{\mathrm{AoA}} \times\Theta_{\mathrm{AoD}} \times\Theta_{\mathrm{dist}},
∣Θ∣=NϕRNϕTNd.(6)|\Theta| = N_{\phi_R}N_{\phi_T}N_d. \tag*{(6)}

Under the normalized array responses adopted in this work, the energy of the parametric response is constant across the search grid. Consequently, maximizing the concentrated single-path likelihood reduces to evaluating the spatial–frequency correlation between each candidate response and the current residual. The dominant MPC parameter vector at iteration ii is estimated as

θ^i=arg⁡max⁡θ∈Θ∣∑k=1Nf⟨PT(θ,fk),Hrem(i)(fk)⟩F∣2,(7)\hat{\theta}_i = \underset{\theta\in\Theta}{\arg\max} \left| \sum_{k=1}^{N_f} \left\langle\mathbf{P}^{\mathrm{T}}(\theta,f_k),\mathbf{H}_{\mathrm{rem}}^{(i)}(f_k) \right\rangle_F \right|^2, \tag*{(7)}

where ⟨A,B⟩F=tr⁡(AHB)\langle A,B\rangle_F = \operatorname{tr}(A^{H}B) denotes the Frobenius inner product. After estimating θ^i\hat{\theta}_i, the corresponding complex path gain is obtained through least-squares (LS) projection:

α^i=∑k=1Nf⟨PT(θ^i,fk),Hrem(i)(fk)⟩F∑k=1Nf∥PT(θ^i,fk)∥F2.(8)\hat{\alpha}_i = \frac{\sum_{k=1}^{N_f} \left\langle\mathbf{P}^{\mathrm{T}}(\hat{\theta}_i,f_k),\mathbf{H}_{\mathrm{rem}}^{(i)}(f_k) \right\rangle_F}{\sum_{k=1}^{N_f} \left\| \mathbf{P}^{\mathrm{T}}(\hat{\theta}_i,f_k) \right\|_F^2}. \tag*{(8)}

The estimated MPC is then reconstructed and subtracted from the current residual according to

Hrem(i+1)(fk)=Hrem(i)(fk)−α^iPT(θ^i,fk).(9)\mathbf{H}_{\mathrm{rem}}^{(i+1)}(f_k) = \mathbf{H}_{\mathrm{rem}}^{(i)}(f_k) - \hat{\alpha}_i\mathbf{P}^{\mathrm{T}}(\hat{\theta}_i,f_k). \tag*{(9)}

The parameter search, gain estimation, and residual subtraction in (7)–(9) are repeated for subsequent MPCs. Extraction may terminate after a prescribed number of components or when an external stopping criterion is satisfied, such as when the estimated path gain or residual energy falls below a predefined threshold.

Computational Bottleneck of GS-CLEAN

The computational cost of GS-CLEAN is dominated by the exhaustive parameter evaluation in (7). For a single candidate θ\theta, evaluating the spatial–frequency correlation over NfN_f observations of an NR×NTN_R \times N_T channel requires approximately

O(NfNRNT)(10)\mathcal{O}(N_fN_RN_T) \tag*{(10)}

operations. Because the AoA–AoD–distance search space contains NϕRNϕTNdN_{\phi_R}N_{\phi_T}N_d candidate combinations, the resulting per-iteration complexity scales as

O(NϕRNϕTNdNfNRNT).(11)\mathcal{O}(N_{\phi_R}N_{\phi_T}N_dN_fN_RN_T). \tag*{(11)}

For comparable grid sizes of approximately GG points per parameter dimension, this dependence reduces to O(G3NfNRNT)\mathcal{O}(G^3N_fN_RN_T). Because the exhaustive search is repeated after each MPC subtraction, the total computational burden also increases approximately linearly with the number of extracted components for a fixed search space and observation dimension. Repeated computation can be reduced by precomputing candidate responses or array-manifold dictionaries. This strategy, however, introduces a memory requirement that grows with both the number of candidate combinations and the spatial–frequency observation dimensions. Increasing the grid resolution, antenna count, or number of frequency samples therefore increases the computational workload, the required dictionary storage, or both.

The limitation becomes more pronounced when additional propagation parameters are incorporated. The present formulation considers a three-dimensional search over azimuth AoA, azimuth AoD, and distance. Including Tx and Rx elevation angles would expand the search space to five dimensions, resulting in approximately O(G5NfNRNT)O(G^{5}N_{\mathrm{f}}N_{\mathrm{R}}N_{\mathrm{T}}) complexity for comparable grid resolutions. Introducing Doppler for a time-varying channel adds another search dimension and further increases the number of candidate hypotheses. Consequently, exhaustive GS-CLEAN becomes progressively more computationally and memory intensive as the parameter space and observation dimensions increase.

Proposed NN-CLEAN Algorithm

NN-Assisted Iterative MPC Extraction

To address the multidimensional search bottleneck identified in Section II, we propose NN-CLEAN, which integrates neural network (NN) inference into the iterative CLEAN framework. As illustrated in Figure 2, the exhaustive parameter search in (7) is replaced by a direct mapping from the current residual channel Hrem(fk)H_{\mathrm{rem}}(f_k) to the geometric parameters of the dominant remaining MPC. The model-based path-gain estimation, parametric reconstruction, and residual-subtraction operations of conventional CLEAN are retained.

Overview of the proposed NN-CLEAN framework

Figure 2. Overview of the proposed NN-CLEAN framework.

At the iith iteration, the residual channel observations are supplied directly to the NN, which produces the dominant MPC parameter estimate θ^i\hat{\boldsymbol{\theta}}_i. Given this estimate, the corresponding complex path gain α^i\hat{\alpha}_i is computed using the LS projection in (8). The estimated MPC is then reconstructed and removed from the residual according to (9), after which Hrem(i+1)(fk)H_{\mathrm{rem}}^{(i+1)}(f_k) is supplied to the same network for the next extraction iteration. NN-CLEAN therefore replaces only the computationally intensive grid-search operation while preserving the physical reconstruction and successive-cancellation structure of CLEAN.

An iterative single-MPC architecture is adopted instead of a one-shot network that estimates all MPCs simultaneously. A one-shot formulation must maintain the association among the AoA, AoD, and distance estimates belonging to each MPC, and this association becomes increasingly difficult as the path count increases. Moreover, a one-shot estimator generally requires a predefined output structure for the complete multipath set, making it less suitable for variable path counts. In contrast, NN-CLEAN repeatedly applies the same single-MPC estimator to the evolving residual, allowing the extraction depth to be prescribed or controlled by an external CLEAN stopping criterion without changing the NN output dimension.

Proposed NN Architecture

The NN architecture used for MPC parameter estimation is illustrated in Figure 3. A shared feature-extraction backbone processes the residual channel and learns a common representation of its spatial–frequency characteristics. The extracted representation is then provided to parameter-specific classification heads for AoA, AoD, and distance estimation.

Multi-head residual classification architecture used in NN-CLEAN

Figure 3. Multi-head residual classification architecture used in NN-CLEAN.

The shared backbone comprises pooling and residual blocks that progressively extract the relevant channel features while reducing the intermediate feature dimension. The resulting representation is supplied to the AoA and AoD classification branches. The distance branch additionally employs a fully connected (FC) gating mechanism conditioned on the angular outputs, allowing information from the estimated angular dimensions to contribute to distance classification. Rather than

treating every element of the Cartesian search space Θ\Theta as a separate class, the network produces three unnormalized class-logit vectors at extraction iteration ii:

y^ϕR(i)∈RNϕR,y^ϕT(i)∈RNϕT,y^d(i)∈RNd.(12)\hat{\mathbf{y}}_{\phi_{\mathrm{R}}}^{(i)} \in\mathbb{R}^{N_{\phi_{\mathrm{R}}}}, \qquad \hat{\mathbf{y}}_{\phi_{\mathrm{T}}}^{(i)} \in\mathbb{R}^{N_{\phi_{\mathrm{T}}}}, \qquad \hat{\mathbf{y}}_{d}^{(i)} \in\mathbb{R}^{N_d}. \tag*{(12)}

Each logit vector assigns a classification score to the candidate grid points of its corresponding parameter dimension. The estimated class index for each output head is selected directly from the logits according to

n^q,i=arg⁡max⁡n y^q,n(i),q∈{ϕR,ϕT,d},\hat{n}_{q,i} = \underset{n}{\arg\max}\ \hat{y}_{q,n}^{(i)}, \qquad q \in\{\phi_{\mathrm{R}}, \phi_{\mathrm{T}}, d\},
θ^i=[ΘAoA[n^ϕR,i]ΘAoD[n^ϕT,i]Θdist[n^d,i]].(13)\hat{\boldsymbol{\theta}}_i = \begin{bmatrix} \Theta_{\mathrm{AoA}}[\hat{n}_{\phi_{\mathrm{R}},i}] \\ \Theta_{\mathrm{AoD}}[\hat{n}_{\phi_{\mathrm{T}},i}] \\ \Theta_{\mathrm{dist}}[\hat{n}_{d,i}] \end{bmatrix}. \tag*{(13)}

The resulting estimate θ^i\hat{\boldsymbol{\theta}}_i follows the same parameterization as the estimate produced by GS-CLEAN and can therefore be used directly in the path-gain estimation and residual-subtraction operations in (8) and (9). The multi-head formulation also avoids constructing a single classifier over all NϕRNϕTNdN_{\phi_R}N_{\phi_T}N_d joint grid combinations. Instead, the network produces a total of NϕR+NϕT+NdN_{\phi_R}+N_{\phi_T}+N_d output logits.

Computational Characteristics

The principal computational distinction between GS-CLEAN and NN-CLEAN lies in the estimation of θ^i\hat{\boldsymbol{\theta}}_i. At every extraction iteration, GS-CLEAN evaluates NϕRNϕTNdN_{\phi_R}N_{\phi_T}N_d joint parameter combinations, whereas NN-CLEAN obtains the three parameter estimates through a single forward pass with factorized classification outputs. NN-CLEAN consequently avoids explicit evaluation and storage of the complete multidimensional candidate space.

NN inference primarily comprises tensor operations that can be efficiently parallelized across multiple channel realizations on modern accelerators. The resulting runtime and memory characteristics are evaluated experimentally in § 6 across different processing batch sizes and system configurations.

Simulation and Evaluation Methodology

The evaluation uses the known number of MPCs retained in the reference channel, NMPCN_{\mathrm{MPC}}, to prescribe the extraction depth of both NN-CLEAN and GS-CLEAN. Only the path count is supplied; the geometric parameters and complex gains are estimated from the channel observation. Unequal reference and estimated path counts would require additional association rules for unmatched components, while reconstruction MSE and BER would combine model-order and parameter-estimation errors. Using a common extraction depth therefore focuses the comparison on parameter estimation and successive cancellation, with incorrect path selections and their resulting reconstruction errors still included.

When the path count is unknown, the extraction depth must be determined from residuals containing physical MPCs, observation noise, and cancellation artifacts. The appropriate stopping criterion depends on SNR, relative path powers, and estimator-dependent residual statistics, making a fixed threshold difficult to apply across operating conditions. Adaptive stopping criteria and their effects on missed and spurious detections, reconstruction quality, BER, and computational cost are left for future work.

Synthetic MIMO Configuration

The proposed NN-CLEAN framework is first evaluated using synthesized wideband MIMO channels following the parametric model in Section II. Unless otherwise specified, a 4×44 \times4 MIMO configuration with NT=NR=4N_T=N_R=4 is considered over a 11 GHz bandwidth centered at fc=2.5f_c=2.5 GHz. The channel is sampled at Nf=512N_f=512 uniformly spaced frequency points. Both the Tx and Rx employ ULAs with half-wavelength inter-element spacing evaluated at fcf_c and ideal vertically polarized omnidirectional elements with negligible mutual coupling. The common system and search-space parameters are summarized in Table 1.

ParameterSetting
Center frequency, fcf_c2.5 GHz
Bandwidth, BB1 GHz
Subcarriers, NfN_f512
Tx/Rx elements, NTN_T, NRN_R4, 4
AoA/AoD, ϕR\phi_R, ϕT\phi_T[−90∘,90∘][-90^\circ,90^\circ], 1∘1^\circ resolution
Distance, dd[5,15][5,15] m, 0.05 m resolution

Table 1. Common Simulation Parameters

For an NN-element ULA, the frequency-dependent steering vector at azimuth angle ϕ\phi and frequency fkf_k is

b(ϕ,fk)=1N[1,e−jπfkfcsin⁡(ϕ),…,e−jπ(N−1)fkfcsin⁡(ϕ)]T.(14)\mathbf{b}(\phi,f_k)=\frac{1}{\sqrt{N}}\left[1,e^{-j\pi\frac{f_k}{f_c}\sin(\phi)},\ldots,e^{-j\pi(N-1)\frac{f_k}{f_c}\sin(\phi)}\right]^{\mathsf{T}}. \tag*{(14)}

For grid-based estimation and NN classification, the parameter space Θ\boldsymbol{\Theta} is discretized as follows:

  • AoD (ϕT\phi_T) and AoA (ϕR\phi_R): [−90∘,90∘][-90^\circ,90^\circ] with 1∘1^\circ spacing, giving NϕR=NϕT=181N_{\phi_R}=N_{\phi_T}=181.

  • Distance (dd): [5,15][5,15] m with 0.05 m spacing, giving Nd=201N_d=201.

The complex path gains are generated independently according to αl∼CN(0,2)\alpha_l \sim\mathcal{CN}(0,2). Let H0(fk)\mathbf{H}_0(f_k) denote the noise-free component of the synthetic channel in (3), such that H(fk)=H0(fk)+N(fk)\mathbf{H}(f_k)=\mathbf{H}_0(f_k)+\mathbf{N}(f_k). The synthetic channel-observation SNR is defined as

SNRsyn=10log⁡10(∑k=1Nf∥H0(fk)∥F2∑k=1Nf∥N(fk)∥F2).(15)\mathrm{SNR}_{\mathrm{syn}}=10\log_{10}\left(\frac{\sum_{k=1}^{N_f}\left\|\mathbf{H}_0(f_k)\right\|_F^2}{\sum_{k=1}^{N_f}\left\|\mathbf{N}(f_k)\right\|_F^2}\right). \tag*{(15)}

Training and testing use different parameter distributions. During training, the AoA, AoD, and distance values are restricted to the predefined grids, corresponding to an on-grid configuration. During synthetic evaluation, these parameters are sampled continuously over the same physical ranges, resulting in an off-grid test condition. Consequently, both NN-CLEAN and GS-CLEAN are evaluated in the presence of grid mismatch rather than only at parameter values represented exactly by the search dictionary.

NN Training Procedure

Training samples are synthesized on the fly during optimization. For each sample, the path count is selected from NMPC∈{1,2,3,4}N_{\mathrm{MPC}}\in\{1,2,3,4\}, and the corresponding AoA, AoD, and distance parameters are drawn from their respective on-grid sets. The synthetic channel-observation SNR is independently sampled from [−5,10][-5,10] dB. The network parameters w\mathbf{w} are optimized using Adam with a learning rate of 10−310^{-3} and a batch size of 128.

Because NN-CLEAN extracts MPCs sequentially, the ground-truth paths are ordered in descending magnitude of @page 5/13 starts_mid=1 ends_mid=1 be used directly in the path-gain estimation and residual-subtraction operations in (8) and (9). The multi-head formulation also avoids constructing a single classifier over all NϕRNϕTNdN_{\phi_R}N_{\phi_T}N_d joint grid combinations. Instead, the network produces a total of NϕR+NϕT+NdN_{\phi_R}+N_{\phi_T}+N_d output logits.

Computational Characteristics

The principal computational distinction between GS-CLEAN and NN-CLEAN lies in the estimation of θ^i\hat{\boldsymbol{\theta}}_i. At every extraction iteration, GS-CLEAN evaluates NϕRNϕTNdN_{\phi_R}N_{\phi_T}N_d joint parameter combinations, whereas NN-CLEAN obtains the three parameter estimates through a single forward pass with factorized classification outputs. NN-CLEAN consequently avoids explicit evaluation and storage of the complete multidimensional candidate space.

NN inference primarily comprises tensor operations that can be efficiently parallelized across multiple channel realizations on modern accelerators. The resulting runtime and memory characteristics are evaluated experimentally in § 6 across different processing batch sizes and system configurations.

Simulation and Evaluation Methodology

The evaluation uses the known number of MPCs retained in the reference channel, NMPCN_{\mathrm{MPC}}, to prescribe the extraction depth of both NN-CLEAN and GS-CLEAN. Only the path count is supplied; the geometric parameters and complex gains are estimated from the channel observation. Unequal reference and estimated path counts would require additional association rules for unmatched components, while reconstruction MSE and BER would combine model-order and parameter-estimation errors. Using a common extraction depth therefore focuses the comparison on parameter estimation and successive cancellation, with incorrect path selections and their resulting reconstruction errors still included.

When the path count is unknown, the extraction depth must be determined from residuals containing physical MPCs, observation noise, and cancellation artifacts. The appropriate stopping criterion depends on SNR, relative path powers, and estimator-dependent residual statistics, making a fixed threshold difficult to apply across operating conditions. Adaptive stopping criteria and their effects on missed and spurious detections, reconstruction quality, BER, and computational cost are left for future work.

Synthetic MIMO Configuration

The proposed NN-CLEAN framework is first evaluated using synthesized wideband MIMO channels following the parametric model in Section II. Unless otherwise specified, a 4×44 \times4 MIMO configuration with NT=NR=4N_T=N_R=4 is considered over a 11 GHz bandwidth centered at fc=2.5f_c=2.5 GHz. The channel is sampled at Nf=512N_f=512 uniformly spaced frequency points. Both the Tx and Rx employ ULAs with half-wavelength inter-element spacing evaluated at fcf_c and ideal vertically polarized omnidirectional elements with negligible mutual coupling. The common system and search-space parameters are summarized in Table 1.

ParameterSetting
Center frequency, fcf_c2.5 GHz
Bandwidth, BB1 GHz
Subcarriers, NfN_f512
Tx/Rx elements, NTN_T, NRN_R4, 4
AoA/AoD, ϕR\phi_R, ϕT\phi_T[−90∘,90∘][-90^\circ,90^\circ], 1∘1^\circ resolution
Distance, dd[5,15][5,15] m, 0.05 m resolution

Table 1 (PDF p. 5). Common Simulation Parameters

For an NN-element ULA, the frequency-dependent steering vector at azimuth angle ϕ\phi and frequency fkf_k is

b(ϕ,fk)=1N[1,e−jπfkfcsin⁡(ϕ),…,e−jπ(N−1)fkfcsin⁡(ϕ)]T.(16)\mathbf{b}(\phi,f_k)=\frac{1}{\sqrt{N}}\left[1,e^{-j\pi\frac{f_k}{f_c}\sin(\phi)},\ldots,e^{-j\pi(N-1)\frac{f_k}{f_c}\sin(\phi)}\right]^{\mathsf{T}}. \tag*{(16)}

For grid-based estimation and NN classification, the parameter space Θ\boldsymbol{\Theta} is discretized as follows:

  • AoD (ϕT\phi_T) and AoA (ϕR\phi_R): [−90∘,90∘][-90^\circ,90^\circ] with 1∘1^\circ spacing, giving NϕR=NϕT=181N_{\phi_R}=N_{\phi_T}=181.

  • Distance (dd): [5,15][5,15] m with 0.05 m spacing, giving Nd=201N_d=201.

The complex path gains are generated independently according to αl∼CN(0,2)\alpha_l \sim\mathcal{CN}(0,2). Let H0(fk)\mathbf{H}_0(f_k) denote the noise-free component of the synthetic channel in (3), such that H(fk)=H0(fk)+N(fk)\mathbf{H}(f_k)=\mathbf{H}_0(f_k)+\mathbf{N}(f_k). The synthetic channel-observation SNR is defined as

SNRsyn=10log⁡10(∑k=1Nf∥H0(fk)∥F2∑k=1Nf∥N(fk)∥F2).(17)\mathrm{SNR}_{\mathrm{syn}}=10\log_{10}\left(\frac{\sum_{k=1}^{N_f}\left\|\mathbf{H}_0(f_k)\right\|_F^2}{\sum_{k=1}^{N_f}\left\|\mathbf{N}(f_k)\right\|_F^2}\right). \tag*{(17)}

Training and testing use different parameter distributions. During training, the AoA, AoD, and distance values are restricted to the predefined grids, corresponding to an on-grid configuration. During synthetic evaluation, these parameters are sampled continuously over the same physical ranges, resulting in an off-grid test condition. Consequently, both NN-CLEAN and GS-CLEAN are evaluated in the presence of grid mismatch rather than only at parameter values represented exactly by the search dictionary.

NN Training Procedure

Training samples are synthesized on the fly during optimization. For each sample, the path count is selected from NMPC∈{1,2,3,4}N_{\mathrm{MPC}}\in\{1,2,3,4\}, and the corresponding AoA, AoD, and distance parameters are drawn from their respective on-grid sets. The synthetic channel-observation SNR is independently sampled from [−5,10][-5,10] dB. The network parameters w\mathbf{w} are optimized using Adam with a learning rate of 10−310^{-3} and a batch size of 128.

Because NN-CLEAN extracts MPCs sequentially, the ground-truth paths are ordered in descending magnitude of their complex gains. The target at extraction iteration ii therefore corresponds to the iith strongest MPC. Gaussian label smoothing (GLS) [21] is applied to account for the correlation among neighboring parameter bins. For parameter head q∈{ϕR,ϕT,d}q \in\{\phi_R,\phi_T,d\}, the GLS target at class index nn is

tq,n(i)=exp⁡[−12(n−μq(i)σ)2]∑m=1Nqexp⁡[−12(m−μq(i)σ)2](18)t_{q,n}^{(i)} = \frac{ \exp\left[-\frac{1}{2}\left(\frac{n-\mu_q^{(i)}}{\sigma}\right)^2\right] }{ \sum_{m=1}^{N_q}\exp\left[-\frac{1}{2}\left(\frac{m-\mu_q^{(i)}}{\sigma}\right)^2\right] } \tag*{(18)}

where μq(i)\mu_q^{(i)} is the ground-truth class index of the iith extracted MPC, NqN_q is the number of classes associated with head qq, and σ=2.0\sigma= 2.0 is the smoothing parameter.

Algorithm 1 Three-Phase Training Procedure for NN-CLEAN

  1. Initialize: Model weights ww and Adam optimizer with lr =10−3=10^{-3}

  2. for each training step t=1t=1 to 1,000,0001{,}000{,}000 do

  3. Sample SNRsyn∼U(−5,10)\mathrm{SNR}_{\mathrm{syn}} \sim U(-5,10) dB

  4. Sample NMPC∈{1,2,3,4}N_{\mathrm{MPC}} \in\{1,2,3,4\}

  5. Generate {ϕR,l,ϕT,l,dl}l=1NMPC∈Θ\{\phi_{R,l},\phi_{T,l},d_l\}_{l=1}^{N_{\mathrm{MPC}}} \in\Theta

  6. Sample αl∼CN(0,2)\alpha_l \sim\mathcal{CN}(0,2)

  7. Synthesize H0\mathbf{H}_0 and add AWGN to obtain H\mathbf{H}

  8. Sort the MPCs in descending order of ∣αl∣\lvert\alpha_l\rvert

  9. Generate the GLS targets using (16)

  10. if t≤500,000t \le500{,}000 then

  11. // Phase 1: Dominant-path estimation

  12. Evaluate Lfinal\mathcal{L}_{\mathrm{final}} using the Phase 1 case of (19)

  13. else if t≤750,000t \le750{,}000 then

  14. // Phase 2: Teacher-forced extraction

  15. Extract NMPCN_{\mathrm{MPC}} paths using ground-truth residual subtraction

  16. Evaluate Lfinal\mathcal{L}_{\mathrm{final}} using the Phase 2 case of (19)

  17. else

  18. // Phase 3: Autoregressive extraction

  19. Extract NMPCN_{\mathrm{MPC}} paths using predicted parameters and LS gain estimates

  20. Evaluate Lfinal\mathcal{L}_{\mathrm{final}} using the Phase 3 case of (19)

  21. end if

  22. Backpropagate Lfinal\mathcal{L}_{\mathrm{final}} and update ww

  23. end for

At each extraction iteration, the network operates on a different residual channel. A separate classification loss is therefore evaluated for each residual state encountered during sequential extraction. Let tq(i)t_q^{(i)} denote the GLS target vector and y^q(i)\hat{\mathbf{y}}_q^{(i)} denote the corresponding unnormalized logit vector. The categorical cross-entropy (CCE) for parameter head qq is

CCE⁡(tq(i),y^q(i))=−∑n=1Nqtq,n(i)log⁡(exp⁡(y^q,n(i))∑m=1Nqexp⁡(y^q,m(i))).(19)\operatorname{CCE}\left(t_q^{(i)},\hat{\mathbf{y}}_q^{(i)}\right) = -\sum_{n=1}^{N_q}t_{q,n}^{(i)} \log\left( \frac{\exp\left(\hat{y}_{q,n}^{(i)}\right)} {\sum_{m=1}^{N_q}\exp\left(\hat{y}_{q,m}^{(i)}\right)} \right). \tag*{(19)}

The loss associated with extraction iteration ii is defined as

Liter(i)=CCE⁡(tϕR(i),y^ϕR(i))+CCE⁡(tϕT(i),y^ϕT(i))+3CCE⁡(td(i),y^d(i)).(20)\mathcal{L}_{\mathrm{iter}}^{(i)} = \operatorname{CCE}\left(t_{\phi_R}^{(i)},\hat{\mathbf{y}}_{\phi_R}^{(i)}\right) + \operatorname{CCE}\left(t_{\phi_T}^{(i)},\hat{\mathbf{y}}_{\phi_T}^{(i)}\right) + 3\operatorname{CCE}\left(t_d^{(i)},\hat{\mathbf{y}}_d^{(i)}\right). \tag*{(20)}

A weight of 3 is applied exclusively to the distance loss because a distance error produces a frequency-dependent phase mismatch in the reconstructed MPC. The resulting coherent residual can propagate through subsequent CLEAN iterations and impair the extraction of weaker components.

The final training loss depends on the curriculum phase:

Lfinal={Liter(1),Phase 1,1NMPC∑i=1NMPCLiter(i),Phases 2 and 3.(21)\mathcal{L}_{\mathrm{final}} = \begin{cases} \mathcal{L}_{\mathrm{iter}}^{(1)}, & \text{Phase 1},\\ \frac{1}{N_{\mathrm{MPC}}}\sum_{i=1}^{N_{\mathrm{MPC}}}\mathcal{L}_{\mathrm{iter}}^{(i)}, & \text{Phases 2 and 3}. \end{cases} \tag*{(21)}

Training comprises 10610^6 optimization steps divided into three phases. Phase 1 uses the first 50% steps to train dominant-path estimation. Phase 2 uses the next 25% steps to introduce sequential extraction with ground-truth residual subtraction. Phase 3 uses the final 25% steps to generate the residual sequence from the predicted parameters and their LS gain estimates. Thus, Phases 2 and 3 use the same loss aggregation in (19), but differ in how the residual channels are formed. During Phase 3, the hard parameter decisions and residual updates are treated as stop-gradient operations.

Evaluation Protocol

Baselines and Estimation Metrics

The primary synthetic evaluation is conducted entirely under off-grid testing, with the ground-truth AoA, AoD, and distance drawn continuously within the ranges in Table 1. NN-CLEAN is compared with GS-CLEAN [9], 3D-MUSIC [4], 3D-ESPRIT [6], and a standalone one-shot NN estimator. GS-CLEAN serves as the exhaustive grid-search reference, while the subspace methods are evaluated only for path counts supported by the available signal-subspace dimension.

The one-shot baseline uses the same network architecture, parameter grids, loss weights, and optimization settings as NN-CLEAN. A single model is trained with varying MPC counts from NMPC∈{1,2,3,4}N_{\mathrm{MPC}} \in\{1,2,3,4\}. For each parameter head, the training target is formed by summing Gaussian kernels centered at the ground-truth bins of all MPCs and normalizing the resulting vector. Training uses the original multipath observation throughout, without the sequential residual updates or three-phase curriculum of NN-CLEAN. After a single forward pass, the NMPCN_{\mathrm{MPC}} highest-scoring bins are selected independently from each head using the known reference path count. Ideal association among the selected AoA, AoD, and distance values is assumed during evaluation.

For NN-CLEAN and GS-CLEAN, the reference MPCs are ranked in descending order of their complex-gain magnitudes. The MPC estimated at extraction iteration ii is compared with the iith reference MPC in this ordering. Unless otherwise specified, a paired MPC is counted as correct only when its AoA, AoD, and distance estimates all lie within ±2\pm2 corresponding grid intervals of the ground truth. Accuracy is defined as

A=NcorrectNtrue,(22)A = \frac{N_{\mathrm{correct}}}{N_{\mathrm{true}}}, \tag*{(22)}

where NcorrectN_{\mathrm{correct}} and NtrueN_{\mathrm{true}} denote the numbers of correctly estimated and ground-truth MPCs, respectively.

The precision of successfully associated MPCs is further characterized using the angular and distance multipath-component distance (MCD). With the angles expressed in radians, the angular MCD is

ηang=12∣ejϕR−ejϕ^R∣2+∣ejϕT−ejϕ^T∣2,(23)\eta_{\mathrm{ang}} = \frac{1}{2}\sqrt{\left|e^{j\phi_R}-e^{j\hat{\phi}_R}\right|^2+\left|e^{j\phi_T}-e^{j\hat{\phi}_T}\right|^2}, \tag*{(23)}

and the normalized distance MCD is

ηd=∣d−d^∣Δdmax⁡,Δdmax⁡=dmax⁡−dmin⁡.(24)\eta_d = \frac{\left|d-\hat{d}\right|}{\Delta d_{\max}}, \qquad\Delta d_{\max}=d_{\max}-d_{\min}. \tag*{(24)}

For either metric, the root-mean-square error (RMSE) over the NmN_m successfully associated MPCs is

RMSE⁡x=1Nm∑l=1Nmηx,l2,x∈{ang,d}.(25)\operatorname{RMSE}_x=\sqrt{\frac{1}{N_m}\sum_{l=1}^{N_m}\eta_{x,l}^{2}}, \qquad x\in\{\mathrm{ang},d\}. \tag*{(25)}

The fidelity of the synthetic channel reconstruction is additionally characterized by the energy-captured ratio

ϵ=∥∑i=1NMPCH^i∥F2∥H0∥F2,(26)\epsilon=\frac{\left\lVert\sum_{i=1}^{N_{\mathrm{MPC}}}\hat{H}_i\right\rVert_F^2}{\left\lVert H_0\right\rVert_F^2}, \tag*{(26)}

where the Frobenius norms are evaluated over the complete spatial–frequency channel. Using the noise-free reference H0H_0 prevents AWGN energy from being interpreted as recoverable multipath energy.

2) Runtime and Memory Profiling: The computational comparison between NN-CLEAN and GS-CLEAN uses synthesized channels under the baseline 4×44\times4, Nf=512N_f=512 configuration on an NVIDIA GeForce RTX 4070 GPU with 12 GB of device memory. Runtime and peak GPU memory are measured as the processing batch size increases from 1 to 8 for two workloads. The one-MPC workload measures the parameter-search call from the observed channel HH to the estimator outputs, using NN inference for NN-CLEAN and exhaustive AoA–AoD–distance search for GS-CLEAN. The three-MPC workload measures the end-to-end extraction call, including parameter search, LS gain estimation, path reconstruction, and residual updates across three sequential iterations. Untimed

Search gridAngular resolutionDistance resolution
Very coarse4∘4^\circ0.20 m
Coarse2∘2^\circ0.10 m
Baseline1∘1^\circ0.05 m
Fine0.5∘0.5^\circ0.025 m
Very fine0.25∘0.25^\circ0.0125 m

Table 2. Search Grids Used in the Resolution Sweep

warm-up runs are performed before measurement to exclude graph tracing and one-time initialization overhead.

Batch size specifies the number of independent channel realizations processed concurrently within the same estimation call, and the reported runtime covers the complete batch. Such a workload may arise in a centralized MIMO or ISAC processor handling observations from multiple users or vehicles within the same processing interval. Each sweep keeps the path count fixed at one or three MPCs per realization, so increasing batch size changes the concurrent workload while preserving the extraction depth.

3) Observation-Dimension and Search-Grid Resolution Sweeps: The dependence of path accuracy on the observation dimensions and search-grid resolution is evaluated using NMPC=3N_{\mathrm{MPC}}=3 off-grid channels at SNRsyn=5\mathrm{SNR}_{\mathrm{syn}}=5 dB, with AoA, AoD, and distance sampled continuously in each sweep. The antenna sweep varies NT=NRN_T=N_R from 4 to 8 with Nf=512N_f=512, and the subcarrier sweep varies Nf∈{64,128,256,512,1024,2048}N_f\in\{64,128,256,512,1024,2048\} with NT=NR=4N_T=N_R=4; both use the baseline search grid. The search-grid resolution sweep holds NT=NR=4N_T=N_R=4 and Nf=512N_f=512 and uses the five grids in Table II. The remaining system parameters follow Table I.

A separate NN-CLEAN model is trained for each configuration following Algorithm 1. The antenna and subcarrier sweeps change its input dimension, whereas the search-grid resolution sweep changes only the sizes of its AoA, AoD, and distance classification outputs and their directly connected layers. The remaining architecture and training procedure are unchanged. For the corresponding GS-CLEAN evaluations, the array and frequency responses are regenerated for each observation dimension, and the search dictionary is constructed at each grid resolution. Both methods are evaluated using the path accuracy defined in (20). The antenna and subcarrier sweeps use the ±2\pm2-grid tolerance of the baseline search grid. This same physical tolerance, ±2∘\pm2^\circ for AoA and AoD and ±0.10\pm0.10 m for distance, is retained across all five resolution settings so that the permitted parameter error does not vary with the search grid.

A separate system-level evaluation is conducted using the ray-tracing capabilities of the NVIDIA Sionna RT package [22]. The simple_street_canyon_with_cars scene is used to evaluate the proposed method under geometry-dependent propagation within an end-to-end communication link. The carrier frequency, antenna configuration, and parameter-search ranges remain consistent with Table 1.

Separate LOS and NLOS test sets are generated in the same ray-tracing scene. The Tx and Rx are randomly positioned at valid roadway locations, and placements intersecting scene objects are discarded. Realizations with an unobstructed direct path are assigned to the LOS set; those without a direct path are assigned to the NLOS set. Sionna RT provides the AoA, AoD, propagation delay τ\tau, and complex coefficient of each resolved MPC, with propagation distance obtained as d=cτd=c\tau. After removing components outside the adopted estimation ranges and redundant paths, the main LOS and NLOS evaluations retain NMPC=2N_{\mathrm{MPC}}=2 paths per realization. A separate three-MPC LOS test set is generated for the ablation study in Section IV-D1. The trained NN-CLEAN model and GS-CLEAN search grid remain fixed across these evaluations.

Each operating point in the LOS and NLOS sweeps is evaluated over 10 independent Monte Carlo runs, with 1,000 test samples per propagation condition in each run. The methods use the same channel realizations within each run, and the reported path accuracy, channel-reconstruction MSE, and BER are averaged over the 10 runs.

The orthogonal frequency-division multiplexing (OFDM) resource grid contains Ns=14N_s=14 OFDM symbols and Nf=512N_f=512 subcarriers, with a cyclic-prefix length of 64 samples. OFDM symbol 7 is allocated to orthogonal MIMO pilots. The information bits are encoded using a rate-1/2 5G low-density parity-check (LDPC) code and mapped to quadrature phase-shift keying (QPSK) symbols. The communication evaluation covers Eb/N0∈[−3,10]E_b/N_0 \in[-3,10] dB, with the AWGN variance determined from the modulation order, coding rate, and cyclic-prefix overhead.

For each test sample, Sionna RT generates the noiseless frequency-domain channel HRT∈CNR×NT×NfH_{\mathrm{RT}}\in\mathbb{C}^{N_R\times N_T\times N_f}. Let X∈CNT×Ns×NfX\in\mathbb{C}^{N_T\times N_s\times N_f} and Y∈CNR×Ns×NfY\in\mathbb{C}^{N_R\times N_s\times N_f} denote the transmitted and received resource grids, respectively. Their kkth subcarrier slices are denoted by Xk∈CNT×NsX_k\in\mathbb{C}^{N_T\times N_s} and Yk∈CNR×NsY_k\in\mathbb{C}^{N_R\times N_s}. Under the quasi-static channel assumption, the received signal on each subcarrier is

Yk=HRT(fk)Xk+Wk,k=1,…,Nf,(27)Y_k=H_{\mathrm{RT}}(f_k)X_k+W_k,\qquad k=1,\ldots,N_f, \tag*{(27)}

where HRT(fk)∈CNR×NTH_{\mathrm{RT}}(f_k)\in\mathbb{C}^{N_R\times N_T} is the channel matrix at frequency fkf_k, and Wk∈CNR×NsW_k\in\mathbb{C}^{N_R\times N_s} represents AWGN.

The complete ray-tracing, channel-estimation, reconstruction, and communication-receiver chain is illustrated in Figure 4. The pilot-bearing entries of YY, denoted by YpilotY_{\mathrm{pilot}}, are processed by the Least Squares (LS) channel estimator. Nearest-neighbor interpolation produces the full-grid estimate H^LS\hat{H}_{\mathrm{LS}}, which serves as the common input to NN-CLEAN and GS-CLEAN. The parameter–gain pairs estimated by each method are then used to reconstruct H^\hat{H} according to the channel expansion in (3), with the additive-noise term omitted.

Sionna ray-tracing and communication-link evaluation framework

Figure 4. Sionna ray-tracing and communication-link evaluation framework.

The reconstructed channel H^\hat{H} and received resource grid YY are supplied to the downstream receiver. The linear minimum mean-square error (LMMSE) equalizer produces estimates of the transmitted QPSK symbols, which are subsequently processed by the QPSK demapper and 5G LDPC decoder to obtain the estimated information bits x^\hat{x}.

The synthetic evaluation is parameterized by SNRsyn\mathrm{SNR}_{\mathrm{syn}}, whereas the communication-link evaluation uses Eb/N0E_b/N_0, with EbE_b denoting the energy per information bit. For the adopted OFDM configuration, pilot normalization, and noise scaling, the measured pilot-level channel-observation SNR is approximately 2 dB below Eb/N0E_b/N_0 in both LOS and NLOS conditions. Thus, Eb/N0=7E_b/N_0=7 dB corresponds to approximately 5 dB at the pilots. This correspondence provides a reference between the noise levels; the LS channel estimation and interpolation used to form the CLEAN input produce a different error structure from the directly perturbed synthetic channel observations.

RT path accuracy is evaluated separately for the LOS and NLOS datasets using the same extraction-order association and ±2\pm2-grid tolerance adopted for the synthetic evaluation, with (22) used to compute the reported accuracy. All estimated MPCs are retained for channel reconstruction, irrespective of whether they satisfy the path-accuracy tolerance. The reconstructed channel is compared with the noiseless RT reference using

MSE⁡H=1NfNTNR∑k=1Nf∥HRT(fk)−H^(fk)∥F2(28)\operatorname{MSE}_{H} = \frac{1}{N_fN_TN_R}\sum_{k=1}^{N_f}\left\lVert\mathbf{H}_{\mathrm{RT}}(f_k)-\hat{\mathbf{H}}(f_k)\right\rVert_F^2 \tag*{(28)}

Communication performance is characterized by the BER obtained by comparing the decoded information bits x^\hat{x} with the transmitted information bits xx at each Eb/N0E_b/N_0 operating point. LS channel estimation with nearest-neighbor interpolation and perfect channel state information (CSI) are included as the conventional and idealized receiver references, respectively.

1) Ablation Study: The full NN-CLEAN model trained according to Algorithm 1 is compared with four ablation variants. In w/o-GLS, the targets in (16) are replaced by one-hot targets at the same ground-truth class indices, while the CCE in (17) is retained. In w/o-gating, the distance head receives the shared backbone features through a branch parallel to the AoA and AoD heads, without angular conditioning. The uniform-weight variant changes the distance CCE coefficient in (18) from 3 to 1, assigning equal weight to all three parameter losses. The direct-Phase3 variant uses the Phase 3 residual updates and loss in (19) from the first training step, omitting Phases 1 and 2. Except for the stated modification, each variant retains the full model’s architecture and training settings described in Section IV-B, including the same total number of optimizer updates. All models are trained separately and evaluated on the same three-MPC LOS RT test samples using the receiver configuration described above. Path accuracy, channel-reconstruction MSE, and BER are compared at Eb/N0=5E_b/N_0 = 5 dB.

Results and Discussion

Baseline Multipath Estimation Performance

Under the off-grid synthetic evaluation, Figure 5 compares NN-CLEAN with GS-CLEAN [9], 3D-MUSIC [4], 3D-ESPRIT [6], and the one-shot NN as the path count increases. For NMPC∈{1,2}N_{\mathrm{MPC}} \in\{1,2\}, NN-CLEAN achieves the highest path accuracy, slightly exceeding GS-CLEAN while maintaining a clear advantage over the subspace and one-shot baselines. In these sparse cases, the learned estimator identifies the relevant region of the three-dimensional AoA–AoD–distance space without explicitly evaluating every candidate at each CLEAN iteration. For NMPC∈{3,4}N_{\mathrm{MPC}} \in\{3,4\}, the accuracy of both CLEAN-based methods decreases, with GS-CLEAN retaining higher accuracy. Because the reference parameters are off-grid, reconstructing a path with a discrete dictionary atom generally leaves structured residual energy after subtraction. These errors affect subsequent extraction steps and make weaker MPCs more difficult to recover. At a fixed aggregate SNRsyn\mathrm{SNR}_{\mathrm{syn}}, increasing the path count also introduces greater inter-path interference and can reduce the individual SNR of weaker components. NN-CLEAN additionally depends on learned parameter decisions, and an inaccurate early estimate can distort the residual supplied

Off-grid MPC estimation accuracy versus path count

Figure 5. Off-grid MPC estimation accuracy versus path count under the baseline synthetic configuration at SNRsyn=5\mathrm{SNR}_{\mathrm{syn}} = 5 dB.

to later iterations. Its larger accuracy reduction is consistent with greater sensitivity to these increasingly difficult residual observations. The one-shot NN degrades more rapidly, even with ideal cross-MPC association. It predicts every MPC from the original superposition, whereas NN-CLEAN updates the observation after each estimated path is removed. Successive cancellation reduces the contribution of previously extracted components before later predictions. The comparison therefore supports retaining the CLEAN recursion under the evaluated baseline configuration.

Parameter Precision and Reconstruction Fidelity

Path accuracy determines whether an MPC satisfies the prescribed detection tolerance but does not characterize the residual error of a successfully associated path. Figure 6 therefore presents the empirical cumulative distribution functions (CDFs) of angular MCD (Figure 6a), distance MCD (Figure 6b), and energy-captured ratio (Figure 6c) for the two-path case. The MCD distributions are conditional on successful path association and therefore measure estimation precision rather than unconditional path-recovery performance.

CDFs of angular MCD, distance MCD, and energy-captured ratio

Figure 6. CDFs of angular MCD, distance MCD, and energy-captured ratio for NMPC=2N_{\mathrm{MPC}} = 2 over the synthetic SNR conditions.

As SNRsyn\mathrm{SNR}_{\mathrm{syn}} decreases, the angular- and distance-error distributions broaden, while the energy-captured ratio deviates further from its ideal value. GS-CLEAN retains the highest conditional precision because it evaluates the complete candidate grid explicitly. Nevertheless, the NN-CLEAN distributions remain close to the GS-CLEAN reference across the evaluated SNR range, indicating that the additional localization error is limited once NN-CLEAN identifies the correct MPC neighborhood.

Both methods remain subject to the same off-grid quantization floor because the continuously generated paths are reconstructed using discrete dictionary atoms. Angular mismatch perturbs the spatial array response, whereas distance mismatch produces a coherent phase error across the observed bandwidth. The latter persists over all subcarriers and can propagate through successive residual updates. Although NN-CLEAN introduces an additional classification error, the closely aligned MCD and energy-captured distributions show that it preserves most of the dominant geometric and energetic channel structure.

Runtime and Memory Efficiency

Figure 7 compares the runtime and peak GPU memory of the one-MPC parameter-search stage as the processing batch size, NbatchN_{\mathrm{batch}}, increases from 1 to 8. At Nbatch=1N_{\mathrm{batch}} = 1, NN-CLEAN requires 0.82 ms, compared to 1.76 ms for GS-CLEAN. GS-CLEAN runtime and memory increase approximately linearly over the batch sweep, with both quantities roughly doubling from Nbatch=4N_{\mathrm{batch}} = 4 to 8. NN-CLEAN runtime remains below 1 ms throughout the sweep, while its memory requirement grows much more slowly. At Nbatch=8N_{\mathrm{batch}} = 8, NN-CLEAN takes 0.92 ms, compared to 25.24 ms for GS-CLEAN, corresponding to an approximately 28× speedup. Peak GPU memory is 0.04 GB for NN-CLEAN and 2.16 GB for GS-CLEAN, a reduction by a factor of approximately 53. The computational advantage therefore becomes substantially larger as more channels are processed within the same estimation call.

Runtime and Memory Comparison of NN-CLEAN and GS-CLEAN for one-MPC

Figure 7. Runtime and Memory Comparison of NN-CLEAN and GS-CLEAN for one-MPC

Table III compares the one-MPC search times with the end-to-end runtime and peak memory of complete three-MPC extraction. GS-CLEAN takes approximately 3× its one-MPC search time, consistent with dictionary evaluation dominating the workload and being repeated at each extraction step. NN-CLEAN requires 1.91 ms at Nbatch=1N_{\mathrm{batch}} = 1, approximately 2.3×

NbatchN_{\mathrm{batch}}MethodOne-MPC search (ms)Three-MPC end-to-end runtime (ms)Three-MPC peak memory (GB)
1GS-CLEAN1.765.400.28
1NN-CLEAN0.821.910.02
4GS-CLEAN12.3136.681.08
4NN-CLEAN0.732.140.03
8GS-CLEAN25.2475.162.16
8NN-CLEAN0.922.800.04

Table III. Runtime and Memory Comparison of NN-CLEAN and GS-CLEAN with three-MPC

its one-MPC search time. This lower ratio is consistent with fixed call and synchronization overhead forming a larger fraction of the short single-path measurement and being amortized within the three-path estimation call. The ratio approaches 3× as the batch workload increases. At Nbatch=8N_{\mathrm{batch}} = 8, complete NN-CLEAN extraction achieves an approximately 27× speedup and a 52-fold reduction in peak GPU memory compared to GS-CLEAN. For both methods, peak memory remains close to the corresponding one-MPC requirement because the processing workspace is reused between successive extraction steps.

Impact of Observation Dimensions and Search-Grid Resolution

Figure 8 compares the effects of observation dimensions and search-grid resolution on three-MPC off-grid estimation at SNRsyn=5\mathrm{SNR}_{\mathrm{syn}} = 5 dB. In Figure 8(a), increasing NT=NRN_T = N_R from 4 to 8 gives GS-CLEAN a modest accuracy improvement, while NN-CLEAN shows no consistent increase. The number of frequency observations has a stronger effect, as shown in Figure 8(b). Both methods improve with NfN_f, and NN-CLEAN obtains most of its gain below the baseline Nf=512N_f = 512. Additional frequency observations help constrain the distance-dependent phase progression used in parameter estimation and cancellation. Because the bandwidth is fixed, increasing NfN_f provides denser sampling and supports noise averaging without changing the nominal delay resolution. The gains become smaller beyond Nf=512N_f = 512, which captures most of the improvement observed in this sweep.

Accuracy under variations in observation dimension and search grid resolution

Figure 8. Accuracy under variations in observation dimension and search grid resolution for NMPC=3N_{\mathrm{MPC}} = 3 at SNRsyn=5\mathrm{SNR}_{\mathrm{syn}} = 5 dB.

Figure 8(c) compares search grids using the same physical accuracy tolerances. NN-CLEAN slightly exceeds GS-CLEAN on the coarse grid, while both methods achieve their highest measured accuracy at the baseline resolution. Finer grids provide no consistent improvement for GS-CLEAN and reduce NN-CLEAN accuracy. For NN-CLEAN, the classification outputs and their directly connected layers expand with grid refinement, but the shared backbone, hidden feature dimensions, and optimization-step count remain fixed. The model must therefore distinguish more closely spaced classes using the same feature representation. In addition, the fixed GLS width in bins corresponds to a narrower physical smoothing interval on finer grids. These training and architecture choices may limit the benefit of reducing the grid spacing.

Ray-Tracing Generalization and Communication Performance

The Sionna RT experiments provide a geometry-based validation of NN-CLEAN and evaluate how parameter-estimation errors affect channel reconstruction and downstream communication performance. Unlike the independently sampled synthetic parameters, the RT paths are determined jointly by the scene geometry and propagation interactions. The following results therefore evaluate both the transfer of the learned search to a different channel distribution and the effect of the resulting estimation errors on the decoded communication link.

Ray-Tracing MPC Estimation Accuracy

Figure 9 compares path accuracy for the two-MPC LOS and NLOS test sets. Accuracy generally increases with Eb/N0E_b/N_0 and levels off toward the upper end of the sweep. GS-CLEAN maintains higher accuracy in both propagation conditions, while NN-CLEAN saturates earlier, particularly for NLOS channels. Both estimators achieve higher accuracy in LOS compared to NLOS under the same retained path count, search grid, and evaluation tolerance.

Accuracy versus $E_b/N_0$ for two-MPC LOS and NLOS RT channels

Figure 9. Accuracy versus Eb/N0E_b/N_0 for two-MPC LOS and NLOS RT channels.

The RT result differs from the synthetic two-MPC baseline, where NN-CLEAN slightly exceeds GS-CLEAN. RT paths have geometry-dependent parameter relationships, and their channel observations are obtained through pilot-based LS channel estimation and interpolation. Applying the trained NN-CLEAN model without retraining therefore exposes it to changes in both path statistics and input-error structure. GS-CLEAN continues to evaluate the physical dictionary directly. The observed accuracy gap captures the combined change in channel distribution and observation pipeline; the pilot-level

SNR correspondence does not establish identical CLEAN input conditions.

Ray-Tracing Channel Reconstruction

Figure 10 compares channel-reconstruction MSE against the noiseless two-MPC RT reference. Both CLEAN-based methods achieve substantially lower MSE compared to LS channel estimation with nearest-neighbor interpolation. The parametric fit constrains the reconstructed channel to the spatial–frequency responses of the estimated paths, reducing the error of the interpolated observation. GS-CLEAN achieves the lowest MSE in both propagation conditions. Over the tested Eb/N0E_b/N_0 range, the maximum absolute difference between NN-CLEAN and GS-CLEAN remains below 1.4×10−21.4 \times10^{-2} for both LOS and NLOS channels.

Channel-reconstruction MSE versus $E_b/N_0$ for two-MPC LOS and NLOS RT channels

Figure 10. Channel-reconstruction MSE versus Eb/N0E_b/N_0 for two-MPC LOS and NLOS RT channels.

All estimated MPCs are included in reconstruction, weighted by their complex gains. An estimate outside the path-accuracy tolerance can still approximate part of the reference response, and its effect on MSE depends on its power and the resulting spatial–frequency mismatch. At higher Eb/N0E_b/N_0, both reconstruction curves vary only weakly as pilot noise decreases. This behavior is consistent with persistent errors from grid discretization and the interpolated LS input. These errors affect the fitted parameters and gains and can propagate through successive cancellation, limiting further improvement under the fixed estimation pipeline.

  1. End-to-End Communication Performance: Figure 11 compares BER for the four receiver cases in two-MPC LOS and NLOS channels. Perfect CSI provides the lowest BER, followed by GS-CLEAN, NN-CLEAN, and LS channel estimation with nearest-neighbor interpolation. Both CLEAN-based reconstructions substantially improve BER compared to LS in both propagation conditions. LOS generally provides lower BER compared to NLOS across the four receivers, apart from a small GS-CLEAN reversal at the upper end of the sweep. The LOS advantage also appears with perfect CSI, showing that the LOS–NLOS difference reflects the communication characteristics of the channels as well as channel-estimation error.

BER versus $E_b/N_0$ for two-MPC LOS and NLOS RT channels

Figure 11. BER versus Eb/N0E_b/N_0 for two-MPC LOS and NLOS RT channels.

Over the entire tested Eb/N0E_b/N_0 range, the maximum absolute BER difference between NN-CLEAN and GS-CLEAN is approximately 1.05% for LOS and 0.69% for NLOS. At

Eb/N0=5E_b/N_0 = 5 dB, the absolute NN-CLEAN–perfect-CSI gap is approximately 0.4% in both conditions. NN-CLEAN BER levels off toward the upper end of the sweep, consistent with its residual channel-reconstruction error. Its reconstruction nevertheless retains a substantial BER advantage over interpolated LS, while the gap to GS-CLEAN quantifies the link-performance penalty associated with the computational savings.

  1. Ablation Study: Table IV compares the full model and four variants on three-MPC LOS RT channels at Eb/N0=5E_b/N_0 = 5 dB. The w/o-GLS variant shows the largest deterioration across all three metrics. This result supports distributing supervision across neighboring parameter bins, whose corresponding channel responses are correlated. Removing angular conditioning in w/o-gating produces a smaller loss in path accuracy, together with higher reconstruction MSE and BER.

VariantAccuracy (%)MSEBER (%)
Full NN-CLEAN75.132.51×10−22.51 \times10^{-2}0.79
w/o-GLS71.243.48×10−23.48 \times10^{-2}1.40
w/o-gating74.532.61×10−22.61 \times10^{-2}0.89
uniform-weight75.123.08×10−23.08 \times10^{-2}1.11
direct-Phase374.172.67×10−22.67 \times10^{-2}1.01

Table IV. NN-CLEAN Ablation Results for Three-MPC LOS RT Channels at Eb/N0=5E_b/N_0 = 5 dB

The uniform-weight variant retains nearly the same path accuracy as the full model but has higher MSE and BER. The larger distance-loss weight therefore benefits reconstruction and link performance even when aggregate path accuracy changes little. This outcome is consistent with distance errors introducing frequency-dependent phase mismatch in the reconstructed paths and subsequent residuals. The direct-Phase3 variant also degrades all three metrics, supporting the gradual introduction of sequential extraction before training with prediction-dependent residuals. This comparison assesses the complete curriculum and does not isolate the individual contributions of Phases 1 and 2.

Conclusion

This paper presented NN-CLEAN, which replaces the exhaustive parameter search within CLEAN with a multi-head neural classifier while retaining LS gain estimation, parametric reconstruction, and residual subtraction. Reusing the same single-MPC network permits different extraction depths without changing its output structure. Off-grid synthetic experiments show that NN-CLEAN is most competitive with GS-CLEAN in sparse channels, while GS-CLEAN retains higher accuracy as the path count increases. The observation-dimension and grid-resolution sweeps also show that larger antenna configurations and finer output grids do not uniformly improve the learned estimator.

For complete three-MPC extraction at a batch size of eight, NN-CLEAN achieves an approximately 27× speedup and a 52-fold reduction in peak GPU memory compared to GS-CLEAN. The two-MPC RT evaluation shows a reconstruction and BER penalty relative to GS-CLEAN in both LOS and NLOS, while both CLEAN-based methods substantially improve performance over interpolated LS. At Eb/N0=5E_b/N_0 = 5 dB, the absolute BER gap between NN-CLEAN and perfect CSI is approximately 0.4% in both conditions. Three-MPC LOS ablations support label smoothing, angular conditioning, distance-loss weighting, and staged training. The results quantify the tradeoff between batched computational efficiency and estimation performance. Adaptive stopping for unknown path counts remains a direction for future work.

Acknowledgements

This work was supported in part by CoCoSys, one of seven centers in JUMP 2.0, a Semiconductor Research Corporation (SRC) program sponsored by DARPA.

References

  1. [1]F. Liu, Y. Cui, C. Masouros, J. Xu, T. X. Han, Y. C. Eldar, and S. Buzzi, “Integrated sensing and communications: Toward dual-functional wireless networks for 6g and beyond,” IEEE journal on selected areas in communications, vol. 40, no. 6, pp. 1728–1767, 2022.DOI
  2. [2]A. Sams and B. Smida, “On the reliability of estimation bounds in low-snr bistatic isac,” in GLOBECOM 2025-2025 IEEE Global Communications Conference. IEEE, 2025, pp. 1440–1445.
  3. [3]R. Schmidt, “Multiple emitter location and signal parameter estimation,” IEEE transactions on antennas and propagation, vol. 34, no. 3, pp. 276–280, 1986.DOI
  4. [4]M. C. Vanderveen, C. B. Papadias, and A. Paulraj, “Joint angle and delay estimation via der for multipath signals arriving at an antenna array,” IEEE Communications letters, vol. 1, no. 1, pp. 12–14, 2002.
  5. [5]R. Roy and T. Kailath, “Esprit-estimation of signal parameters via rotational invariance techniques,” IEEE Transactions on acoustics, speech, and signal processing, vol. 37, no. 7, pp. 984–995, 2002.
  6. [6]M. C. Vanderveen, A.-J. Van der Veen, and A. Paulraj, “Estimation of multipath parameters in wireless communications,” IEEE transactions on signal processing, vol. 46, no. 3, pp. 682–690, 2002.
  7. [7]A. A. Hussain, N. Tayem, and A.-H. Soliman, “Low complexity doa estimation of multiple coherent sources using a single direct data snapshot,” IEEE Access, vol. 12, pp. 2371–2388, 2023.DOI
  8. [8]K. Xu, M. Xing, R. Zhang, M. Sha, W. Nie, Y. Quan et al., “High-accuracy doa estimation algorithm at low snr through exploiting a supervised index,” IEEE Transactions on Aerospace and Electronic Systems, vol. 58, no. 4, pp. 3658–3665, 2022.DOI
  9. [9]V. Kristem, S. Sangodoyin, C. U. Bas, M. Käske, J. Lee, C. Schneider, G. Sommerkorn, C. J. Zhang, R. S. Thomä, and A. F. Molisch, “3d mimo outdoor-to-indoor propagation channel measurement,” IEEE Transactions on Wireless Communications, vol. 16, no. 7, pp. 4600–4613, 2017.arxiv.org/abs/1703.10607
  10. [10]L. Sun, C. Deng, J.-S. Hsu, and S. Sangodoyin, “Guided random search algorithm for offline high resolution terahertz radar sensing,” IEEE Transactions on Terahertz Science and Technology, 2026.DOI
  11. [11]F. Athley, “Threshold region performance of maximum likelihood direction of arrival estimators,” IEEE Transactions on Signal Processing, vol. 53, no. 4, pp. 1359–1373, 2005.DOI
  12. [12]T. Luo, P. Chen, Z. Yang, L. Zheng, Y. Zhang, and J. Liu, “A robust deep learning-based doa super-resolution estimation method with single snapshot,” IEEE Transactions on Vehicular Technology, 2025.DOI
  13. [13]H. Huang, J. Yang, H. Huang, Y. Song, and G. Gui, “Deep learning for super-resolution channel estimation and doa estimation based massive mimo system,” IEEE Transactions on Vehicular Technology, vol. 67, no. 9, pp. 8549–8560, 2018.DOI
  14. [14]S. Zheng, Z. Yang, W. Shen, L. Zhang, J. Zhu, Z. Zhao, and X. Yang, “Deep learning-based doa estimation,” IEEE Transactions on Cognitive Communications and Networking, vol. 10, no. 3, pp. 819–835, 2024.DOI
  15. [15]Q. Xu, Y. Gao, R. Zhang, J. Kong, and C. Yuen, “Deep learning-based doa estimation via grid search approach for unknown and variable number of signals,” IEEE Transactions on Cognitive Communications and Networking, 2025.
  16. [16]A. M. Elbir, “Deepmusic: Multiple signal classification via deep learning,” IEEE Sensors Letters, vol. 4, no. 4, pp. 1–4, 2020.DOI
  17. [17]S. Zheng, Z. Yang, W. Shen, L. Zhang, J. Zhu, Z. Zhao, and X. Yang, “Deep learning-based doa estimation,” IEEE Transactions on Cognitive Communications and Networking, vol. 10, no. 3, pp. 819–835, 2024.DOI
  18. [18]S. Xu, Z. Wang, W. Zhang, and Z. He, “End-to-end regression neural network for coherent doa estimation with dual-branch outputs,” IEEE Sensors Journal, vol. 24, no. 3, pp. 4047–4056, 2023.
  19. [19]C. Deng, L. Sun, J. Lee, and A. Raychowdhury, “Neural network-assisted clean for channel modeling in low-snr regimes,” arXiv preprint arXiv:2607.27450, 2026.arxiv.org/abs/2607.27450
  20. [20]J. A. Högbom, “Aperture synthesis with a non-regular distribution of interferometer baselines,” Astronomy and Astrophysics Supplement, Vol. 15, p. 417, vol. 15, p. 417, 1974.
  21. [21]B. Shaybet, V. Tourbabin, and B. Rafaely, “Srp-phat-net: A reliability-driven dnn for reverberant speaker localization,” arXiv preprint arXiv:2510.22682, 2025.arxiv.org/abs/2510.22682
  22. [22]J. Hoydis, S. Cammerer, F. Ait Aoudia, M. Nimier-David, L. Maggi, G. Marcus, A. Vem, and A. Keller, “Sionna,” 2022, https://nvlabs.github.io/sionna/.arxiv.org/abs/2203.11854

Paper details

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

views · 7

downloads · 1

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

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents