4 Radio Map Solver

In the previous sections, we have detailed the path solver, which computes propagation paths and the related electric fields from a source to a target. Now, we turn our attention to the radio map solver, which computes a radio map (also known as coverage map or power map) for a given scene and source. While we describe the algorithm for a single source, Sionna RT can compute radio maps for multiple sources in parallel.

Refer to caption
(a) Scene with a measurement plane.
Refer to caption
(b) Radio map for the measurement plane in (a).
Figure 25: (a) A measurement surface, which is here a plane parallel to the ground, is placed in the scene to capture paths without affecting their propagation, (b) the resulting radio map showing the spatial distribution of channel gains.

A radio map estimates the channel gain (5) from a source to each point on a measurement surface, as illustrated in Figure 25. The measurement surface is partitioned into measurement cells, which are assumed to be planar. For each cell, the solver estimates the average channel gain that would be observed by a target placed within that cell. Note that the measurement surface does not interact with the electromagnetic waves, but only serves to capture the paths that intersect it. Moreover, a ray can intersect the measurement surface at multiple points.

In Section 4.1, we present a definition of radio maps that allows for their efficient computation using SBR. This approach makes the computation of radio maps both fast and scalable.

4.1 Definition of Radio Map

We define radio maps as path integrals, similarly to how measurements are defined in computer graphics [23, 24, Section 3.7]. Consider a point source 𝐬 and a measurement surface ℳ, divided into NM cells Mi, for i=1,…,NM, each of area |Mi|. For clarity, we ignore diffraction in this subsection. Diffraction is considered in Section 4.2.

In the propagation model implemented by Sionna RT, diffuse reflections spawn new ray tubes, whereas specular reflections and refractions merely deviate incident ray tubes, as illustrated in Figure 26.

Refer to caption
(a) Specular reflection
Refer to caption
(b) Diffuse reflection
Figure 26: A specular reflection (left) deviates the incident ray tube, whereas a diffuse reflection (right) spawns a new ray tube. Shown in 2D for clarity.

Ignoring diffuse reflections for now, 𝐬 is the only source of ray tubes, and every path therefore consists of a single ray tube. The radio map value for the i-th cell due to specular reflections and refractions is

Ci(ℛ,𝒯)=1|Mi|⁢∫Mie(ℛ,𝒯)⁢(𝐭)⁢𝑑A⁢(𝐭), (39)

where d⁢A⁢(𝐭) is an infinitesimal surface element of Mi, and

e(ℛ,𝒯)⁢(𝐭)=∑p∈𝒫(ℛ,𝒯)⁢(𝐬→𝐭)e⁢(p)⁢𝒱⁢(p) (40)

is the channel gain at 𝐭 due to specular reflections and refractions. Here, 𝒫(ℛ,𝒯)⁢(𝐬→𝐭) denotes the countable set of paths p=(𝐬,𝐯(1),…,𝐯(ℓ),𝐭) connecting 𝐬 to 𝐭 through specular reflections and refractions. The visibility function 𝒱⁢(p) equals 1 if p is not occluded and 0 otherwise. The channel gain associated with p is

e⁢(p)=∥λ04⁢π⁢𝐓𝐂T⁢(θT,φT)∥22, (41)

where λ0 is the free-space wavelength, 𝐂T is the two-dimensional complex transmit antenna pattern evaluated at the departure angles (θT,φT) of p, and 𝐓 is a 2×2 complex matrix modeling the effects of the interactions and free-space propagation along p. Unlike in (4), the receive antenna pattern is not applied. Instead, the squared norm of the electric-field amplitude is used, corresponding to an isotropic receive antenna whose polarization is matched to that of the incident wave. Because the squared amplitudes of the individual paths are summed, the radio map is non-coherent and does not capture interference between paths.

We now generalize the definition to diffuse reflections. Let 𝒜 denote the union of all diffuse reflecting surfaces in the scene. These surfaces can be regarded as a continuum of point sources. As detailed in Appendix A.9, the squared amplitude of the diffuse scattered field is proportional to the area of the impinging ray-tube footprint on the scattering surface. For a path p containing a diffuse reflection at 𝐯(𝒮)∈𝒜, its channel gain can therefore be written as

e(𝒮)⁢(p)=e~(𝒮)⁢(p)⁢d⁢A⁢(𝐯(𝒮)) (42)

