{"title":"Universal Quantum Channel Simulation in Duality Quantum Computing","authors":"Shijie Wei, T. Xin, G. Long","doi":"10.1109/GLOCOMW.2017.8269078","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2017.8269078","url":null,"abstract":"Quantum channels describe general transformations of the state of a physical system and play a fundamental role in many fields. It promises wide range of applications, because any physical process can be represented as a quantum channel transforming an initial state into a final state. The evolution of system undergoing a quantum channel is not necessary unitary which makes it unrealisable without ancillary system. Inspired by the method performing non-unitary operator by the linear combination of unitary operations, we proposed a quantum algorithm for the simulation of universal single-qubit channel, described by a convex combination of two generalized extreme channels corresponding to four Kraus operators, and is scalable to arbitrary higher dimension. We demonstrate the whole algorithm experimentally using the universal IBM cloud quantum computer and study properties of different qubit quantum channels. We illustrate the quantum capacity of the general qubit quantum channels, which quantifies the amount of quantum information that can be protected. There is a general agreement between the theoretical predictions and the experiments, which strongly supported our method. By realizing arbitrary qubit channel, this work provides a universal way to explore various properties of quantum channel and novel prospect of quantum communication.","PeriodicalId":345352,"journal":{"name":"2017 IEEE Globecom Workshops (GC Wkshps)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114174574","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}
Ravinder Singh, Stefano Pergoloni, T. O’Farrell, G. Scarano, J. David, M. Biagi
{"title":"White Light Constrained Multi-Primary Modulation for Visible Light Communication","authors":"Ravinder Singh, Stefano Pergoloni, T. O’Farrell, G. Scarano, J. David, M. Biagi","doi":"10.1109/GLOCOMW.2017.8269142","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2017.8269142","url":null,"abstract":"The application of visible light communication (VLC) systems is to transmit data while maintaining efficient and good quality illumination service. In order to meet standard lighting requirements when multi-colored modulation techniques are used, such as color shift keying (CSK), the color fluctuation becomes a relevant issue. This paper presents a multi- primary (multi-color) modulation technique which provides reliable data transmission while keeping a strong constraint on the light color illuminated by every symbol of the modulation alphabet. The number of possible primary color combinations that ensure white light are calculated for a given set of multi-color light sources. The system performance in terms of bit error rate for different constellation is evaluated and compared against other multi-color VLC schemes in the literature, considering a range of channel impairments due to the optical front-end components.","PeriodicalId":345352,"journal":{"name":"2017 IEEE Globecom Workshops (GC Wkshps)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114377781","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}
{"title":"Game Theory Based Base Station Association for Flexible Duplex Networks","authors":"Shuyi Tian, Meng Ma, B. Jiao","doi":"10.1109/GLOCOMW.2017.8269188","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2017.8269188","url":null,"abstract":"Flexible duplex has been seen as a promising technology for dealing with varying traffic asymmetries in the fifth generation (5G) system. However, the main issue that limits its performance is cross-link interference, i.e., the interference between downlink (DL) and uplink (UL). To solve this interference problem, base station (BS) association mechanism is considered to be an effective way, in which the cellular system determines which user equipment (UE) is associated with a particular BS before data transmission. In this work, we propose a distributed BS association algorithm for flexible duplex systems to maximize network sum rate. In particular, by taking the influence of interference caused by the UE's associated BS into consideration, we formulate the BS association problem as a BS association game, and prove that it is an exact potential game (EPG) which has at least one pure strategy Nash equilibrium (NE). Then a distributed BS association algorithm is proposed to achieve NE with local information. Simulation results show that our algorithm can not only achieve an outstanding performance in terms of network sum rate, especially when the DL and UL traffic are asymmetric, but also balance the sum rates between the DL and UL UEs by adjusting a weight parameter in the proposed algorithm.","PeriodicalId":345352,"journal":{"name":"2017 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128726711","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}
{"title":"Secrecy Outage Design in MIMO-SWIPT Systems Based on a Non-Linear EH Model","authors":"Yi Yuan, Z. Ding","doi":"10.1109/GLOCOMW.2017.8269099","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2017.8269099","url":null,"abstract":"This paper consider a multiple-input multiple- output (MIMO) downlink system with simultaneous wireless information and power transfer (SWIPT). In this system, we provide secure communication by considering all non-linear energy receivers (ERs) as the potential eavesdroppers. We aim to design an optimal covariance matrix of the transmit signal based on the proposed outage-constrained secrecy rate maximization (OC-SRM) problem, where the proposed system keeps the probability of the secrecy rate outage and the harvested energy outage caused by uncertainties regarding the channel state information (CSI) below the given thresholds. The proposed maximization problem is non-convex and unlikely to be efficiently computable. To surmount the non-convexity of the proposed OC-SRM problem, we resort several transformations and approximations. In the partial channel uncertainty (PCU) model, we introduce auxiliary variables to transfer the Shannon capacity expressions into easy handled forms based on the concept of Fenchel conjugate arguments. As a compromise, we employ three safe approximation approaches to find the upper bounds of the probabilistic constraints. Moveover, an alternating optimization (AO) algorithm is proposed to solve the reformulated problem. The performance of the proposed design is efficiently validated by numerical results in our paper.","PeriodicalId":345352,"journal":{"name":"2017 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130526486","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}
{"title":"Performance Evaluation of Downlink Cooperative Multipoint Joint Transmission in LiFi Systems","authors":"Cheng Chen, H. Haas","doi":"10.1109/GLOCOMW.2017.8269151","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2017.8269151","url":null,"abstract":"LiFi (Light-Fidelity) is known as a high speed wireless access network based on visible light communication (VLC) techniques. Two of the limiting factors in a LiFi network are the co-channel interference (CCI) and blockage. In this paper, a cooperative multipoint joint transmission (CoMP-JT) scheme in an orthogonal frequency division multiplexing (OFDM)-based LiFi downlink network has been proposed to alleviate these issues. The main idea of CoMP-JT in LiFi is to serve mobile user equipment with multiple downlink transmitters. A transmitter assignment scheme and a proportional fairness scheduling scheme have been presented. Simulation results show that CoMP-JT can significantly improve the reliability and quality- of-service (QoS) of LiFi systems relative to a system with single-point transmission (SPT) scheme.","PeriodicalId":345352,"journal":{"name":"2017 IEEE Globecom Workshops (GC Wkshps)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129135800","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}
{"title":"Quantum Pattern Recognition for Local Sequence Alignment","authors":"Konstantinos Prousalis, Nikos Konofaos","doi":"10.1109/GLOCOMW.2017.8269076","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2017.8269076","url":null,"abstract":"Over the last two decades, there have been some challenging proposals on the field of pattern recognition by means of quantum technology. The application of them is considered for a popular branch of bioinformatics which analyzes massive amounts of sequence data for genes and proteins. More specific, the Smith-Waterman algorithm is studied under the more general term of local sequence alignment. The steps of this algorithm are totally reformed and powered by the quantum mechanics computing theory. The proposed method is based on R. Schützhold's pattern recognition quantum algorithm. A binary and unstructured data set is formed after the comparison of the sequences under alignment which is used by R. Schützhold's algorithm to identify and locate potential patterns. It is achieved with the aid of a spatial light modulator. The adopted quantum algorithm exhibits an exponential speed-up in comparison with its classical counterparts.","PeriodicalId":345352,"journal":{"name":"2017 IEEE Globecom Workshops (GC Wkshps)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114733409","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}
{"title":"The K-User Linear Deterministic Broadcast Channel with Receiver Memory","authors":"H. Kang, M. G. Kang, Wan Choi","doi":"10.1109/GLOCOMW.2017.8269181","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2017.8269181","url":null,"abstract":"This paper considers a cache-aided linear deterministic broadcast channel where receivers have memories. A novel multi-rate coded multicasting is proposed, which utilizes different signal strength levels at the receivers contrary to the conventional coded multicasting. We derive the required transmission time for given memory size, and analyze the memory- transmission time tradeoff which characterizes the relationship between memory size and required transmission time satisfying all user requests. A lower bound on the memory-transmission time tradeoff is also derived using cut-set bound and optimality of the proposed scheme is evaluated by comparing the achievable tradeoff of the proposed scheme with the lower bound. It is shown that the proposed scheme achieves much less required transmission time than the conventional coded multicasting when the signal strength levels at the users are different.","PeriodicalId":345352,"journal":{"name":"2017 IEEE Globecom Workshops (GC Wkshps)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127953511","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}
Qian Deng, Li Guo, Chao Dong, Xiaopeng Liang, Jiaru Lin
{"title":"Hybrid Iterative Updates Detection Scheme for Uplink Dynamic Multiuser Massive MIMO Systems","authors":"Qian Deng, Li Guo, Chao Dong, Xiaopeng Liang, Jiaru Lin","doi":"10.1109/GLOCOMW.2017.8269176","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2017.8269176","url":null,"abstract":"A new signal detection scheme based on joint Chebyshev polynomials acceleration and semi-iterative plus symmetric successive over relaxation (SSOR+CP) method is proposed to fast update the linear minimum mean square error (MMSE) detection when a user is added to or removed from the massive multipleinput multiple- output (MIMO) systems. Chebyshev polynomials (CP) acceleration and semi-iterative method not only is employed to construct a secondary iteration for the SSOR method to significantly accelerate the convergence rate, but also has inexpensive cost. Furthermore, by utilizing Schur complements and the block matrix inverse lemma, we can fast update a matrix inverse that further reduce the complexity by an order of magnitude in real massive MIMO systems with a dynamic set of users. Through numerical simulations, it is observed that the proposed hybrid iterative updates method, with only a few operations, is almost able to perform the optimal detection performance in contrast with recently proposed detection algorithms, even when the number of user equipments (UEs) significantly increased. Meanwhile, our hybrid iterative updates method can provide more robust signal detection in high-spatial correlation of massive MIMO channels.","PeriodicalId":345352,"journal":{"name":"2017 IEEE Globecom Workshops (GC Wkshps)","volume":"435 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131919508","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}
Mathieu Gineste, T. Deleu, Michel Cohen, N. Chuberre, V. Saravanan, V. Frascolla, M. Muck, E. Strinati, E. Dutkiewicz
{"title":"Narrowband IoT Service Provision to 5G User Equipment via a Satellite Component","authors":"Mathieu Gineste, T. Deleu, Michel Cohen, N. Chuberre, V. Saravanan, V. Frascolla, M. Muck, E. Strinati, E. Dutkiewicz","doi":"10.1109/GLOCOMW.2017.8269209","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2017.8269209","url":null,"abstract":"Today an estimated 15 billion of connected objects communicate with each other''s. These connected objects that compose the Internet of Things (IoT) are expected to extend to 50 or 80 billion worldwide by 2020. Bringing wide-area connectivity for the IoT using satellite technology is therefore an attractive solution to complement terrestrial networks, allowing densification and coverage extension in remote areas. This paper deals with seamless integration of satellites and high altitude platforms (HAPS) into 5G networks. It describes the necessary modifications to operate on 5G systems in order to take satellite and HAPS specifics into account. Link budget calculations and system dimensioning, including channel modeling, are provided to determine the required satellite and HAPS performance as well as to estimate the number of served users per km².","PeriodicalId":345352,"journal":{"name":"2017 IEEE Globecom Workshops (GC Wkshps)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129997904","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}
Junting Chen, Omid Esrafilian, D. Gesbert, U. Mitra
{"title":"Efficient Algorithms for Air-to-Ground Channel Reconstruction in UAV-Aided Communications","authors":"Junting Chen, Omid Esrafilian, D. Gesbert, U. Mitra","doi":"10.1109/GLOCOMW.2017.8269065","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2017.8269065","url":null,"abstract":"This paper develops an efficient algorithm to learn and reconstruct from a small measurement samples an air-to-ground radio map with fine- grained propagation details so as to predict the signal strength between a wireless equipped UAV and arbitrary ground users, and ultimately the optimal position of the UAV as a mobile relay. In this paper, a joint data clustering and parameter estimation algorithm is developed to learn an multi-segment propagation model from energy measurements that may contain large observation noise. To reduce the reconstruction complexity, we propose to learn a hidden multi-class virtual obstacle model to help efficiently predict the air-to-ground channel. Numerical results demonstrate that the channel prediction error is significantly reduced, and meanwhile, the radio map reconstruction time is reduced to 1/300.","PeriodicalId":345352,"journal":{"name":"2017 IEEE Globecom Workshops (GC Wkshps)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131502853","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}