HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

A New Strategy for Indoor Propagation Fast Computation with MR-FDPF Algorithm

Guillaume de la Roche 1 Raphael Rebeyrortte Katia Jaffrès-Runser 1 Jean-Marie Gorce 1, *
* Corresponding author
1 ARES - Architectures of networks of services
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
Abstract : The multi-resolution frequency domain ParFlow (MR FDPF) algorithm has been developed since 2001 for the purpose of Indoor wave propagation simulation. This algo rithm derives from a TLM like formalism, and implements a multi-resolution (MR) approach to compute efficiently full coverage of several access points (AP). This approach is well-designed for a wireless LAN planning because the computation load required to process an AP candidate is fast. The heart of the proposed approach holds in the MR nodes that are obtained by gathering recursively pixels into bricks. This requires a MR binary tree structure which should be adapted to the environment. In this paper, dif ferent strategies are evaluated to compute this binary tree. Computation load and memory consumption are evaluated on a real example. It is shown that an appropriate choice of the binary tree may decrease significantly the computation load associated with the method.
Document type :
Conference papers
Complete list of metadata

Contributor : Jean-Marie Gorce Connect in order to contact the contributor
Submitted on : Sunday, July 19, 2009 - 10:16:22 PM
Last modification on : Friday, February 4, 2022 - 3:19:03 AM


  • HAL Id : inria-00405192, version 1



Guillaume de la Roche, Raphael Rebeyrortte, Katia Jaffrès-Runser, Jean-Marie Gorce. A New Strategy for Indoor Propagation Fast Computation with MR-FDPF Algorithm. Antennas, Radar and Wave Propagation, IASTED, Jul 2005, Banff, Canada. ⟨inria-00405192⟩



Record views