where e~(𝒮)⁢(p) is the channel gain normalized by the area of the impinging ray-tube footprint. A path containing one diffuse reflection consists of two ray tubes: one originating at 𝐬 and one originating at 𝐯(𝒮). The path may additionally contain specular reflections and refractions before or after 𝐯(𝒮). The contribution of paths containing exactly one diffuse reflection is

Ci(𝒮,1)=1|Mi|⁢∫Mi∫𝒜e~(𝒮,1)⁢(𝐯(𝒮),𝐭)⁢𝑑A⁢(𝐯(𝒮))⁢𝑑A⁢(𝐭) (43)

where

e~(𝒮,1)⁢(𝐯(𝒮),𝐭)=∑p∈𝒫(𝒮,1)⁢(𝐬→𝐯(𝒮)→𝐭)e~(𝒮)⁢(p)⁢𝒱⁢(p). (44)

The diffuse-reflection point 𝐯(𝒮) is held fixed when defining 𝒫(𝒮,1)⁢(𝐬→𝐯(𝒮)→𝐭). Consequently, this path set is countable, although the subsequent integration over 𝐯(𝒮)∈𝒜 is continuous.

For an arbitrary number n𝒮 of diffuse reflections, define

𝒜n𝒮=𝒜×⋯×𝒜⏟n𝒮⁢ times (45)

as the set of ordered sequences 𝐯𝒮(n𝒮)=(𝐯(𝒮,1),…,𝐯(𝒮,n𝒮)) of diffuse-reflection points, and define the product surface element

d⁢An𝒮⁢(𝐯𝒮(n𝒮))=∏i=1n𝒮d⁢A⁢(𝐯(𝒮,i)). (46)

Repeated application of (42) gives

e(𝒮,n𝒮)⁢(p)=e~(𝒮,n𝒮)⁢(p)⁢d⁢An𝒮⁢(𝐯𝒮(n𝒮)), (47)

where for fixed diffuse-reflection points 𝐯𝒮(n𝒮), we define

e~(𝒮,n𝒮)⁢(𝐯𝒮(n𝒮),𝐭)=∑p∈𝒫(𝒮,n𝒮)⁢(𝐬→𝐯(𝒮,1)→⋯→𝐯(𝒮,n𝒮)→𝐭)e~(𝒮,n𝒮)⁢(p)⁢𝒱⁢(p). (48)

As in the single-reflection case, the path set in this expression is countable because all diffuse-reflection points are held fixed. The radio map value is obtained by summing over all possible numbers of diffuse reflections:

Ci=1|Mi|⁢∫Mi∑n𝒮=0∞∫𝒜n𝒮e~(𝒮,n𝒮)⁢(𝐯𝒮(n𝒮),𝐭)⁢𝑑An𝒮⁢(𝐯𝒮(n𝒮))⁢𝑑A⁢(𝐭). (49)

For n𝒮=0, the inner surface integral is omitted and e~(𝒮,0)⁢(𝐭)=e(ℛ,𝒯)⁢(𝐭), so that the corresponding term is precisely (39).

Remark

Equation (49) accounts for arbitrarily many diffuse reflections. In practice, the path depth is limited to a finite maximum, so the corresponding sum is always finite.

Relation to computer graphics

Defining radio maps as path integrals closely parallels the measurement equation used in computer graphics (see, e.g., [24, Eq. 3.18]). Following [24, Chapter 8], the radio map definition (49) can be written as

Ci=1|Mi|⁢∫Mi∫𝒜∞e~(𝒮)⁢(q,𝐭)⁢𝑑μ(𝒮)⁢(q)⁢𝑑A⁢(𝐭), (50)

where

𝒜∞ =⋃n𝒮=0∞𝒜n𝒮, (51)
μ(𝒮)⁢(B) =∑n𝒮=0∞An𝒮⁢(B∩𝒜n𝒮). (52)

Here, B⊆𝒜∞ is a measurable set, and An𝒮 denotes the product surface-area measure on 𝒜n𝒮. An element q∈𝒜n𝒮 is an ordered sequence of n𝒮 diffuse-reflection points, and

e~(𝒮)⁢(q,𝐭)=e~(𝒮,n𝒮)⁢(q,𝐭),q∈𝒜n𝒮, (53)

