Pub Date : 2013-06-09DOI: 10.1109/ICC.2013.6655429
Nuwan S. Ferdinand, Nandana Rajatheva, M. Latva-aho
Antenna correlation is usually viewed as a detrimental effect in a multiple input multiple output (MIMO) system. This paper investigates how this affects the performance of an amplify-and-forward (AF) relay network. We consider multiple antennas at all nodes with a general correlation matrix structure having an arbitrary eigenvalue distribution. We derive exact closed form expression for the ergodic capacity and simplify to special case of distinct eigenvalues. Further, we investigate the system in high signal-to-noise ratio (SNR) and derive a simple asymptotic expression. Our results provide a comprehensive analysis and useful insight about the ergodic capacity of the system.
{"title":"Exact ergodic capacity of MIMO OSTBC amplify-and-forward relay network with antenna correlation","authors":"Nuwan S. Ferdinand, Nandana Rajatheva, M. Latva-aho","doi":"10.1109/ICC.2013.6655429","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655429","url":null,"abstract":"Antenna correlation is usually viewed as a detrimental effect in a multiple input multiple output (MIMO) system. This paper investigates how this affects the performance of an amplify-and-forward (AF) relay network. We consider multiple antennas at all nodes with a general correlation matrix structure having an arbitrary eigenvalue distribution. We derive exact closed form expression for the ergodic capacity and simplify to special case of distinct eigenvalues. Further, we investigate the system in high signal-to-noise ratio (SNR) and derive a simple asymptotic expression. Our results provide a comprehensive analysis and useful insight about the ergodic capacity of the system.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"5 1","pages":"5301-5305"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87722045","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.6655362
N. Aboutorab, Wibowo Hardjawana, B. Vucetic
In this paper, we propose a new compressive sensing (CS) based channel estimation method for high mobility orthogonal frequency division multiplexing (OFDM) systems. The proposed scheme offers the benefits of orthogonal matching pursuit (OMP) and subspace pursuit (SP) estimation methods combined with an inter-carrier interference (ICI) cancellation process. The proposed CS based channel estimation scheme, referred to as the hybrid pursuit (HP) based channel estimation method, operates in an iterative, decision-directed fashion. Here, in each iteration, once the channel is estimated, data symbols are detected and used to calculate the estimate of ICI, caused by the Doppler spread. After that, the ICI term is subtracted from the received signals. The whole process is then repeated, iteratively. The simulation results assess the performance gains achieved by the proposed scheme over the best known channel estimation methods.
{"title":"Application of compressive sensing to channel estimation of high mobility OFDM systems","authors":"N. Aboutorab, Wibowo Hardjawana, B. Vucetic","doi":"10.1109/ICC.2013.6655362","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655362","url":null,"abstract":"In this paper, we propose a new compressive sensing (CS) based channel estimation method for high mobility orthogonal frequency division multiplexing (OFDM) systems. The proposed scheme offers the benefits of orthogonal matching pursuit (OMP) and subspace pursuit (SP) estimation methods combined with an inter-carrier interference (ICI) cancellation process. The proposed CS based channel estimation scheme, referred to as the hybrid pursuit (HP) based channel estimation method, operates in an iterative, decision-directed fashion. Here, in each iteration, once the channel is estimated, data symbols are detected and used to calculate the estimate of ICI, caused by the Doppler spread. After that, the ICI term is subtracted from the received signals. The whole process is then repeated, iteratively. The simulation results assess the performance gains achieved by the proposed scheme over the best known channel estimation methods.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"55 1","pages":"4946-4950"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88272607","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.6654828
Troy Nunnally, Penyen Chi, K. Abdullah, A. Uluagac, J. Copeland, R. Beyah
As network attacks increase in complexity, network administrators will continue to struggle with analyzing security data immediately and efficiently. To alleviate these challenges, researchers are looking into various visualization techniques (e.g., two-dimensional (2D) and three-dimensional (3D)) to detect, identify, and analyze malicious attacks. This paper discusses the benefits of using a stereoscopic 3D parallel visualization techniques for network scanning, in particular, when addressing occlusion-based visualization attacks intended to confuse network administrators. To our knowledge, no 2D or 3D tool exists that analyzes these attacks. Hence, we propose a novel 3D Parallel coordinate visualization tool for advanced network scans and attacks called P3D. P3D uses flow data, filtering techniques, and state-of-the art 3D technologies to help network administrators detect distributed and coordinated network scans. Compared to other 2D and 3D network security visualization tools, P3D prevents occlusion-based visualization attacks (e.g., Windshield Wiper and Port Source Confusion attacks). We validate our tool with use-cases from emulated distributed scanning attacks. Our evaluation shows P3D allows users to extract new information about scans and minimize information overload by adding an extra dimension and awareness region in the visualization.
{"title":"P3D: A parallel 3D coordinate visualization for advanced network scans","authors":"Troy Nunnally, Penyen Chi, K. Abdullah, A. Uluagac, J. Copeland, R. Beyah","doi":"10.1109/ICC.2013.6654828","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654828","url":null,"abstract":"As network attacks increase in complexity, network administrators will continue to struggle with analyzing security data immediately and efficiently. To alleviate these challenges, researchers are looking into various visualization techniques (e.g., two-dimensional (2D) and three-dimensional (3D)) to detect, identify, and analyze malicious attacks. This paper discusses the benefits of using a stereoscopic 3D parallel visualization techniques for network scanning, in particular, when addressing occlusion-based visualization attacks intended to confuse network administrators. To our knowledge, no 2D or 3D tool exists that analyzes these attacks. Hence, we propose a novel 3D Parallel coordinate visualization tool for advanced network scans and attacks called P3D. P3D uses flow data, filtering techniques, and state-of-the art 3D technologies to help network administrators detect distributed and coordinated network scans. Compared to other 2D and 3D network security visualization tools, P3D prevents occlusion-based visualization attacks (e.g., Windshield Wiper and Port Source Confusion attacks). We validate our tool with use-cases from emulated distributed scanning attacks. Our evaluation shows P3D allows users to extract new information about scans and minimize information overload by adding an extra dimension and awareness region in the visualization.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"72 1","pages":"2052-2057"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86316716","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.6655363
Peng Cheng, Zhuo Chen, Lin Gui, Y. Guo, M. Tao, Yun Rui
Channel estimation for an orthogonal frequency-division multiplexing (OFDM) broadband system operating with high mobility is very challenging. This is mainly due to the significant Doppler spread, inherent in a time-frequency doubly-selective (DS) channel. Consequently, a large number of channel coefficients must be estimated, forcing the need for allocating a large number of pilot subcarriers. To address this problem, we propose a novel channel estimation method based on basis expansion models (BEMs) and distributed compressive sensing (DCS) theory. To be specific, we develop a two-stage sparse BEM coefficients estimation method, which can effectively combat the Doppler spread and enable accurate channel estimation with dramatically reduced number of pilot subcarriers. The numerical results reveal that, in a typical LTE system configuration, the proposed scheme can increase the spectral efficiency by 40% and achieve a 6 dB gain in terms of normalized mean square error (NMSE), both compared to the conventional scheme.
{"title":"Distributed sparse channel estimation for OFDM systems with high mobility","authors":"Peng Cheng, Zhuo Chen, Lin Gui, Y. Guo, M. Tao, Yun Rui","doi":"10.1109/ICC.2013.6655363","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655363","url":null,"abstract":"Channel estimation for an orthogonal frequency-division multiplexing (OFDM) broadband system operating with high mobility is very challenging. This is mainly due to the significant Doppler spread, inherent in a time-frequency doubly-selective (DS) channel. Consequently, a large number of channel coefficients must be estimated, forcing the need for allocating a large number of pilot subcarriers. To address this problem, we propose a novel channel estimation method based on basis expansion models (BEMs) and distributed compressive sensing (DCS) theory. To be specific, we develop a two-stage sparse BEM coefficients estimation method, which can effectively combat the Doppler spread and enable accurate channel estimation with dramatically reduced number of pilot subcarriers. The numerical results reveal that, in a typical LTE system configuration, the proposed scheme can increase the spectral efficiency by 40% and achieve a 6 dB gain in terms of normalized mean square error (NMSE), both compared to the conventional scheme.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"4951-4956"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82962957","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.6655370
Qi Sun, Lihua Li, Ping Zhang
We propose decentralized relay coordination algorithms and corresponding channel state information (CSI) signaling concepts for weighted sum rate maximization, via linear downlink transceiver optimization in multiuser multi-relay MIMO network. Two decentralized algorithms are developed with the local CSI requirements at the base station and the relay nodes. In the first proposed algorithm, the generalized channel inversion precoding is utilized at the base station to avoid the second hop channel sharing requirements among the relay nodes. Further, decentralized transceiver optimization of the relay nodes and users are developed to maximize the weighted sum rate. For the second proposed approach, we provide a novel structure of the precoding matrix of the base station. Then decentralized joint BS, relay and user transceiver design is developed to further improve the performance. Moreover, CSI signaling and decentralized processing in TDD system are analyzed. Simulation results show the effectiveness of the decentralized relay coordination compared to the existing algorithms.
{"title":"Decentralized relay coordination for weighted sum rate maximization in TDD multiuser multi-relay systems","authors":"Qi Sun, Lihua Li, Ping Zhang","doi":"10.1109/ICC.2013.6655370","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655370","url":null,"abstract":"We propose decentralized relay coordination algorithms and corresponding channel state information (CSI) signaling concepts for weighted sum rate maximization, via linear downlink transceiver optimization in multiuser multi-relay MIMO network. Two decentralized algorithms are developed with the local CSI requirements at the base station and the relay nodes. In the first proposed algorithm, the generalized channel inversion precoding is utilized at the base station to avoid the second hop channel sharing requirements among the relay nodes. Further, decentralized transceiver optimization of the relay nodes and users are developed to maximize the weighted sum rate. For the second proposed approach, we provide a novel structure of the precoding matrix of the base station. Then decentralized joint BS, relay and user transceiver design is developed to further improve the performance. Moreover, CSI signaling and decentralized processing in TDD system are analyzed. Simulation results show the effectiveness of the decentralized relay coordination compared to the existing algorithms.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"28 1","pages":"4989-4994"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89045846","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.6655590
Mengjie Zhou, Jiming Chen, Quanbo Ge, Xigang Huang, Yuesheng Liu
The identification of vessel collision risk for a Maritime Intelligent Transport System (MITS) is crucial for maritime safety and management. This paper considers the identification of the Systematic Collision Risk (SCR) for an MITS based on AIS data, which is obtained by wireless communication among vessels and between vessels and shore-based stations. SCR is modeled as a function of the collision risk of each vessel. A computing method for the SCR of a two-vessel case is proposed. Meanwhile, a hierarchical clustering based simplification algorithm is provided and applied to transform the topology of an MITS, thus simplifying the computing of the SCR. Based on the two-vessel case and transformation, a bottom-to-top weighted fusion method is employed to calculate the SCR for an MITS. Extensive numerical examples of simulative and real AIS data verify the effectiveness of our modeling and computing.
{"title":"AIS data based identification of systematic collision risk for maritime intelligent transport system","authors":"Mengjie Zhou, Jiming Chen, Quanbo Ge, Xigang Huang, Yuesheng Liu","doi":"10.1109/ICC.2013.6655590","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655590","url":null,"abstract":"The identification of vessel collision risk for a Maritime Intelligent Transport System (MITS) is crucial for maritime safety and management. This paper considers the identification of the Systematic Collision Risk (SCR) for an MITS based on AIS data, which is obtained by wireless communication among vessels and between vessels and shore-based stations. SCR is modeled as a function of the collision risk of each vessel. A computing method for the SCR of a two-vessel case is proposed. Meanwhile, a hierarchical clustering based simplification algorithm is provided and applied to transform the topology of an MITS, thus simplifying the computing of the SCR. Based on the two-vessel case and transformation, a bottom-to-top weighted fusion method is employed to calculate the SCR for an MITS. Extensive numerical examples of simulative and real AIS data verify the effectiveness of our modeling and computing.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"72 1","pages":"6158-6162"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89192777","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.6654767
Zijie Zhang, Guoqiang Mao, B. Anderson
Broadcast in mobile ad-hoc networks is a challenging and resource demanding task, due to the effects of dynamic network topology and channel randomness. In this paper, we consider 2D wireless ad-hoc networks where nodes are randomly distributed and move following a random direction mobility model. A piece of information is broadcast from an arbitrary node. Based on an in-depth analysis into the popular Susceptible-Infectious-Recovered (SIR) epidemic routing algorithm for mobile ad-hoc networks, an energy and spectrum efficient broadcast scheme is proposed, which is able to adapt to fast-changing network topology and channel randomness. Analytical results are provided to characterize the performance of the proposed scheme, including the fraction of nodes that can receive the information and the delay of information propagation. The accuracy of analytical results is verified using simulations.
{"title":"Opportunistic broadcast in mobile ad-hoc networks subject to channel randomness","authors":"Zijie Zhang, Guoqiang Mao, B. Anderson","doi":"10.1109/ICC.2013.6654767","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654767","url":null,"abstract":"Broadcast in mobile ad-hoc networks is a challenging and resource demanding task, due to the effects of dynamic network topology and channel randomness. In this paper, we consider 2D wireless ad-hoc networks where nodes are randomly distributed and move following a random direction mobility model. A piece of information is broadcast from an arbitrary node. Based on an in-depth analysis into the popular Susceptible-Infectious-Recovered (SIR) epidemic routing algorithm for mobile ad-hoc networks, an energy and spectrum efficient broadcast scheme is proposed, which is able to adapt to fast-changing network topology and channel randomness. Analytical results are provided to characterize the performance of the proposed scheme, including the fraction of nodes that can receive the information and the delay of information propagation. The accuracy of analytical results is verified using simulations.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"32 1","pages":"1725-1729"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88838219","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.6655051
J. Andrade, G. F. P. Fernandes, V. Silva, J. Barreto, Nuno Gonçalves, V. Savin
The tradeoff between error-correcting performance and numerical complexity of LDPC decoding algorithms is a well-known problem. In this paper we depict the unseen error-floor performance of the Self-Corrected Min-Sum algorithm for long length DVB-S2 codes. We developed a massively parallel simulation using GPUs which allowed a comprehensive BER characterization either in the waterfall or in the error-floor region. We show that the self-correction technique increases the BER performance by 0.5 and 0.2 dB, in the waterfall and error-floor region, when compared to the Min-Sum algorithm. Furthermore, it reaches within 0.2 dB to the Logarithmic Sum-Product BER performance and it also outperforms the Normalized Min-Sum at high SNR, a low complexity decoding algorithm which yields good BER performance.
{"title":"Near-LSPA performance at MSA complexity","authors":"J. Andrade, G. F. P. Fernandes, V. Silva, J. Barreto, Nuno Gonçalves, V. Savin","doi":"10.1109/ICC.2013.6655051","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655051","url":null,"abstract":"The tradeoff between error-correcting performance and numerical complexity of LDPC decoding algorithms is a well-known problem. In this paper we depict the unseen error-floor performance of the Self-Corrected Min-Sum algorithm for long length DVB-S2 codes. We developed a massively parallel simulation using GPUs which allowed a comprehensive BER characterization either in the waterfall or in the error-floor region. We show that the self-correction technique increases the BER performance by 0.5 and 0.2 dB, in the waterfall and error-floor region, when compared to the Min-Sum algorithm. Furthermore, it reaches within 0.2 dB to the Logarithmic Sum-Product BER performance and it also outperforms the Normalized Min-Sum at high SNR, a low complexity decoding algorithm which yields good BER performance.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"6 1","pages":"3281-3285"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88903084","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.6654816
W. Chu, Bin B. Zhu, Feng Xue, X. Guan, Zhongmin Cai
Phishing is the third cyber-security threat globally and the first cyber-security threat in China. There were 61.69 million phishing victims in China alone from June 2011 to June 2012, with the total annual monetary loss more than 4.64 billion US dollars. These phishing attacks were highly concentrated in targeting at a few major Websites. Many phishing Webpages had a very short life span. In this paper, we assume the Websites to protect against phishing attacks are known, and study the effectiveness of machine learning based phishing detection using only lexical and domain features, which are available even when the phishing Webpages are inaccessible. We propose several novel highly effective features, and use the real phishing attack data against Taobao and Tencent, two main phishing targets in China, in studying the effectiveness of each feature, and each group of features. We then select an optimal set of features in our phishing detector, which has achieved a detection rate better than 98%, with a false positive rate of 0.64% or less. The detector is still effective when the distribution of phishing URLs changes.
{"title":"Protect sensitive sites from phishing attacks using features extractable from inaccessible phishing URLs","authors":"W. Chu, Bin B. Zhu, Feng Xue, X. Guan, Zhongmin Cai","doi":"10.1109/ICC.2013.6654816","DOIUrl":"https://doi.org/10.1109/ICC.2013.6654816","url":null,"abstract":"Phishing is the third cyber-security threat globally and the first cyber-security threat in China. There were 61.69 million phishing victims in China alone from June 2011 to June 2012, with the total annual monetary loss more than 4.64 billion US dollars. These phishing attacks were highly concentrated in targeting at a few major Websites. Many phishing Webpages had a very short life span. In this paper, we assume the Websites to protect against phishing attacks are known, and study the effectiveness of machine learning based phishing detection using only lexical and domain features, which are available even when the phishing Webpages are inaccessible. We propose several novel highly effective features, and use the real phishing attack data against Taobao and Tencent, two main phishing targets in China, in studying the effectiveness of each feature, and each group of features. We then select an optimal set of features in our phishing detector, which has achieved a detection rate better than 98%, with a false positive rate of 0.64% or less. The detector is still effective when the distribution of phishing URLs changes.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"16 1","pages":"1990-1994"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80582664","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.6655354
Ning Sun, Jingxian Wu, Guoqing Zhou
A new distributed joint source-channel code (DJSCC) is proposed for a communication network with spatial-temporally correlated Markov sources. The DJSCC is performed by puncturing the information bits of a systematic linear block code but leaving the parity bits intact, and transmitting the information and parity bits with unequal energy allocations. At the receiver, the spatial data correlation is exploited with a new multi-codeword message passing (MCMP) decoding algorithm. The MCMP decoder performs decoding by exchanging information between codewords from correlated sources, whereas conventional message passing (MP) algorithms exchanges soft information only inside a codeword. The inter-codeword soft information exchange of MCMP yields additional performance gains over the MP algorithm. In recognition that the signals at the receiver are distorted observations of the Markov source and thus can be modeled by a hidden Markov model (HMM), we propose to exploit the temporal data correlation by adding a HMM decoding module to the MCMP decoder. The HMM decoder iteratively exchanges soft information with the MCMP decoder, and this results in significant performance gains over conventional systems.
{"title":"Distributed joint source-channel code for spatial-temporally correlated Markov sources","authors":"Ning Sun, Jingxian Wu, Guoqing Zhou","doi":"10.1109/ICC.2013.6655354","DOIUrl":"https://doi.org/10.1109/ICC.2013.6655354","url":null,"abstract":"A new distributed joint source-channel code (DJSCC) is proposed for a communication network with spatial-temporally correlated Markov sources. The DJSCC is performed by puncturing the information bits of a systematic linear block code but leaving the parity bits intact, and transmitting the information and parity bits with unequal energy allocations. At the receiver, the spatial data correlation is exploited with a new multi-codeword message passing (MCMP) decoding algorithm. The MCMP decoder performs decoding by exchanging information between codewords from correlated sources, whereas conventional message passing (MP) algorithms exchanges soft information only inside a codeword. The inter-codeword soft information exchange of MCMP yields additional performance gains over the MP algorithm. In recognition that the signals at the receiver are distorted observations of the Markov source and thus can be modeled by a hidden Markov model (HMM), we propose to exploit the temporal data correlation by adding a HMM decoding module to the MCMP decoder. The HMM decoder iteratively exchanges soft information with the MCMP decoder, and this results in significant performance gains over conventional systems.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"211 1","pages":"4905-4910"},"PeriodicalIF":0.0,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80687366","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
扫码关注我们
求助内容：
应助结果提醒方式：