{"title":"Reduced Complexity SCL Decoding of U-UV Codes Through List Pruning","authors":"Wenhao Chen, Li Chen, Huazi Zhang","doi":"10.1109/ICCCWorkshops57813.2023.10233707","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233707","url":null,"abstract":"U-UV structural coding with algebraic component codes can provide competent error-correction performance in the short-to-medium length regime. Constituted by BCH component codes and its ordered statistics decoding (OSD), the successive cancellation list (SCL) decoding of U-UV codes can outperform that of cyclic redundancy check (CRC)-polar codes. However, this list decoding complexity becomes formidable as the decoding output list size L increases. This paper proposes the list pruning techniques for reducing the SCL complexity. It eliminates the unpromising decoding paths, in an effort to reduce redundant decoding operations. We show that this can be realized through either estimating the a posterior probability (APP) of a decoding path, or estimating the dynamic performance loss. Subsequently, two list decoding schemes are proposed for U-UV codes. Our simulation results show that they can both effectively reduce the SCL decoding complexity of U-UV codes with marginal performance loss.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121181945","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}
Kai Xiong, Rui Wang, S. Leng, Quanxin Zhao, Meie Peng
{"title":"Graph Convolutional Integration based Distributed Multi-View Learning in Urban Air Mobility","authors":"Kai Xiong, Rui Wang, S. Leng, Quanxin Zhao, Meie Peng","doi":"10.1109/ICCCWorkshops57813.2023.10233715","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233715","url":null,"abstract":"Urban Air Mobility (UAM) expands vehicles from the ground to the near-ground space, envisioned as a revolution for transportation systems. Comprehensive scene perception is the foundation for Autonomous Air Vehicles (AAV). However, AAV encounters a primary perception challenge: three-dimensional piloting makes the visual perception of AAVs easily obstructed by skyscrapers in urban. High perception learning requirements conflict with the view-limited visual information. To overcome the challenge, multi-view learning has been proposed to collect multi-view data to train the onboard deep learning model. But traditional multi-view learning is deployed on a single device operating centrally, which is difficult to deploy in dynamic environments. Accordingly, this paper proposes Graph Convolutional Network (GCN) based Distributed Multi-View learning (GCNDMV), taking account of GCN relation extractability to facilitate single-view representation learning integration. The proposed distributed multi-view learning framework allows distinct single-view representation learning integration. Moreover, due to the diversity gain of different single-view learning, various single-view representation learning of the GCN-DMV outperforms a homogeneous single-view representation learning of GCN-DMV in terms of recognition accuracy. Simulation experiments are conducted over a realistic multi-view dataset to verify the efficiency of the distributed multi-view learning framework.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123623923","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}
Shuangyue Liu, J. Yin, Xuexin Li, Wenyi Li, Peirong Xie
{"title":"Integration of ToB Service and ToC Service for 5G-Advanced Networks","authors":"Shuangyue Liu, J. Yin, Xuexin Li, Wenyi Li, Peirong Xie","doi":"10.1109/ICCCWorkshops57813.2023.10233842","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233842","url":null,"abstract":"The fifth-generation (5G) network enables vertical industries and facilitates the digital and intelligent transformation of industries. However, 5G to business (ToB) and 5G to customer (ToC) cannot be accessed simultaneously by universal terminals, which poses inconvenience to customers in the education, government, cultural tourism. In this paper, a dual-domain fast network (DDFN) with network-side routed selected solution (NRSS) is proposed at the 5G core architecture and process level, which integrates ToB and ToC services for 5G-advanced networks. The DDFN customers can access the local public network and nearby private network simultaneously and imperceptibly with universal terminals at anytime and anywhere. NRSS is a routing scheme of DDFN, which directs various services onto distinct protocol data unit (PDU) sessions. Private network PDU sessions are automatically created when triggered by a particular policy. Compared to universal or standard solutions, NRSS without the upgrade of terminals exhibits superior capabilities in interprovincial roaming and compatibility with various access modes. In summary, NRSS-based DDFN enables service-based diversion without upgrading terminals and wireless infrastructure, which is a potential solution for applications in 5G-advanced industries.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128556726","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}
Yuan Ren, Zhouting Ding, Xuewei Zhang, Fan Jiang, Junxuan Wang
{"title":"Incremental Relay Inspired Mode Selection for SWIPT-Enabled NOMA Systems with Imperfect SIC and Random User Locations","authors":"Yuan Ren, Zhouting Ding, Xuewei Zhang, Fan Jiang, Junxuan Wang","doi":"10.1109/ICCCWorkshops57813.2023.10233783","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233783","url":null,"abstract":"This paper proposes transmission mode switching for the simultaneous wireless information and power transfer enabled non-orthogonal multiple access (NOMA) systems with imperfect successive interference cancellation (SIC) and random user locations. The system is composed of a base station (BS) and multiple near and far users. The location of the near and far users follows a homogeneous Poisson point process. The near users adopt incremental relay protocol and the simultaneous wireless information and power transfer enabled system can switch between cooperative and non-cooperative transmission mode based on 1-bit feedback of the far users. Due to the decoding errors of practical SIC process, imperfect SIC is considered at the near user. Under the proposed mode switching scheme, the closed-form expressions for the outage probability and system throughput are obtained considering random user locations. Numerical results demonstrate the correctness of the theoretical analysis and show that the proposed scheme outperforms the traditional cooperative and non-cooperative NOMA schemes in terms of outage and throughput performance.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126240987","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}
Zhouxiang Zhao, Zhaohui Yang, Ye Hu, Licheng Lin, Zhaoyang Zhang
{"title":"Semantic Information Extraction for Text Data with Probability Graph","authors":"Zhouxiang Zhao, Zhaohui Yang, Ye Hu, Licheng Lin, Zhaoyang Zhang","doi":"10.1109/ICCCWorkshops57813.2023.10233741","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233741","url":null,"abstract":"In this paper, the problem of semantic information extraction for resource constrained text data transmission is studied. In the considered model, a sequence of text data need to be transmitted within a communication resource-constrained network, which only allows limited data transmission. Thus, at the transmitter, the original text data is extracted with natural language processing techniques. Then, the extracted semantic information is captured in a knowledge graph. An additional probability dimension is introduced in this graph to capture the importance of each information. This semantic information extraction problem is posed as an optimization framework whose goal is to extract most important semantic information for transmission. To find an optimal solution for this problem, a Floyd’s algorithm based solution coupled with an efficient sorting mechanism is proposed. Numerical results testify the effectiveness of the proposed algorithm with regards to two novel performance metrics including semantic uncertainty and semantic similarity.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121685731","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}
Chong Zhang, Bo Wang, Mingan Luan, Jiahui Yang, Yanping Zhao, Fengye Hu
{"title":"Power Allocation for Aerial RIS-assisted Jamming Nodes in Distributed MIMO Radar Networks","authors":"Chong Zhang, Bo Wang, Mingan Luan, Jiahui Yang, Yanping Zhao, Fengye Hu","doi":"10.1109/ICCCWorkshops57813.2023.10233714","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233714","url":null,"abstract":"In the current rapid development of sensing systems, ensuring system security has become increasingly important. Reconfigurable Intelligent Surface (RIS) has shown potential in jamming radar localization due to their adaptive capability in reconfiguring wireless environments. In this paper, a novel jamming strategy is considered for the distributed MIMO radar system, in which the contribution of the RIS is to change the signal propagation environment to degrade radar localization performance. Firstly, we derive the Cramér-Rao lower bound (CRLB) as the performance metric. Subsequently, a joint optimization problem of RIS phase design and jamming power allocation is formulated with the aim of maximizing the minimum CRLB for locating UAV targets. On this basis, we propose a two-step-based approach to solve this non-convex problem of joint optimization. In the first step, the RIS phase design problem is addressed with semi-definite programming (SDP) and Gaussian randomization techniques. In the second step, an analytical solution for power optimization is obtained by employing the Lagrange multiplier method. Simulation results show the superior performance of the proposed strategy and verify the theoretical findings.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128171224","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}
Shiji Wang, Shida Xia, Sha Liu, Yan Zhang, Chang Cao
{"title":"Transfer Learning-Based Physical Layer Authentication for Wireless Networks Handover","authors":"Shiji Wang, Shida Xia, Sha Liu, Yan Zhang, Chang Cao","doi":"10.1109/ICCCWorkshops57813.2023.10233819","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233819","url":null,"abstract":"In dynamic access networks, terminals face frequent network handover which requires authentication handover to ensure the security of network access. Physical layer authentication based on machine learning will cause large computation overhead and communication delay for network. Therefore, this paper designs a fast authentication handover mechanism based on transfer learning, which makes full use of the source network authentication model and adopts transfer learning algorithm to transfer the previously trained model to target network. Target network continues to train on the basis of the model trained by source network, which simplifies the process of retraining authentication model during network handover greatly.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"203 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127029729","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}
Dongyang Peng, Yi Fang, Huan Ma, Pingping Chen, Meiyuan Miao
{"title":"An Intelligent Detector for Carrier Index Differential Chaos Shift Keying System","authors":"Dongyang Peng, Yi Fang, Huan Ma, Pingping Chen, Meiyuan Miao","doi":"10.1109/ICCCWorkshops57813.2023.10233810","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233810","url":null,"abstract":"Inspired by the orthogonal time frequency space modulation, carrier index differential chaos shift keying (CI-DCSK) system has been proposed and attracted more and more attention because of its high-efficiency and low-complexity advantages. In this paper, a deep learning based intelligent detector for CI-DCSK system, referred to as DL-CI-DCSK detector, is proposed to realize more reliable transmission. The proposed detector inherits the advantages of neural network and traditional energy detection. The proposed DL-CI-DCSK detector first recovers the index bits using a neural network and then using the index bits to demodulate the modulation bits. The designed network structure mainly exploits the characteristics of long short-term memory unit and multiple fully connected layers to extract and integrate the correlation and features of the modulated signals. Simulation results show that the proposed intelligent detector can achieve better bit-error-rate (BER) performance than conventional detectors over multipath Rayleigh fading channels.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133658811","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}
Haihui Xie, M. Xia, Peiran Wu, Shuai Wang, Kaibin Huang
{"title":"Decentralized Federated Learning With Asynchronous Parameter Sharing","authors":"Haihui Xie, M. Xia, Peiran Wu, Shuai Wang, Kaibin Huang","doi":"10.1109/ICCCWorkshops57813.2023.10233712","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233712","url":null,"abstract":"Federated learning (FL) enables wireless terminals to collaboratively learn a shared parameter model while keeping all the training data on devices per se. Whatever parameter sharing is applied, the learning model shall adapt to distinct network architectures because an improper learning model will deteriorate learning performance and, even worse, lead to model divergence, especially for the asynchronous transmission in resource-limited distributed networks. To address this issue, this paper proposes a decentralized learning model and develops an asynchronous parameter-sharing algorithm for resource-limited distributed Internet of Things (IoT) networks. It can improve learning efficiency and realize efficient communication. By jointly accounting for the convergence bound of federated learning and the transmission delay of wireless communications, we develop a node scheduling and bandwidth allocation algorithm to improve the learning performance. Extensive simulation results corroborate the effectiveness of the distributed algorithm in terms of fast learning model convergence and low transmission delay.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130409420","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":"Rate-Compatible Shortened PAC Codes","authors":"Xinyi Gu, M. Rowshan, Jinhong Yuan","doi":"10.1109/ICCCWorkshops57813.2023.10233795","DOIUrl":"https://doi.org/10.1109/ICCCWorkshops57813.2023.10233795","url":null,"abstract":"Rate matching techniques, such as puncturing and shortening, have been developed for polar codes to accommodate the specific code length requirements in practical applications. However, the existing shortening techniques cannot be directly applied to polarization-adjusted convolutional (PAC) codes. In this work, we propose an approach to shorten PAC codes by imposing constraints on the precoding process based on the shortening patterns. The proposed technique leads to up to 0.2 dB power gain in the error correction performance compared to shortened polar codes. This power gain can be further improved up to 0.45 dB by employing Reed-Muller (RM) polar rate profile based on the 5G universal reliability sequence. Furthermore, we shed light on these improvements by analysing the intersection of the shortening pattern and the GN-row decomposition of minimum weight codewords and its impact on the formation of these codewords, and evaluation of the error coefficients of the shortened codes versus their performance.","PeriodicalId":201450,"journal":{"name":"2023 IEEE/CIC International Conference on Communications in China (ICCC Workshops)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130386296","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}