is the corresponding channel-gain density defined in Section 4.1. With these definitions, the sum over the number of diffuse reflections in (49) is absorbed into the measure μ(𝒮), resulting in the single integral in (50). This reduced path-space formulation is analogous to [24, Eq. 8.5] and enables the use of computer graphics techniques for radio map computation, including methods for improving sampling efficiency.

While the definition (49) is comprehensive, it is not practical for computation as-is. Indeed, directly integrating over the surfaces of the measurement cells would require connecting points on the measurement surface to the source, for example by placing one or more targets within each cell and using the path solver to compute the connecting paths. However, because accurately computing fine-grained radio maps typically demands a large number of target points, this approach is computationally prohibitive. Instead, we use Monte Carlo integration with a single SBR loop to efficiently estimate the value of each cell. This is achieved by reformulating the radio map definition (49) so that the integration is performed over the directions of rays originating from the source and the points that spawn ray tubes intersecting the measurement surface, rather than directly over the measurement and diffuse scatterer surfaces. This is enabled by applying the change of variables d⁢A=r2/|𝐧^𝖳⁢𝐤^|⁢d⁢ω, where r is the length of the ray tube, 𝐤^ is its propagation direction, 𝐧^ is the unit normal of either a scatterer or the measurement surface, and d⁢ω is the infinitesimal solid angle subtended by the ray tube (see Section 2.4). Thus, d⁢A represents the intersection area of the ray tube on the measurement surface. With this change of variables, the radio map definition (49) can be rewritten as:

Ci=1|Mi|⁢∫Ω∑n𝒮=0∞∫Ωn𝒮e~(𝒮,n𝒮)⁢(𝐯𝒮(n𝒮),𝐭)⁢(r(𝒮,n𝒮))2|(𝐧^(𝒮,n𝒮+1))𝖳⁢𝐤^i(𝒮,n𝒮+1)|⁢∏k=1n𝒮(r(𝒮,k−1))2|(𝐧^(𝒮,k))𝖳⁢𝐤^i(𝒮,k)|⁢d⁢ωn𝒮⁢(𝐤^𝒮(n𝒮))⁢d⁢ω⁢(𝐤^0) (54)

where Ω is the unit sphere, 𝐤^𝒮(n𝒮)=(𝐤^(𝒮,1),…,𝐤^(𝒮,n𝒮)) is the sequence of scattered propagation directions at the diffuse reflection points, (𝐤^i(𝒮,1),…,𝐤^i(𝒮,n𝒮)) is the sequence of incident propagation directions at those points, and 𝐤^0 is the propagation direction of the ray tube originating from the source. The outer integral is therefore over ray tubes originating from the source, whereas the inner integral is over ray tubes originating from the diffuse reflection points. Here, r(𝒮,i) is the length of the i-th ray tube originating from the i-th diffuse reflection point, r(𝒮,0) is the length of the ray tube originating from the source, and 𝐧^(𝒮,i) is the unit normal of the i-th diffusely reflecting surface. Finally, 𝐧^(𝒮,n𝒮+1) denotes the unit normal to the measurement surface, and 𝐤^i(𝒮,n𝒮+1) is the incident propagation direction on that surface.

Expression (54) can be estimated as follows. Paths are generated by launching NS rays from the source 𝐬 and tracing their interactions with the scene geometry, thus performing a Monte Carlo integration over the surfaces of the scatterers. Intuitively, when a ray intersects a diffuse reflecting surface, it samples a surface element Δ⁢A that corresponds to the ray tube intersection area, given by Δ⁢A=(r2/|𝐧^𝖳⁢𝐤^|)⁢Δ⁢ω. The source emits NS ray tubes, each subtending a solid angle of 4⁢π/NS, while each diffuse reflection point spawns a single ray tube, uniformly sampled over the hemisphere, with a solid angle of 2⁢π. The maximum path depth is set to L<∞, and since a single path may intersect the measurement surface at multiple depths, all path depths ℓ=0,1,…,L are considered. Interaction types (specular reflection, refraction, or diffuse reflection) are sampled according to (20). This process leads to the following Monte Carlo estimator for the radio map (54):

C^i=4⁢πNS⁢|Mi|⋅∑n=1NS∑ℓ=0Le~(𝒮,n𝒮)⁢(pn(ℓ))⁢𝕀⁢(pn(ℓ))⁢(Pr⁡(𝝌n(ℓ)))−1⁢(2⁢π)n𝒮⁢(rn(𝒮,n𝒮))2|(𝐧^n(𝒮,n𝒮+1))𝖳⁢𝐤^i,n(𝒮,n𝒮+1)|⁢∏k=1n𝒮(rn(𝒮,k−1))2|(𝐧^n(𝒮,k))𝖳⁢𝐤^i,n(𝒮,k)| (55)

