Pub Date : 2015-12-03DOI: 10.1109/WCSP.2015.7341162
Hualiang Chen, Dan Wu, Yueming Cai, Xinrong Guan
In this paper, we investigate an inband cooperative device-to-device (D2D) communication system in cellular networks. Cellular users and D2D pairs help each other to improve their respective performance. Specifically, via coalition formation, cellular users release some of their spectrum to D2D pairs so as to start the communications of the D2D pairs; at the same time, D2D pairs help to relay the messages of the cellular users. The D2D pairs are thought to be socially untrusted to the cellular users, as thus, a secrecy problem for cellular users comes into being due to the relaying. Then we address this problem from a physical layer security perspective. A coalition formation algorithm is designed to solve the spectrum management problem in this cooperative system. Numerical results show the validity of the proposed scheme.
{"title":"Coalition formation based energy efficient spectrum leasing in doubtful inband cooperative D2D communications","authors":"Hualiang Chen, Dan Wu, Yueming Cai, Xinrong Guan","doi":"10.1109/WCSP.2015.7341162","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341162","url":null,"abstract":"In this paper, we investigate an inband cooperative device-to-device (D2D) communication system in cellular networks. Cellular users and D2D pairs help each other to improve their respective performance. Specifically, via coalition formation, cellular users release some of their spectrum to D2D pairs so as to start the communications of the D2D pairs; at the same time, D2D pairs help to relay the messages of the cellular users. The D2D pairs are thought to be socially untrusted to the cellular users, as thus, a secrecy problem for cellular users comes into being due to the relaying. Then we address this problem from a physical layer security perspective. A coalition formation algorithm is designed to solve the spectrum management problem in this cooperative system. Numerical results show the validity of the proposed scheme.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127060494","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341106
D. He, Qiang Zhao, Hengjia Qin
The multivariate grey model (MGM), which is recently improved by virtue of the convolution integral, has emerged as a powerful tool for the prediction problem. Unfortunately, this promising technique only effectively adopted the trapezoidal rule, whereas the model coefficients and other interpolation methods are not fully considered. In this paper, we propose an alternative version of MGM inspired by B-spline. Focusing on the evaluation of the model coefficients and convolution integrals, which are key elements for improving the efficiency of MGM, we replaced the existing trapezoidal rule with B-spline. Consequently, comparative studies of the proposed schemes and other generally acknowledged methods are conducted on synthetic data. Simulation results indicate that the proposed methods can achieve promising reinforcement in the short-term time series forecasting performance.
{"title":"B-spline inspired multivariate grey model for short-term time series forecasting","authors":"D. He, Qiang Zhao, Hengjia Qin","doi":"10.1109/WCSP.2015.7341106","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341106","url":null,"abstract":"The multivariate grey model (MGM), which is recently improved by virtue of the convolution integral, has emerged as a powerful tool for the prediction problem. Unfortunately, this promising technique only effectively adopted the trapezoidal rule, whereas the model coefficients and other interpolation methods are not fully considered. In this paper, we propose an alternative version of MGM inspired by B-spline. Focusing on the evaluation of the model coefficients and convolution integrals, which are key elements for improving the efficiency of MGM, we replaced the existing trapezoidal rule with B-spline. Consequently, comparative studies of the proposed schemes and other generally acknowledged methods are conducted on synthetic data. Simulation results indicate that the proposed methods can achieve promising reinforcement in the short-term time series forecasting performance.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115236615","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341335
Lei Wang, Lulu Gao, Aiqing Zhang, Mingkai Chen
Device-to-device (D2D) communication technology can significantly improve energy efficiency and offload base station traffic. It has become a new research focus in next generation mobile communications. In this paper, a file-sharing mechanism based on social networks is proposed for the D2D communication system underlaying cellular networks aiming at improving the users' quality of experience (QoE). In the proposed mechanism, all users are divided into several groups according to the documentation requirements. Then the D2D communication links are built within each group by fully considering the social relationships and trust degrees of users. The target files give priority to be shared through the D2D mode. Theoretical analysis and extensive simulation results show clearly that the social relationships can affect the whole wireless networks significantly. Selecting a user with the largest social degree as a central user can greatly reduce the transmission delay, relieve the heavy burden of base stations and then optimize the overall performance of cellular communication systems.
{"title":"Social-aware file-sharing mechanism for device-to-device communications","authors":"Lei Wang, Lulu Gao, Aiqing Zhang, Mingkai Chen","doi":"10.1109/WCSP.2015.7341335","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341335","url":null,"abstract":"Device-to-device (D2D) communication technology can significantly improve energy efficiency and offload base station traffic. It has become a new research focus in next generation mobile communications. In this paper, a file-sharing mechanism based on social networks is proposed for the D2D communication system underlaying cellular networks aiming at improving the users' quality of experience (QoE). In the proposed mechanism, all users are divided into several groups according to the documentation requirements. Then the D2D communication links are built within each group by fully considering the social relationships and trust degrees of users. The target files give priority to be shared through the D2D mode. Theoretical analysis and extensive simulation results show clearly that the social relationships can affect the whole wireless networks significantly. Selecting a user with the largest social degree as a central user can greatly reduce the transmission delay, relieve the heavy burden of base stations and then optimize the overall performance of cellular communication systems.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115464749","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341170
Ruian Wu, Jinchun Gao, G. Xie, Yuan’an Liu, Mangqing Guo, Shuo Liu
This paper proposes a bandwidth allocation method in distributed constellation network, first introducing an economic link utility function, which quantifies Quality of Experience (QoE) satisfaction level of users as a combination of link reward and link cost. Then, a QoE-based resource allocation method is proposed for the efficient sharing of radio resources in circumstances of Geostationary Orbit (GEO) satellites cooperation, so that uplink system utility is maximized and the fairness between different satellites is also achieved. In multi-layered satellites scenario, we investigate the benefit of multiple uplink transmissions by multiple GEO satellites over a single transmission by a single GEO satellite at a time, which can be interpreted as network diversity. Meanwhile, we model the fact that the suitability of different networks to different users varies, which is seldom considered in previous literatures. Numerical results validate the performance enhancement of our scheme compared with the existing ones.
{"title":"QoE-aware bandwidth allocation method with GEO satellites cooperation in distributed constellation network","authors":"Ruian Wu, Jinchun Gao, G. Xie, Yuan’an Liu, Mangqing Guo, Shuo Liu","doi":"10.1109/WCSP.2015.7341170","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341170","url":null,"abstract":"This paper proposes a bandwidth allocation method in distributed constellation network, first introducing an economic link utility function, which quantifies Quality of Experience (QoE) satisfaction level of users as a combination of link reward and link cost. Then, a QoE-based resource allocation method is proposed for the efficient sharing of radio resources in circumstances of Geostationary Orbit (GEO) satellites cooperation, so that uplink system utility is maximized and the fairness between different satellites is also achieved. In multi-layered satellites scenario, we investigate the benefit of multiple uplink transmissions by multiple GEO satellites over a single transmission by a single GEO satellite at a time, which can be interpreted as network diversity. Meanwhile, we model the fact that the suitability of different networks to different users varies, which is seldom considered in previous literatures. Numerical results validate the performance enhancement of our scheme compared with the existing ones.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123897366","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7340967
Shun-wai Zhang, Rong-fang Song, Fengfan Yang
Quasi-cyclic low-density-parity-check (QC-LDPC) codes are jointly designed for cascade-based multisource coded cooperation system. Firstly, QC-LDPC codes based on the base matrix and exponent matrix are introduced, and then two types of girth-4 cycles in QC-LDPC codes employed by the sources and relay are explicated. Secondly, we propose joint design method of QC-LDPC codes employed by the sources and relay, by which all girth-4 cycles including both Type-I and Type-II are canceled. Numerical simulations show that the jointly designed QC-LDPC coded cooperation well combines cooperation gain and channel coding gain, and outperforms the coded noncooperation under the same conditions. Furthermore, the bit error rate (BER) performance of the coded cooperation employing jointly designed QC-LDPC codes is better than those of random LDPC codes and separately designed QC-LDPC codes over AWGN channels.
{"title":"Joint design of QC-LDPC codes for cascade-based multisource coded cooperation","authors":"Shun-wai Zhang, Rong-fang Song, Fengfan Yang","doi":"10.1109/WCSP.2015.7340967","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7340967","url":null,"abstract":"Quasi-cyclic low-density-parity-check (QC-LDPC) codes are jointly designed for cascade-based multisource coded cooperation system. Firstly, QC-LDPC codes based on the base matrix and exponent matrix are introduced, and then two types of girth-4 cycles in QC-LDPC codes employed by the sources and relay are explicated. Secondly, we propose joint design method of QC-LDPC codes employed by the sources and relay, by which all girth-4 cycles including both Type-I and Type-II are canceled. Numerical simulations show that the jointly designed QC-LDPC coded cooperation well combines cooperation gain and channel coding gain, and outperforms the coded noncooperation under the same conditions. Furthermore, the bit error rate (BER) performance of the coded cooperation employing jointly designed QC-LDPC codes is better than those of random LDPC codes and separately designed QC-LDPC codes over AWGN channels.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124530001","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341020
Yinan Hou, Yuankai Xue, Cao Chen, S. Xiao
Indoor positioning using visible light has attracted great attentions in the world. The reported indoor positioning schemes based on visible light are limited by installing multiple LED lamps in the environments. In order to overcome this limitation, we propose a novel indoor positioning system using only one LED lamp, in which a smartphone is used to be receiver to estimate the three-dimension (3-D) position by using the received-signal-strength (RSS) and angle-of-arrival (AOA) positioning algorithm. The proposed system is demonstrated by experiment and the results show that ~10.2-cm average positioning error is achieved in a 2 m × 2 m × 2.5 m indoor environment.
利用可见光进行室内定位已经引起了世界各国的广泛关注。基于可见光的室内定位方案受到环境中安装多个LED灯的限制。为了克服这一限制，我们提出了一种仅使用一个LED灯的新型室内定位系统，其中使用智能手机作为接收器，通过接收信号强度(RSS)和到达角(AOA)定位算法来估计三维(3-D)位置。实验结果表明，在2 m × 2 m × 2.5 m的室内环境下，该系统的平均定位误差约为10.2 cm。
{"title":"A RSS/AOA based indoor positioning system with a single LED lamp","authors":"Yinan Hou, Yuankai Xue, Cao Chen, S. Xiao","doi":"10.1109/WCSP.2015.7341020","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341020","url":null,"abstract":"Indoor positioning using visible light has attracted great attentions in the world. The reported indoor positioning schemes based on visible light are limited by installing multiple LED lamps in the environments. In order to overcome this limitation, we propose a novel indoor positioning system using only one LED lamp, in which a smartphone is used to be receiver to estimate the three-dimension (3-D) position by using the received-signal-strength (RSS) and angle-of-arrival (AOA) positioning algorithm. The proposed system is demonstrated by experiment and the results show that ~10.2-cm average positioning error is achieved in a 2 m × 2 m × 2.5 m indoor environment.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114396532","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341055
Weigang Hou, Boyi Xian, Lei Guo, Weijing Qi, Hongli Zhang
Space information network is a kind of delay-tolerant networks. Recently, with possible participation of many network nodes, maintaining efficient and dynamic topology becomes crucial. In space information networks, the underlying topology is lack of continuous connectivity, and has the drawbacks of network segmentation, long delay and unreliable connections, which makes the routing design face severe challenges. In this paper, we propose novel routing schemes for space information networks. To construct a semi-deterministic time-space graph model, the timeliness-aware data mining algorithm is introduced to predict the contact probability for each pair of nodes. Using this time-space graph model, we put forward a simplified topology for achieving the reliable and cost-efficient routing. Simulation results demonstrate that the proposed routing algorithms can ensure the connectivity and reliability of paths over time, but also significantly reduce the total link overhead.
{"title":"Novel routing algorithms in space information networks based on timeliness-aware data mining and time-space graph","authors":"Weigang Hou, Boyi Xian, Lei Guo, Weijing Qi, Hongli Zhang","doi":"10.1109/WCSP.2015.7341055","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341055","url":null,"abstract":"Space information network is a kind of delay-tolerant networks. Recently, with possible participation of many network nodes, maintaining efficient and dynamic topology becomes crucial. In space information networks, the underlying topology is lack of continuous connectivity, and has the drawbacks of network segmentation, long delay and unreliable connections, which makes the routing design face severe challenges. In this paper, we propose novel routing schemes for space information networks. To construct a semi-deterministic time-space graph model, the timeliness-aware data mining algorithm is introduced to predict the contact probability for each pair of nodes. Using this time-space graph model, we put forward a simplified topology for achieving the reliable and cost-efficient routing. Simulation results demonstrate that the proposed routing algorithms can ensure the connectivity and reliability of paths over time, but also significantly reduce the total link overhead.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"226 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114423348","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7340977
Yu Dong, Tao Zhang, Xiaodan Hou, Chen-yao Xu
Conventional steganalysis method generally encounters the problems of embedding algorithm mismatch (EAM) and cover source mismatch (CSM). These problems cause difficulties in the use of steganalysis in the real world. Learning from the idea of image pre-classified, this study presents a JPEG steganalysis paradigm combining the similarity retrieval of image-inherent statistical properties (IISP) and unsupervised outlier detection. First, cover images with similar IISP to the test image are searched from massive image database to establish an aided sample set. Outlier detection is then performed in a test set composed of the test image and its aided sample set to judge the type of the test image. Experimental results show that the proposed paradigm can effectively avoid EAM and CSM. It demonstrates better performance than the steganalysis strategy using a mixed image set as the training sample. The proposed method has high detection efficiency with the unsupervised outlier detection.
{"title":"A new steganalysis paradigm based on image retrieval of similar image-inherent statistical properties and outlier detection","authors":"Yu Dong, Tao Zhang, Xiaodan Hou, Chen-yao Xu","doi":"10.1109/WCSP.2015.7340977","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7340977","url":null,"abstract":"Conventional steganalysis method generally encounters the problems of embedding algorithm mismatch (EAM) and cover source mismatch (CSM). These problems cause difficulties in the use of steganalysis in the real world. Learning from the idea of image pre-classified, this study presents a JPEG steganalysis paradigm combining the similarity retrieval of image-inherent statistical properties (IISP) and unsupervised outlier detection. First, cover images with similar IISP to the test image are searched from massive image database to establish an aided sample set. Outlier detection is then performed in a test set composed of the test image and its aided sample set to judge the type of the test image. Experimental results show that the proposed paradigm can effectively avoid EAM and CSM. It demonstrates better performance than the steganalysis strategy using a mixed image set as the training sample. The proposed method has high detection efficiency with the unsupervised outlier detection.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114438966","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341185
Jin Wang, Huilin Jiang, Zhiwen Pan, Nan Liu, Xiaohu You, Tianle Deng
In this paper, a user association scheme for load balancing in a downlink Heterogeneous cellular network (HetNet) incorporating almost blank subframe (ABS) for interference management is proposed. The joint user association and ABS optimization problem is formulated as maximizing a Logarithmic utility function. Since the joint optimization problem is non-convex and NP-hard, the block coordinate descent (BCD) method is employed to decouple the joint problem into two sub-problems (user association and ABS allocation) and solved in an iterative manner to obtain a suboptimal solution. Simulation results show the effectiveness of the proposed algorithm.
{"title":"Joint user association and ABS proportion optimization for load balancing in HetNet","authors":"Jin Wang, Huilin Jiang, Zhiwen Pan, Nan Liu, Xiaohu You, Tianle Deng","doi":"10.1109/WCSP.2015.7341185","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341185","url":null,"abstract":"In this paper, a user association scheme for load balancing in a downlink Heterogeneous cellular network (HetNet) incorporating almost blank subframe (ABS) for interference management is proposed. The joint user association and ABS optimization problem is formulated as maximizing a Logarithmic utility function. Since the joint optimization problem is non-convex and NP-hard, the block coordinate descent (BCD) method is employed to decouple the joint problem into two sub-problems (user association and ABS allocation) and solved in an iterative manner to obtain a suboptimal solution. Simulation results show the effectiveness of the proposed algorithm.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114657917","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 : 2015-12-03DOI: 10.1109/WCSP.2015.7341255
Yang He, Wenbin Yu, Cailian Chen, Yiyin Wang, X. Guan
Mobile electrocardiogram (ECG) monitoring systems have sprung up owing to the considerable interest attracted to wireless body area networks (WBAN). The long-term acquisition process for ECG produces large amount of data, which puts forward high demand on sensor lifetime. Fortunately, compressive sensing (CS) theory has been proved useful in energy saving by compressing signal in certain degree and fulfilling transmission. However, the reconstruction error will increase with fixed compression ratio since users or the sparsity of ECG signal will change during monitoring process. This paper concerns the flexibility and reconstruction quality problem existed in traditional CS-based ECG signal processing. One adaptive ECG compression scheme inspired by closed-loop control theory is proposed, in which the compression ratio can be adjusted according to both real-time reconstruction error and prior knowledge support. Simulation results show that the proposed scheme can improve the compression performance of 10.83% compared with traditional CS-based methods.
{"title":"Adaptive ECG compression scheme with prior knowledge support based on compressive sensing","authors":"Yang He, Wenbin Yu, Cailian Chen, Yiyin Wang, X. Guan","doi":"10.1109/WCSP.2015.7341255","DOIUrl":"https://doi.org/10.1109/WCSP.2015.7341255","url":null,"abstract":"Mobile electrocardiogram (ECG) monitoring systems have sprung up owing to the considerable interest attracted to wireless body area networks (WBAN). The long-term acquisition process for ECG produces large amount of data, which puts forward high demand on sensor lifetime. Fortunately, compressive sensing (CS) theory has been proved useful in energy saving by compressing signal in certain degree and fulfilling transmission. However, the reconstruction error will increase with fixed compression ratio since users or the sparsity of ECG signal will change during monitoring process. This paper concerns the flexibility and reconstruction quality problem existed in traditional CS-based ECG signal processing. One adaptive ECG compression scheme inspired by closed-loop control theory is proposed, in which the compression ratio can be adjusted according to both real-time reconstruction error and prior knowledge support. Simulation results show that the proposed scheme can improve the compression performance of 10.83% compared with traditional CS-based methods.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117275005","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
扫码关注我们
求助内容：
应助结果提醒方式：