Wireless data rates are prodicted to increase 1000 fold by 2020 and likely go up to 10,000 times by 2025. To meet the explosive growth in traffic during the next fifteen years, significant improvement in spectral efficiency is required. One of the promising innovative technologies to meet the above requirements is the massive MIMO technology adopting in large-scale antenna array system. The MIMO channel formed by the massive MIMO technology is likely to be very asymmetric and the number of possible independent data streams for transmission is limited by the number of antennas at the mobile station. Thus MU-MIMO (multi-user MIMO), which offer spatial multiplexing gain without the requirement of multiple antenna arrays at the mobile station, is very worthy of study in large scale antenna array system. In this paper, we give a formula of SINR prediction based on MU-MIMO in large scale antenna array system. Using the formula, a base station could easily predict the capacity loss because of non-deal Channel State Information (CSI), and then choose MIMO mode(e.g. adaptive switching between Single User-MIMO and MU-MIMO) or the best paired users properly in MU-MIMO system. Simulation results show the rationality of the formula.
{"title":"SINR prediction based on MU-MIMO in large scale antenna array system","authors":"Zhaohua Lu, Dengkui Zhu, Xiaodan Zhang, Xianming Chen","doi":"10.1109/WCSP.2013.6677060","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677060","url":null,"abstract":"Wireless data rates are prodicted to increase 1000 fold by 2020 and likely go up to 10,000 times by 2025. To meet the explosive growth in traffic during the next fifteen years, significant improvement in spectral efficiency is required. One of the promising innovative technologies to meet the above requirements is the massive MIMO technology adopting in large-scale antenna array system. The MIMO channel formed by the massive MIMO technology is likely to be very asymmetric and the number of possible independent data streams for transmission is limited by the number of antennas at the mobile station. Thus MU-MIMO (multi-user MIMO), which offer spatial multiplexing gain without the requirement of multiple antenna arrays at the mobile station, is very worthy of study in large scale antenna array system. In this paper, we give a formula of SINR prediction based on MU-MIMO in large scale antenna array system. Using the formula, a base station could easily predict the capacity loss because of non-deal Channel State Information (CSI), and then choose MIMO mode(e.g. adaptive switching between Single User-MIMO and MU-MIMO) or the best paired users properly in MU-MIMO system. Simulation results show the rationality of the formula.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"40 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":"116323533","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.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}
Pub Date : 2013-12-02DOI: 10.1109/WCSP.2013.6677146
Yan Li, Xiaodong Ji, M. Peng, Yuan Li, Chao-Wei Huang
Multiple input multiple output (MIMO) system with large number of antennas, referred to as massive MIMO, has drawn increasing attention for it enables very high throughput in LTE-Advanced networks. Massive MIMO arrays are expected to be implemented in a three dimensional (3D) array structure and 3D MIMO is introduced. Antenna propagation was considered only in horizontal domain during the past few years. In this paper, vertical domain of antenna is taken into account and the modeling of 3D channel is investigated. Furthermore, an enhanced dynamic beamforming algorithm is proposed where beamforming vector can be obtained according to both users' horizontal and vertical directions. Enhanced performance can be obtained by the proposed algorithm compared with conventional 2D beamforming. In addition, the impact of sector radius on spectral efficiency as well as cell coverage is analyzed and the optimal downtilts for different senarios are explored.
{"title":"An enhanced beamforming algorithm for three dimensional MIMO in LTE-advanced networks","authors":"Yan Li, Xiaodong Ji, M. Peng, Yuan Li, Chao-Wei Huang","doi":"10.1109/WCSP.2013.6677146","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677146","url":null,"abstract":"Multiple input multiple output (MIMO) system with large number of antennas, referred to as massive MIMO, has drawn increasing attention for it enables very high throughput in LTE-Advanced networks. Massive MIMO arrays are expected to be implemented in a three dimensional (3D) array structure and 3D MIMO is introduced. Antenna propagation was considered only in horizontal domain during the past few years. In this paper, vertical domain of antenna is taken into account and the modeling of 3D channel is investigated. Furthermore, an enhanced dynamic beamforming algorithm is proposed where beamforming vector can be obtained according to both users' horizontal and vertical directions. Enhanced performance can be obtained by the proposed algorithm compared with conventional 2D beamforming. In addition, the impact of sector radius on spectral efficiency as well as cell coverage is analyzed and the optimal downtilts for different senarios are explored.","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":"122371049","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}
Frequency allocation and scrambling code allocation are challenging issues for TD-SCDMA networks. Proper allocation schemes should not only meet traffic volume requirement and networking constraints, but suppress intercell interference effectively as well. This paper investigates joint frequency and scrambling code allocation, in order to take full use of the freedom degrees owned by these two resources and thus suppress interference to the greatest extent. A complete model of intercell interference is established, taking radio propagation condition, traffic distribution, frequency orthogonality and code correlation into consideration. A novel two-step joint allocation algorithm is proposed, with joint frequency and scrambling code family allocation in the first step and then scrambling code selection in the second step. Therefore, the minimum interference is achieved by the joint allocation, and computational complexity is greatly reduced by the two-step implementation. Numerical results show that in interference suppression point of view, our proposed joint allocation outperforms the sequential allocation commonly used in engineering.
{"title":"Joint frequency and scrambling code allocation for TD-SCDMA cellular network optimization","authors":"Cheng Wang, Zhouyun Wu, Aiping Huang, Hangguan Shan, Liang Shen, Zhoushi Xiong","doi":"10.1109/WCSP.2013.6677250","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677250","url":null,"abstract":"Frequency allocation and scrambling code allocation are challenging issues for TD-SCDMA networks. Proper allocation schemes should not only meet traffic volume requirement and networking constraints, but suppress intercell interference effectively as well. This paper investigates joint frequency and scrambling code allocation, in order to take full use of the freedom degrees owned by these two resources and thus suppress interference to the greatest extent. A complete model of intercell interference is established, taking radio propagation condition, traffic distribution, frequency orthogonality and code correlation into consideration. A novel two-step joint allocation algorithm is proposed, with joint frequency and scrambling code family allocation in the first step and then scrambling code selection in the second step. Therefore, the minimum interference is achieved by the joint allocation, and computational complexity is greatly reduced by the two-step implementation. Numerical results show that in interference suppression point of view, our proposed joint allocation outperforms the sequential allocation commonly used in engineering.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"52 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":"129301645","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.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.6677099
Yu-zhen Huang, F. Al-Qahtani, C. Zhong, Qi-hui Wu
This paper investigate the impact of primary transceivers on the outage performance of a dual-hop decode-and-forward (DF) spectrum sharing relay system with multiple secondary user (SU) destinations in Nakagami-m fading channels. To doing so, we derive new exact and asymptotic closed-form expressions for the outage probability of spectrum sharing relay systems employing the opportunistic scheduling algorithm, which readily enable us to characterize the impact of various key system parameters on the outage performance of the system. Monte Carlo simulation results are provided to verify the theoretical analysis and evaluate the effects of channel fading severity, SU relay placement, and number of SU destinations. The finding of this paper suggests that the interference temperature constraint results in the outage saturation phenomenon and zero diversity gain of spectrum sharing relay systems.
{"title":"Outage analysis of spectrum sharing relay systems with multi-secondary destinations in the presence of primary user's interference","authors":"Yu-zhen Huang, F. Al-Qahtani, C. Zhong, Qi-hui Wu","doi":"10.1109/WCSP.2013.6677099","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677099","url":null,"abstract":"This paper investigate the impact of primary transceivers on the outage performance of a dual-hop decode-and-forward (DF) spectrum sharing relay system with multiple secondary user (SU) destinations in Nakagami-m fading channels. To doing so, we derive new exact and asymptotic closed-form expressions for the outage probability of spectrum sharing relay systems employing the opportunistic scheduling algorithm, which readily enable us to characterize the impact of various key system parameters on the outage performance of the system. Monte Carlo simulation results are provided to verify the theoretical analysis and evaluate the effects of channel fading severity, SU relay placement, and number of SU destinations. The finding of this paper suggests that the interference temperature constraint results in the outage saturation phenomenon and zero diversity gain of spectrum sharing relay systems.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"177 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":"121611842","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.6677208
Cunhua Pan, Bo Du, Cailuan Su, Lei Wu, Ming Chen
This paper studies the jointly distributed transceiver design for time-division-duplex (TDD) multicell downlink systems where there is no exchange information between the Base Stations (BSs). With an aim to minimize the sum MSE under per-BS power constraint, we give a hierarchical iterative algorithm which can be implemented in a distributed manner with low complexity. The algorithm is described as follows. First, with given precoders, the equalizers are updated by MMSE method. Second, by keeping the equalizers fixed, the original problem is convex in precoders and the precoders can be solved with the aid of KKT conditions. Finally, repeat the above steps until the algorithm converges. The proof of the convergence and the analysis of the complexity are given as well. Simulation results show that the proposed algorithm is converged within few iterations and outperforms the existing distributed algorithms.
{"title":"Jointly distributed transceiver design for multicell systems with low complexity","authors":"Cunhua Pan, Bo Du, Cailuan Su, Lei Wu, Ming Chen","doi":"10.1109/WCSP.2013.6677208","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677208","url":null,"abstract":"This paper studies the jointly distributed transceiver design for time-division-duplex (TDD) multicell downlink systems where there is no exchange information between the Base Stations (BSs). With an aim to minimize the sum MSE under per-BS power constraint, we give a hierarchical iterative algorithm which can be implemented in a distributed manner with low complexity. The algorithm is described as follows. First, with given precoders, the equalizers are updated by MMSE method. Second, by keeping the equalizers fixed, the original problem is convex in precoders and the precoders can be solved with the aid of KKT conditions. Finally, repeat the above steps until the algorithm converges. The proof of the convergence and the analysis of the complexity are given as well. Simulation results show that the proposed algorithm is converged within few iterations and outperforms the existing distributed algorithms.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"18 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":"121024116","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.6677145
Linqiong Jia, Wence Zhang, Zhaohui Yang, Chunhua Ma, Ming Chen
The problem of cell sites planning in a given service area in LTE cellular networks is studied in this paper, the optimization objective of which is to minimize the power consumption of both users and cell sites under the constraint of cell load balancing. Non-uniform traffic distributions across the entire service area are considered. An efficient algorithm is proposed, which first works out a proper range of the optimal sites number, and then determines the cell sites locations for each number in the range by iteratively solving a convex problem to minimize the power consumption of both users and cell sites. The optimal cell sites number is the one with minimal power consumption and the locations are determined accordingly. An example scenario is presented to demonstrate the convergence and effectiveness of the proposed algorithm.
{"title":"Cell sites planning with minimized power consumption under cell load balancing constraint in LTE networks","authors":"Linqiong Jia, Wence Zhang, Zhaohui Yang, Chunhua Ma, Ming Chen","doi":"10.1109/WCSP.2013.6677145","DOIUrl":"https://doi.org/10.1109/WCSP.2013.6677145","url":null,"abstract":"The problem of cell sites planning in a given service area in LTE cellular networks is studied in this paper, the optimization objective of which is to minimize the power consumption of both users and cell sites under the constraint of cell load balancing. Non-uniform traffic distributions across the entire service area are considered. An efficient algorithm is proposed, which first works out a proper range of the optimal sites number, and then determines the cell sites locations for each number in the range by iteratively solving a convex problem to minimize the power consumption of both users and cell sites. The optimal cell sites number is the one with minimal power consumption and the locations are determined accordingly. An example scenario is presented to demonstrate the convergence and effectiveness of the proposed algorithm.","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":"125942817","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
扫码关注我们
求助内容：
应助结果提醒方式：