where pn(ℓ) denotes the n-th path at depth ℓ, 𝕀⁢(pn(ℓ)) is an indicator function equal to 1 if pn(ℓ) intersects the measurement surface at depth ℓ and 0 otherwise, and Pr⁡(𝝌n(ℓ)) is the probability of sampling the specific sequence of interaction types 𝝌n(ℓ) corresponding to pn(ℓ). The number of diffuse reflections n𝒮 depends on the path, but its depedency on pn(ℓ) is not explicitly stated for simplicity.

4.2 Computation of Radio Map due to Diffraction

SBR is not applicable to paths that include diffraction: as explained in Section 3.1, the probability of a ray intersecting an edge is zero. To address this, Sionna RT computes the radio map in two steps, as illustrated in Figure 27. First, the radio map is computed for all interaction types except diffraction as described previously. Wedges near the source are detected and stored during this step. Second, only diffracted paths are computed. Currently, Sionna RT supports only first-order diffraction for radio map computation, i.e., paths connecting the source to the measurement surface through a single diffracting wedge and no other interactions with the scene. The two radio maps are then summed to obtain the final result. The following describes the computation of radio map due to diffraction.

Refer to caption
Figure 27: Computation of the radio map in two steps: First, the radio map is computed for all interaction types except diffraction using a single SBR loop. Second, only diffracted paths are computed. The two radio maps are then summed to obtain the final radio map.

For clarity, we consider diffraction on a single edge ℰ, defined by an origin 𝐨, an edge vector 𝐞^, and length Lℰ. Sionna RT processes all such wedges found near the source in parallel. Let 𝐯∈ℰ be a diffraction point, which is parametrized by the distance along the edge x and the Keller cone azimuth ϕ, i.e., 𝐯=𝐨+x⁢𝐞^. Then for a measurement point 𝐭∈Mi, define:

w⁢(𝐭,𝐯)=(𝐯−𝐬)𝖳⁢𝐞^∥𝐯−𝐬∥2⏟cos⁡β0′−(𝐭−𝐯)𝖳⁢𝐞^∥𝐭−𝐯∥2⏟cos⁡β0 (56)

where β0′ and β0 are the angles between the edge and the incident and diffracted wave, respectively (see Figure 5(b)). The Keller cone condition is w⁢(𝐭,𝐯)=0, which can be shown to be satisfied only for a single diffraction point on the edge, denoted by 𝐯𝒟⁢(𝐭). For a single diffraction wedge, as the diffraction point is unique, the radio map definition is similar to (39):

Ci(𝒟)=1|Mi|⁢∫Mie(𝒟)⁢(p)⁢𝒱⁢(p)⁢𝑑A⁢(𝐭) (57)

where p=(𝐬,𝐯𝒟⁢(𝐭),𝐭) is the path from the source to the measurement point 𝐭 via the diffraction point 𝐯𝒟⁢(𝐭).

Direct integration over the measurement surface is inefficient, as it would require connecting surface points to the source (for example, by placing targets within each cell and running the path solver). To overcome this, consider an orthogonal basis (𝐭^0,𝐧^0,𝐞^), where 𝐧^0 is the normal to a wedge face and 𝐭^0×𝐧^0=𝐞^, as illustrated in Figure 28. For a given angle of incidence β0′, any point on Mi that can be reached by a diffracted ray can be written as:

𝐭=𝐨+x⁢𝐞^⏟𝐯𝒟⁢(𝐭)+γ⁢(sin⁡β0′⁢cos⁡ϕ⁢𝐭^0+sin⁡β0′⁢sin⁡ϕ⁢𝐧^0+cos⁡β0′⁢𝐞^)⏟𝐤^s. (58)

Here, 𝐤^s is the direction of the diffracted ray (with ϕ the Keller cone azimuth), and γ>0 is the distance for which the ray from 𝐯𝒟⁢(𝐭) in direction 𝐤^s intersects the measurement cell Mi (see Figure 28). Since a ray and a plane intersect at most once, 𝐭 is uniquely determined by x and ϕ, and thus 𝐭⁢(x,ϕ) forms a reparametrization of the subset of Mi that can be reached by a diffracted ray when the angle of incidence is β0′.

