Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655052
Guanghui Song, Jun Cheng, Y. Watanabe
A k-user parallel concatenated code (PCC) is proposed for a Gaussian multiple-access channel with symbol synchronization and equal power users. In this code, each user employs a PCC with M + 1 component codes, where the first component code is a rate 1/q repetition code and the other M component codes are the same rate-1 convolutional code 1/1+D. The K-user PCC achieves a larger maximum sum rate, at the high rate region, than the conventional scheme of an error correction code serially concatenated with a spreading.
{"title":"K-user parallel concatenated code for Gaussian multiple-access channel","authors":"Guanghui Song, Jun Cheng, Y. Watanabe","doi":"10.1109/ICC.2013.6655052","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655052","url":null,"abstract":"A k-user parallel concatenated code (PCC) is proposed for a Gaussian multiple-access channel with symbol synchronization and equal power users. In this code, each user employs a PCC with M + 1 component codes, where the first component code is a rate 1/q repetition code and the other M component codes are the same rate-1 convolutional code 1/1+D. The K-user PCC achieves a larger maximum sum rate, at the high rate region, than the conventional scheme of an error correction code serially concatenated with a spreading.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"407 1","pages":"3286-3291"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77469926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655099
X. Misseri, I. Gojmerac, J. Rougier
In the present Internet, inter-domain routing is based on BGP-4 which does not allow for the use of multiple paths, but rather selects a single path per destination prefix. However, as the global Internet connectivity graph displays vast inherent path diversity, we believe that there is a lack of mechanisms which put this latent potential into use. To this end, we propose Inter-Domain Route Diversity (IDRD) as a mechanism which allows for diverse inter-domain paths to be propagated among carriers and used for packet forwarding. Our proposal is aimed to be efficient, backwards compatible, and incrementally deployable. In order to make use of the existing path diversity, we also propose a relaxation of the multipath route selection policy that is provably stable, while being more flexible. Our extensive evaluation of path disjointness in the Internet connectivity graph illustrates the potential benefits of IDRD. While the evaluation shows that the traditional “prefer customer” rule heavily impedes the use and propagation of the underlying diversity, it also demonstrates that our proposed relaxation of the multipath route selection policy enables near-optimal utilization of the underlying path diversity in the real Internet inter-domain topology.
{"title":"IDRD: Enabling inter-domain route diversity","authors":"X. Misseri, I. Gojmerac, J. Rougier","doi":"10.1109/ICC.2013.6655099","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655099","url":null,"abstract":"In the present Internet, inter-domain routing is based on BGP-4 which does not allow for the use of multiple paths, but rather selects a single path per destination prefix. However, as the global Internet connectivity graph displays vast inherent path diversity, we believe that there is a lack of mechanisms which put this latent potential into use. To this end, we propose Inter-Domain Route Diversity (IDRD) as a mechanism which allows for diverse inter-domain paths to be propagated among carriers and used for packet forwarding. Our proposal is aimed to be efficient, backwards compatible, and incrementally deployable. In order to make use of the existing path diversity, we also propose a relaxation of the multipath route selection policy that is provably stable, while being more flexible. Our extensive evaluation of path disjointness in the Internet connectivity graph illustrates the potential benefits of IDRD. While the evaluation shows that the traditional “prefer customer” rule heavily impedes the use and propagation of the underlying diversity, it also demonstrates that our proposed relaxation of the multipath route selection policy enables near-optimal utilization of the underlying path diversity in the real Internet inter-domain topology.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"64 1","pages":"3536-3541"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72802009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655039
A. Tarable, G. Montorsi, S. Benedetto, Stefano Chinnici
In this paper, we derive a phase-noise estimator for MIMO systems affected by independent phase noise at each antenna. The proposed phase-noise estimator employs the expectation-maximization algorithm and can incorporate channel decoding. The main feature of the proposed estimator lies in the fact that it estimates separately phase-noise samples at the transmitter and at the receiver, instead of estimating, as it is typical in single-antenna case, the sum of the samples at the two sides. Simulation results show that the proposed estimator allows obtaining a very good performance at an affordable complexity.
{"title":"An EM-based phase-noise estimator for MIMO systems","authors":"A. Tarable, G. Montorsi, S. Benedetto, Stefano Chinnici","doi":"10.1109/ICC.2013.6655039","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655039","url":null,"abstract":"In this paper, we derive a phase-noise estimator for MIMO systems affected by independent phase noise at each antenna. The proposed phase-noise estimator employs the expectation-maximization algorithm and can incorporate channel decoding. The main feature of the proposed estimator lies in the fact that it estimates separately phase-noise samples at the transmitter and at the receiver, instead of estimating, as it is typical in single-antenna case, the sum of the samples at the two sides. Simulation results show that the proposed estimator allows obtaining a very good performance at an affordable complexity.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"28 1","pages":"3215-3219"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72839108","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655168
K. Walkowiak, M. Klinkowski
Anycast communication is gaining much interest due to the deployment and the growing importance of new network services, including Content Delivery Networks (CDNs) and grid/cloud computing, among others. Concurrently, elastic optical networks (EONs), being a very promising solution for future optical transport networks, are considered as effective and cost-efficient approach for supporting such bandwidth-demanding applications. In this article, we focus on anycast communication in EON. Specifically, we formulate a joint anycast and unicast Routing and Spectrum Allocation (RSA/JAU) off-line optimization problem and solve it by means of both Integer Linear Programming (ILP) and dedicated heuristic algorithms. We evaluate the performance of algorithms and assess the effectiveness of anycast communication under various network scenarios. The main conclusion is that anycast routing brings significant spectrum savings in EON.
{"title":"Joint anycast and unicast routing for elastic optical networks: Modeling and optimization","authors":"K. Walkowiak, M. Klinkowski","doi":"10.1109/ICC.2013.6655168","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655168","url":null,"abstract":"Anycast communication is gaining much interest due to the deployment and the growing importance of new network services, including Content Delivery Networks (CDNs) and grid/cloud computing, among others. Concurrently, elastic optical networks (EONs), being a very promising solution for future optical transport networks, are considered as effective and cost-efficient approach for supporting such bandwidth-demanding applications. In this article, we focus on anycast communication in EON. Specifically, we formulate a joint anycast and unicast Routing and Spectrum Allocation (RSA/JAU) off-line optimization problem and solve it by means of both Integer Linear Programming (ILP) and dedicated heuristic algorithms. We evaluate the performance of algorithms and assess the effectiveness of anycast communication under various network scenarios. The main conclusion is that anycast routing brings significant spectrum savings in EON.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"15 1","pages":"3909-3914"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73355639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655186
Igor Almeida, A. Klautau, Chenguang Lu
The evolving broadband access systems using copper networks are currently deployed in a frequency band that goes up to 30 MHz, as specified in VDSL2. As hybrid fiber-copper architectures become more important in the industry and academia, using shorter loop lengths (i.e. up to 250 meters) from the last distribution point to users enables adopting even higher frequencies to achieve very high data rates of 500 Mbps and beyond, as is the case with the G.fast standard under development by ITU-T. In this work, a time-domain simulator has been developed to evaluate G.fast system performance. System capacity is evaluated with different cyclic extension lengths and different reference loop topologies specified by ITU-T. The simulation results show that G.fast systems are robust to bridgetaps and capable of providing very high data rates for all simulated loop topologies to support next generation ultra high speed broadband services.
{"title":"Capacity analysis of G.fast systems via time-domain simulations","authors":"Igor Almeida, A. Klautau, Chenguang Lu","doi":"10.1109/ICC.2013.6655186","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655186","url":null,"abstract":"The evolving broadband access systems using copper networks are currently deployed in a frequency band that goes up to 30 MHz, as specified in VDSL2. As hybrid fiber-copper architectures become more important in the industry and academia, using shorter loop lengths (i.e. up to 250 meters) from the last distribution point to users enables adopting even higher frequencies to achieve very high data rates of 500 Mbps and beyond, as is the case with the G.fast standard under development by ITU-T. In this work, a time-domain simulator has been developed to evaluate G.fast system performance. System capacity is evaluated with different cyclic extension lengths and different reference loop topologies specified by ITU-T. The simulation results show that G.fast systems are robust to bridgetaps and capable of providing very high data rates for all simulated loop topologies to support next generation ultra high speed broadband services.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"4008-4013"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79931519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655463
R. Swaminathan, R. Roy, M. D. Selvaraj
In this paper, we analyse the performance of a single-relay cooperative diversity system, which is an effective technique to combat the effects of small scale fading, in a more realistic scenario by assuming a correlation among source-to-relay (SR), relay-to-destination (RD), and source-to-destination (SD) links. A generalised closed form end-to-end symbol error probability (SEP) expression for M-ary phase-shift keying (MPSK) scheme using paired error approach has been derived over correlated Nakagami-m fading channels with decode and forward (DF) protocol being used at the relay node. Moreover, we use similar error approach to analyse the performance of a double correlated cooperative diversity system by assuming the correlation between SR and RD channels. Finally, Monte Carlo simulation has been performed to validate the theoretical results.
{"title":"Performance analysis of triple correlated selection combining for cooperative diversity systems","authors":"R. Swaminathan, R. Roy, M. D. Selvaraj","doi":"10.1109/ICC.2013.6655463","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655463","url":null,"abstract":"In this paper, we analyse the performance of a single-relay cooperative diversity system, which is an effective technique to combat the effects of small scale fading, in a more realistic scenario by assuming a correlation among source-to-relay (SR), relay-to-destination (RD), and source-to-destination (SD) links. A generalised closed form end-to-end symbol error probability (SEP) expression for M-ary phase-shift keying (MPSK) scheme using paired error approach has been derived over correlated Nakagami-m fading channels with decode and forward (DF) protocol being used at the relay node. Moreover, we use similar error approach to analyse the performance of a double correlated cooperative diversity system by assuming the correlation between SR and RD channels. Finally, Monte Carlo simulation has been performed to validate the theoretical results.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"151 1","pages":"5483-5488"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76752294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655312
Ahmed A. S. Seleim, I. Macaluso, L. Doyle
The concept of cancellation carriers (CCs) has been proposed in the literature for sidelobe suppression for orthogonal frequency division multiplexing (OFDM) systems. Subcarriers at the edges of the OFDM spectrum are used for sidelobe reduction while the remaining subcarriers are used for data transmission. Existing CCs techniques require performing complex optimization that should be applied for each OFDM symbol which is not suitable for real-time applications. In this paper, we propose a heuristic approach for CCs. The proposed algorithm involves few computations compared with all other techniques proposed in the literature. Simulation results show that sidelobe reduction performance can be close to the optimal. Moreover, the proposed algorithm is implemented in a software defined radio and implementation results prove that it can be introduced for real-time applications.
{"title":"Efficient sidelobe suppression for OFDM systems using advanced cancellation carriers","authors":"Ahmed A. S. Seleim, I. Macaluso, L. Doyle","doi":"10.1109/ICC.2013.6655312","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655312","url":null,"abstract":"The concept of cancellation carriers (CCs) has been proposed in the literature for sidelobe suppression for orthogonal frequency division multiplexing (OFDM) systems. Subcarriers at the edges of the OFDM spectrum are used for sidelobe reduction while the remaining subcarriers are used for data transmission. Existing CCs techniques require performing complex optimization that should be applied for each OFDM symbol which is not suitable for real-time applications. In this paper, we propose a heuristic approach for CCs. The proposed algorithm involves few computations compared with all other techniques proposed in the literature. Simulation results show that sidelobe reduction performance can be close to the optimal. Moreover, the proposed algorithm is implemented in a software defined radio and implementation results prove that it can be introduced for real-time applications.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"170 1","pages":"4687-4692"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76941401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655342
C. Knievel, D. Hao, P. Hoeher, P. Weitkemper, H. Taoka
In most modern wireless systems, adaptive modulation and channel coding is applied to achieve a high spectral efficiency. Hence, suitable receivers need to support a large variety of modulation and channel coding schemes (MCS) while maintaining a low complexity. The performance and complexity of a multi-dimensional factor-graph based (MD-GSIR) framework for iterative joint channel estimation and data detection is investigated for the application of adaptive modulation and coding in an LTE environment. Three detection algorithms within the MD-GSIR framework are investigated and a novel tree-based detection is proposed. The versatile structure of the MD-GSIR concept offers a flexible trade-off between computational complexity and performance. Furthermore, the message exchange is adapted to support the irregular training structure which may occur in adaptive environments.
{"title":"Evaluation and extension of a multi-dimensional graph-based receiver concept for MIMO-OFDM","authors":"C. Knievel, D. Hao, P. Hoeher, P. Weitkemper, H. Taoka","doi":"10.1109/ICC.2013.6655342","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655342","url":null,"abstract":"In most modern wireless systems, adaptive modulation and channel coding is applied to achieve a high spectral efficiency. Hence, suitable receivers need to support a large variety of modulation and channel coding schemes (MCS) while maintaining a low complexity. The performance and complexity of a multi-dimensional factor-graph based (MD-GSIR) framework for iterative joint channel estimation and data detection is investigated for the application of adaptive modulation and coding in an LTE environment. Three detection algorithms within the MD-GSIR framework are investigated and a novel tree-based detection is proposed. The versatile structure of the MD-GSIR concept offers a flexible trade-off between computational complexity and performance. Furthermore, the message exchange is adapted to support the irregular training structure which may occur in adaptive environments.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"59 1","pages":"4844-4848"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77213116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655198
Konstantinos Poularakis, L. Tassiulas
Hierarchical topologies have been applied in many existing systems that provide public IPTV or massive content delivery services. The efficient operation of these services requires massive bandwidth resources. Data caching has emerged as an effective way in reducing bandwidth consumption and accelerating content access. In hierarchical caching systems requests for content are routed upwards until they reach a cache that stores a copy of the requested file. When the requested file is found, it is sent on the reverse path to the client. In this work, we focus on the problem of caching redundant copies of content in intermediate caches on the reverse path in order to minimize the bandwidth consumption within a given time horizon. The above problem is known to be NP-hard. However, we show that replacing the cache capacity constraints by a cost term paid each time we store a file in a cache, results to the tractable problem of minimizing the overall bandwidth and caching expenses. We use its optimal solution to establish a novel algorithm for the efficient solution of the original problem. We furthermore study the case that segments of encoded versions of the files instead of only complete files are allowed to be stored at the caches. We show that this problem is of polynomial complexity. Numerical experiments for typical popularity distributions reveal the performance distance between the proposed algorithms and heuristic algorithms that are commonly applied nowadays.
{"title":"Optimal algorithms for hierarchical web caches","authors":"Konstantinos Poularakis, L. Tassiulas","doi":"10.1109/ICC.2013.6655198","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655198","url":null,"abstract":"Hierarchical topologies have been applied in many existing systems that provide public IPTV or massive content delivery services. The efficient operation of these services requires massive bandwidth resources. Data caching has emerged as an effective way in reducing bandwidth consumption and accelerating content access. In hierarchical caching systems requests for content are routed upwards until they reach a cache that stores a copy of the requested file. When the requested file is found, it is sent on the reverse path to the client. In this work, we focus on the problem of caching redundant copies of content in intermediate caches on the reverse path in order to minimize the bandwidth consumption within a given time horizon. The above problem is known to be NP-hard. However, we show that replacing the cache capacity constraints by a cost term paid each time we store a file in a cache, results to the tractable problem of minimizing the overall bandwidth and caching expenses. We use its optimal solution to establish a novel algorithm for the efficient solution of the original problem. We furthermore study the case that segments of encoded versions of the files instead of only complete files are allowed to be stored at the caches. We show that this problem is of polynomial complexity. Numerical experiments for typical popularity distributions reveal the performance distance between the proposed algorithms and heuristic algorithms that are commonly applied nowadays.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"90 1","pages":"4073-4077"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77221029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655505
Mingming Gan, F. Mani, F. Kaltenberger, Claude Oestges, T. Zemen
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.
{"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":"https://doi.org/10.1109/ICC.2013.6655505","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.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82567670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：