Pub Date : 2026-02-10DOI: 10.1109/tcomm.2026.3663304
Yifan Sun, Rang Liu, Ming Li, Qian Liu
{"title":"One-Bit DAC/ADC Transceiver Designs for Efficient MIMO-ISAC Systems","authors":"Yifan Sun, Rang Liu, Ming Li, Qian Liu","doi":"10.1109/tcomm.2026.3663304","DOIUrl":"https://doi.org/10.1109/tcomm.2026.3663304","url":null,"abstract":"","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"56 1","pages":""},"PeriodicalIF":8.3,"publicationDate":"2026-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146161385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-10DOI: 10.1109/tcomm.2026.3663231
Jiping Luo, Nikolaos Pappas
{"title":"Exploiting Data Significance in Remote Estimation of Discrete-State Markov Sources","authors":"Jiping Luo, Nikolaos Pappas","doi":"10.1109/tcomm.2026.3663231","DOIUrl":"https://doi.org/10.1109/tcomm.2026.3663231","url":null,"abstract":"","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"299 1","pages":""},"PeriodicalIF":8.3,"publicationDate":"2026-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146161395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-10DOI: 10.1109/tcomm.2026.3663153
Kexin Zhou, Jianguo Li, Quanchao Zhou, Neng Ye, Kai Yang, Jianping An
{"title":"Modeling and Analysis of Terahertz Inter-Satellite Communication-Ranging System under Platform Vibrations","authors":"Kexin Zhou, Jianguo Li, Quanchao Zhou, Neng Ye, Kai Yang, Jianping An","doi":"10.1109/tcomm.2026.3663153","DOIUrl":"https://doi.org/10.1109/tcomm.2026.3663153","url":null,"abstract":"","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"311 1","pages":""},"PeriodicalIF":8.3,"publicationDate":"2026-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146161451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-10DOI: 10.1109/tcomm.2026.3663270
Bo Zhu, Fei Du, Ming Yang, Yiwen Zhang, Suiyan Geng, Zhenyu Zhou, Xiongwen Zhao
{"title":"DL-Enhanced Channel Parameter Prediction Scheme based on Adaptive Meta Mask R-CNN Model","authors":"Bo Zhu, Fei Du, Ming Yang, Yiwen Zhang, Suiyan Geng, Zhenyu Zhou, Xiongwen Zhao","doi":"10.1109/tcomm.2026.3663270","DOIUrl":"https://doi.org/10.1109/tcomm.2026.3663270","url":null,"abstract":"","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"242 1","pages":""},"PeriodicalIF":8.3,"publicationDate":"2026-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146161458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-09DOI: 10.1109/tcomm.2026.3657401
Yuanwen Liu, Bruno Clerckx
{"title":"Rate-Splitting Multiple Access for Coexistence of Semantic and Bit Communications","authors":"Yuanwen Liu, Bruno Clerckx","doi":"10.1109/tcomm.2026.3657401","DOIUrl":"https://doi.org/10.1109/tcomm.2026.3657401","url":null,"abstract":"","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"15 1","pages":""},"PeriodicalIF":8.3,"publicationDate":"2026-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146161154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-09DOI: 10.1109/tcomm.2026.3662396
Wei Xu, Zhaohui Yang, Derrick Wing Kwan Ng, Robert Schober, H. Vincent Poor, Zhaoyang Zhang, Xiaohu You
{"title":"A New Path to Integrated Learning and Communication (ILAC): Large AI Models Leveraging Hyperdimensional Computing","authors":"Wei Xu, Zhaohui Yang, Derrick Wing Kwan Ng, Robert Schober, H. Vincent Poor, Zhaoyang Zhang, Xiaohu You","doi":"10.1109/tcomm.2026.3662396","DOIUrl":"https://doi.org/10.1109/tcomm.2026.3662396","url":null,"abstract":"","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"157 1","pages":""},"PeriodicalIF":8.3,"publicationDate":"2026-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146161151","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-09DOI: 10.1109/TCOMM.2026.3658364
Zhi Wang;Tao Gong;Yingpu Nian;Bo Yi;Xingwei Wang;Xinhao Zhou;Jianhui Lv;Geyong Min;Keqin Li
The core function of quantum networks is to establish high-fidelity quantum entanglement for long-distance communication. However, the main challenge is to efficiently allocate resources under limited conditions, maximize throughput, satisfy end-to-end (E2E) fidelity requirements, and prevent quantum decoherence caused by inefficient routing algorithms. Current research focuses on optimizing either throughput or fidelity, with a lack of approaches that optimize both simultaneously; furthermore, existing algorithms suffer from high computational complexity. To tackle these challenges, this study proposes a Satisfying Fidelity Threshold Routing and Adaptive Purification Strategy (SFTRAP). SFTRAP maximizes throughput for each request by selecting multiple paths and dynamically choosing links for entanglement purification based on the current state of link resources, thus minimizing throughput loss while satisfying fidelity threshold. The strategy also adaptively adjusts the number of purification rounds according to the fidelity threshold, thereby optimizing the time required for deep purification and enhancing algorithmic efficiency. For multi-request scenarios, SFTRAP employs a priority sorting mechanism that takes into account both path cost and path freedom, which refines request scheduling and path selection to create more efficient request combinations, thus further boosting the overall network throughput. Simulation results indicate that SFTRAP surpasses state-of-the-art methods in terms of both throughput and algorithmic efficiency, highlighting its potential for optimizing resources in quantum networks.
{"title":"SFTRAP: Satisfying Fidelity Threshold Routing and Adaptive Purification for Throughput Maximum in Quantum Network","authors":"Zhi Wang;Tao Gong;Yingpu Nian;Bo Yi;Xingwei Wang;Xinhao Zhou;Jianhui Lv;Geyong Min;Keqin Li","doi":"10.1109/TCOMM.2026.3658364","DOIUrl":"10.1109/TCOMM.2026.3658364","url":null,"abstract":"The core function of quantum networks is to establish high-fidelity quantum entanglement for long-distance communication. However, the main challenge is to efficiently allocate resources under limited conditions, maximize throughput, satisfy end-to-end (E2E) fidelity requirements, and prevent quantum decoherence caused by inefficient routing algorithms. Current research focuses on optimizing either throughput or fidelity, with a lack of approaches that optimize both simultaneously; furthermore, existing algorithms suffer from high computational complexity. To tackle these challenges, this study proposes a Satisfying Fidelity Threshold Routing and Adaptive Purification Strategy (SFTRAP). SFTRAP maximizes throughput for each request by selecting multiple paths and dynamically choosing links for entanglement purification based on the current state of link resources, thus minimizing throughput loss while satisfying fidelity threshold. The strategy also adaptively adjusts the number of purification rounds according to the fidelity threshold, thereby optimizing the time required for deep purification and enhancing algorithmic efficiency. For multi-request scenarios, SFTRAP employs a priority sorting mechanism that takes into account both path cost and path freedom, which refines request scheduling and path selection to create more efficient request combinations, thus further boosting the overall network throughput. Simulation results indicate that SFTRAP surpasses state-of-the-art methods in terms of both throughput and algorithmic efficiency, highlighting its potential for optimizing resources in quantum networks.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"74 ","pages":"3952-3967"},"PeriodicalIF":8.3,"publicationDate":"2026-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146161152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-06DOI: 10.1109/tcomm.2026.3662093
Dao Quang Hiep, Nguyen Cong Luong, Shimin Gong, Xingwang Li, Ngoc Hung Nguyen, Dusit Niyato, Dong In Kim
{"title":"Dynamic Multi-layer Aerial System for Latent Diffusion-based Generative AI Inference at the Edge","authors":"Dao Quang Hiep, Nguyen Cong Luong, Shimin Gong, Xingwang Li, Ngoc Hung Nguyen, Dusit Niyato, Dong In Kim","doi":"10.1109/tcomm.2026.3662093","DOIUrl":"https://doi.org/10.1109/tcomm.2026.3662093","url":null,"abstract":"","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"888 1","pages":""},"PeriodicalIF":8.3,"publicationDate":"2026-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146134910","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：