Pub Date : 2013-12-02DOI: 10.1109/WCSP.2013.6677268
Xianbin Wang, Zhaoyang Zhang, Liang Zhang
Polarization, first introduced by Arikan, is a phenomenon that after some processing of a channel, the resulted channels are either almost clean channels or useless channels. In this paper we propose three schemes to polarize a MIMO channel and design the corresponding polar codes. In the first two schemes, the MIMO channel is decomposed into different independent channels, while in the third scheme, we analyze the performance to polarize the MIMO channel directly. In SCHEME ONE, we design corresponding polar code for each independent channel, and in SCHEME TWO, we propose a method to transmit messages cooperatively in these channels. Based on the theoretical analysis and the simulation results, the SCHEME TWO can achieve a lower frame error rate without sacrifice of coding rate and decoding delay.
{"title":"On the polar codes for MIMO","authors":"Xianbin Wang, Zhaoyang Zhang, Liang Zhang","doi":"10.1109/WCSP.2013.6677268","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677268","url":null,"abstract":"Polarization, first introduced by Arikan, is a phenomenon that after some processing of a channel, the resulted channels are either almost clean channels or useless channels. In this paper we propose three schemes to polarize a MIMO channel and design the corresponding polar codes. In the first two schemes, the MIMO channel is decomposed into different independent channels, while in the third scheme, we analyze the performance to polarize the MIMO channel directly. In SCHEME ONE, we design corresponding polar code for each independent channel, and in SCHEME TWO, we propose a method to transmit messages cooperatively in these channels. Based on the theoretical analysis and the simulation results, the SCHEME TWO can achieve a lower frame error rate without sacrifice of coding rate and decoding delay.","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":"130559749","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.6677224
Qizhong Lin, Dongmei Zhang, Kui Xu, Wei Xie
In this paper, a new Opportunistic Role of Destination Transition Protocol (ODT) is proposed for the cooperative network with a source node and two destination nodes. As two destination nodes compete to receive the message from the source node, either of the two destination nodes can opportunely play the role of a destination and the other will serve as an amplify-and-forward relay. Particularly, the source just need to know the channel state information of each link to make role transition. In order to reveal the inherent impacts of different link statistics, we derive the closed form outage probability lower bound for ODT protocol. From the simulation results, we find that in high-SNR, the inter-destination link affects little on the ODT outage behavior when two nodes are in the downlink direction. Moreover, we demonstrate that without complicated calculation, ODT nearly has the as same effect as `5 time-slots ahead of transmission in [8]' and is also superior to schemes of predefined role configuration [1]. Theoretical analyses corroborated the correctness of the Monte Carlo simulation results.
{"title":"Opportunistic Role of Destination Transition Protocol for two-destinations AF relaying networks","authors":"Qizhong Lin, Dongmei Zhang, Kui Xu, Wei Xie","doi":"10.1109/WCSP.2013.6677224","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677224","url":null,"abstract":"In this paper, a new Opportunistic Role of Destination Transition Protocol (ODT) is proposed for the cooperative network with a source node and two destination nodes. As two destination nodes compete to receive the message from the source node, either of the two destination nodes can opportunely play the role of a destination and the other will serve as an amplify-and-forward relay. Particularly, the source just need to know the channel state information of each link to make role transition. In order to reveal the inherent impacts of different link statistics, we derive the closed form outage probability lower bound for ODT protocol. From the simulation results, we find that in high-SNR, the inter-destination link affects little on the ODT outage behavior when two nodes are in the downlink direction. Moreover, we demonstrate that without complicated calculation, ODT nearly has the as same effect as `5 time-slots ahead of transmission in [8]' and is also superior to schemes of predefined role configuration [1]. Theoretical analyses corroborated the correctness of the Monte Carlo simulation results.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"19 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":"123377033","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.6677069
Yingxiao Sun, Dewei Yang, Weizhen Tian, Wenlong Liu
IEEE802.11 DCF (Distributed Coordination Function) protocol adopts binary exponential backoff (BEB) algorithm to reduce the probability of collision. However, when the network reaches saturation, throughput declines sharply with the increase of the number of stations (STAs) because of more collisions. In order to further avoid collisions and optimize the system, this paper proposes an improved algorithm based on the RTS / CTS (request to send /dear to send) mechanism. A STA intended to send packet sets an appropriate contention window (CW) and selects a backoff value different from that of other STAs according to the result of previous packet and the current backoff value of other STAs in the network. Theoretical analysis and OPNET simulation results show that the new algorithm outperforms BEB in performance of throughput, network delay and data dropped.
IEEE802.11 DCF (Distributed Coordination Function，分布式协调函数)协议采用了二进制指数回退(binary exponential backoff, BEB)算法来降低碰撞的概率。然而，当网络达到饱和时，由于冲突的增加，吞吐量随着站数的增加而急剧下降。为了进一步避免碰撞，优化系统，本文提出了一种基于RTS / CTS (request to send /dear to send)机制的改进算法。发送报文的STA根据前一个报文的处理结果和网络中其他STA当前的回退值，设置一个合适的竞争窗口(CW)，选择一个不同于其他STA的回退值。理论分析和OPNET仿真结果表明，新算法在吞吐量、网络延迟和数据丢失等性能上都优于BEB算法。
{"title":"Optimized backoff algorithm of IEEE 802.11 DCF for collision resolution","authors":"Yingxiao Sun, Dewei Yang, Weizhen Tian, Wenlong Liu","doi":"10.1109/WCSP.2013.6677069","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677069","url":null,"abstract":"IEEE802.11 DCF (Distributed Coordination Function) protocol adopts binary exponential backoff (BEB) algorithm to reduce the probability of collision. However, when the network reaches saturation, throughput declines sharply with the increase of the number of stations (STAs) because of more collisions. In order to further avoid collisions and optimize the system, this paper proposes an improved algorithm based on the RTS / CTS (request to send /dear to send) mechanism. A STA intended to send packet sets an appropriate contention window (CW) and selects a backoff value different from that of other STAs according to the result of previous packet and the current backoff value of other STAs in the network. Theoretical analysis and OPNET simulation results show that the new algorithm outperforms BEB in performance of throughput, network delay and data dropped.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"28 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120867811","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.6677231
Jinqing Ding, Feng Liu, Z. Gan, Changhong Chen
In order to improve the quality of the reconstructed Wyner-Ziv frame, based on the introduction of a basic way to generate the side information, two strategies was proposed to optimize the side information. Firstly, during the unidirectional motion estimation process, we made full use of intra-correlation and inter-frame correlation to adaptively obtain the motion search starting coordinates of the current macro-block and the size of the search window. After the bidirectional motion estimation, a motion vector smoothing method was introduced to optimize the reconstruction of the motion vector field, and to further enhance the authenticity of the motion vectors. Compared with the existing conventional interpolation algorithm, the experimental results show that the average PSNR of side information generated by the proposed method can be improved by 1.33~1.66dB, and the subjective quality of the side information is significantly improved.
{"title":"The optimization of side information generation algorithm for Wyner-Ziv video coding","authors":"Jinqing Ding, Feng Liu, Z. Gan, Changhong Chen","doi":"10.1109/WCSP.2013.6677231","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677231","url":null,"abstract":"In order to improve the quality of the reconstructed Wyner-Ziv frame, based on the introduction of a basic way to generate the side information, two strategies was proposed to optimize the side information. Firstly, during the unidirectional motion estimation process, we made full use of intra-correlation and inter-frame correlation to adaptively obtain the motion search starting coordinates of the current macro-block and the size of the search window. After the bidirectional motion estimation, a motion vector smoothing method was introduced to optimize the reconstruction of the motion vector field, and to further enhance the authenticity of the motion vectors. Compared with the existing conventional interpolation algorithm, the experimental results show that the average PSNR of side information generated by the proposed method can be improved by 1.33~1.66dB, and the subjective quality of the side information is significantly improved.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"6 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":"116193957","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.6677238
He Jiang, Zaichen Cong, Zhiyong Gao, Xiaoyun Zhang
In this paper, an algorithm named ILSE (Improved Local Self Examples) is proposed to improve the facet phenomenon based on [1]. The algorithm divides the high frequency component into two orthogonal spaces by analyzing the covariance matrix of a single image. Moreover, the high resolution image can be further improved by using the IWLS (Improved Weighted Least Square) filter, in which we add one more regulation term to balance the gradient field and 2-order holomorphic complete differential form of the image. The algorithm can preserve the edge sharpness and enhance the details at the same time. Analysis is given on the relations and the differences between the proposed approach and some other state-of-the-art interpolation methods. Experimental results show that the proposed method can achieve better image quality as compared to other competitors.
本文在[1]的基础上，提出了一种改善facet现象的算法ILSE (Improved Local Self Examples)。该算法通过分析单幅图像的协方差矩阵，将高频分量划分为两个正交空间。此外，采用改进加权最小二乘(IWLS)滤波器可以进一步提高图像的高分辨率，该滤波器增加了一个调节项来平衡梯度场和图像的二阶全纯完全微分形式。该算法在保持边缘清晰度的同时，还能增强图像的细节。分析了该方法与其他一些最新插值方法之间的关系和差异。实验结果表明，与其他竞争对手相比，该方法可以获得更好的图像质量。
{"title":"Image super-resolution with facet improvement and detail enhancement based on local self examples","authors":"He Jiang, Zaichen Cong, Zhiyong Gao, Xiaoyun Zhang","doi":"10.1109/WCSP.2013.6677238","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677238","url":null,"abstract":"In this paper, an algorithm named ILSE (Improved Local Self Examples) is proposed to improve the facet phenomenon based on [1]. The algorithm divides the high frequency component into two orthogonal spaces by analyzing the covariance matrix of a single image. Moreover, the high resolution image can be further improved by using the IWLS (Improved Weighted Least Square) filter, in which we add one more regulation term to balance the gradient field and 2-order holomorphic complete differential form of the image. The algorithm can preserve the edge sharpness and enhance the details at the same time. Analysis is given on the relations and the differences between the proposed approach and some other state-of-the-art interpolation methods. Experimental results show that the proposed method can achieve better image quality as compared to other competitors.","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":"126210349","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}
In this paper, we propose a unified TDMA-based scheduling protocol for Vehicle-to-Infrastructure (V2I) communications. In the proposed TDMA-based scheduling protocol, the roadside infrastructure collects the information from the vehicles within its communication coverage through a control channel at the beginning of each transmission frame and then decides how to allocate the time slots to the vehicles for their data transmission requests based on a new designed weight-factor-based scheduler. The provided weight factor jointly takes into consideration the channel quality of communication links, the speed based fairness among vehicles, and different access categories. Simulation results verify the efficiency of the proposed scheduling protocol in terms of the network throughput performance, the fairness among the vehicles, and different accessing priorities of different access categories.
{"title":"A unified TDMA-based scheduling protocol for Vehicle-to-Infrastructure communications","authors":"Rongqing Zhang, Jinsung Lee, X. Shen, Xiang Cheng, Liuqing Yang, B. Jiao","doi":"10.1109/WCSP.2013.6677153","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677153","url":null,"abstract":"In this paper, we propose a unified TDMA-based scheduling protocol for Vehicle-to-Infrastructure (V2I) communications. In the proposed TDMA-based scheduling protocol, the roadside infrastructure collects the information from the vehicles within its communication coverage through a control channel at the beginning of each transmission frame and then decides how to allocate the time slots to the vehicles for their data transmission requests based on a new designed weight-factor-based scheduler. The provided weight factor jointly takes into consideration the channel quality of communication links, the speed based fairness among vehicles, and different access categories. Simulation results verify the efficiency of the proposed scheduling protocol in terms of the network throughput performance, the fairness among the vehicles, and different accessing priorities of different access categories.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"41 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":"128143679","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.6677211
Junfei Zhang, Y. Li, Jianing Li, Lianghao Wang, Dongxiao Li, Ming Zhang
In recent years, several approaches have been proposed to reconstruct static scenes. However, there exists rarely method for dynamic scenes. In this paper, we propose an approach to reconstruct dynamic scenes using only a moving depth sensor. The main idea is to reconstruct the moving foreground objects and static background scenes respectively. An iterative closest point (ICP) algorithm is used for obtaining the current camera pose. The foreground and background splitting is achieved by processing failed tracking points. We introduce an efficient filter and morphological operations to handle these points. Finally, foreground and background models are reconstructed separately using the split depth data and the calculated camera pose. Experimental results demonstrate that our method has fast and robust performance in reconstructing complex dynamic scenes.
{"title":"Dynamic scenes reconstruction based on foreground and background splitting","authors":"Junfei Zhang, Y. Li, Jianing Li, Lianghao Wang, Dongxiao Li, Ming Zhang","doi":"10.1109/WCSP.2013.6677211","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677211","url":null,"abstract":"In recent years, several approaches have been proposed to reconstruct static scenes. However, there exists rarely method for dynamic scenes. In this paper, we propose an approach to reconstruct dynamic scenes using only a moving depth sensor. The main idea is to reconstruct the moving foreground objects and static background scenes respectively. An iterative closest point (ICP) algorithm is used for obtaining the current camera pose. The foreground and background splitting is achieved by processing failed tracking points. We introduce an efficient filter and morphological operations to handle these points. Finally, foreground and background models are reconstructed separately using the split depth data and the calculated camera pose. Experimental results demonstrate that our method has fast and robust performance in reconstructing complex dynamic scenes.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"25 5 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":"125958803","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.6677259
Jun Zheng, Zhenzhong Huang, Qihuang Shu, N. Mitton
This paper considers the Slepian-Wolf coding based energy-minimization rate allocation problem in a wireless sensor network (WSN) and propose a distributed rate allocation algorithm to solve the problem. The proposed distributed algorithm is based on an existing centralized rate allocation algorithm which has a high computational complexity. To reduce the computational complexity of the centralized algorithm and make the rate allocation performable in a distributed manner, we make necessary modifications to the centralized algorithm by reducing the number of sets in calculating the average energy consumption cost and limiting the number of conditional nodes that a set can use. Simulation results show that the proposed distributed algorithm can significantly reduce the computational time when compared with the existing centralized algorithm at the cost of the overall energy consumption for data transmission and the total amount of data transmitted in the network.
{"title":"A distributed rate allocation algorithm for Slepian-Wolf coding based data aggregation in wireless sensor networks","authors":"Jun Zheng, Zhenzhong Huang, Qihuang Shu, N. Mitton","doi":"10.1109/WCSP.2013.6677259","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677259","url":null,"abstract":"This paper considers the Slepian-Wolf coding based energy-minimization rate allocation problem in a wireless sensor network (WSN) and propose a distributed rate allocation algorithm to solve the problem. The proposed distributed algorithm is based on an existing centralized rate allocation algorithm which has a high computational complexity. To reduce the computational complexity of the centralized algorithm and make the rate allocation performable in a distributed manner, we make necessary modifications to the centralized algorithm by reducing the number of sets in calculating the average energy consumption cost and limiting the number of conditional nodes that a set can use. Simulation results show that the proposed distributed algorithm can significantly reduce the computational time when compared with the existing centralized algorithm at the cost of the overall energy consumption for data transmission and the total amount of data transmitted in the network.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"309 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":"131801940","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.6677194
P. Patcharamaneepakorn, A. Doufexi, S. Armour
This paper presents linear transceiver designs for MIMO interfering broadcast channels (MIMO IFBC). A new global objective, referred to as a Total Signal-to-Leakage-plus-Noise Ratio (TSLNR), is proposed and is solved based on alternating optimisation. The algorithm is also proven to converge. The proposed objective is further modified into an Individual SLNR (ISLNR) to relax the requirement of global channel state information (CSI). High-performance practical linear transceivers are also given and are shown to achieve near-theoretical performance. Moreover, robust designs of the proposed algorithms in the presence of imperfect CSI are presented. The advantages of the proposed algorithms are also illustrated through simulations.
{"title":"Leakage-based transceiver designs for MIMO interfering broadcast channels","authors":"P. Patcharamaneepakorn, A. Doufexi, S. Armour","doi":"10.1109/WCSP.2013.6677194","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677194","url":null,"abstract":"This paper presents linear transceiver designs for MIMO interfering broadcast channels (MIMO IFBC). A new global objective, referred to as a Total Signal-to-Leakage-plus-Noise Ratio (TSLNR), is proposed and is solved based on alternating optimisation. The algorithm is also proven to converge. The proposed objective is further modified into an Individual SLNR (ISLNR) to relax the requirement of global channel state information (CSI). High-performance practical linear transceivers are also given and are shown to achieve near-theoretical performance. Moreover, robust designs of the proposed algorithms in the presence of imperfect CSI are presented. The advantages of the proposed algorithms are also illustrated through simulations.","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":"130758793","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.6677280
Kecheng Zhang, Jiamo Jiang, M. Peng, Lei Li
The energy-efficient design for heterogeneous OFDM downlink systems has attracted much attention since the problem of environmental pollution becomes dramatically serious. The core issue of the problem is power optimization. In this paper, the optimization problem is modeled as a multi-cell OFDM downlink heterogeneous system and the energy efficiency is calculated as the total throughput divided by the total power consumption. To solve the problem we first derive the relationship between the total power consumption and the system energy efficiency. Then the existence of the unique optimal value of the energy efficiency, which can be get by adjusting the transmit power, is proved. Thus, an improved water-filling algorithm is proposed to achieve the maximum energy efficiency of the system but the complexity is too high for the current system. Then we propose a distributed suboptimal algorithm to approach the optimal value. It adjusts the transmit power of each cell independently and finally converges by a certain number of iterations. Simulation results illustrate the features of the energy efficiency and show the proposed algorithm is feasible and effective.
{"title":"Energy-efficient power allocation algorithm for heterogeneous OFDM downlink systems","authors":"Kecheng Zhang, Jiamo Jiang, M. Peng, Lei Li","doi":"10.1109/WCSP.2013.6677280","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677280","url":null,"abstract":"The energy-efficient design for heterogeneous OFDM downlink systems has attracted much attention since the problem of environmental pollution becomes dramatically serious. The core issue of the problem is power optimization. In this paper, the optimization problem is modeled as a multi-cell OFDM downlink heterogeneous system and the energy efficiency is calculated as the total throughput divided by the total power consumption. To solve the problem we first derive the relationship between the total power consumption and the system energy efficiency. Then the existence of the unique optimal value of the energy efficiency, which can be get by adjusting the transmit power, is proved. Thus, an improved water-filling algorithm is proposed to achieve the maximum energy efficiency of the system but the complexity is too high for the current system. Then we propose a distributed suboptimal algorithm to approach the optimal value. It adjusts the transmit power of each cell independently and finally converges by a certain number of iterations. Simulation results illustrate the features of the energy efficiency and show the proposed algorithm is feasible and effective.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"51 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":"130759077","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
扫码关注我们
求助内容：
应助结果提醒方式：