{"title":"Semantic Coding for Text Transmission: An Iterative Design","authors":"Shengshi Yao;Kai Niu;Sixian Wang;Jincheng Dai","doi":"10.1109/TCCN.2022.3192407","DOIUrl":"10.1109/TCCN.2022.3192407","url":null,"abstract":"We consider the wireless text transmission using joint source-channel coding (JSCC). Classical source coding only considers the syntactic information based on probabilistic models, ignoring the meaning of source messages. Neural network based joint source and channel coders handle the source semantic information more efficiently. However, existing semantic transmission using end-to-end neural networks do not generalize well under varying channel conditions. To tackle this, we propose a semi-neural framework with an iterative architecture, named iterative semantic JSCC (IS-JSCC). Specifically, at each iteration, the remaining semantics is extracted from the intermediate decoded text and is then used as a priori information for the channel decoder in the next iteration. Instead of reconstructing text explicitly, we synthesize the semantics of candidate words in the embedding space, weighted by their posterior probability. This soft semantic synthesis alleviates the error propagation and reduces the complexity of iterative decoding as well. Results show that compared to full-neural designs, the proposed framework can improve the quality of text reconstruction by joint iterative decoding and exhibit better robustness over wireless channels.","PeriodicalId":13069,"journal":{"name":"IEEE Transactions on Cognitive Communications and Networking","volume":"8 4","pages":"1594-1603"},"PeriodicalIF":8.6,"publicationDate":"2022-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41307189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mingjun Dai;Ziying Zheng;Zhaoyan Hong;Shengli Zhang;Hui Wang
{"title":"Edge Computing-Aided Coded Vertical Federated Linear Regression","authors":"Mingjun Dai;Ziying Zheng;Zhaoyan Hong;Shengli Zhang;Hui Wang","doi":"10.1109/TCCN.2022.3174615","DOIUrl":"10.1109/TCCN.2022.3174615","url":null,"abstract":"For the training process of federated linear regression (FLR), which is the simplest form of federated learning, the integrated computation at each company is slowed down either by huge volume data or by time-consuming homomorphic encryption. Targetted at accelerating the training process of FLR, through the incorporation of edge computing aided coded distributed computing (CDC) into intensive computation (matrix multiplication), a novel coded FLR framework is proposed where several edge nodes aid the computing of one company. Two schemes, including linear combination (LC)-based vertical FLR and Matdot-based vertical FLR, are proposed and designed, which enjoy in-parallel computation and homomorphic encryption at the edge nodes. Since workload at each edge node is reduced significantly, the training runtime of these two schemes may be reduced significantly. Numerical studies show that our proposed coded schemes outperform traditional uncoded schemes significantly in terms of overall runtime (sum of encoding, computing, and decoding phases) of the training process. Besides, among the two proposed coded schemes, LC-based scheme and Matdot-based scheme each has its own advantage scenarios which conforms with the analysis.","PeriodicalId":13069,"journal":{"name":"IEEE Transactions on Cognitive Communications and Networking","volume":"8 3","pages":"1543-1551"},"PeriodicalIF":8.6,"publicationDate":"2022-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41461689","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Tiep M. Hoang;Dong Liu;Thien Van Luong;Jiankang Zhang;Lajos Hanzo
{"title":"Deep Learning Aided Physical-Layer Security: The Security Versus Reliability Trade-Off","authors":"Tiep M. Hoang;Dong Liu;Thien Van Luong;Jiankang Zhang;Lajos Hanzo","doi":"10.1109/TCCN.2021.3138392","DOIUrl":"10.1109/TCCN.2021.3138392","url":null,"abstract":"This paper considers a communication system whose source can learn from channel-related data, thereby making a suitable choice of system parameters for security improvement. The security of the communication system is optimized using deep neural networks (DNNs). More explicitly, the associated security vs reliability trade-off problem is characterized in terms of the symbol error probabilities and the discrete-input continuous-output memoryless channel (DCMC) capacities. A pair of loss functions were defined by relying on the Lagrangian and on the monotonic-function based techniques. These were then used for managing the learning/training process of the DNNs for finding near-optimal solutions to the associated non-convex problem. The Lagrangian technique was shown to approach the performance of the exhaustive search. We concluded by characterizing the security vs reliability trade-off in terms of the intercept probability vs the outage probability.","PeriodicalId":13069,"journal":{"name":"IEEE Transactions on Cognitive Communications and Networking","volume":"8 2","pages":"442-453"},"PeriodicalIF":8.6,"publicationDate":"2021-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41301820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Deterministic Move Lists for Federal Incumbent Protection in the CBRS Band","authors":"Thao T. Nguyen;Michael R. Souryal","doi":"10.1109/TCCN.2020.3030643","DOIUrl":"10.1109/TCCN.2020.3030643","url":null,"abstract":"The 3.5 GHz citizens broadband radio service (CBRS) band in the U.S. is a key portion of mid-band spectrum shared between commercial operators and existing federal and non-federal incumbents. To protect the federal incumbents from harmful interference, a spectrum access system (SAS) is required to use a common, standardized algorithm, called the move list algorithm, to suspend transmissions of some CBRS devices (CBSDs) on channels in which the incumbent becomes active. However, the current reference move list implementation used for SAS testing is non-deterministic in that it uses a Monte Carlo estimate of the \u0000<inline-formula> <tex-math>$95^{mathrm {th}}$ </tex-math></inline-formula>\u0000 percentile of the aggregate interference from CBSDs to the incumbent. This leads to uncertainty in move list results and in the aggregate interference check of the test. This article uses upper and lower bounds on the aggregate interference distribution to compute deterministic move lists. These include the reference move list used by the testing system and an operational move list used by the SAS itself. We evaluate the performance of the proposed deterministic move lists using reference implementations of the standards and simulated CBSD deployments in the vicinity of federal incumbent dynamic protection areas.","PeriodicalId":13069,"journal":{"name":"IEEE Transactions on Cognitive Communications and Networking","volume":"7 3","pages":"790-801"},"PeriodicalIF":8.6,"publicationDate":"2020-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TCCN.2020.3030643","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39174987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance Impact of Coexistence Groups in a GAA-GAA Coexistence Scheme in the CBRS Band","authors":"Weichao Gao;Anirudha Sahoo","doi":"10.1109/TCCN.2020.3003027","DOIUrl":"10.1109/TCCN.2020.3003027","url":null,"abstract":"The General Authorized Access (GAA) users in the Citizens Broadband Radio Service (CBRS) band are the lowest priority users. They must make sure that they do not cause harmful interference to the higher tier users while cooperating with each other to minimize potential interference among themselves. Thus, efficient GAA coexistence scheme is essential for the operation of GAA users and to obtain high spectrum utilization. Towards this goal, the Wireless Innovation Forum (WInnForum) has recommended three schemes to facilitate GAA-GAA coexistence. We had reported a performance study of one of these schemes (called Approach 1), but that study did not have any Coexistence Group (CxG). A CxG is responsible for managing interference among its CBRS devices (CBSDs). In this paper, we study the performance of Approach 1 without CxGs as well as with different number of CxGs, in various configurations. We conduct our study around two locations in the USA using actual terrain and land cover data of the continental USA. We evaluate performance of the scheme at different deployment densities, using different propagation models at those two locations with different number of CxGs. We provide some interesting insights into the costs and benefits of having CxGs in the deployment.","PeriodicalId":13069,"journal":{"name":"IEEE Transactions on Cognitive Communications and Networking","volume":"7 1","pages":"184-196"},"PeriodicalIF":8.6,"publicationDate":"2020-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TCCN.2020.3003027","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39090165","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Spectrum Resource Allocation Based on Cooperative NOMA With Index Modulation","authors":"Xuan Chen;Miaowen Wen;Tianqi Mao;Shuping Dang","doi":"10.1109/TCCN.2020.2991426","DOIUrl":"10.1109/TCCN.2020.2991426","url":null,"abstract":"In this paper, two novel spectrum resource allocation schemes, based on orthogonal frequency division multiplexing with index modulation (OFDM-IM) and dual-mode OFDM-IM, are proposed for a three-node cooperative non-orthogonal multiple access (C-NOMA) system. In the first scheme, we allocate IM bits to serve the cell-edge user, and save the transmit power to assist the delivery of constellation symbols. Alternatively, constrained by the spectral efficiency (SE), the rest information bits of the cell-edge user can be carried by the conventional signal constellation. In the second scheme, to further eliminate the interference between users and boost the SE, different modulation modes (Mode I and Mode II) are employed to distinguish the subcarriers of the cell-center and cell-edge users, and to encode the incoming bit stream from these users, respectively. Furthermore, we consider two different detectors for the cell-edge user, i.e., the optimal/suboptimal maximum-likelihood detectors. Asymptotically tight bounds on the bit error rate of the above-mentioned users are derived in closed-form. Finally, simulation results verify the theoretical analysis and show that the proposed schemes have the potential to outperform C-NOMA.","PeriodicalId":13069,"journal":{"name":"IEEE Transactions on Cognitive Communications and Networking","volume":"6 3","pages":"946-958"},"PeriodicalIF":8.6,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TCCN.2020.2991426","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41349305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Design of Communication Systems Using Deep Learning: A Variational Inference Perspective","authors":"Vishnu Raj;Sheetal Kalyani","doi":"10.1109/TCCN.2020.2985371","DOIUrl":"10.1109/TCCN.2020.2985371","url":null,"abstract":"Recent research in the design of end to end communication system using deep learning has produced models which can outperform traditional communication schemes. Most of these architectures leveraged autoencoders to design the encoder at the transmitter and decoder at the receiver and train them jointly by modeling transmit symbols as latent codes from the encoder. However, in communication systems, the receiver has to work with noise corrupted versions of transmit symbols. Traditional autoencoders are not designed to work with latent codes corrupted with noise. In this work, we provide a framework to design end to end communication systems which accounts for the existence of noise corrupted transmit symbols. The proposed method uses deep neural architecture. An objective function for optimizing these models is derived based on the concepts of variational inference. Further, domain knowledge such as channel type can be systematically integrated into the objective. Through numerical simulation, the proposed method is shown to consistently produce models with better packing density and achieving it faster in multiple popular channel models as compared to the previous works leveraging deep learning models.","PeriodicalId":13069,"journal":{"name":"IEEE Transactions on Cognitive Communications and Networking","volume":"6 4","pages":"1320-1334"},"PeriodicalIF":8.6,"publicationDate":"2020-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TCCN.2020.2985371","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41306793","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}