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

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Abstract

This paper 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. Multi-room 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.
Luk

Detaljer

This paper 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. Multi-room 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.
OriginalsprogEngelsk
TidsskriftI E E E Antennas and Wireless Propagation Letters
Antal sider5
ISSN1536-1225
DOI
StatusE-pub ahead of print - 2019
PublikationsartForskning
Peer reviewJa
ID: 293340296