A ray tracing algorithm using the discrete prolate spheroidal subspace

Mingming Gan, F. Mani, F. Kaltenberger, Claude Oestges, T. Zemen
{"title":"A ray tracing algorithm using the discrete prolate spheroidal subspace","authors":"Mingming Gan, F. Mani, F. Kaltenberger, Claude Oestges, T. Zemen","doi":"10.1109/ICC.2013.6655505","DOIUrl":null,"url":null,"abstract":"Ray tracing (RT) is an accurate propagation prediction tool that has been widely used to simulate channel characteristics in indoor environments. To date, the developed RT tool includes not only specular reflection, penetration through dielectric blocks and diffraction, but also diffuse scattering mechanisms. The accuracy, provided by a detailed modeling of the environment, comes at the cost of a high computational complexity, which directly scales with the number of propagation paths considered. We are interested in simulating the radio propagation conditions for a mobile terminal, communicating in a frame based communication system indoors with several fixed nodes. This communication shall be used to obtain the position of the mobile terminal in indoor scenario. Therefore, the correlated temporal and spatial evolution of the channel impulse response is of utmost concern. In this paper, we propose a method to significantly reduce the computational complexity of RT by using a projection of all propagation paths on a subspace spanned by two-dimensional discrete prolate spheroidal (DPS) sequences. With this method the computational complexity can be reduced by more than one order of magnitude for indoor scenarios. The accuracy of our low-complexity DPS subspace based RT algorithm is verified by numeric simulations.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"8 1","pages":"5710-5714"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2013.6655505","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Ray tracing (RT) is an accurate propagation prediction tool that has been widely used to simulate channel characteristics in indoor environments. To date, the developed RT tool includes not only specular reflection, penetration through dielectric blocks and diffraction, but also diffuse scattering mechanisms. The accuracy, provided by a detailed modeling of the environment, comes at the cost of a high computational complexity, which directly scales with the number of propagation paths considered. We are interested in simulating the radio propagation conditions for a mobile terminal, communicating in a frame based communication system indoors with several fixed nodes. This communication shall be used to obtain the position of the mobile terminal in indoor scenario. Therefore, the correlated temporal and spatial evolution of the channel impulse response is of utmost concern. In this paper, we propose a method to significantly reduce the computational complexity of RT by using a projection of all propagation paths on a subspace spanned by two-dimensional discrete prolate spheroidal (DPS) sequences. With this method the computational complexity can be reduced by more than one order of magnitude for indoor scenarios. The accuracy of our low-complexity DPS subspace based RT algorithm is verified by numeric simulations.
一种使用离散长球面子空间的射线跟踪算法
射线追踪(Ray tracing, RT)是一种精确的传播预测工具,已广泛用于模拟室内环境下的信道特性。到目前为止,开发的RT工具不仅包括镜面反射,穿透介质块和衍射,还包括漫射散射机制。由环境的详细建模提供的准确性是以高计算复杂性为代价的,它直接与所考虑的传播路径的数量成比例。我们感兴趣的是模拟移动终端的无线电传播条件,在室内有几个固定节点的基于帧的通信系统中进行通信。此通信应使用用于获取室内场景下移动终端的位置。因此,通道脉冲响应的相关时空演变是人们最关心的问题。在本文中,我们提出了一种方法,通过使用所有传播路径的投影在一个由二维离散扩展球(DPS)序列所张成的子空间上显著降低RT的计算复杂度。该方法可将室内场景的计算复杂度降低一个数量级以上。通过数值仿真验证了基于低复杂度DPS子空间的RT算法的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信