Pub Date : 2010-11-11DOI: 10.1109/WCSP.2010.5633496
Xiuning Zhang, Z. Tan
Due to spectrum scarcity and emerging various wireless applications in IMT-Advanced system, spectrum allocation scheme becomes a recently critical issue. In this paper, we refer to the concepts of spectrum reservation and power reward, make use of maximum-minimum criteria, propose a cellbased distributed dynamic spectrum allocation (DSA) algorithm which combines the water filling power allocation algorithm with the DSA algorithm. In this paper, the joint algorithm is used to tackle the cellular network topology for the dynamic spectrum allocation scheme in IMT-Advanced system. It aims to efficiently satisfy users' diverse quality-of-service (QoS) requirements of multimedia traffic. Our proposed algorithm is an adaptive algorithm providing good performance and adaptability in both spectrum varying environment and multiservice environment in IMT-Advanced system. Compared with conventional algorithm, this novel algorithm considers system stability, fairness among users and improves the spectrum efficiency. The simulation results show that our algorithm has higher system stability under the condition of acceptable complexity than previous methods.
{"title":"A new spectrum allocation algorithm for IMT-Advanced system over rayleigh-fading channels","authors":"Xiuning Zhang, Z. Tan","doi":"10.1109/WCSP.2010.5633496","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633496","url":null,"abstract":"Due to spectrum scarcity and emerging various wireless applications in IMT-Advanced system, spectrum allocation scheme becomes a recently critical issue. In this paper, we refer to the concepts of spectrum reservation and power reward, make use of maximum-minimum criteria, propose a cellbased distributed dynamic spectrum allocation (DSA) algorithm which combines the water filling power allocation algorithm with the DSA algorithm. In this paper, the joint algorithm is used to tackle the cellular network topology for the dynamic spectrum allocation scheme in IMT-Advanced system. It aims to efficiently satisfy users' diverse quality-of-service (QoS) requirements of multimedia traffic. Our proposed algorithm is an adaptive algorithm providing good performance and adaptability in both spectrum varying environment and multiservice environment in IMT-Advanced system. Compared with conventional algorithm, this novel algorithm considers system stability, fairness among users and improves the spectrum efficiency. The simulation results show that our algorithm has higher system stability under the condition of acceptable complexity than previous methods.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115023987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-11-11DOI: 10.1109/WCSP.2010.5633634
Tao Chen, Haesik Kim, Yang Yang
Recently the concern on energy efficiency in wireless communications has been growing rapidly as energy consumption increasingly becomes a global environment problem. Lots of research and development efforts have been spent in wireless industry, aiming for energy efficient solutions which lead to green wireless communications. In this paper we provide a brief overview on those efforts, with an emphasis on introducing energy efficiency metrics. Since energy efficiency metrics are indicators of efficiency, understanding those metrics provides us a better view on how energy efficiency can be achieved in wireless systems/networks. Observing energy is a concern at every corner of a wireless system/network, we describe those metrics from at component, equipment and system/networks level, respectively. From our observation, energy efficiency metrics for components and equipments have been well established. However, studied for system/network level solutions and metrics deserve more attention. We believe new energy efficient architecture and associated metrics will be the key for the energy consumption problem in wireless industry.
{"title":"Energy efficiency metrics for green wireless communications","authors":"Tao Chen, Haesik Kim, Yang Yang","doi":"10.1109/WCSP.2010.5633634","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633634","url":null,"abstract":"Recently the concern on energy efficiency in wireless communications has been growing rapidly as energy consumption increasingly becomes a global environment problem. Lots of research and development efforts have been spent in wireless industry, aiming for energy efficient solutions which lead to green wireless communications. In this paper we provide a brief overview on those efforts, with an emphasis on introducing energy efficiency metrics. Since energy efficiency metrics are indicators of efficiency, understanding those metrics provides us a better view on how energy efficiency can be achieved in wireless systems/networks. Observing energy is a concern at every corner of a wireless system/network, we describe those metrics from at component, equipment and system/networks level, respectively. From our observation, energy efficiency metrics for components and equipments have been well established. However, studied for system/network level solutions and metrics deserve more attention. We believe new energy efficient architecture and associated metrics will be the key for the energy consumption problem in wireless industry.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116453977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-11-11DOI: 10.1109/WCSP.2010.5629647
Yuhua Xu, Jinlong Wang, Qi-hui Wu
We consider the issue of opportunistic spectrum access in temporal domain, in which secondary user seeks spectrum vacancies between bursty transmissions of the primary user to communicate. Since spectrum sensing and data transmission can not be performed simultaneously in the same channel, secondary user employs a sense-then-transmit strategy to detect the presence of the primary user before accessing the licensed channel. Consequently, secondary user transmission is periodically suspended for spectrum sensing. To capture the discontinuous transmission nature of secondary user, we introduce a discrete-time queuing subjected to bursty preemption to describe the behavior of secondary user. The bursty preemption is an abstraction of temporal channel unavailability due to the bursty appearance of the primary user. Under the discrete-time queuing framework, we analyze the performance of opportunistic spectrum access in terms of packet completion slots, secondary user throughput and packet delay. In addition, the stability of the secondary system is studied. Finally, simulation results validate our theoretical approaches and reveal that the proposed model can be widely used to optimize the performance of the opportunistic spectrum access system.
{"title":"A discrete-time model for multichannel opportunistic spectrum access based on preempted queuing","authors":"Yuhua Xu, Jinlong Wang, Qi-hui Wu","doi":"10.1109/WCSP.2010.5629647","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5629647","url":null,"abstract":"We consider the issue of opportunistic spectrum access in temporal domain, in which secondary user seeks spectrum vacancies between bursty transmissions of the primary user to communicate. Since spectrum sensing and data transmission can not be performed simultaneously in the same channel, secondary user employs a sense-then-transmit strategy to detect the presence of the primary user before accessing the licensed channel. Consequently, secondary user transmission is periodically suspended for spectrum sensing. To capture the discontinuous transmission nature of secondary user, we introduce a discrete-time queuing subjected to bursty preemption to describe the behavior of secondary user. The bursty preemption is an abstraction of temporal channel unavailability due to the bursty appearance of the primary user. Under the discrete-time queuing framework, we analyze the performance of opportunistic spectrum access in terms of packet completion slots, secondary user throughput and packet delay. In addition, the stability of the secondary system is studied. Finally, simulation results validate our theoretical approaches and reveal that the proposed model can be widely used to optimize the performance of the opportunistic spectrum access system.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117071083","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-11-11DOI: 10.1109/WCSP.2010.5633681
Shan Lu, Y. Li, Jun Cheng
A low-complexity two-user turbo decoding scheme for two-way relay network is proposed. In the relay, the superimposed packets have to be decoded to the arithmetic summation of two source packets based on the sum trellis. In the sum trellis, there are some symmetrical states, especially when the sources use identical component codes. These symmetrical states provide same information to the turbo decoder. This observation motives a reconstruction of the sum trellis by merging the symmetrical sates in the trellis. By this mergence, a simplified sum trellis with the less state number is given. Complexity analysis shows that the computational complexity of two-user turbo decoding with simplified sum trellis is reduced to half, compared with one with sum trellis.
{"title":"Low-complexity turbo decoding scheme for two-way relay network","authors":"Shan Lu, Y. Li, Jun Cheng","doi":"10.1109/WCSP.2010.5633681","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633681","url":null,"abstract":"A low-complexity two-user turbo decoding scheme for two-way relay network is proposed. In the relay, the superimposed packets have to be decoded to the arithmetic summation of two source packets based on the sum trellis. In the sum trellis, there are some symmetrical states, especially when the sources use identical component codes. These symmetrical states provide same information to the turbo decoder. This observation motives a reconstruction of the sum trellis by merging the symmetrical sates in the trellis. By this mergence, a simplified sum trellis with the less state number is given. Complexity analysis shows that the computational complexity of two-user turbo decoding with simplified sum trellis is reduced to half, compared with one with sum trellis.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123963279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-11-11DOI: 10.1109/WCSP.2010.5633791
Maocong Chen, Hua Tian, Lianguo Wu
Self-localization is one of the basic problems in wireless sensor networks. In this paper, we propose a new localization algorithm using received signal strength (RSS) with seven anchors in order to balance the complex technology for distance estimation and the accuracy of the localization. First, based entirely on comparison of received signal strength transmitted by mobile anchors, the static nodes can acquire their positions without estimating these distances directly from other nodes. Then the unknown nodes can estimate the path loss exponent nearby with the estimated positions. Finally, the more accurate positions are achieved through log-distance path loss model. This proposed algorithm decreases the complexity of the hardware equipment, and improves the accuracy of localization result.
{"title":"A novel self-localization algorithm based on RSS for wireless sensor networks","authors":"Maocong Chen, Hua Tian, Lianguo Wu","doi":"10.1109/WCSP.2010.5633791","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633791","url":null,"abstract":"Self-localization is one of the basic problems in wireless sensor networks. In this paper, we propose a new localization algorithm using received signal strength (RSS) with seven anchors in order to balance the complex technology for distance estimation and the accuracy of the localization. First, based entirely on comparison of received signal strength transmitted by mobile anchors, the static nodes can acquire their positions without estimating these distances directly from other nodes. Then the unknown nodes can estimate the path loss exponent nearby with the estimated positions. Finally, the more accurate positions are achieved through log-distance path loss model. This proposed algorithm decreases the complexity of the hardware equipment, and improves the accuracy of localization result.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123984805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-11-11DOI: 10.1109/WCSP.2010.5633860
Qinghai Gao, Huilan Zou
We study probabilistic coverage and connectivity in wireless sensor networks. Since many sensors are powered by battery, the sensing range and the communication range of static sensor nodes are very limited. As a result, it is very likely that the field is not completely covered and the network is not fully connected. However, we observe that clumps of sensors could be formulated and cooperation among the sensor nodes could be carried out, after the sensor nodes are randomly deployed in the field. With cooperation, the area covered by the sensor nodes increases and the data could be shared among the sensors within one clump. Moreover, mobile nodes (Mules) could be deployed in the field to further improve the coverage and connectivity. In this paper, we characterize the expected proportion of covered region, the time needed to obtain full connectivity, and the number of nodes connected by the Mules at certain time threshold. Our results show that significant improvement of coverage and connectivity can be achieved from cooperation and mobility.
{"title":"Improving probabilistic coverage and connectivity in wireless sensor networks: Cooperation and mobility","authors":"Qinghai Gao, Huilan Zou","doi":"10.1109/WCSP.2010.5633860","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633860","url":null,"abstract":"We study probabilistic coverage and connectivity in wireless sensor networks. Since many sensors are powered by battery, the sensing range and the communication range of static sensor nodes are very limited. As a result, it is very likely that the field is not completely covered and the network is not fully connected. However, we observe that clumps of sensors could be formulated and cooperation among the sensor nodes could be carried out, after the sensor nodes are randomly deployed in the field. With cooperation, the area covered by the sensor nodes increases and the data could be shared among the sensors within one clump. Moreover, mobile nodes (Mules) could be deployed in the field to further improve the coverage and connectivity. In this paper, we characterize the expected proportion of covered region, the time needed to obtain full connectivity, and the number of nodes connected by the Mules at certain time threshold. Our results show that significant improvement of coverage and connectivity can be achieved from cooperation and mobility.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125703550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-11-11DOI: 10.1109/WCSP.2010.5633442
QUAN LIU, Jun Gao, Lesheng Chen
Cooperation is necessitated for tackling the challenges caused by fading/shadowing effects, noise uncertainty and sensing time constraints in spectrum sensing of cognitive radio networks. This paper studies the optimization problem of energy detection based cooperative spectrum sensing (CSS), with the main focuses on the optimality of K out of N fusion strategy and cooperative-user number. The procedures for optimizing the fusion strategy under both the Neyman-Pearson (N-P) and Bayesian criteria are given, and the numerical results demonstrate that the optimal strategy outperforms others, with the maximum collective detection probability under N-P criterion, and the minimum detection risk under Bayesian criterion. Further, the optimal number of cooperative users is investigated, as a solution to the tradeoff between the cooperative spectrum sensing performance and the total sensing overhead. It is shown that the required sensing reliability and minimization of the sensing overhead can be guaranteed simultaneously, if only the local detection threshold and the fusion strategy are properly set.
在认知无线电网络频谱感知中，需要合作解决衰落/阴影效应、噪声不确定性和感知时间限制带来的挑战。研究了基于能量检测的协同频谱感知(CSS)优化问题，重点研究了K out of N融合策略和协同用户数的最优性问题。给出了内曼-皮尔逊(N-P)准则和贝叶斯准则下融合策略的优化步骤，数值结果表明，在N-P准则下，最优策略具有最大的集体检测概率，在贝叶斯准则下具有最小的检测风险，优于其他策略。在此基础上，研究了最优合作用户数量，以解决合作频谱感知性能与总感知开销之间的权衡问题。结果表明，只要适当设置局部检测阈值和融合策略，就可以同时保证所需的传感可靠性和传感开销最小化。
{"title":"Optimization of energy detection based cooperative spectrum sensing in cognitive radio networks","authors":"QUAN LIU, Jun Gao, Lesheng Chen","doi":"10.1109/WCSP.2010.5633442","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633442","url":null,"abstract":"Cooperation is necessitated for tackling the challenges caused by fading/shadowing effects, noise uncertainty and sensing time constraints in spectrum sensing of cognitive radio networks. This paper studies the optimization problem of energy detection based cooperative spectrum sensing (CSS), with the main focuses on the optimality of K out of N fusion strategy and cooperative-user number. The procedures for optimizing the fusion strategy under both the Neyman-Pearson (N-P) and Bayesian criteria are given, and the numerical results demonstrate that the optimal strategy outperforms others, with the maximum collective detection probability under N-P criterion, and the minimum detection risk under Bayesian criterion. Further, the optimal number of cooperative users is investigated, as a solution to the tradeoff between the cooperative spectrum sensing performance and the total sensing overhead. It is shown that the required sensing reliability and minimization of the sensing overhead can be guaranteed simultaneously, if only the local detection threshold and the fusion strategy are properly set.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124686893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-11-11DOI: 10.1109/WCSP.2010.5633723
Xuesong Liang, Shi Jin, Xiqi Gao, Kai‐Kit Wong
This paper addresses the maximum achievable rate for amplify-and-forward (AF) one-way relay channel (OWRC) and two-way relay channel (TWRC) with a total transmit power constraint. The achievable rate is maximized for both channels where the optimal power allocation is applied over all the nodes and the closed-form expressions for the maximum achievable rate are derived. It is shown that for TWRCs, the rate is maximized if half of the total power is allocated to the relay node regardless of the channel variations. Furthermore, we conclude that in the case of optimal power allocation, the achievable rate of TWRC is much greater than that of OWRC, which is however generally not true in the case of equal power allocation.
{"title":"Maximum achievable rate for AF TWRC with optimal power allocation","authors":"Xuesong Liang, Shi Jin, Xiqi Gao, Kai‐Kit Wong","doi":"10.1109/WCSP.2010.5633723","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633723","url":null,"abstract":"This paper addresses the maximum achievable rate for amplify-and-forward (AF) one-way relay channel (OWRC) and two-way relay channel (TWRC) with a total transmit power constraint. The achievable rate is maximized for both channels where the optimal power allocation is applied over all the nodes and the closed-form expressions for the maximum achievable rate are derived. It is shown that for TWRCs, the rate is maximized if half of the total power is allocated to the relay node regardless of the channel variations. Furthermore, we conclude that in the case of optimal power allocation, the achievable rate of TWRC is much greater than that of OWRC, which is however generally not true in the case of equal power allocation.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127364374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-11-11DOI: 10.1109/WCSP.2010.5633683
Kaibin Huang, Rui Zhang
In cognitive radio networks based on spectrum sharing, cognitive beamforming (CB) enables the multi-antenna secondary user (SU) transmitter to suppress the interference to the primary user (PU) receiver and yet maximize the SU link throughput. In our prior work, a design framework was proposed for realizing CB based on finite-rate cooperative feedback from the PU receiver to the SU transmitter. The above cooperative feedback design is based on the orthogonal CB (OCB) algorithm. Specifically, the beamformer at the SU transmitter attempts to null the interference to the PU receiver by restricting the beamformer to be orthogonal to the SU-to-PU channel direction fed back by the PU receiver. In this paper, a new CB algorithm, called non-orthogonal CB (NOCB), is proposed by relaxing the orthogonality constraint for OCB. The NOCB algorithm computes the SU beamformer based on the feedback from the PU receiver including the quantized channel direction information (CDI) and interference power control (IPC) signal that is designed to regulate the SU transmission power. Furthermore, feedforward of the secondary-link CDI from the SU transmitter to the PU receiver is proposed, which enables more efficient IPC feedback design for the SU receiver and thereby allows larger SU transmission power. The proposed NOCB algorithms with cooperative PU feedback and SU feedforward are shown to substantially improve the SU link performance over the existing OCB designs.
{"title":"Cognitive beamforming with cooperative feedback","authors":"Kaibin Huang, Rui Zhang","doi":"10.1109/WCSP.2010.5633683","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633683","url":null,"abstract":"In cognitive radio networks based on spectrum sharing, cognitive beamforming (CB) enables the multi-antenna secondary user (SU) transmitter to suppress the interference to the primary user (PU) receiver and yet maximize the SU link throughput. In our prior work, a design framework was proposed for realizing CB based on finite-rate cooperative feedback from the PU receiver to the SU transmitter. The above cooperative feedback design is based on the orthogonal CB (OCB) algorithm. Specifically, the beamformer at the SU transmitter attempts to null the interference to the PU receiver by restricting the beamformer to be orthogonal to the SU-to-PU channel direction fed back by the PU receiver. In this paper, a new CB algorithm, called non-orthogonal CB (NOCB), is proposed by relaxing the orthogonality constraint for OCB. The NOCB algorithm computes the SU beamformer based on the feedback from the PU receiver including the quantized channel direction information (CDI) and interference power control (IPC) signal that is designed to regulate the SU transmission power. Furthermore, feedforward of the secondary-link CDI from the SU transmitter to the PU receiver is proposed, which enables more efficient IPC feedback design for the SU receiver and thereby allows larger SU transmission power. The proposed NOCB algorithms with cooperative PU feedback and SU feedforward are shown to substantially improve the SU link performance over the existing OCB designs.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127152132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-11-11DOI: 10.1109/WCSP.2010.5633525
S. Xiao
Compared with traditional sparse representation methods, overcomplete sparse representation is more suitable for image deconvolution. However, there have been few image deconvolution algorithms using overcomplete sparse representation. Further, among existing algorithms, a specific sparse image deconvolution algorithm corresponding to a certain sparse representation method is commonly used, which usually does not suit other methods. Therefore, in this paper, we develop a general sparse image deconvolution algorithm that can incorporate various sparse representation methods into image deconvolution depending on the applications. We propose the Bayesian framework for the presented algorithm, in which the original image is firstly modeled using a hybrid model. The statistical characteristics of the model parameters are then described using Gamma distribution. Based on the prior distributions of the original image and model parameters, we use evidence analysis method to estimate the optimal original image. The experimental results demonstrate the efficiency and competitive performance of the proposed algorithm compared with state-of-the-art algorithms.
{"title":"A hybrid prior based general sparse image deconvolution algorithm","authors":"S. Xiao","doi":"10.1109/WCSP.2010.5633525","DOIUrl":"https://doi.org/10.1109/WCSP.2010.5633525","url":null,"abstract":"Compared with traditional sparse representation methods, overcomplete sparse representation is more suitable for image deconvolution. However, there have been few image deconvolution algorithms using overcomplete sparse representation. Further, among existing algorithms, a specific sparse image deconvolution algorithm corresponding to a certain sparse representation method is commonly used, which usually does not suit other methods. Therefore, in this paper, we develop a general sparse image deconvolution algorithm that can incorporate various sparse representation methods into image deconvolution depending on the applications. We propose the Bayesian framework for the presented algorithm, in which the original image is firstly modeled using a hybrid model. The statistical characteristics of the model parameters are then described using Gamma distribution. Based on the prior distributions of the original image and model parameters, we use evidence analysis method to estimate the optimal original image. The experimental results demonstrate the efficiency and competitive performance of the proposed algorithm compared with state-of-the-art algorithms.","PeriodicalId":448094,"journal":{"name":"2010 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129046761","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
扫码关注我们
求助内容：
应助结果提醒方式：