Pub Date : 2017-12-01DOI: 10.1109/ICSPCS.2017.8270459
Henning Idsøe, Mohamed Hamid, Linga Reddy Cenkeramaddi, Thomas Jordbru, B. Beferull-Lozano
This paper validates the functionality of an algorithm for spectrum cartography, generating a radio environment map (REM) using adaptive radial basis functions (RBF) based on a limited number of measurements. The power at all locations is estimated as a linear combination of different RBFs without assuming any prior information about either power spectral densities (PSD) of the transmitters or their locations. The RBFs are represented as centroids at optimized locations, using machine learning to jointly optimize their positions, weights and Gaussian decaying parameters. Optimization is performed using expectation maximization with a least squares loss function and a quadratic regularizer. Measurements from 14 receivers, randomly divided into 2 sets, are used for training and validating the algorithm. Estimations are compared to the validation set by means of normalized mean square error (NMSE), and the obtained results verify the functionality of the algorithm.
{"title":"Experimental validation for spectrum cartography using adaptive multi-kernels","authors":"Henning Idsøe, Mohamed Hamid, Linga Reddy Cenkeramaddi, Thomas Jordbru, B. Beferull-Lozano","doi":"10.1109/ICSPCS.2017.8270459","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270459","url":null,"abstract":"This paper validates the functionality of an algorithm for spectrum cartography, generating a radio environment map (REM) using adaptive radial basis functions (RBF) based on a limited number of measurements. The power at all locations is estimated as a linear combination of different RBFs without assuming any prior information about either power spectral densities (PSD) of the transmitters or their locations. The RBFs are represented as centroids at optimized locations, using machine learning to jointly optimize their positions, weights and Gaussian decaying parameters. Optimization is performed using expectation maximization with a least squares loss function and a quadratic regularizer. Measurements from 14 receivers, randomly divided into 2 sets, are used for training and validating the algorithm. Estimations are compared to the validation set by means of normalized mean square error (NMSE), and the obtained results verify the functionality of the algorithm.","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"11 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":"126400692","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 : 2017-12-01DOI: 10.1109/ICSPCS.2017.8270488
Yuki Matsumura, Lihui Wang, K. Takeda, Satoshi Nagata
In this paper, channel design for the New Radio (NR) physical uplink control channel (NR PUCCH) of 1 symbol (short-PUCCH) carrying up to 2 bits of acknowledgement (ACK)/negative ACK (NACK) is investigated. Two types of short-PUCCH designs, i.e., short-PUCCH type A and short-PUCCH type B, are compared and evaluated by computer simulation. In short-PUCCH type A, reference signal (RS) and ACK/NACK are multiplexed in different subcarriers within the same symbol; in short-PUCCH type B, no RS is used and ACK/NACK are indicated by which sequence is selected among the sequence candidates. The link-level evaluation results and link-budget analysis show that short-PUCCH type B has 40∼60 % larger coverage than short-PUCCH type A.
本文研究了新无线电(NR)物理上行控制信道(NR PUCCH)的信道设计，该信道为1个符号(短PUCCH)，携带最多2位确认(ACK)/负确认(NACK)。通过计算机仿真对短pucch A型和短pucch B型两种短pucch设计进行了比较和评价。在短pucch类型A中，参考信号(RS)和ACK/NACK在同一符号内的不同子载波中复用;在short-PUCCH type B中，不使用RS，通过在候选序列中选择哪个序列来表示ACK/NACK。链路级评价结果和链路预算分析表明，短pucch B型的覆盖率比短pucch A型高40 ~ 60%。
{"title":"5G new RAT uplink control channel for small payloads","authors":"Yuki Matsumura, Lihui Wang, K. Takeda, Satoshi Nagata","doi":"10.1109/ICSPCS.2017.8270488","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270488","url":null,"abstract":"In this paper, channel design for the New Radio (NR) physical uplink control channel (NR PUCCH) of 1 symbol (short-PUCCH) carrying up to 2 bits of acknowledgement (ACK)/negative ACK (NACK) is investigated. Two types of short-PUCCH designs, i.e., short-PUCCH type A and short-PUCCH type B, are compared and evaluated by computer simulation. In short-PUCCH type A, reference signal (RS) and ACK/NACK are multiplexed in different subcarriers within the same symbol; in short-PUCCH type B, no RS is used and ACK/NACK are indicated by which sequence is selected among the sequence candidates. The link-level evaluation results and link-budget analysis show that short-PUCCH type B has 40∼60 % larger coverage than short-PUCCH type A.","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"16 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":"121555246","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 : 2017-07-28DOI: 10.1109/ICSPCS.2017.8270510
Conrad Sanderson, Ryan R. Curtin
Modelling of multivariate densities is a core component in many signal processing, pattern recognition and machine learning applications. The modelling is often done via Gaussian mixture models (GMMs), which use computationally expensive and potentially unstable training algorithms. We provide an overview of a fast and robust implementation of GMMs in the C++ language, employing multi-threaded versions of the Expectation Maximisation (EM) and k-means training algorithms. Multi-threading is achieved through reformulation of the EM and k-means algorithms into a MapReduce-like framework. Furthermore, the implementation uses several techniques to improve numerical stability and modelling accuracy. We demonstrate that the multi-threaded implementation achieves a speedup of an order of magnitude on a recent 16 core machine, and that it can achieve higher modelling accuracy than a previously well-established publically accessible implementation. The multi-threaded implementation is included as a user-friendly class in recent releases of the open source Armadillo C++ linear algebra library. The library is provided under the permissive Apache 2.0 license, allowing unencumbered use in commercial products.
{"title":"An open source C++ implementation of multi-threaded Gaussian mixture models, k-means and expectation maximisation","authors":"Conrad Sanderson, Ryan R. Curtin","doi":"10.1109/ICSPCS.2017.8270510","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270510","url":null,"abstract":"Modelling of multivariate densities is a core component in many signal processing, pattern recognition and machine learning applications. The modelling is often done via Gaussian mixture models (GMMs), which use computationally expensive and potentially unstable training algorithms. We provide an overview of a fast and robust implementation of GMMs in the C++ language, employing multi-threaded versions of the Expectation Maximisation (EM) and k-means training algorithms. Multi-threading is achieved through reformulation of the EM and k-means algorithms into a MapReduce-like framework. Furthermore, the implementation uses several techniques to improve numerical stability and modelling accuracy. We demonstrate that the multi-threaded implementation achieves a speedup of an order of magnitude on a recent 16 core machine, and that it can achieve higher modelling accuracy than a previously well-established publically accessible implementation. The multi-threaded implementation is included as a user-friendly class in recent releases of the open source Armadillo C++ linear algebra library. The library is provided under the permissive Apache 2.0 license, allowing unencumbered use in commercial products.","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"26 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130190752","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 : 1900-01-01DOI: 10.1109/ICSPCS.2017.8270489
F. Khan, M. Portmann
Future cellular networks utilizes complex network technologies that makes it hard to achieve fine-grained traffic control. Moreover dynamic channel conditions alongwith finite backhaul capacity, limits the desired quality of service (QoS) objectives. This work aims to design a framework for software-defined cellular networks (SDCN) and suggests channel and QoS-aware load balancing procedures that jointly consider both access and back-haul networks. Based on the overall access and backhaul load information we first formulate optimization problems for both QoS and non-QoS users, respectively, considering their specific objectives. Then a realistic algorithm is proposed consisting of users scheduling, load estimation, handover decision, admission, and rate control procedures. To achieve optimal control of backhaul and access network segments in a timely efficient manner, the procedures are envisioned to run in a distributed fashion. Using our system-level SDN-LTE testbed developed in the network simulator (NS3), the proposed system is evaluated and compared with other state-of-the-art cell association algorithms that either consider the fairness in load distribution factor or just maximizes the end user rate while ignoring the load metric.
{"title":"Backhaul, QoS, and channel-aware load balancing optimization in SDN-based LTE networks","authors":"F. Khan, M. Portmann","doi":"10.1109/ICSPCS.2017.8270489","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270489","url":null,"abstract":"Future cellular networks utilizes complex network technologies that makes it hard to achieve fine-grained traffic control. Moreover dynamic channel conditions alongwith finite backhaul capacity, limits the desired quality of service (QoS) objectives. This work aims to design a framework for software-defined cellular networks (SDCN) and suggests channel and QoS-aware load balancing procedures that jointly consider both access and back-haul networks. Based on the overall access and backhaul load information we first formulate optimization problems for both QoS and non-QoS users, respectively, considering their specific objectives. Then a realistic algorithm is proposed consisting of users scheduling, load estimation, handover decision, admission, and rate control procedures. To achieve optimal control of backhaul and access network segments in a timely efficient manner, the procedures are envisioned to run in a distributed fashion. Using our system-level SDN-LTE testbed developed in the network simulator (NS3), the proposed system is evaluated and compared with other state-of-the-art cell association algorithms that either consider the fairness in load distribution factor or just maximizes the end user rate while ignoring the load metric.","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116100981","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 : 1900-01-01DOI: 10.1109/ICSPCS.2017.8270500
F. Khan, M. Portmann
Future cellular networks utilizes complex network technologies that makes it hard to achieve fine-grained traffic control. Moreover dynamic channel conditions alongwith finite backhaul capacity, limits the desired quality of service (QoS) objectives. This work aims to design a framework for software-defined cellular networks (SDCN) and suggests channel and QoS-aware load balancing procedures that jointly consider both access and back-haul networks. Based on the overall access and backhaul load information we first formulate optimization problems for both QoS and non-QoS users, respectively, considering their specific objectives. Then a realistic algorithm is proposed consisting of users scheduling, load estimation, handover decision, admission, and rate control procedures. To achieve optimal control of backhaul and access network segments in a timely efficient manner, the procedures are envisioned to run in a distributed fashion. Using our system-level SDN-LTE testbed developed in the network simulator (NS3), the proposed system is evaluated and compared with other state-of-the-art cell association algorithms that either consider the fairness in load distribution factor or just maximizes the end user rate while ignoring the load metric.
{"title":"Backhaul, QoS, and channel-aware load balancing optimization in SDN-based LTE networks","authors":"F. Khan, M. Portmann","doi":"10.1109/ICSPCS.2017.8270500","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270500","url":null,"abstract":"Future cellular networks utilizes complex network technologies that makes it hard to achieve fine-grained traffic control. Moreover dynamic channel conditions alongwith finite backhaul capacity, limits the desired quality of service (QoS) objectives. This work aims to design a framework for software-defined cellular networks (SDCN) and suggests channel and QoS-aware load balancing procedures that jointly consider both access and back-haul networks. Based on the overall access and backhaul load information we first formulate optimization problems for both QoS and non-QoS users, respectively, considering their specific objectives. Then a realistic algorithm is proposed consisting of users scheduling, load estimation, handover decision, admission, and rate control procedures. To achieve optimal control of backhaul and access network segments in a timely efficient manner, the procedures are envisioned to run in a distributed fashion. Using our system-level SDN-LTE testbed developed in the network simulator (NS3), the proposed system is evaluated and compared with other state-of-the-art cell association algorithms that either consider the fairness in load distribution factor or just maximizes the end user rate while ignoring the load metric.","PeriodicalId":268205,"journal":{"name":"2017 11th International Conference on Signal Processing and Communication Systems (ICSPCS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114392343","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
扫码关注我们
求助内容：
应助结果提醒方式：