Pub Date : 2013-12-02DOI: 10.1109/WCSP.2013.6677262
Xinyu Gu, Wenyu Li, Lin Zhang
With Cell Range Extension in a heterogeneous network, the users in the range extension area usually suffer from high interference from macro cell. This may degrade the cell-edge user downlink performance if the resource provided in the Low Power Node can not compensate for the loss from the increased interference. This paper proposes an adaptive algorithm to dynamically adjust the coverage area of the Low Power Node. By using this algorithm, the coverage area of the Low Power Node is extended dynamically according to the varying traffic situation in the network so as to avoid any unnecessarily increased interference from range extension. Simulation results indicate that the proposed algorithm can ensure a nearly optimal cell-edge user performance in all tested traffic load situation.
{"title":"Adaptive cell range control in heterogeneous network","authors":"Xinyu Gu, Wenyu Li, Lin Zhang","doi":"10.1109/WCSP.2013.6677262","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677262","url":null,"abstract":"With Cell Range Extension in a heterogeneous network, the users in the range extension area usually suffer from high interference from macro cell. This may degrade the cell-edge user downlink performance if the resource provided in the Low Power Node can not compensate for the loss from the increased interference. This paper proposes an adaptive algorithm to dynamically adjust the coverage area of the Low Power Node. By using this algorithm, the coverage area of the Low Power Node is extended dynamically according to the varying traffic situation in the network so as to avoid any unnecessarily increased interference from range extension. Simulation results indicate that the proposed algorithm can ensure a nearly optimal cell-edge user performance in all tested traffic load situation.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132552027","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-12-02DOI: 10.1109/WCSP.2013.6677052
Peng Chen, Lenan Wu
This paper presents an optimum weighted cumulation target detection (OWCTD) algorithm and prewhitening processing matrix for resonance region multi-carrier radar, and points out that the target detection performance of the wideband multi-carrier pulse radar using OWCTD algorithm is better than the traditional match filter algorithm. In addition, this paper deduces that the target velocity has little effect on the detection performance of the OWCTD algorithm. Finally, the asymptotic target detection probability as SNR tends to infinity is given, and the OWCTD algorithm performs better than the traditional match filter target detection algorithm at all target velocity.
{"title":"Optimum weighted cumulation target detection for resonance region multi-carrier radar","authors":"Peng Chen, Lenan Wu","doi":"10.1109/WCSP.2013.6677052","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677052","url":null,"abstract":"This paper presents an optimum weighted cumulation target detection (OWCTD) algorithm and prewhitening processing matrix for resonance region multi-carrier radar, and points out that the target detection performance of the wideband multi-carrier pulse radar using OWCTD algorithm is better than the traditional match filter algorithm. In addition, this paper deduces that the target velocity has little effect on the detection performance of the OWCTD algorithm. Finally, the asymptotic target detection probability as SNR tends to infinity is given, and the OWCTD algorithm performs better than the traditional match filter target detection algorithm at all target velocity.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134511178","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-12-02DOI: 10.1109/WCSP.2013.6677152
Jun Zhou, Yijun Mo, Bang Wang
Mobility Load Balancing (MLB) and Mobility Robustness Optimization (MRO) are two important functions in Long Term Evolved (LTE) cellular mobile networks. They are closely related because they both adjust handover parameters to achieve their respective objective. But some conflicts may occur if both of the two functions work inconsistently and adjust the same parameter in opposite directions. This will result in huge resource waste, and both of them will not work efficiently. In this paper, we present a scheme embedded in MLB based on the cell load to solve the conflict problem. Analysis and simulation results show that the proposed scheme works efficiently and improves the performance of the network.
{"title":"Joint optimization between MLB and MRO based on cell load balance for LTE networks","authors":"Jun Zhou, Yijun Mo, Bang Wang","doi":"10.1109/WCSP.2013.6677152","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677152","url":null,"abstract":"Mobility Load Balancing (MLB) and Mobility Robustness Optimization (MRO) are two important functions in Long Term Evolved (LTE) cellular mobile networks. They are closely related because they both adjust handover parameters to achieve their respective objective. But some conflicts may occur if both of the two functions work inconsistently and adjust the same parameter in opposite directions. This will result in huge resource waste, and both of them will not work efficiently. In this paper, we present a scheme embedded in MLB based on the cell load to solve the conflict problem. Analysis and simulation results show that the proposed scheme works efficiently and improves the performance of the network.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130346607","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-12-02DOI: 10.1109/WCSP.2013.6677048
Longfei Wei, Xiaohui Li, Yaying Wu, Y. Hei
Aiming at the uplink out-of-synchronization resulted from the long distance between the UE (User Equipment) and eNodeB (evolved NodeB) in LTE-A (Long Term Evolution-Advanced) super coverage, a time-domain-cascade-correlation method for estimating TA (Timing Advance) is proposed in this paper. Based on the design of the random access preamble structure, the eNodeB achieves the estimation of TA by cascading two different ZC (Zadoff-Chu) sequences to form the preamble sequence and detecting the delay of channel with the sliding correlation in the time domain. The theoretical analysis and simulation results show that the coverage performance of the Physical Random Access Channel (PRACH) can meet the requirements in LTE-A super coverage with the proposed method.
{"title":"Time-domain-cascade-correlation Timing Advance estimation method in LTE-A super coverage","authors":"Longfei Wei, Xiaohui Li, Yaying Wu, Y. Hei","doi":"10.1109/WCSP.2013.6677048","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677048","url":null,"abstract":"Aiming at the uplink out-of-synchronization resulted from the long distance between the UE (User Equipment) and eNodeB (evolved NodeB) in LTE-A (Long Term Evolution-Advanced) super coverage, a time-domain-cascade-correlation method for estimating TA (Timing Advance) is proposed in this paper. Based on the design of the random access preamble structure, the eNodeB achieves the estimation of TA by cascading two different ZC (Zadoff-Chu) sequences to form the preamble sequence and detecting the delay of channel with the sliding correlation in the time domain. The theoretical analysis and simulation results show that the coverage performance of the Physical Random Access Channel (PRACH) can meet the requirements in LTE-A super coverage with the proposed method.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114354792","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-12-02DOI: 10.1109/WCSP.2013.6677184
Jianxiong Wen, Lianghui Ding, Feng Yang, Liang Qian, Chuan Sun
Time synchronization is important for many distributed applications in Underwater Acoustic Networks (UANs) with large propagation delay, such as precise scheduling, target tracking and energy conservation. In this paper, we prove that the accuracy of time skew estimation increases as the number of overheard packet exchange from other neighboring nodes increases, and propose a light-weighted synchronization algorithm for multi-hop UANS, named as Improved Multi-hop time Synchronization for Underwater Acoustic Networks(IMSUAN). IMSUAN consists of three parts. The first one is to establish a time synchronization tree with the reference node as the root, and assign each node a tree level as low as possible. The second one is to synchronize with the parent node by dedicated three-time handshake and overhear exchange packets from parent and neighboring nodes. The third is to filter the inaccurate time-stamps of the overheard synchronization packets. In the paper, we establish a simulation platform in OPNET to evaluate the performance of IMSUAN. Simulation results show that the performance of extended Tri-message, MSUAN and IMSUAN are the same when no overhearing exists. However, when overhearing is possible in a random topology, the performance of IMSUAN can be 60% better than extended Tri-Message and 40% better than MSUAN.
{"title":"Improved multi-hop time synchronization for Underwater Acoustic Networks","authors":"Jianxiong Wen, Lianghui Ding, Feng Yang, Liang Qian, Chuan Sun","doi":"10.1109/WCSP.2013.6677184","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677184","url":null,"abstract":"Time synchronization is important for many distributed applications in Underwater Acoustic Networks (UANs) with large propagation delay, such as precise scheduling, target tracking and energy conservation. In this paper, we prove that the accuracy of time skew estimation increases as the number of overheard packet exchange from other neighboring nodes increases, and propose a light-weighted synchronization algorithm for multi-hop UANS, named as Improved Multi-hop time Synchronization for Underwater Acoustic Networks(IMSUAN). IMSUAN consists of three parts. The first one is to establish a time synchronization tree with the reference node as the root, and assign each node a tree level as low as possible. The second one is to synchronize with the parent node by dedicated three-time handshake and overhear exchange packets from parent and neighboring nodes. The third is to filter the inaccurate time-stamps of the overheard synchronization packets. In the paper, we establish a simulation platform in OPNET to evaluate the performance of IMSUAN. Simulation results show that the performance of extended Tri-message, MSUAN and IMSUAN are the same when no overhearing exists. However, when overhearing is possible in a random topology, the performance of IMSUAN can be 60% better than extended Tri-Message and 40% better than MSUAN.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114484730","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-12-02DOI: 10.1109/WCSP.2013.6677284
Chunxu Jiao, Zhaoyang Zhang, Jun Yu Li
In this paper, a differential space-time modulation (DSTM) scheme is put forward for high speed train(HST) transmission system. In particular, the HST is equipped with multiple antennas. By exploiting the delay correlation inherited from the linear mobility of HST, this scheme performs extremely robustly and efficiently even without knowing CSI at the transmitter or receiver. The performance of an optimal unitary code in a specific 2 × 2 case is studied and the accurate analytical expression for its pairwise error probability(PEP) is obtained. Furthermore, a rather tight upper bound for the symbol error rate(SER) based on PEP is derived. Simulation results verify the good performance of the proposed scheme.
{"title":"Delay correlation based differential space-time modulation for high speed train transmission","authors":"Chunxu Jiao, Zhaoyang Zhang, Jun Yu Li","doi":"10.1109/WCSP.2013.6677284","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677284","url":null,"abstract":"In this paper, a differential space-time modulation (DSTM) scheme is put forward for high speed train(HST) transmission system. In particular, the HST is equipped with multiple antennas. By exploiting the delay correlation inherited from the linear mobility of HST, this scheme performs extremely robustly and efficiently even without knowing CSI at the transmitter or receiver. The performance of an optimal unitary code in a specific 2 × 2 case is studied and the accurate analytical expression for its pairwise error probability(PEP) is obtained. Furthermore, a rather tight upper bound for the symbol error rate(SER) based on PEP is derived. Simulation results verify the good performance of the proposed scheme.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115125328","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-12-02DOI: 10.1109/WCSP.2013.6677246
Wei Zhou, C. Ren, Chuan Ma, Hui Yu, Han-wen Luo, Xiaoying Gan, Wang Xi
In recent years, there is a significant trend for VANET to provide not only traditional services like warning information exchanging for road safety and car collision avoidance but also various multimedia applications such as mobile TV which may require broadband access to core network or Internet. On the other hand, service provision technologies with point-to-multipoint transmission mode which could better utilize the limited wireless resource have been well discussed and standardized, such as MBMS in 3GPP and BCMCS in 3GPP2. In this paper, we propose an effective solution aimed to enable multicast/broadcast service provision in integrated VANET-cellular heterogeneous wireless networks based on a two-phase cooperative transmission strategy. Through analysis and simulation, our proposal combines advantages of these two heterogeneous networks and the nature of multicast/broadcast technology.
{"title":"Multicast/broadcast service in integrated VANET-cellular heterogeneous wireless networks","authors":"Wei Zhou, C. Ren, Chuan Ma, Hui Yu, Han-wen Luo, Xiaoying Gan, Wang Xi","doi":"10.1109/WCSP.2013.6677246","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677246","url":null,"abstract":"In recent years, there is a significant trend for VANET to provide not only traditional services like warning information exchanging for road safety and car collision avoidance but also various multimedia applications such as mobile TV which may require broadband access to core network or Internet. On the other hand, service provision technologies with point-to-multipoint transmission mode which could better utilize the limited wireless resource have been well discussed and standardized, such as MBMS in 3GPP and BCMCS in 3GPP2. In this paper, we propose an effective solution aimed to enable multicast/broadcast service provision in integrated VANET-cellular heterogeneous wireless networks based on a two-phase cooperative transmission strategy. Through analysis and simulation, our proposal combines advantages of these two heterogeneous networks and the nature of multicast/broadcast technology.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115494353","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-12-02DOI: 10.1109/WCSP.2013.6677030
Y. Chai, Qinghe Du, Pinyi Ren
In Multi-user Multi-input Multi-output (MU-MIMO) systems, the most popular method to eliminate the multi-user interferences is projecting every user's precoding matrix into the null space of the rests' channels, so that data streams intended for different users would be transmitted in orthogonal spaces. However, while users having mutual correlated channels caused by the increased density of smart phones nowadays, this method would make correlated subspaces unused by data transmission for any user, and cause the reduction of overall throughput. To address the corresponding issue, we in this paper study the efficient precoding scheme that can eliminate the multi-user interferences as well as maximize the system capacity for MU-MIMO system in the spatially low scattering channel environments. Unlike the existing methods, our approach allows high-QoS-requirement users' precoding matrices to lie in the correlated subspaces between the channels of these primary users and the rests, so that more data streams can be transmitted to the primary ones simultaneously. In the mean time, in order to avoid the multi-user interferences, we require that every correlated channel can only be occupied by one user's precoding matrix. Following the aforementioned principles, we propose a Correlated Channels Utilized Precoding (CCUP) scheme for MU-MIMO system. Under this scheme, we also propose a different utilizing criterion of correlated subspaces to satisfy the networks with same-QoS-requirement services, in which every user's precoding space can be broadened by adopting partial correlated subspaces, termed Fair CCUP (F-CCUP) scheme. Simulation results show that while keeping no multi-user interferences, our proposed CCUP scheme can greatly increase the number of allowed independent data streams, and improve the overall capacity of MU-MIMO system in spatially correlated propagation environments compared to the existing approach.
{"title":"Precoding for MU-MIMO system in low scattering channel environments","authors":"Y. Chai, Qinghe Du, Pinyi Ren","doi":"10.1109/WCSP.2013.6677030","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677030","url":null,"abstract":"In Multi-user Multi-input Multi-output (MU-MIMO) systems, the most popular method to eliminate the multi-user interferences is projecting every user's precoding matrix into the null space of the rests' channels, so that data streams intended for different users would be transmitted in orthogonal spaces. However, while users having mutual correlated channels caused by the increased density of smart phones nowadays, this method would make correlated subspaces unused by data transmission for any user, and cause the reduction of overall throughput. To address the corresponding issue, we in this paper study the efficient precoding scheme that can eliminate the multi-user interferences as well as maximize the system capacity for MU-MIMO system in the spatially low scattering channel environments. Unlike the existing methods, our approach allows high-QoS-requirement users' precoding matrices to lie in the correlated subspaces between the channels of these primary users and the rests, so that more data streams can be transmitted to the primary ones simultaneously. In the mean time, in order to avoid the multi-user interferences, we require that every correlated channel can only be occupied by one user's precoding matrix. Following the aforementioned principles, we propose a Correlated Channels Utilized Precoding (CCUP) scheme for MU-MIMO system. Under this scheme, we also propose a different utilizing criterion of correlated subspaces to satisfy the networks with same-QoS-requirement services, in which every user's precoding space can be broadened by adopting partial correlated subspaces, termed Fair CCUP (F-CCUP) scheme. Simulation results show that while keeping no multi-user interferences, our proposed CCUP scheme can greatly increase the number of allowed independent data streams, and improve the overall capacity of MU-MIMO system in spatially correlated propagation environments compared to the existing approach.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115507586","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-12-02DOI: 10.1109/WCSP.2013.6677076
Qiang Liu, Kun Yang, Peng He
Molecular communication is a promising paradigm to communicate at nanoscale and it is inspired by nature. The molecules can be sent into diffusion channel by different emission scheme and received by ligand-based receptors. Instantaneous and continuous emissions are two important molecule emission schemes in molecular communication. Up to now, very limited literatures consider the capacity in molecular communication with continuous emission. In this paper, we study the channel capacity of diffusion and ligand-based molecular communication system with continuous molecule emission scheme. We establish a basic diffusion-based propagation model based on the On-Off keying and time slot scheme. The capacity expression of the continuous emission scheme is derived with considering the effects of the channel memory and ligand-receptor binding mechanisms. The numerical results show that the channel capacity is bound up with the physical parameters of ligand-receptor and diffusion channel.
{"title":"Channel capacity analysis for molecular communication with continuous molecule emission","authors":"Qiang Liu, Kun Yang, Peng He","doi":"10.1109/WCSP.2013.6677076","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677076","url":null,"abstract":"Molecular communication is a promising paradigm to communicate at nanoscale and it is inspired by nature. The molecules can be sent into diffusion channel by different emission scheme and received by ligand-based receptors. Instantaneous and continuous emissions are two important molecule emission schemes in molecular communication. Up to now, very limited literatures consider the capacity in molecular communication with continuous emission. In this paper, we study the channel capacity of diffusion and ligand-based molecular communication system with continuous molecule emission scheme. We establish a basic diffusion-based propagation model based on the On-Off keying and time slot scheme. The capacity expression of the continuous emission scheme is derived with considering the effects of the channel memory and ligand-receptor binding mechanisms. The numerical results show that the channel capacity is bound up with the physical parameters of ligand-receptor and diffusion channel.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122802437","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-12-02DOI: 10.1109/WCSP.2013.6677124
Ruixun Liu, Yufei Wu, Dongming Wang, Yu Yang, Shaoli Kang
The evaluation of signal detection algorithm involves two aspects: computational complexity and performance. Based on the statistical covariances of the signal, the well-known spectrum sensing algorithm named as maximum-to-minimum ratio eigenvalue (MME) algorithm was proposed in [1]. MME is a blind signal detection algorithm and it has good performance. The main advantage of MME is that it does not related to the noise power. However, due to involving eigenvalue decomposition, MME has a high computational complexity. MME is not the best signal detection algorithm based on statistical covariance matrix. Therefore there may be other algorithm can perform better than MME. In this paper, based on the idea of the approximation of the eigenvalue of the matrix, we proposed three spectrum sensing algorithms with lower complexity. These algorithms are also blind spectrum sensing algorithms, and they are not sensitive to the noise power. Simulation results demonstrate that their performances are better than that of the MME algorithm.
{"title":"A class of low complexity spectrum sensing algorithms based on statistical covariances","authors":"Ruixun Liu, Yufei Wu, Dongming Wang, Yu Yang, Shaoli Kang","doi":"10.1109/WCSP.2013.6677124","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677124","url":null,"abstract":"The evaluation of signal detection algorithm involves two aspects: computational complexity and performance. Based on the statistical covariances of the signal, the well-known spectrum sensing algorithm named as maximum-to-minimum ratio eigenvalue (MME) algorithm was proposed in [1]. MME is a blind signal detection algorithm and it has good performance. The main advantage of MME is that it does not related to the noise power. However, due to involving eigenvalue decomposition, MME has a high computational complexity. MME is not the best signal detection algorithm based on statistical covariance matrix. Therefore there may be other algorithm can perform better than MME. In this paper, based on the idea of the approximation of the eigenvalue of the matrix, we proposed three spectrum sensing algorithms with lower complexity. These algorithms are also blind spectrum sensing algorithms, and they are not sensitive to the noise power. Simulation results demonstrate that their performances are better than that of the MME algorithm.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125119063","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
扫码关注我们
求助内容：
应助结果提醒方式：