Refer to caption
(a) 3D view
Refer to caption
(b) 2D cross-section
Figure 28: A measurement point 𝐭 reachable by a diffracted ray from a wedge is determined by a distance along the edge x and the Keller cone azimuth ϕ, while the cone opening angle is β0′.

With this reparametrization, (57) becomes:

Ci(𝒟)=1|Mi|⁢∫0Lℰ∫0n⁢πe⁢(p)⁢𝒱⁢(p)⁢∥∂𝐭∂x×∂𝐭∂ϕ∥2⁢𝑑x⁢𝑑ϕ. (59)

To estimate (59), NS′ samples are drawn on the wedge: x uniformly in [0,Lℰ] and ϕ uniformly in [0,n⁢π]. This yields the Monte Carlo estimator:

C^i(𝒟)=1|Mi|⁢Lℰ⁢n⁢πNS′⁢∑n=1NS′e⁢(pn)⁢𝕀⁢(pn)⁢∥∂𝐭∂x×∂𝐭∂ϕ∥2 (60)

where pn is the n-th path, 𝕀⁢(pn) is 1 if pn intersects the measurement surface and is not occluded by other scatterers and 0 otherwise, and the weighting factor ∥∂𝐭∂x×∂𝐭∂ϕ∥2 is computed as described in Appendix D.

4.3 Non-Coherent vs. Coherent Radio Maps

The proposed definition of radio maps involves a non-coherent summation of path gains (41). As a result, it does not capture fast fading effects, which result from the constructive and destructive interference of multiple paths. Figure 29 demonstrates this by comparing three scenarios: a radio map generated using the radio map solver, a radio map created by non-coherently summing the path coefficients (4) calculated with the path solver (Section 3) by placing a single target at the center of each measurement cell, and a radio map produced by coherently summing the path coefficients (4) calculated with the path solver, also by placing a single target at the center of each measurement cell. The radio map obtained using the radio map solver aligns with the non-coherent summation of path coefficients calculated using the path solver, as anticipated. However, it does not account for fast fading effects, which require the coherent summation of path coefficients. Also, because the diffracted contributions are accumulated non-coherently with the specular and LoS contributions, field-level continuity at incident and reflection shadow boundaries is not preserved.

Refer to caption
Figure 29: Comparison of radio maps: one computed using the radio map solver, one by non-coherently summing path coefficients from the path solver, and one by coherently summing path coefficients from the path solver. The transmitter is depicted as a red ball. All radio maps are computed with a maximum depth of L=3, cell sizes of 10×10 cm, using isotropic antenna patterns on both the transmitter and receiver, and for the “box” scene built in Sionna RT. The “non-coherent sum” and “coherent sum” radio maps are generated by placing a single target point at the center of each measurement cell.

4.4 Handling Multiple Transmit Antennas

The Sionna RT radio map solver supports antenna arrays of any size at the transmitter and allows for user-defined precoding vectors. However, it only supports synthetic arrays. In this setup, paths are generated from a single source located at the center of the array, and the channel response for each individual antenna is calculated by applying the appropriate phase shifts synthetically. This approximation requires plan wave approximation, which is valid only when D2≪R⁢λ0, where D is the array size and R is the distance from the array center to the first interaction point or measurement plane.

Using synthetic arrays enables efficient scaling with respect to the number of antennas. To see this, let NAtx denote the number of antennas at the transmitter, and let 𝐮P∈ℂNAtx be the precoding vector. For a given path connecting the source to the measurement plane, let 𝐄∈ℂ2 represent the electric field observed at the measurement plane. By employing a synthetic array, the corresponding electric fields for each antenna element are obtained by applying the array response vector (36), denoted as 𝐮Atx, leading to

𝐄A=𝐄⁢(𝐮Atx)𝖳. (61)

Here, 𝐄A is a matrix of size 2×NAtx, where each column represents the electric fields radiated by each transmit antenna. The contribution of this path to the radio map is given by

∥𝐄A⁢𝐮P∥22. (62)

This expression allows the path’s contribution to the radio map to be represented as

∥𝐄A⁢𝐮P∥22=∥(𝐄⁢(𝐮Atx)𝖳⁢𝐮P)∥22=∥𝐄⁢α∥22 (63)

