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

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.