Pub Date : 2010-12-10DOI: 10.1109/GLOCOM.2010.5683260
Jiankang Zhang, L. Hanzo, X. Mu
In this paper, a Forward Error Coded (FEC) Decision-Directed (FEC-DD) channel estimation scheme is proposed for Multiple-Input Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing/Space Division Multiple Access (OFDM/SDMA) systems which is based on the Expectation-Conditional Maximization Either (ECME) algorithm. The proposed DD technique is combined with the Optimised Hierarchy Reduced Search Algorithm (OHRSA) based Multi-User Detector (MUD) and directly calculates the Maximization-Step (M-Step) by conditionally maximizing the logarithmic likelihood function of the ``incomplete'' data. We avoid the employment of matrix inversion, since only a single subcarrier's Frequency-Domain CHannel Transfer Function (FD-CHTF) is calculated at a time, since we assume that the other subcarriers' FD-CHTFs are the most recent estimates from the previous iteration of the proposed scheme. Our simulation results have demonstrated that the proposed scheme is capable of reducing the received power requirement by $4 dB$ upon exploiting the error correction capability of a FEC decoder within the ECME loop.
{"title":"Channel Code Aided Decision-Directed Channel Estimation for MIMO OFDM/SDMA Systems Based on the \"Expectation-Conditional Maximization Either\" Algorithm","authors":"Jiankang Zhang, L. Hanzo, X. Mu","doi":"10.1109/GLOCOM.2010.5683260","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683260","url":null,"abstract":"In this paper, a Forward Error Coded (FEC) Decision-Directed (FEC-DD) channel estimation scheme is proposed for Multiple-Input Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing/Space Division Multiple Access (OFDM/SDMA) systems which is based on the Expectation-Conditional Maximization Either (ECME) algorithm. The proposed DD technique is combined with the Optimised Hierarchy Reduced Search Algorithm (OHRSA) based Multi-User Detector (MUD) and directly calculates the Maximization-Step (M-Step) by conditionally maximizing the logarithmic likelihood function of the ``incomplete'' data. We avoid the employment of matrix inversion, since only a single subcarrier's Frequency-Domain CHannel Transfer Function (FD-CHTF) is calculated at a time, since we assume that the other subcarriers' FD-CHTFs are the most recent estimates from the previous iteration of the proposed scheme. Our simulation results have demonstrated that the proposed scheme is capable of reducing the received power requirement by $4 dB$ upon exploiting the error correction capability of a FEC decoder within the ECME loop.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"41 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88414029","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 : 2010-12-06DOI: 10.1109/GLOCOM.2010.5683304
W. Ivancic, P. Paulsen, D. Stewart, W. Eddy, J. McKim, John Taylor, S. Lynch, Jay Heberle, J. Northam, C. Jackson, Lloyd Wood
Abstract-We use Delay-Tolerant Networking (DTN) to break control loops between space-ground communication links and ground-ground communication links to increase overall file delivery efficiency, as well as to enable large files to be proactively fragmented and received across multiple ground stations. DTN proactive fragmentation and reactive fragmentation were demonstrated from the UK-DMC satellite using two independent ground stations. The files were reassembled at a bundle agent, located at Glenn Research Center in Cleveland Ohio. The first space-based demonstration of this occurred on September 30 and October 1, 2009. This paper details those experiments.
{"title":"Large File Transfers from Space Using Multiple Ground Terminals and Delay-Tolerant Networking","authors":"W. Ivancic, P. Paulsen, D. Stewart, W. Eddy, J. McKim, John Taylor, S. Lynch, Jay Heberle, J. Northam, C. Jackson, Lloyd Wood","doi":"10.1109/GLOCOM.2010.5683304","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683304","url":null,"abstract":"Abstract-We use Delay-Tolerant Networking (DTN) to break control loops between space-ground communication links and ground-ground communication links to increase overall file delivery efficiency, as well as to enable large files to be proactively fragmented and received across multiple ground stations. DTN proactive fragmentation and reactive fragmentation were demonstrated from the UK-DMC satellite using two independent ground stations. The files were reassembled at a bundle agent, located at Glenn Research Center in Cleveland Ohio. The first space-based demonstration of this occurred on September 30 and October 1, 2009. This paper details those experiments.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"183 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74640041","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 : 2010-12-06DOI: 10.1109/GLOCOM.2010.5683614
R. Langar, Salsabil Njima, N. Bouabdallah, R. Boutaba, G. Pujolle
In this paper, we address the radio resource utilization efficiency in single channel wireless mesh networks (WMNs) while considering the mobility of users and when multiple simultaneous connections on the same channel exist in the network. To achieve this, we use clustering. We first identify through analytical models and simulations the cases where clustering is helpful. Building on these results, we propose two clustering schemes that take into consideration the mobility properties of users in order to improve the WMN performance. We prove that both schemes can achieve significant gains in terms of radio resource utilization, especially when the number of simultaneous connections in the network increases. Specifically, we show that the first scheme fits better low-connected wireless mesh networks, whereas the second scheme is more suitable for highly-connected networks.
{"title":"Towards Efficient Use of Radio Resources in Single Channel Wireless Mesh Networks","authors":"R. Langar, Salsabil Njima, N. Bouabdallah, R. Boutaba, G. Pujolle","doi":"10.1109/GLOCOM.2010.5683614","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683614","url":null,"abstract":"In this paper, we address the radio resource utilization efficiency in single channel wireless mesh networks (WMNs) while considering the mobility of users and when multiple simultaneous connections on the same channel exist in the network. To achieve this, we use clustering. We first identify through analytical models and simulations the cases where clustering is helpful. Building on these results, we propose two clustering schemes that take into consideration the mobility properties of users in order to improve the WMN performance. We prove that both schemes can achieve significant gains in terms of radio resource utilization, especially when the number of simultaneous connections in the network increases. Specifically, we show that the first scheme fits better low-connected wireless mesh networks, whereas the second scheme is more suitable for highly-connected networks.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"87 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79427182","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 : 2010-12-06DOI: 10.1109/GLOCOM.2010.5683556
T. Silverston, Olivier Fourmaux, Kave Salamatian, Kenjiro Cho
In this paper, we present our P2P-TV measurement experiment performed in France and Japan. By using multiple measurement points in different locations of the world, we are able to get a global view of the measured P2P networks and we can infer their main properties. More precisely, we focus on the level of collaboration between peers, their location and the effect of the traffic on the networks. Our results show that there is no fairness between peers and it is an important issue for the scalability of P2P-TV systems. Moreover, hundreds of Autonomous Systems are involved in the P2P-TV traffic and it points out the lack of locality-aware mechanisms for these systems. The geographic location of peers testifies the wide spread of these applications in Asia and highlights their worldwide usage.
{"title":"On Fairness and Locality in P2P-TV through Large-Scale Measurement Experiment","authors":"T. Silverston, Olivier Fourmaux, Kave Salamatian, Kenjiro Cho","doi":"10.1109/GLOCOM.2010.5683556","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683556","url":null,"abstract":"In this paper, we present our P2P-TV measurement experiment performed in France and Japan. By using multiple measurement points in different locations of the world, we are able to get a global view of the measured P2P networks and we can infer their main properties. More precisely, we focus on the level of collaboration between peers, their location and the effect of the traffic on the networks. Our results show that there is no fairness between peers and it is an important issue for the scalability of P2P-TV systems. Moreover, hundreds of Autonomous Systems are involved in the P2P-TV traffic and it points out the lack of locality-aware mechanisms for these systems. The geographic location of peers testifies the wide spread of these applications in Asia and highlights their worldwide usage.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"192 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76779486","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 : 2010-12-06DOI: 10.1109/GLOCOM.2010.5683380
J. Rubio-Loyola, A. Astorga, J. Serrat, W. Chai, L. Mamatas, A. Galis, S. Clayman, A. Cheniour, L. Lefèvre, Olivier Mornard, A. Fischer, A. Paler, H. Meer
The current Internet does not enable easy introduction and deployment of new network technologies and services. This paper aims to progress the Future Internet (FI) by introduction of a service composition and execution environment that re-use existing components of access and core networks. This paper presents essential service-centric platforms and software systems that have been developed with the aim to create a flexible environment for an Autonomic Internet
{"title":"Platforms and Software Systems for an Autonomic Internet","authors":"J. Rubio-Loyola, A. Astorga, J. Serrat, W. Chai, L. Mamatas, A. Galis, S. Clayman, A. Cheniour, L. Lefèvre, Olivier Mornard, A. Fischer, A. Paler, H. Meer","doi":"10.1109/GLOCOM.2010.5683380","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683380","url":null,"abstract":"The current Internet does not enable easy introduction and deployment of new network technologies and services. This paper aims to progress the Future Internet (FI) by introduction of a service composition and execution environment that re-use existing components of access and core networks. This paper presents essential service-centric platforms and software systems that have been developed with the aim to create a flexible environment for an Autonomic Internet","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"31 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75573987","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 : 2010-12-06DOI: 10.1109/GLOCOM.2010.5683236
R. Al-Zubi, M. Krunz, Leo Lopes
Ultra-wideband (UWB) communications has emerged as a burgeoning technology for high data rate wireless personal area networks (WPANs). In this paper, we propose a novel resource utilization mechanism (RUM) for improving the throughput in multi-rate UWB-based WPANs. RUM is intended to remedy a critical issue in both unicast and multicast transmissions. In unicast (single- and multi-hop), the connectivity of a source-destination pair is defined by the ability to overhear control messages (e.g., route requests, request-to-send/clear-to-send, etc.). These messages are usually sent at a low transmission rate to extend their reachability, hence a node can directly communicate with faraway destinations. Such destinations cannot be reliably reached by high transmission rates. This leads to a long channel reservation time and hence a high blocking probability for prospective reservations and low network throughput. In the case of multicast, the maximum transmission rate is bottlenecked by the farthest destination. RUM exploits opportunistic-relaying and time-spreading techniques to improve link reliability and increase the transmission rate, and hence network throughput. Simulations are used to demonstrate the performance gain of RUM.
{"title":"Resource Utilization Mechanism for Multi-Rate Ultra-Wide Band Networks","authors":"R. Al-Zubi, M. Krunz, Leo Lopes","doi":"10.1109/GLOCOM.2010.5683236","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683236","url":null,"abstract":"Ultra-wideband (UWB) communications has emerged as a burgeoning technology for high data rate wireless personal area networks (WPANs). In this paper, we propose a novel resource utilization mechanism (RUM) for improving the throughput in multi-rate UWB-based WPANs. RUM is intended to remedy a critical issue in both unicast and multicast transmissions. In unicast (single- and multi-hop), the connectivity of a source-destination pair is defined by the ability to overhear control messages (e.g., route requests, request-to-send/clear-to-send, etc.). These messages are usually sent at a low transmission rate to extend their reachability, hence a node can directly communicate with faraway destinations. Such destinations cannot be reliably reached by high transmission rates. This leads to a long channel reservation time and hence a high blocking probability for prospective reservations and low network throughput. In the case of multicast, the maximum transmission rate is bottlenecked by the farthest destination. RUM exploits opportunistic-relaying and time-spreading techniques to improve link reliability and increase the transmission rate, and hence network throughput. Simulations are used to demonstrate the performance gain of RUM.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"43 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77128444","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 : 2010-12-06DOI: 10.1109/GLOCOM.2010.5683769
S. Voran, Andrew Catellier
We present and evaluate a new multiple-description coding extension to the international standard for pulse code modulation speech coding (ITU-T Rec. G.711). This extension is inserted between the G.711 encoder and decoder. It uses speech-polarity decomposition to spread the speech signal across two channels thus increasing robustness to channel losses. When both channels deliver their payloads the extension becomes transparent and bit-exact G.711 speech samples are produced-there is no quality penalty. Due to low inter-channel redundancy, block coding, and entropy coding, the average total speech payload bit-rate is no greater than the 64 kbps rate of conventional G.711-there is no rate penalty. When either channel fails to deliver, the remaining channel still produces intelligible speech with moderately reduced quality thanks to a compressed sine-pulse fill-in algorithm. We are not aware of any other viable multiple-description coding extension that simultaneously meets the opposing goals of no quality penalty and no rate penalty.
{"title":"Multiple-Description Speech Coding Using Speech-Polarity Decomposition","authors":"S. Voran, Andrew Catellier","doi":"10.1109/GLOCOM.2010.5683769","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683769","url":null,"abstract":"We present and evaluate a new multiple-description coding extension to the international standard for pulse code modulation speech coding (ITU-T Rec. G.711). This extension is inserted between the G.711 encoder and decoder. It uses speech-polarity decomposition to spread the speech signal across two channels thus increasing robustness to channel losses. When both channels deliver their payloads the extension becomes transparent and bit-exact G.711 speech samples are produced-there is no quality penalty. Due to low inter-channel redundancy, block coding, and entropy coding, the average total speech payload bit-rate is no greater than the 64 kbps rate of conventional G.711-there is no rate penalty. When either channel fails to deliver, the remaining channel still produces intelligible speech with moderately reduced quality thanks to a compressed sine-pulse fill-in algorithm. We are not aware of any other viable multiple-description coding extension that simultaneously meets the opposing goals of no quality penalty and no rate penalty.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"37 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75617394","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 : 2010-12-06DOI: 10.1109/GLOCOM.2010.5684018
Sandra Céspedes Umaña, Xuemin Shen
We present a novel mobility management scheme for seamless Internet access in urban vehicular scenarios. The scheme is based on Proxy Mobile IPv6 and Host Identity Protocol, and allows users to handoff within and across different administrative domains. We consider two types of nodes: legacy nodes with no mobility support (e.g., end devices that depend on the vehicle's mobile router for the support of mobility), and mobility-enabled nodes (e.g., passengers that commute from/to vehicles and terminal stations). The main advantage of our scheme is to enable the inter-domain handover of both types of nodes with a reduced signalling overhead and packet losses. Performance evaluations demonstrate that our scheme improves the handover latency and packet losses compared to other global mobility management protocols.
{"title":"An Efficient Hybrid HIP-PMIPv6 Scheme for Seamless Internet Access in Urban Vehicular Scenarios","authors":"Sandra Céspedes Umaña, Xuemin Shen","doi":"10.1109/GLOCOM.2010.5684018","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5684018","url":null,"abstract":"We present a novel mobility management scheme for seamless Internet access in urban vehicular scenarios. The scheme is based on Proxy Mobile IPv6 and Host Identity Protocol, and allows users to handoff within and across different administrative domains. We consider two types of nodes: legacy nodes with no mobility support (e.g., end devices that depend on the vehicle's mobile router for the support of mobility), and mobility-enabled nodes (e.g., passengers that commute from/to vehicles and terminal stations). The main advantage of our scheme is to enable the inter-domain handover of both types of nodes with a reduced signalling overhead and packet losses. Performance evaluations demonstrate that our scheme improves the handover latency and packet losses compared to other global mobility management protocols.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"1 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82313755","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 : 2010-12-06DOI: 10.1109/GLOCOM.2010.5684114
Yuehua Ding, Yide Wang, J. Diouris
In this paper, RFSD (Robust Fixed-complexity Sphere Decoder) based on a new preprocessing algorithm is proposed for MIMO (Multiple Input Multiple Output) detection. Unlike the original FSD (Fixed-complexity Sphere Decoder) ordering which determines the FE (Full expansion) stage by choosing the signal component with greatest post-processing noise amplification on itself, the proposed RFSD determines the FE stage by selecting the signal component with the smallest postprocessing impact on the undetected signal component in following SE (Single Expansion) stage. Besides better performance than the original FSD ordering, RFSD is robust to the configuration of MIMO antennas (both NT<=NR and NT>NR), which is another advantage over original FSD ordering.
{"title":"Robust Fixed Complexity Sphere Decoder","authors":"Yuehua Ding, Yide Wang, J. Diouris","doi":"10.1109/GLOCOM.2010.5684114","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5684114","url":null,"abstract":"In this paper, RFSD (Robust Fixed-complexity Sphere Decoder) based on a new preprocessing algorithm is proposed for MIMO (Multiple Input Multiple Output) detection. Unlike the original FSD (Fixed-complexity Sphere Decoder) ordering which determines the FE (Full expansion) stage by choosing the signal component with greatest post-processing noise amplification on itself, the proposed RFSD determines the FE stage by selecting the signal component with the smallest postprocessing impact on the undetected signal component in following SE (Single Expansion) stage. Besides better performance than the original FSD ordering, RFSD is robust to the configuration of MIMO antennas (both NT<=NR and NT>NR), which is another advantage over original FSD ordering.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"31 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90612039","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683790
Ahmad Gomaa, N. Al-Dhahir
We propose a novel algorithm based on compressive sensing (CS) theory to estimate narrow band interference (NBI) signals experiencing time-varying frequency-selective fading channels in orthogonal frequency division multiplexing (OFDM) systems. In addition, we investigate the case of asynchronous jamming where there is a frequency offset between the NBI and desired signals. Furthermore, we propose a reduced-complexity implementation for our proposed algorithm with negligible performance loss. Finally, we show that our proposed approach can be applied to both cyclic-prefix and zero-padding OFDM systems. Simulation results show the effectiveness of our proposed algorithm in mitigating NBI.
{"title":"A Compressive Sensing Approach to NBI Cancellation in Mobile OFDM Systems","authors":"Ahmad Gomaa, N. Al-Dhahir","doi":"10.1109/GLOCOM.2010.5683790","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683790","url":null,"abstract":"We propose a novel algorithm based on compressive sensing (CS) theory to estimate narrow band interference (NBI) signals experiencing time-varying frequency-selective fading channels in orthogonal frequency division multiplexing (OFDM) systems. In addition, we investigate the case of asynchronous jamming where there is a frequency offset between the NBI and desired signals. Furthermore, we propose a reduced-complexity implementation for our proposed algorithm with negligible performance loss. Finally, we show that our proposed approach can be applied to both cyclic-prefix and zero-padding OFDM systems. Simulation results show the effectiveness of our proposed algorithm in mitigating NBI.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"53 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73774205","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
扫码关注我们
求助内容：
应助结果提醒方式：