Pub Date : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037343
Jeongho Jeon, Qian Li, Huaning Niu, A. Papathanassiou, Geng Wu
In this paper, we consider the operation of the Long Term Evolution (LTE) systems in the unlicensed spectrum. Given the lack of the exclusive use of the spectrum, the operation in the unlicensed band is fundamentally limited by interference from other technologies using the same frequency band. By noting that the unlicensed spectrum is heavily used by Wireless Local Area Networks (WLAN), here we focus on the mutual effect between LTE and WLAN when they coexist. For this, we developed a novel inter-system interference analysis technique based on the continuum field approximation and spiral representation, which improves the accuracy of the previous approaches and is applicable to both large-scale and small-scale networks. To this end, we quantify the effect of inter-system interference when the LTE and WLAN systems operate in the same unlicensed spectrum.
{"title":"LTE in the unlicensed spectrum: A novel coexistence analysis with WLAN systems","authors":"Jeongho Jeon, Qian Li, Huaning Niu, A. Papathanassiou, Geng Wu","doi":"10.1109/GLOCOM.2014.7037343","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037343","url":null,"abstract":"In this paper, we consider the operation of the Long Term Evolution (LTE) systems in the unlicensed spectrum. Given the lack of the exclusive use of the spectrum, the operation in the unlicensed band is fundamentally limited by interference from other technologies using the same frequency band. By noting that the unlicensed spectrum is heavily used by Wireless Local Area Networks (WLAN), here we focus on the mutual effect between LTE and WLAN when they coexist. For this, we developed a novel inter-system interference analysis technique based on the continuum field approximation and spiral representation, which improves the accuracy of the previous approaches and is applicable to both large-scale and small-scale networks. To this end, we quantify the effect of inter-system interference when the LTE and WLAN systems operate in the same unlicensed spectrum.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"54 1","pages":"3459-3464"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78337420","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037496
Li Zhu, F. Yu, Hongwei Wang, T. Tang, B. Ning
Communication-Based Train Control (CBTC) system is an automated train control system using bidirectional train-ground communications to ensure the safe operation of rail vehicles. Due to unreliable wireless communications and frequent handoff, existing CBTC systems can severely affect train control performance. In this paper, we use recent advances in Coordinated Multi-Point transmission and reception (CoMP) to enhance the train control performance of CBTC systems. In addition, unlike the exiting works on CoMP, linear quadratic cost for the train control performance in CBTC systems is considered as the performance measure. Moreover, we propose an optimal guidance trajectory calculation scheme in the train control procedure that takes full consideration of the tracking error caused by handoff latency. Simulation results show that the train control performance can be improved substantially in our proposed CBTC system with CoMP.
{"title":"A novel communication-based train control (CBTC) system with coordinated multi-point transmission and reception","authors":"Li Zhu, F. Yu, Hongwei Wang, T. Tang, B. Ning","doi":"10.1109/GLOCOM.2014.7037496","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037496","url":null,"abstract":"Communication-Based Train Control (CBTC) system is an automated train control system using bidirectional train-ground communications to ensure the safe operation of rail vehicles. Due to unreliable wireless communications and frequent handoff, existing CBTC systems can severely affect train control performance. In this paper, we use recent advances in Coordinated Multi-Point transmission and reception (CoMP) to enhance the train control performance of CBTC systems. In addition, unlike the exiting works on CoMP, linear quadratic cost for the train control performance in CBTC systems is considered as the performance measure. Moreover, we propose an optimal guidance trajectory calculation scheme in the train control procedure that takes full consideration of the tracking error caused by handoff latency. Simulation results show that the train control performance can be improved substantially in our proposed CBTC system with CoMP.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"230 1","pages":"4377-4381"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77456014","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037093
G. Feng
Finding a multi-constrained shortest path (MCSP) between a pair of nodes arises in many important applications such as quality of service provisioning in the next-generation network. While this problem subject to a single constraint has been well studied, efficient algorithms solving this problem with two or more constraints are still quite limited. In this paper, we propose a new Lagrangian relaxation algorithm for solving a generalized version of the MCSP problem, where we search for multiple shortest paths subject to multiple constraints. As in some related work, our algorithm first identifies the lower and upper bounds, and then tries to close the gap with a path enumeration procedure. However, our algorithm is based on the recognition that the Lagrange multipliers found by existing methods usually do not give the best search direction for minimizing path enumerations even though they can provide near-optimized lower bounds. We provide a solution to meet both of these goals. Through experiments on the most challenging benchmark instances, we show that our algorithm performs significantly better than the best known algorithm in the literature.
{"title":"A fast Lagrangian relaxation algorithm for finding multi-constrained multiple shortest paths","authors":"G. Feng","doi":"10.1109/GLOCOM.2014.7037093","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037093","url":null,"abstract":"Finding a multi-constrained shortest path (MCSP) between a pair of nodes arises in many important applications such as quality of service provisioning in the next-generation network. While this problem subject to a single constraint has been well studied, efficient algorithms solving this problem with two or more constraints are still quite limited. In this paper, we propose a new Lagrangian relaxation algorithm for solving a generalized version of the MCSP problem, where we search for multiple shortest paths subject to multiple constraints. As in some related work, our algorithm first identifies the lower and upper bounds, and then tries to close the gap with a path enumeration procedure. However, our algorithm is based on the recognition that the Lagrange multipliers found by existing methods usually do not give the best search direction for minimizing path enumerations even though they can provide near-optimized lower bounds. We provide a solution to meet both of these goals. Through experiments on the most challenging benchmark instances, we show that our algorithm performs significantly better than the best known algorithm in the literature.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"74 1","pages":"1949-1955"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73117494","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037346
F. Babich, M. Comisso
This paper presents an approximated, but accurate and fast to compute, mathematical framework for evaluating the capture probability and the number of sustainable communications in a mobile wireless network where spatial reuse enables the coexistence of multiple traffic flows. The proposed study focuses on a particular multi-packet approach, known as multi-packet communication, in which different communicating pairs are simultaneously active. Within this context, the statistics of the received power, of the interference power, and of the signal-to-interference ratio are derived accounting for the antenna system and the network topology in the presence of Nakagami fading. The theoretical results, which are validated by independent Monte Carlo simulations, are used to discuss the impact of mobility on the result of each transmission attempt. The purpose of the developed theory is to provide an alternative analysis, including the spatial domain, for modeling the capture probability and the number of concurrent peer-to-peer communications that can be sustained in a mobile ad-hoc network.
{"title":"Capture analysis of mobile multi-packet networks adopting spatial reuse: An alternative study","authors":"F. Babich, M. Comisso","doi":"10.1109/GLOCOM.2014.7037346","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037346","url":null,"abstract":"This paper presents an approximated, but accurate and fast to compute, mathematical framework for evaluating the capture probability and the number of sustainable communications in a mobile wireless network where spatial reuse enables the coexistence of multiple traffic flows. The proposed study focuses on a particular multi-packet approach, known as multi-packet communication, in which different communicating pairs are simultaneously active. Within this context, the statistics of the received power, of the interference power, and of the signal-to-interference ratio are derived accounting for the antenna system and the network topology in the presence of Nakagami fading. The theoretical results, which are validated by independent Monte Carlo simulations, are used to discuss the impact of mobility on the result of each transmission attempt. The purpose of the developed theory is to provide an alternative analysis, including the spatial domain, for modeling the capture probability and the number of concurrent peer-to-peer communications that can be sustained in a mobile ad-hoc network.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"29 1","pages":"3477-3482"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76647923","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037355
Tian Xia, Hsiao-Chun Wu, S. Chang, Xian Liu, S. Huang
In this paper, we propose a blind binary low-density parity-check (LDPC) encoder identification scheme for M-quadrature amplitude modulation (M-QAM) signals. The expectation-maximization (EM) algorithm is developed to estimate the unknown signal amplitude, noise variance, and phase offset for M-QAM signals. The a posteriori probabilities (APPs) of the coded bits are obtained from the APPs of the transmitted symbols according to the M-QAM mapper. Monte Carlo simulation results demonstrate the effectiveness of our proposed new blind binary LDPC encoder identification scheme for different modulation orders. The average iteration number needed for the EM algorithm to converge is also investigated for different modulation orders.
{"title":"Blind identification of binary LDPC codes for M-QAM signals","authors":"Tian Xia, Hsiao-Chun Wu, S. Chang, Xian Liu, S. Huang","doi":"10.1109/GLOCOM.2014.7037355","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037355","url":null,"abstract":"In this paper, we propose a blind binary low-density parity-check (LDPC) encoder identification scheme for M-quadrature amplitude modulation (M-QAM) signals. The expectation-maximization (EM) algorithm is developed to estimate the unknown signal amplitude, noise variance, and phase offset for M-QAM signals. The a posteriori probabilities (APPs) of the coded bits are obtained from the APPs of the transmitted symbols according to the M-QAM mapper. Monte Carlo simulation results demonstrate the effectiveness of our proposed new blind binary LDPC encoder identification scheme for different modulation orders. The average iteration number needed for the EM algorithm to converge is also investigated for different modulation orders.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"97 1","pages":"3532-3536"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76733529","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036970
Jonghoon Yun, Hyang-Won Lee, Young-Myoung Kim
We develop a rate allocation scheme for two-sided networks where both contents providers (CPs) and end users (EUs) participate in deciding data rate. For rate allocation, our scheme splits the network congestion price into network usage prices by CP and EU, respectively. Using this property, we show that our scheme maximizes the aggregate utility of CPs and EUs, while maximizing the net utility of each CP and EU.
{"title":"A distributed rate allocation scheme in the two-sided network","authors":"Jonghoon Yun, Hyang-Won Lee, Young-Myoung Kim","doi":"10.1109/GLOCOM.2014.7036970","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036970","url":null,"abstract":"We develop a rate allocation scheme for two-sided networks where both contents providers (CPs) and end users (EUs) participate in deciding data rate. For rate allocation, our scheme splits the network congestion price into network usage prices by CP and EU, respectively. Using this property, we show that our scheme maximizes the aggregate utility of CPs and EUs, while maximizing the net utility of each CP and EU.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"283 1","pages":"1187-1192"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76963228","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037396
Wence Zhang, Cunhua Pan, Bo Du, Ming Chen, R. D. Lamare
This paper studies the impact of hardware mismatch (HM) between base station (BS) and user equipment in the downlink of large scale antenna systems. Analytical expressions to predict the achievable rates are derived for different precoding methods, i.e. matched filter (MF) and regularized zero-forcing (RZF), using large system analysis techniques. Furthermore, the asymptotic downlink signal to interference plus noise ratio (SINR) under HM is investigated, which is only related to the variances of circuit gains in most practical scenarios. Monte-Carlo simulations are carried out, and numerical results demonstrate the correctness of the analysis.
{"title":"Achievable rate analysis of large scale antenna systems with hardware mismatch in UL/DL","authors":"Wence Zhang, Cunhua Pan, Bo Du, Ming Chen, R. D. Lamare","doi":"10.1109/GLOCOM.2014.7037396","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037396","url":null,"abstract":"This paper studies the impact of hardware mismatch (HM) between base station (BS) and user equipment in the downlink of large scale antenna systems. Analytical expressions to predict the achievable rates are derived for different precoding methods, i.e. matched filter (MF) and regularized zero-forcing (RZF), using large system analysis techniques. Furthermore, the asymptotic downlink signal to interference plus noise ratio (SINR) under HM is investigated, which is only related to the variances of circuit gains in most practical scenarios. Monte-Carlo simulations are carried out, and numerical results demonstrate the correctness of the analysis.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"46 1","pages":"3778-3783"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77184960","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7036993
Shenghong Hu, Lingfen Sun, Chao Gui, E. Jammeh, I. Mkwawa
The paper presents novel content-aware adaptation schemes for QoE optimized HTTP-based adaptive video streaming services. In recent years, content type has been investigated and proofed to have a deep influence on user's acceptable quality of experience (QoE). However, most of the existing HTTP-based adaptive video strategies only conduct bitrate switching according to network resources without a consideration of video content types. This may cause a non-optimal network resource allocation which may not achieve the optimized QoE for delivered video streaming services. In this paper, we proposed two content-aware adaptation schemes, named as Content-aware Probe and Adapt (C-PANDA) and Content-aware Dynamic Programming (C-DP), which are able to decide the video bitrate for the next video segment, based on not only the available bandwidth, the existing buffer capacity, but also the video content type. We implemented both content-aware adaptation algorithms in player prototypes based on libdash 3.0 library. Preliminary results show that content-aware adaptation schemes achieve better QoE when compared with conventional PANDA scheme. The proposed schemes are able to optimize QoE according to contents. They can achieve higher than acceptable QoE for most attractive contents such as those with high motion intensity to improve user experience for the most interesting scenes; select same video representations for segments belonging to a scene to avoid quality oscillation; and reserve buffer resource during low motion scenes to avoid stalling for the following high motion scenes. The work will be helpful in designing QoE-aware DASH schemes in the future.
{"title":"Content-aware adaptation scheme for QoE optimized dash applications","authors":"Shenghong Hu, Lingfen Sun, Chao Gui, E. Jammeh, I. Mkwawa","doi":"10.1109/GLOCOM.2014.7036993","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036993","url":null,"abstract":"The paper presents novel content-aware adaptation schemes for QoE optimized HTTP-based adaptive video streaming services. In recent years, content type has been investigated and proofed to have a deep influence on user's acceptable quality of experience (QoE). However, most of the existing HTTP-based adaptive video strategies only conduct bitrate switching according to network resources without a consideration of video content types. This may cause a non-optimal network resource allocation which may not achieve the optimized QoE for delivered video streaming services. In this paper, we proposed two content-aware adaptation schemes, named as Content-aware Probe and Adapt (C-PANDA) and Content-aware Dynamic Programming (C-DP), which are able to decide the video bitrate for the next video segment, based on not only the available bandwidth, the existing buffer capacity, but also the video content type. We implemented both content-aware adaptation algorithms in player prototypes based on libdash 3.0 library. Preliminary results show that content-aware adaptation schemes achieve better QoE when compared with conventional PANDA scheme. The proposed schemes are able to optimize QoE according to contents. They can achieve higher than acceptable QoE for most attractive contents such as those with high motion intensity to improve user experience for the most interesting scenes; select same video representations for segments belonging to a scene to avoid quality oscillation; and reserve buffer resource during low motion scenes to avoid stalling for the following high motion scenes. The work will be helpful in designing QoE-aware DASH schemes in the future.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"78 1","pages":"1336-1341"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77189776","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037439
Jie Tang, D. So, E. Alsusa, K. Hamdi, Arman Shojaeifard
Characterizing the fundamental metric of energy efficiency (EE) of multiple-input multiple-output interfering broadcast channels (MIMO-IFBC) is important for the development of green wireless communications. In this paper, we address the EE optimization problem for multi-cell MIMO-IFBC within the context of interference alignment (IA). We employ grouping-based IA scheme to cancel both inter-cell interference (ICI) and inter-user inference (IUI), and thus transform the MIMO-IFBC to a single cell single user MIMO scenario. A gradient-based optimal power adaptation scheme is proposed which utilizes water-filling approach and singular value decomposition (SVD) to maximize EE for each cell. Simulation results confirm the theoretical findings and demonstrate that the proposed resource allocation algorithm can efficiently approach the optimal EE.
{"title":"Energy efficiency in multi-cell MIMO broadcast channels with interference alignment","authors":"Jie Tang, D. So, E. Alsusa, K. Hamdi, Arman Shojaeifard","doi":"10.1109/GLOCOM.2014.7037439","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037439","url":null,"abstract":"Characterizing the fundamental metric of energy efficiency (EE) of multiple-input multiple-output interfering broadcast channels (MIMO-IFBC) is important for the development of green wireless communications. In this paper, we address the EE optimization problem for multi-cell MIMO-IFBC within the context of interference alignment (IA). We employ grouping-based IA scheme to cancel both inter-cell interference (ICI) and inter-user inference (IUI), and thus transform the MIMO-IFBC to a single cell single user MIMO scenario. A gradient-based optimal power adaptation scheme is proposed which utilizes water-filling approach and singular value decomposition (SVD) to maximize EE for each cell. Simulation results confirm the theoretical findings and demonstrate that the proposed resource allocation algorithm can efficiently approach the optimal EE.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"08 1","pages":"4036-4041"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82365478","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 : 2014-12-01DOI: 10.1109/GLOCOM.2014.7037112
Jin-yuan Wang, Jun-Bo Wang, Ming Chen, Jiangzhou Wang
In this paper, we focus on a dimmable visible light communication (VLC) system using PIN photodiodes. In such a system, the main distortion is caused by additive Gaussian noise, however, with a noise variance depending on the current signal strength. Under the non-negativity, peak power and dimmable average power constraints, the lower and upper bounds on the channel capacity are derived, respectively. Specifically, the derivation of the lower bound is based on the fact that the entropy of the output is always larger than the entropy of the input, while the derivation of the upper bound relies on the dual expression of the channel capacity and the notion of capacity-achieving input distribution that escape to infinity. Numerical results show that the gap between the lower and upper bounds is very small in the VLC application zone.
{"title":"Capacity bounds for dimmable visible light communications using PIN photodiodes with input-dependent Gaussian noise","authors":"Jin-yuan Wang, Jun-Bo Wang, Ming Chen, Jiangzhou Wang","doi":"10.1109/GLOCOM.2014.7037112","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037112","url":null,"abstract":"In this paper, we focus on a dimmable visible light communication (VLC) system using PIN photodiodes. In such a system, the main distortion is caused by additive Gaussian noise, however, with a noise variance depending on the current signal strength. Under the non-negativity, peak power and dimmable average power constraints, the lower and upper bounds on the channel capacity are derived, respectively. Specifically, the derivation of the lower bound is based on the fact that the entropy of the output is always larger than the entropy of the input, while the derivation of the upper bound relies on the dual expression of the channel capacity and the notion of capacity-achieving input distribution that escape to infinity. Numerical results show that the gap between the lower and upper bounds is very small in the VLC application zone.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"7 1","pages":"2066-2071"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81317090","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
扫码关注我们
求助内容：
应助结果提醒方式：