An Iterative Transfer Matrix Computation Method for Propagation Graphs in Multi-Room Environments

Research output: Contribution to journalJournal articleResearchpeer-review

Abstract

This letter presents a reduced complexity method for computing the transfer matrix of wireless channels in complex indoor environments with a large number of rooms using propagation graphs. Multiroom indoor environments can be represented in a vector signal flow graph with rooms in the complex structure as nodes and propagation between rooms as branches. We propose an iterative procedure to compute the transfer matrix of such complex graphs. The state vector for each node in the graph is iteratively computed until convergence. The state vector for the room(s) with the receiver is then used to compute the transfer function. We show via simulations that the proposed approach closely approximates the original model at much reduced complexity.

Original language English 8638953 I E E E Antennas and Wireless Propagation Letters 18 4 616-620 5 1536-1225 https://doi.org/10.1109/LAWP.2019.2898641 Published - Apr 2019

Fingerprint

Signal flow graphs
Transfer functions

Keywords

• Channel model
• complexity
• multiroom indoor environment
• propagation graph (PG)
• signal flow graph

Cite this

@article{fd012fee261d4219b3cb8ef1baf94475,
title = "An Iterative Transfer Matrix Computation Method for Propagation Graphs in Multi-Room Environments",
abstract = "This letter presents a reduced complexity method for computing the transfer matrix of wireless channels in complex indoor environments with a large number of rooms using propagation graphs. Multiroom indoor environments can be represented in a vector signal flow graph with rooms in the complex structure as nodes and propagation between rooms as branches. We propose an iterative procedure to compute the transfer matrix of such complex graphs. The state vector for each node in the graph is iteratively computed until convergence. The state vector for the room(s) with the receiver is then used to compute the transfer function. We show via simulations that the proposed approach closely approximates the original model at much reduced complexity.",
keywords = "Channel model, complexity, multiroom indoor environment, propagation graph (PG), signal flow graph",
author = "Ramoni Adeogun and Ayush Bharti and Troels Pedersen",
year = "2019",
month = "4",
doi = "10.1109/LAWP.2019.2898641",
language = "English",
volume = "18",
pages = "616--620",
journal = "I E E E Antennas and Wireless Propagation Letters",
issn = "1536-1225",
publisher = "IEEE",
number = "4",

}

In: I E E E Antennas and Wireless Propagation Letters, Vol. 18, No. 4, 8638953, 04.2019, p. 616-620.

Research output: Contribution to journalJournal articleResearchpeer-review

TY - JOUR

T1 - An Iterative Transfer Matrix Computation Method for Propagation Graphs in Multi-Room Environments

AU - Adeogun, Ramoni

AU - Bharti, Ayush

AU - Pedersen, Troels

PY - 2019/4

Y1 - 2019/4

N2 - This letter presents a reduced complexity method for computing the transfer matrix of wireless channels in complex indoor environments with a large number of rooms using propagation graphs. Multiroom indoor environments can be represented in a vector signal flow graph with rooms in the complex structure as nodes and propagation between rooms as branches. We propose an iterative procedure to compute the transfer matrix of such complex graphs. The state vector for each node in the graph is iteratively computed until convergence. The state vector for the room(s) with the receiver is then used to compute the transfer function. We show via simulations that the proposed approach closely approximates the original model at much reduced complexity.

AB - This letter presents a reduced complexity method for computing the transfer matrix of wireless channels in complex indoor environments with a large number of rooms using propagation graphs. Multiroom indoor environments can be represented in a vector signal flow graph with rooms in the complex structure as nodes and propagation between rooms as branches. We propose an iterative procedure to compute the transfer matrix of such complex graphs. The state vector for each node in the graph is iteratively computed until convergence. The state vector for the room(s) with the receiver is then used to compute the transfer function. We show via simulations that the proposed approach closely approximates the original model at much reduced complexity.

KW - Channel model

KW - complexity

KW - multiroom indoor environment

KW - propagation graph (PG)

KW - signal flow graph

UR - http://www.scopus.com/inward/record.url?scp=85064252885&partnerID=8YFLogxK

U2 - 10.1109/LAWP.2019.2898641

DO - 10.1109/LAWP.2019.2898641

M3 - Journal article

VL - 18

SP - 616

EP - 620

JO - I E E E Antennas and Wireless Propagation Letters

JF - I E E E Antennas and Wireless Propagation Letters

SN - 1536-1225

IS - 4

M1 - 8638953

ER -