Propagation graph

Example of a propagation graph with four transmitters (Tx1-Tx4), three receivers (Rx1-Rx3) and six scatterers S1-S6. An edge is drawn from one vertex to another if propagation is possible.

Propagation graphs are a mathematical modelling method for radio propagation channels. A propagation graph is a signal flow graph in which vertices represent transmitters, receivers or scatterers. Edges in the graph model propagation conditions between vertices. Propagation graph models were initially developed by Troels Pedersen, et al. for multipath propagation in scenarios with multiple scattering, such as indoor radio propagation. ^{[1] [2] [3]} It has later been applied in many other scenarios.

Mathematical definition

A propagation graph is a simple directed graph ${\displaystyle {\mathcal {G}}=({\mathcal {V}},{\mathcal {E}})}$ with vertex set ${\displaystyle {\mathcal {V}}}$ and edge set ${\displaystyle {\mathcal {E}}}$.

The vertices models objects in the propagation scenario. The vertex set ${\displaystyle {\mathcal {V}}}$ is split into three disjoint sets as ${\displaystyle {\mathcal {V}}={\mathcal {V}}_{t}\cup {\mathcal {V}}_{r}\cup {\mathcal {V}}_{s}}$ where ${\displaystyle {\mathcal {V}}_{t}}$ is the set of transmitters, ${\displaystyle {\mathcal {V}}_{r}}$ is the set of receivers and ${\displaystyle {\mathcal {V}}_{s}}$ is the set of objects named "scatterers".

