The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January/February (1999 vol.1)
pp: 31-41
ABSTRACT
<p>Driven by our increasingly mobile society's ever-growing demand for communications, today's providers of wireless telecommunication services must ensure reliable radio coverage "everywhere." Computer-based techniques that reduce the need for expensive experimental measurements are invaluable tools for achieving this objective. Various computational algorithms based mainly on ray tracing have emerged in recent years for determining radio coverage. Although the output of these algorithms agrees well with measurement results, execution times remain high. </p> <p>To provide faster computational methods for determining radio coverage, we have developed a fast 3D method of regions (MR) algorithm. This algorithm divides the environment into reflection, transmission, and possibly diffraction regions, then identifies infeasible image combinations and locations affected by similar propagation mechanisms a priori. As this article shows, when implemented on a parallel machine, our algorithm provides close-to-ideal speedups, enabling the fast computation of radio coverage that service providers require.</p>
CITATION
Marc Kimpe, Harry Leib, Olivier Maquelin, Ted H. Szymanski, "Fast Computational Techniques for Indoor Radio Channel Estimation", Computing in Science & Engineering, vol.1, no. 1, pp. 31-41, January/February 1999, doi:10.1109/5992.743620
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool