{"title":"移动无线电系统中具有相关阴影衰落的信道映射的有效建模","authors":"H. Claussen","doi":"10.1109/PIMRC.2005.1651489","DOIUrl":null,"url":null,"abstract":"For simulating mobility of both user terminals and base stations in wireless access systems, it is often advantageous to generate environment \"maps\" of the channel attenuations including path loss and shadow fading. However, the generation of a large number of spatially correlated shadow fading values, using for example the Cholesky decomposition of the corresponding correlation matrix, is computationally complex and requires a large amount of memory. In this paper an efficient low complexity alternative is proposed, where each new fading value is generated based only on the correlation with selected neighbouring values in the map. This results in a significant reduction of the computational complexity and memory requirements. It is shown that taking a small number of neighbouring values into account is sufficient to achieve relatively small correlation errors in the generated shadow fading maps","PeriodicalId":248766,"journal":{"name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"128","resultStr":"{\"title\":\"Efficient modelling of channel maps with correlated shadow fading in mobile radio systems\",\"authors\":\"H. Claussen\",\"doi\":\"10.1109/PIMRC.2005.1651489\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For simulating mobility of both user terminals and base stations in wireless access systems, it is often advantageous to generate environment \\\"maps\\\" of the channel attenuations including path loss and shadow fading. However, the generation of a large number of spatially correlated shadow fading values, using for example the Cholesky decomposition of the corresponding correlation matrix, is computationally complex and requires a large amount of memory. In this paper an efficient low complexity alternative is proposed, where each new fading value is generated based only on the correlation with selected neighbouring values in the map. This results in a significant reduction of the computational complexity and memory requirements. It is shown that taking a small number of neighbouring values into account is sufficient to achieve relatively small correlation errors in the generated shadow fading maps\",\"PeriodicalId\":248766,\"journal\":{\"name\":\"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"128\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2005.1651489\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2005.1651489","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient modelling of channel maps with correlated shadow fading in mobile radio systems
For simulating mobility of both user terminals and base stations in wireless access systems, it is often advantageous to generate environment "maps" of the channel attenuations including path loss and shadow fading. However, the generation of a large number of spatially correlated shadow fading values, using for example the Cholesky decomposition of the corresponding correlation matrix, is computationally complex and requires a large amount of memory. In this paper an efficient low complexity alternative is proposed, where each new fading value is generated based only on the correlation with selected neighbouring values in the map. This results in a significant reduction of the computational complexity and memory requirements. It is shown that taking a small number of neighbouring values into account is sufficient to achieve relatively small correlation errors in the generated shadow fading maps