Pub Date : 2017-12-14DOI: 10.1109/WCSP.2013.6677046
Yunquan Dong, Pingyi Fan
Wireless fading channels suffer from the time varying channel gains besides the Additive White Gaussian Noise (AWGN). As a result, it is impossible for fading channels to support a constant rate data stream without the help of buffers. In this paper, we consider information transmission over an infinite buffer-aided block Rayleigh fading channel in the low signal-to-noise ratio (SNR) regime, and characterize the transmission capability of the channel in terms of stationary queue length distribution and packet delay rather than using data rate only. Taking advantage of the memoryless property of the service provided by the channel in each block, which follows the negative exponential distribution, the transmission process is formulated as a discrete time discrete state D/G/1 queueing problem. The obtained results provide a full characterization of block Rayleigh fading channels and can be extended to the finite buffer aided transmissions.
{"title":"Queueing analysis for block fading Rayleigh channels in the low SNR regime","authors":"Yunquan Dong, Pingyi Fan","doi":"10.1109/WCSP.2013.6677046","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677046","url":null,"abstract":"Wireless fading channels suffer from the time varying channel gains besides the Additive White Gaussian Noise (AWGN). As a result, it is impossible for fading channels to support a constant rate data stream without the help of buffers. In this paper, we consider information transmission over an infinite buffer-aided block Rayleigh fading channel in the low signal-to-noise ratio (SNR) regime, and characterize the transmission capability of the channel in terms of stationary queue length distribution and packet delay rather than using data rate only. Taking advantage of the memoryless property of the service provided by the channel in each block, which follows the negative exponential distribution, the transmission process is formulated as a discrete time discrete state D/G/1 queueing problem. The obtained results provide a full characterization of block Rayleigh fading channels and can be extended to the finite buffer aided transmissions.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127640047","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.6677286
Cui Su, Panpan Wang, Rong Chai
Wireless Body Area Networks (WBANs) are made up of tiny physiological sensors implanted in/on the human body that communicate with a coordinator. The specific characteristics of WBANs propose challenges and difficulties on resource allocation, coordinator deployment and service Quality of Service (QoS) guarantee, etc. In this paper, jointly considering the issues, including various QoS requirements of sensor nodes, the characteristics of channels between sensor nodes and the coordinator, and the posture states of human bodies, the problem of joint power allocation and coordinator deployment is formulated as an energy consumption minimization problem subject to sensor service and power constraints. Through solving the optimization problem, the optimal transmission power and the location of the coordinator can be obtained. Numerical results demonstrate that the proposed algorithm is capable of achieving energy efficiency of sensor nodes and guaranteeing user QoS requirements as well.
{"title":"Joint power allocation and coordinator deployment for Wireless Body Area Network","authors":"Cui Su, Panpan Wang, Rong Chai","doi":"10.1109/WCSP.2013.6677286","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677286","url":null,"abstract":"Wireless Body Area Networks (WBANs) are made up of tiny physiological sensors implanted in/on the human body that communicate with a coordinator. The specific characteristics of WBANs propose challenges and difficulties on resource allocation, coordinator deployment and service Quality of Service (QoS) guarantee, etc. In this paper, jointly considering the issues, including various QoS requirements of sensor nodes, the characteristics of channels between sensor nodes and the coordinator, and the posture states of human bodies, the problem of joint power allocation and coordinator deployment is formulated as an energy consumption minimization problem subject to sensor service and power constraints. Through solving the optimization problem, the optimal transmission power and the location of the coordinator can be obtained. Numerical results demonstrate that the proposed algorithm is capable of achieving energy efficiency of sensor nodes and guaranteeing user QoS requirements as well.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"1140 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":"117163874","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}
A hemispherical lens is often used in Visible Light Communication (VLC) systems to provide a wide field of view (FOV) and spatial multiplexing gain. Depending on the way of placing the lens, in practice there are generally two kinds of receivers, namely the flat-surface and curved-surface receivers, where the former one uses the flat surface of lens to collect light from the LED while the latter one uses the curved surface. We first derive the channel gain of the single-input single-output (SISO) VLC system with a finite receiving area, and then compare the channel gains of the two receivers in various scenarios. It is shown that the flat-surface receiver could provide a wider FOV than the curved-surface receiver. We further study the performance of two receivers in multiple-input multiple-output (MIMO) VLC systems. Through the BER performance analysis, we find that high spatial multiplexing gain could be achieved by both receivers if the receiving plane is properly located.
{"title":"Performance analysis of the imaging receivers using a hemispherical lens for Visible Light Communications","authors":"Baolong Li, Xiaoquan Lai, Jiaheng Wang, X. Liang, Chunming Zhao","doi":"10.1109/WCSP.2013.6677179","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677179","url":null,"abstract":"A hemispherical lens is often used in Visible Light Communication (VLC) systems to provide a wide field of view (FOV) and spatial multiplexing gain. Depending on the way of placing the lens, in practice there are generally two kinds of receivers, namely the flat-surface and curved-surface receivers, where the former one uses the flat surface of lens to collect light from the LED while the latter one uses the curved surface. We first derive the channel gain of the single-input single-output (SISO) VLC system with a finite receiving area, and then compare the channel gains of the two receivers in various scenarios. It is shown that the flat-surface receiver could provide a wider FOV than the curved-surface receiver. We further study the performance of two receivers in multiple-input multiple-output (MIMO) VLC systems. Through the BER performance analysis, we find that high spatial multiplexing gain could be achieved by both receivers if the receiving plane is properly located.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"25 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":"121076340","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.6677113
Nora Tax, B. Lankl
A new fixed effort Multiple Input Multiple Output (MIMO) decoder for orthogonal frequency division multiplexing (OFDM) is proposed. For enhancing the data rates in wireless communication systems a higher bandwidth is needed, resulting in a frequency selective channel with multiple reflecting transmission paths. These requirements implicate additional considerations on the dimension of channel memory. Therefore we get a higher complexity for the decoder on the receiver side that can be reduced by performing the equalization in the frequency domain with OFDM, where each subchannel can be considered as a flat MIMO channel. To achieve the optimum hardware exploitation it is strongly necessary to find optimized effort based solutions to be able to implement an efficient MIMO decoder in concrete practical systems. Therefore our reduced search sphere decoder (RS-SD) algorithm that performs the closest point search over a reduced set of candidates based on pre-computed search set missing probabilities and other common fixed effort algorithms for flat MIMO channels are adapted to the OFDM system model. Furthermore our new OFDM-RS-SD algorithm is proposed quartering the needed computational effort compared to the RS-SD by additionally considering the conditions of the different subchannel matrices during the selection of the candidates. Therefore the OFDM-RS-SD offers a higher flexibility reaching near ML performance with significantly reduced computational effort.
{"title":"Fixed effort sphere decoder for MIMO OFDM systems","authors":"Nora Tax, B. Lankl","doi":"10.1109/WCSP.2013.6677113","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677113","url":null,"abstract":"A new fixed effort Multiple Input Multiple Output (MIMO) decoder for orthogonal frequency division multiplexing (OFDM) is proposed. For enhancing the data rates in wireless communication systems a higher bandwidth is needed, resulting in a frequency selective channel with multiple reflecting transmission paths. These requirements implicate additional considerations on the dimension of channel memory. Therefore we get a higher complexity for the decoder on the receiver side that can be reduced by performing the equalization in the frequency domain with OFDM, where each subchannel can be considered as a flat MIMO channel. To achieve the optimum hardware exploitation it is strongly necessary to find optimized effort based solutions to be able to implement an efficient MIMO decoder in concrete practical systems. Therefore our reduced search sphere decoder (RS-SD) algorithm that performs the closest point search over a reduced set of candidates based on pre-computed search set missing probabilities and other common fixed effort algorithms for flat MIMO channels are adapted to the OFDM system model. Furthermore our new OFDM-RS-SD algorithm is proposed quartering the needed computational effort compared to the RS-SD by additionally considering the conditions of the different subchannel matrices during the selection of the candidates. Therefore the OFDM-RS-SD offers a higher flexibility reaching near ML performance with significantly reduced computational effort.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"37 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":"125823191","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.6677264
Jiahui Yang, Changhong Chen, Z. Gan, Xiuchang Zhu
Recognition of human actions has already been an active area in the computer vision domain and techniques related to action recognition have been applied in plenty of fields such as smart surveillance, motion analysis and virtual reality. In this paper, we propose a new action recognition method which represents human actions as a bag of spatio-temporal words extracted from input video sequences and uses L-LDA (labeled Latent Dirichlet Allocation) model as a classifier. L-LDA is a supervised model extended from LDA which is unsupervised. The L-LDA adds a label layer on the basis of LDA to label the category of the train video sequences, so L-LDA can assign the latent topic variable in the model to the specific action categorization automatically. What's more, due to above characteristic of L-LDA, it can help to estimate the model parameters more reasonably, accurately and fast. We test our method on the KTH and Weizmann human action dataset and the experimental results show that L-LDA is better than its unsupervised counterpart LDA as well as SVMs (support vector machines).
{"title":"Human action recognition using labeled Latent Dirichlet Allocation model","authors":"Jiahui Yang, Changhong Chen, Z. Gan, Xiuchang Zhu","doi":"10.1109/WCSP.2013.6677264","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677264","url":null,"abstract":"Recognition of human actions has already been an active area in the computer vision domain and techniques related to action recognition have been applied in plenty of fields such as smart surveillance, motion analysis and virtual reality. In this paper, we propose a new action recognition method which represents human actions as a bag of spatio-temporal words extracted from input video sequences and uses L-LDA (labeled Latent Dirichlet Allocation) model as a classifier. L-LDA is a supervised model extended from LDA which is unsupervised. The L-LDA adds a label layer on the basis of LDA to label the category of the train video sequences, so L-LDA can assign the latent topic variable in the model to the specific action categorization automatically. What's more, due to above characteristic of L-LDA, it can help to estimate the model parameters more reasonably, accurately and fast. We test our method on the KTH and Weizmann human action dataset and the experimental results show that L-LDA is better than its unsupervised counterpart LDA as well as SVMs (support vector machines).","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"1 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":"126937477","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.6677170
Mingju Li, Xiang Yun, Satoshi Nagata, Lan Chen
Coordinated Multiple Point (CoMP) has been adopted in 3GPP LTE-Advanced to improve both the cell average and cell edge throughput. Among various downlink CoMP schemes, Dynamic Point Blanking (DPB) is simple and effective to improve the cell-edge user throughput by dynamic muting of the strongest interference of coordinated points. DPB can be used together with Coordinated Scheduling (CS) as CS/DPB and Dynamic Point Selection (DPS) as DPS/DPB to achieve more cell-edge throughput. However there exists the problem that radio resource may not be fully used due to muting. In this paper, Dynamic Point Reduced Power (DPRP) schemes are proposed to further improve the cell edge throughput. With the proposed methods, each resource block (RB) can be dynamically allocated with zero power, reduced power or a full power. Performance evaluation shows the proposed methods improve cell edge throughput by 30% compared to that of conventional single cell transmission.
{"title":"Power allocation of Dynamic Point Blanking for downlink CoMP in LTE-Advanced","authors":"Mingju Li, Xiang Yun, Satoshi Nagata, Lan Chen","doi":"10.1109/WCSP.2013.6677170","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677170","url":null,"abstract":"Coordinated Multiple Point (CoMP) has been adopted in 3GPP LTE-Advanced to improve both the cell average and cell edge throughput. Among various downlink CoMP schemes, Dynamic Point Blanking (DPB) is simple and effective to improve the cell-edge user throughput by dynamic muting of the strongest interference of coordinated points. DPB can be used together with Coordinated Scheduling (CS) as CS/DPB and Dynamic Point Selection (DPS) as DPS/DPB to achieve more cell-edge throughput. However there exists the problem that radio resource may not be fully used due to muting. In this paper, Dynamic Point Reduced Power (DPRP) schemes are proposed to further improve the cell edge throughput. With the proposed methods, each resource block (RB) can be dynamically allocated with zero power, reduced power or a full power. Performance evaluation shows the proposed methods improve cell edge throughput by 30% compared to that of conventional single cell transmission.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"21 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":"123029541","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.6677075
Yun Cao, C. Tellambura
We investigate distributed beamforming and power allocation for a single-antenna two-way relay network, which consists of multiple, parallel amplify-and-forward relays. The goal is to maximize the smaller of the two signal-to-noise-ratios (SNRs) while maintaining the total transmit power in each time slot below a predefined threshold. While related previous studies have assumed that the two transceivers know perfect instantaneous channel state information (CSI) of the entire network, in this paper, each transceiver only knows its own channel to the relays and the second-order-statistics (SOS) of the channel gains from the other transceiver to the relays. We develop optimal and sub-optimal solutions. The optimal one requires eigenvalue decomposition and iteratively exhaustive search, while the sub-optimal one uses a Taylor series approximation, but gives a near-optimal solution with significantly low computational complexity.
{"title":"Distributed beamforming and power allocation in two-way multi-relay networks with second-order channel statistics","authors":"Yun Cao, C. Tellambura","doi":"10.1109/WCSP.2013.6677075","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677075","url":null,"abstract":"We investigate distributed beamforming and power allocation for a single-antenna two-way relay network, which consists of multiple, parallel amplify-and-forward relays. The goal is to maximize the smaller of the two signal-to-noise-ratios (SNRs) while maintaining the total transmit power in each time slot below a predefined threshold. While related previous studies have assumed that the two transceivers know perfect instantaneous channel state information (CSI) of the entire network, in this paper, each transceiver only knows its own channel to the relays and the second-order-statistics (SOS) of the channel gains from the other transceiver to the relays. We develop optimal and sub-optimal solutions. The optimal one requires eigenvalue decomposition and iteratively exhaustive search, while the sub-optimal one uses a Taylor series approximation, but gives a near-optimal solution with significantly low computational complexity.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"47 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":"114372357","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.6677097
Yan Ni, Wence Zhang, Ming Chen
Using a large number of transmit and receive antennas can significantly improve system performance at the price of higher hardware costs. For a large-scale MIMO system, an efficient approach to reduce the hardware cost is antenna selection. In this paper, we propose two fast antenna selection algorithms for wireless large-scale MIMO systems. The first algorithm is aiming to maximize the downlink sum-rate at a low computation complexity. Simulation results show that the proposed algorithm achieves nearly 2 dB gain in sum-capacity than the norm based selection (NBS) algorithm and has lower computational complexity than the optimal exhaust search scheme. The second algorithm minimizes the number of selected transmit antennas while maintaining a pre-defined user rate requirement, so as to reduce the hardware cost to the extreme. The performance of the proposed scheme is verified by simulation.
{"title":"Antenna subset selection in MU large-scale MIMO systems","authors":"Yan Ni, Wence Zhang, Ming Chen","doi":"10.1109/WCSP.2013.6677097","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677097","url":null,"abstract":"Using a large number of transmit and receive antennas can significantly improve system performance at the price of higher hardware costs. For a large-scale MIMO system, an efficient approach to reduce the hardware cost is antenna selection. In this paper, we propose two fast antenna selection algorithms for wireless large-scale MIMO systems. The first algorithm is aiming to maximize the downlink sum-rate at a low computation complexity. Simulation results show that the proposed algorithm achieves nearly 2 dB gain in sum-capacity than the norm based selection (NBS) algorithm and has lower computational complexity than the optimal exhaust search scheme. The second algorithm minimizes the number of selected transmit antennas while maintaining a pre-defined user rate requirement, so as to reduce the hardware cost to the extreme. The performance of the proposed scheme is verified by simulation.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"2014 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":"114443485","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.6677127
Ying Yuan, Hua Zhang, Wei Xu
With a rapidly growing demand for high speed data transmissions, small cell networks (SCN) have been shown promising due to its flexible and low-cost deployments. Although SCN can effectively improve the network performance, a dense small cell deployment causes severe co-channel interference. Most of existing interference management methods are proposed under the assumption of perfect synchronization among all cells, which can hardly be achieved in practice. In this study, we studied the interference mitigation between adjacent small cells caused by synchronization errors. A simple but efficient prefix based approach is presented for the SCN to alleviate the performance degradation due to synchronization errors. Simulation results show that the proposed method achieves a noticeable performance gain in terms of both outage probability and average data rate.
{"title":"Efficient interference mitigation for small cell networks with synchronization error","authors":"Ying Yuan, Hua Zhang, Wei Xu","doi":"10.1109/WCSP.2013.6677127","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677127","url":null,"abstract":"With a rapidly growing demand for high speed data transmissions, small cell networks (SCN) have been shown promising due to its flexible and low-cost deployments. Although SCN can effectively improve the network performance, a dense small cell deployment causes severe co-channel interference. Most of existing interference management methods are proposed under the assumption of perfect synchronization among all cells, which can hardly be achieved in practice. In this study, we studied the interference mitigation between adjacent small cells caused by synchronization errors. A simple but efficient prefix based approach is presented for the SCN to alleviate the performance degradation due to synchronization errors. Simulation results show that the proposed method achieves a noticeable performance gain in terms of both outage probability and average data rate.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"7 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":"116834523","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.6677200
Kun Zhao, Bangning Zhang, Kegang Pan, Aijun Liu, D. Guo
In this paper, we investigate a cooperative communication system which consists of a source, a destination and NR relays. The differential modulation and relay selection (DM-RS) are combined in the system, where the best relay is selected to assist the source node with detect-and-forward (DetF) protocol. We consider general fading scenarios where the channel variances of different links are not equal, the average bit error rate (ABER) performance and power allocation strategy are investigated. Firstly, a theoretical ABER expression of the scheme with differential M-ary phase shift keying (DMPSK) modulation is derived. Then, to gain more insightful understanding, we look into the high signal-to-noise ratio (SNR) regime and provide a simple and informative asymptotic ABER expression, which reveals that the scheme can achieve a full diversity order. Furthermore, based on the simple asymptotic ABER expression, the optimum power allocation strategy is determined to improve the system ABER performance. Simulation and numerical results show that the optimum power allocation strategy yields significant performance improvement over the equal power allocation strategy.
{"title":"BER analysis and optimization for differential cooperative networks with relay selection","authors":"Kun Zhao, Bangning Zhang, Kegang Pan, Aijun Liu, D. Guo","doi":"10.1109/WCSP.2013.6677200","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677200","url":null,"abstract":"In this paper, we investigate a cooperative communication system which consists of a source, a destination and NR relays. The differential modulation and relay selection (DM-RS) are combined in the system, where the best relay is selected to assist the source node with detect-and-forward (DetF) protocol. We consider general fading scenarios where the channel variances of different links are not equal, the average bit error rate (ABER) performance and power allocation strategy are investigated. Firstly, a theoretical ABER expression of the scheme with differential M-ary phase shift keying (DMPSK) modulation is derived. Then, to gain more insightful understanding, we look into the high signal-to-noise ratio (SNR) regime and provide a simple and informative asymptotic ABER expression, which reveals that the scheme can achieve a full diversity order. Furthermore, based on the simple asymptotic ABER expression, the optimum power allocation strategy is determined to improve the system ABER performance. Simulation and numerical results show that the optimum power allocation strategy yields significant performance improvement over the equal power allocation strategy.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"66 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":"128500673","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
扫码关注我们
求助内容：
应助结果提醒方式：