where α=(𝐮Atx)𝖳⁢𝐮P is a scalar, which depends on the departure direction of the path from the transmitter and thus varies for paths originating from the source. By precomputing α for each path, the effect of the transmitter array can be efficiently simulated by multiplying the electric field of each path by α whenever the path intersects the measurement surface. This operation does not depend on the size of the array.

Refer to caption
(a) Scene with the radio map.
Refer to caption
(b) Computation time vs. number of samples NS.
Figure 30: Computation time for calculating radio maps using an NVIDIA RTX 4090 GPU for a single transmitter with a linear array of 1 to 1024 antennas.

Figure 30(b) illustrates the computation time needed to generate a radio map for a single source as the number of samples NS and the number of transmit antennas NAtx are varied. The setup, depicted in Figure 30(a), employs the “simple street canyon” scene built into Sionna RT. The red ball indicates the source, positioned 20 meters above the ground. The radio map in Figure 30(a) is calculated using 108 samples and a linear array of 512 transmit antennas. Notably, the radio map solver can compute radio maps with 109 samples on a single NVIDIA RTX 4090 GPU. The computation time increases with both the number of samples and antennas, exceeding one second only for the most demanding computations. It is important to note that while the computation time increases with the number of antennas due to the precomputation of the array weighting factor α, it does not increase the memory usage of the radio map solver.

Handling of Dual-Polarized Transmit Antennas

The radio map solver supports dual-polarized transmit antennas by considering two independent electric field vectors for each path. These are processed as if they were separate antenna elements (see Section 4.4).

4.5 Practical Notes

Mesh-based Measurement Surface

Sionna RT supports mesh-based measurement surfaces, which are defined as collections of triangles (see Section 2.1). In this case, each triangle serves as a measurement cell. Meshes can possess arbitrary topology, making this feature well suited for computing radio maps over complex terrains.

Early Termination with Russian Roulette and Gain Thresholding

The radio map solver allows for early deactivation of paths using two techniques: Russian roulette and gain thresholding. Both features can be enabled simultaneously and are applied only after a user-defined depth is reached. With gain thresholding, a path with ray tube length r is deactivated when the propagation gain falls below a user-defined threshold. With Russian roulette, at each iteration, a path continues with a probability given by

prr=min⁡(r2⁢∥𝐄∥22,prr,max) (64)

where 0<prr,max≤1 is the maximum probability, set by the user, for keeping the path active, and r2⁢∥𝐄∥22 is the distance-normalized propagation gain. The surviving paths are reweighted by the inverse square root of the probability of being kept active, i.e., 1/prr, to ensure the estimator is unbiased. Unlike compensated Russian roulette, gain thresholding removes the weakest contributions and therefore introduces bias.

Extension to other Types of Radio Maps

The Sionna RT solver currently supports the calculation of channel gain maps, which are radio maps that provide an estimate of the channel gain for each cell. It is possible to extend the solver to calculate other types of radio maps, such as root-mean-square delay spread maps and angular spread maps [25].

Radio Map Solver: Supported Path Families, Array Model, and Accumulation

Let L denote the user-configured maximum path depth. The radio map solver supports the following path families:

Path family Supported interaction sequences
LoS A path of depth zero, containing no interaction.
Non-diffracted paths Any sequence of specular reflections, refractions, and diffuse reflections, with total depth at most L.
Diffracted paths Direct first-order diffraction paths of the form 𝐬⟶diffraction⟶𝐭, where 𝐬 is the source (transmitter), 𝐭 is a point on the measurement surface.

Higher-order diffraction and paths combining diffraction with other interaction types are currently not supported.

Array model. The radio map solver supports only synthetic transmit arrays. Paths are traced from the center of the transmit array, and the contributions from the individual antenna elements are obtained by applying synthetic phase shifts and the user-provided precoding vector. The approximation requires the wavefront to be approximately planar across the array. A commonly used sufficient far-field criterion is D2≪R⁢λ0, where D is the array total aperture and R is the distance from the array center to the first interaction point or measurement plane.

Non-coherent accumulation. The fields radiated by the transmit-array elements are combined coherently through the precoding vector for each individual propagation path. Different propagation paths, however, are accumulated non-coherently: Radio maps represent sums of individual path gains and do not include cross terms between paths. They therefore do not capture fast fading caused by constructive and destructive multipath interference.