The edge set ${\displaystyle {\mathcal {E}}}$ models the propagation models propagation conditions between vertices. Since ${\displaystyle {\mathcal {G}}}$ is assumed simple, ${\displaystyle {\mathcal {E}}\subset {\mathcal {V}}^{2}}$ and an edge may be identified by a pair of vertices as ${\displaystyle e=(v,v')}$ An edge ${\displaystyle e=(v,v')}$ is included in ${\displaystyle {\mathcal {E}}}$ if a signal emitted by vertex ${\displaystyle v}$ can propagate to ${\displaystyle v'}$. In a propagation graph, transmitters cannot have incoming edges and receivers cannot have outgoing edges.

Two propagation rules are assumed

• A vertex sums the signals impinging via its ingoing edges and remits a scaled version it via the outgoing edges.
• Each edge ${\displaystyle e=(v,v')}$ transfers the signal from ${\displaystyle v}$ to ${\displaystyle v'}$ scaled by a transfer function.

The definition of the vertex gain scaling and the edge transfer functions can be adapted to accommodate particular scenarios and should be defined in order to use the model in simulations. A variety of such definitions have been considered for different propagation graph models in the published literature.

Vector signal flow graph of a propagation graph.

The edge transfer functions (in the Fourier domain) can be grouped into transfer matrices as

• ${\displaystyle \mathbf {D} (f)}$ the direct propagation from transmitters to receivers
• ${\displaystyle \mathbf {T} (f)}$ transmitters to scatterers
• ${\displaystyle \mathbf {R} (f)}$ scatterers to receivers
• ${\displaystyle \mathbf {B} (f)}$ scatterers to scatterers,

where ${\displaystyle f}$ is the frequency variable.

Denoting the Fourier transform of the transmitted signal by ${\displaystyle \mathbf {X} (f)}$, the received signal reads in the frequency domain

$${\displaystyle \mathbf {Y} (f)=\mathbf {D} (f)\mathbf {X} (f)+\mathbf {R} (f)\mathbf {T} (f)\mathbf {X} (f)+\mathbf {R} (f)\mathbf {B} (f)\mathbf {T} (f)\mathbf {X} (f)+\mathbf {R} (f)\mathbf {B} ^{2}(f)\mathbf {T} (f)\mathbf {X} (f)+\cdots }$$

Transfer function

The transfer function ${\displaystyle \mathbf {H} (f)}$ of a propagation graph forms an infinite series ^[3]

$${\displaystyle {\begin{aligned}\mathbf {H} (f)&=\mathbf {D} (f)+\mathbf {R} (f)[\mathbf {I} +\mathbf {B} (f)+\mathbf {B} (f)^{2}+\cdots ]\mathbf {T} (f)\\&=\mathbf {D} (f)+\mathbf {R} (f)\sum _{k=0}^{\infty }\mathbf {B} (f)^{k}\mathbf {T} (f)\end{aligned}}}$$

The transfer function is a Neumann series of operators. Alternatively, it can be viewed pointwise in frequency as a geometric series of matrices. This observation yields a closed form expression for the transfer function as

$${\displaystyle \mathbf {H} (f)=\mathbf {D} (f)+\mathbf {R} (f)[\mathbf {I} -\mathbf {B} (f)]^{-1}\mathbf {T} (f),\qquad \rho (\mathbf {B} (f))<1}$$

where ${\displaystyle \mathbf {I} }$ denotes the identity matrix and ${\displaystyle \rho (\cdot )}$ is the spectral radius of the matrix given as argument. The transfer function account for propagation paths irrespective of the number of 'bounces'.

The series is similar to the Born series from multiple scattering theory. ^[4]

The impulse responses ${\displaystyle \mathbf {h} (\tau )}$ are obtained by inverse Fourier transform of ${\displaystyle \mathbf {H} (f)}$

Partial transfer function

Closed form expressions are available for partial sums, i.e. by considering only some of the terms in the transfer function. The partial transfer function for signal components propagation via at least ${\displaystyle K}$ and at most ${\displaystyle L}$ interactions is defined as

$${\displaystyle \mathbf {H} _{K:L}(f)=\sum _{k=K}^{L}\mathbf {H} _{k}(f)}$$

where

$${\displaystyle \mathbf {H} _{k}(f)={\begin{cases}\mathbf {D} (f),&k=0\\\mathbf {R} (f)\mathbf {B} ^{k-1}(f)\mathbf {T} (f),&k=1,2,3,\ldots \end{cases}}}$$

Here ${\displaystyle k}$ denotes the number of interactions or the bouncing order.

Animation of power delay profiles calculated from partial transfer functions of a propagation graph model. The red line indicates the delay of the direct path.

The partial transfer function is then ^[3]

$${\displaystyle \mathbf {H} _{K:L}(f)={\begin{cases}\mathbf {D} (f)+\mathbf {R} (f)[\mathbf {I} -\mathbf {B} ^{L}(f)]\cdot [\mathbf {I} -\mathbf {B} (f)]^{-1}\cdot \mathbf {T} (f),&K=0\\\mathbf {R} (f)[\mathbf {B} ^{K-1}(f)-\mathbf {B} ^{L}(f)]\cdot [\mathbf {I} -\mathbf {B} (f)]^{-1}\cdot \mathbf {T} (f),&{\text{otherwise}}.\\\end{cases}}}$$

Special cases:

• ${\displaystyle \mathbf {H} _{0:\infty }(f)=\mathbf {H} (f)}$: Full transfer function.
• ${\displaystyle \mathbf {H} _{1:\infty }(f)=\mathbf {R} (f)[\mathbf {I} -\mathbf {B} (f)]^{-1}\mathbf {T} (f)}$: Inderect term only.
• ${\displaystyle \mathbf {H} _{0:L}(f)}$: Only terms with ${\displaystyle L}$ or fewer bounces are kept (${\displaystyle L}$-bounce truncation).
• ${\displaystyle \mathbf {H} _{L+1:\infty }(f)}$: Error term due to an ${\displaystyle L}$-bounce truncation.

One application of partial transfer functions is in hybrid models, where propagation graphs are employed to model part of the response (usually the higher-order interactions).

The partial impulse responses ${\displaystyle \mathbf {h} _{K:L}(\tau )}$ are obtained from ${\displaystyle \mathbf {H} _{K:L}(f)}$ by the inverse Fourier transform.

Propagation graph models

The propagation graph methodology have been applied in various settings to create radio channel models. Such a model is referred to as a propagation graph model. Such models have been derived for scenarios including

• Unipolarized inroom channels. The initial propagation graph models ^{[1] [2] [3]} were derived for unipolarized inroom channels.
• In ^[5] a polarimetric propagation graph model is developed for the inroom propagation scenario.
• The propagation graph framework has been extended in ^[6] to time-variant scenarios (such as the vehicle-to-vehicle). For terrestrial communications, where relative velocity of objects are limited, the channel may be assumed quasi-static and the static model may be applied at each time step.
• In a number of works including ^{[7] [8] [9] [10]} propagation graphs have been integrated into ray-tracing models to enable simulation of reverberation phenomena. Such models are referred to as hybrid models.
• Complex environments including outdoor-to-indoor cases. ^[11] can be studied by taking advantage of the special structure of propagation graphs for these scenarios. Computation methods for obtaining responses for very complex environments have been developed in ^[12]
• The graph model methodology has been used to make spatially consistent MIMO channel models. ^[13]
• Several propagation graph models have been published for high-speed train communications. ^{[14] [15]}

Calibration of propagation graph models

To calibrate a propagation graph model, its parameters should be set to reasonable values. Different approaches can be taken. Certain parameters can be derived from simplified geometry of the room. In particular, reverberation time can be computed via room electromagnetics. Alternatively, the parameters can ben set according to measurement data using inference techniques such as method of moments (statistics), ^[5] approximate Bayesian computation., ^[16] or deep neural networks ^[17]

Related radio channel model types

The method of propagation graph modeling is related to other methods. Noticeably,

• Multiple scattering theory
• Radiosity
• Ray tracing
• Geometry-based stochastic channel models (GBSCM)

References

1. Pedersen, Troels; Fleury, Bernard (2006). "A Realistic Radio Channel Model Based in Stochastic Propagation Graphs" (PDF). Proceedings 5th MATHMOD Vienna: 324–331.
2. Pedersen, T.; Fleury, B. H. (2007). "Radio Channel Modelling Using Stochastic Propagation Graphs". 2007 IEEE International Conference on Communications. pp. 2733–2738. doi:10.1109/ICC.2007.454. ISBN   978-1-4244-0353-0. S2CID   8479930.
3. Pedersen, Troels; Steinbock, Gerhard; Fleury, Bernard H. (2012). "Modeling of Reverberant Radio Channels Using Propagation Graphs". IEEE Transactions on Antennas and Propagation. 60 (12): 5978–5988. arXiv: 1105.4542 . Bibcode:2012ITAP...60.5978P. doi:10.1109/TAP.2012.2214192. S2CID   14429206.
4. Lu, S. X. (2011). "Characterization of the random scattering induced delay power spectrum using Born series". 2011 IEEE International Symposium on Antennas and Propagation (APSURSI). pp. 3317–3319. doi:10.1109/APS.2011.6058692. ISBN   978-1-4244-9563-4. S2CID   8166055.
5. Adeogun, R.; Pedersen, T.; Gustafson, C.; Tufvesson, F. (2019). "Polarimetric Wireless Indoor Channel Modeling Based on Propagation Graph" (PDF). IEEE Transactions on Antennas and Propagation. 67 (10): 6585–6595. Bibcode:2019ITAP...67.6585A. doi:10.1109/TAP.2019.2925128. S2CID   96454776.
6. Stern, K.; Fuglsig, A.J.; Ramsgaard-Jensen, K.; Pedersen, T. (2018). "Propagation graph modeling of time-varying radio channels" (PDF). 12th European Conference on Antennas and Propagation (EuCAP 2018). pp. 22 (5 pp.). doi:10.1049/cp.2018.0381. ISBN   978-1-78561-816-1. S2CID   115436690.
7. Steinbock, Gerhard; Gan, Mingming; Meissner, Paul; Leitinger, Erik; Witrisal, Klaus; Zemen, Thomas; Pedersen, Troels (2016). "Hybrid Model for Reverberant Indoor Radio Channels Using Rays and Graphs". IEEE Transactions on Antennas and Propagation. 64 (9): 4036–4048. Bibcode:2016ITAP...64.4036S. doi:10.1109/TAP.2016.2589958. S2CID   34442470.
8. Tian, L.; Degli-Esposti, V.; Vitucci, E. M.; Yin, X. (2016). "Semi-Deterministic Radio Channel Modeling Based on Graph Theory and Ray-Tracing". IEEE Transactions on Antennas and Propagation. 64 (6): 2475–2486. Bibcode:2016ITAP...64.2475T. doi:10.1109/TAP.2016.2546950. hdl: 11585/536072 . S2CID   29844181.
9. Gan, Mingming; Steinbock, Gerhard; Xu, Zhinan; Pedersen, Troels; Zemen, Thomas (2018). "A Hybrid Ray and Graph Model for Simulating Vehicle-to-Vehicle Channels in Tunnels". IEEE Transactions on Vehicular Technology. 67 (9): 7955–7968. doi:10.1109/TVT.2018.2839980. S2CID   52305255.
10. Miao, Yang; Pedersen, Troels; Gan, Mingming; Vinogradov, Evgenii; Oestges, Claude (2018). "Reverberant Room-to-Room Radio Channel Prediction by Using Rays and Graphs" (PDF). IEEE Transactions on Antennas and Propagation. 67 (1): 484–494. doi:10.1109/TAP.2018.2878088. S2CID   58669645.
11. Pedersen, Troels; Steinbock, Gerhard; Fleury, Bernard H. (2014). "Modeling of outdoor-to-indoor radio channels via propagation graphs". 2014 XXXIth URSI General Assembly and Scientific Symposium (URSI GASS). pp. 1–4. doi:10.1109/URSIGASS.2014.6929300. ISBN   978-1-4673-5225-3. S2CID   25407801.
12. Adeogun, Ramoni; Bharti, Ayush; Pedersen, Troels (2019). "An Iterative Transfer Matrix Computation Method for Propagation Graphs in Multiroom Environments". IEEE Antennas and Wireless Propagation Letters. 18 (4): 616–620. Bibcode:2019IAWPL..18..616A. doi:10.1109/LAWP.2019.2898641. S2CID   106411757.
13. Pratschner, S.; Blazek, T.; Zöchmann, E.; Ademaj, F.; Caban, S.; Schwarz, S.; Rupp, M. (2019). "A Spatially Consistent MIMO Channel Model With Adjustable K Factor". IEEE Access. 7: 110174–110186. Bibcode:2019IEEEA...7k0174P. doi: 10.1109/ACCESS.2019.2934635 . S2CID   201620704.
14. Cheng, Wenpu; Tao, Cheng; Liu, Liu; Sun, Rongchen; Zhou, Tao (2014). Geometrical channel characterization for high speed railway environments using propagation graphs methods. 16th International Conference on Advanced Communication Technology. pp. 239–243. doi:10.1109/ICACT.2014.6778956. ISBN   978-89-968650-3-2. S2CID   9210011.
15. Zhou, Tao; Tao, Cheng; Salous, Sana; Tan, Zhenhui; Liu, Liu; Tian, Li (2014). "Graph-based stochastic model for high-speed railway cutting scenarios". IET Microwaves, Antennas & Propagation. 9 (15): 1691–1697. doi: 10.1049/iet-map.2014.0827 .
16. Bharti, A.; Adeogun, R.; Pedersen, T. (2020). "Learning Parameters of Stochastic Radio Channel Models From Summaries". IEEE Open Journal of Antennas and Propagation. 1: 175–188. doi: 10.1109/OJAP.2020.2989814 . S2CID   215861548.
17. Adeogun, Ramoni (2019). "Calibration of Stochastic Radio Propagation Models Using Machine Learning" (PDF). IEEE Antennas and Wireless Propagation Letters. 18 (12): 2538–2542. Bibcode:2019IAWPL..18.2538A. doi:10.1109/LAWP.2019.2942819. S2CID   203994446.