### 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 |
---|---|

Article number | 8638953 |

Journal | I E E E Antennas and Wireless Propagation Letters |

Volume | 18 |

Issue number | 4 |

Pages (from-to) | 616-620 |

Number of pages | 5 |

ISSN | 1536-1225 |

DOIs | |

Publication status | Published - Apr 2019 |

### Fingerprint

### Keywords

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

### Cite this

}

**An Iterative Transfer Matrix Computation Method for Propagation Graphs in Multi-Room Environments.** / Adeogun, Ramoni; Bharti, Ayush; Pedersen, Troels.

Research output: Contribution to journal › Journal article › Research › peer-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 -