{"title":"Generalized Fourier Transform Pair Codes","authors":"Yaping Lv;Suihua Cai;Xiao Ma","doi":"10.1109/LCOMM.2025.3547330","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3547330","url":null,"abstract":"This letter is concerned with Fourier transform pair (FTP) codes over finite fields. Given any element of order n in a finite field, we can construct an FTP code with length <inline-formula> <tex-math>$2n$ </tex-math></inline-formula>, dimension n, and minimum distance at least <inline-formula> <tex-math>$2sqrt {n}$ </tex-math></inline-formula>. Distinguishingly, an FTP code defined with any element (if it exists) of order 2, 3 or 5 in a finite field is a maximum distance separable code. In this letter, we extend the FTP codes to generalized FTP (GFTP) codes. To show the superiority of the GFTP codes over the FTP codes, we compute the binary weight spectra of the GFTP codes, approaching more close than the FTP codes to that of the random codes. We also apply the ordered statistic decoding with local constraints (LC-OSD) algorithm to the binary image of GFTP codes. Numerical results show that the GFTP codes perform better than the FTP codes as the code length increases. Numerical results also show that GFTP codes are comparable with existing codes of the same code rate and similar code length.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"933-937"},"PeriodicalIF":3.7,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"EraseIMF: Enhancing Deep Learning-Based Few-Shot Modulation Recognition With VMD Random Erasure Augmentation","authors":"Tao Chen;Shilian Zheng;Qi Xuan;Xiaoniu Yang","doi":"10.1109/LCOMM.2025.3547352","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3547352","url":null,"abstract":"During signal transmission, errors inevitably occur, leading to bits being set to zero and affecting the signal’s integrity. To simulate this content loss phenomenon, we adapt the random erasure method from image processing and introduce it into the field of signal processing. By combining it with the time-frequency transformation method Variational Mode Decomposition (VMD), we can generate new samples to expand the training set. This method involves randomly erasing the Intrinsic Mode Functions (IMFs) components decomposed by VMD and then reconstructing the random erasured IMF components to generate new samples, which we call the EraseIMF method. By decomposing the signal, randomly random erasureing certain components, and reconstructing the signal, this method generates diverse augmented data to improve the model’s generalization ability and performance. Experiments have demonstrated that our proposed EraseIMF augmentation method performs well across different random erasure rates and various convolutional networks in few-shot scenario.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"938-942"},"PeriodicalIF":3.7,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dual-Polarized Beyond Diagonal RIS","authors":"Matteo Nerini;Bruno Clerckx","doi":"10.1109/LCOMM.2025.3547175","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3547175","url":null,"abstract":"Beyond diagonal reconfigurable intelligent surface (BD-RIS) is a family of RIS architectures more flexible than conventional RIS. While BD-RIS has been primarily analyzed assuming uni-polarized systems, modern wireless deployments are dual-polarized. To address this gap, this letter investigates the fundamental limits of dual-polarized BD-RIS-aided systems. We derive the scaling laws governing the performance of BD-RIS and the Pareto frontier of the trade-off between performance and circuit complexity enabled by BD-RIS. Theoretical results show that the group-connected RIS with group size 2 provides remarkable gains over conventional RIS in both Rayleigh and line-of-sight (LoS) channels, while maintaining a reduced circuit complexity.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"928-932"},"PeriodicalIF":3.7,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abdulrahman S. Dughri;Taissir Y. Elganimi;Khaled M. Rabie
{"title":"A Novel Beam Tracking Scheme in RIS for Wideband THz Communication Systems","authors":"Abdulrahman S. Dughri;Taissir Y. Elganimi;Khaled M. Rabie","doi":"10.1109/LCOMM.2025.3547435","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3547435","url":null,"abstract":"Terahertz (THz) massive multiple-input multiple-output (mMIMO) has recently gained significant attention because of its ability to deliver a high data rate and offer a high capacity. In this letter, a novel sub-surface of sub-arrays (SSoSA)-based beam tracking scheme is proposed to track mobile users in reconfigurable intelligent surface (RIS)-aided wideband THz mMIMO systems. By considering the sub-connected phase-delay-phase architecture, the proposed scheme can simultaneously track the physical directions of users, unlike traditional schemes that generate one frequency-independent beam in each time slot. Simulation results show that the proposed scheme offers near-optimal achievable rate performance with low training overhead.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"943-947"},"PeriodicalIF":3.7,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Non-Stationary Channel Estimation for XL-MIMO With Hybrid Structure via Low-Rank Matrix Completion","authors":"Yiwen Wu;Chen Liu;Yunchao Song;Wanyue Zhang;Zheng Huang","doi":"10.1109/LCOMM.2025.3546057","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3546057","url":null,"abstract":"Due to the spatial non-stationary (SnS) property of extremely large-scale MIMO (XL-MIMO), channel estimation algorithms that rely on the assumption of spatial stationarity are no longer suitable. To address this problem, in this letter, we utilize the low-rank property of channels to investigate a non-stationary channel estimation algorithm based on low-rank matrix completion for XL-MIMO with hybrid structure. Specifically, we introduce a two-stage sampling method to select precoding and combining matrices from the codebooks and reformulate the non-stationary channel estimation problem as a matrix completion problem with a fixed-rank constraint. To handle the non-convex constraint, we treat the set of fixed-rank matrices as a manifold and utilize a fixed-rank matrix manifold-based gradient descent (FRM-GD) algorithm. Simulation results show that our algorithm significantly outperforms existing methods.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 4","pages":"863-867"},"PeriodicalIF":3.7,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Novel Discrete Phase RIS-Aided MIMO Multiuser Transceiver Design Using Dirty Paper Coding","authors":"Hsiao-Feng Lu","doi":"10.1109/LCOMM.2025.3545366","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3545366","url":null,"abstract":"In this letter we present a novel transceiver design for RIS-aided MIMO multiuser downlink communications. The design employs dirty paper coding and practical discrete-phase RIS to overcome the limitations of existing techniques and achieve the ultimate channel sum-rate capacity. The new design supports arbitrary number of antennas and users and provides a practical solution for next-generation wireless networks. In particular, a new method is proposed for optimizing the discrete phase shifts of RIS, with polynomial complexity in the number of RIS elements and linear complexity relative to the number discrete phases. Simulations show that our design with QPSK-phase RIS offers a cost-effective solution with significant performance improvement upon existing works for RIS-aided MIMO communications.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 4","pages":"848-852"},"PeriodicalIF":3.7,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Secure Transmission in IRS and AN-Assisted MISO System: Maximizing Secrecy Energy Efficiency","authors":"Panpan Xu;Weijie Tan;Zhenling Li;Chunguo Li;Rui Zhao","doi":"10.1109/LCOMM.2025.3545446","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3545446","url":null,"abstract":"In this letter, we investigate the maximization of secrecy energy efficiency (SEE) for multiple-input single-output (MISO) system assisted by artificial noise (AN) and an intelligent reflecting surface (IRS), in the presence of multiple eavesdroppers. To solve the complex and non-convex fractional programming problem of SEE maximization, we design an efficient method based on the Dinkelbach algorithm and alternative optimization, which divides the solving process into an outer algorithm and an inner algorithm. For the outer algorithm, we introduce the Dinkelbach operator to transform the fractional programming problem into a tractable subtractive form, involving the beamforming (BF) vector, AN vector, and IRS reflecting phase shift. In the inner algorithm, the integer problem is decomposed into two simpler sub-problems, then sub-optimal solutions can be obtained by iteratively optimizing the sub-problems. The simulation results verify that using AN can efficiently enhance the SEE in IRS-aided MISO systems, and the advantage of incorporating AN becomes even more pronounced in the presence of multiple eavesdroppers.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 4","pages":"858-862"},"PeriodicalIF":3.7,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Joint Optimization for Power-Splitting Relay-Assisted Over-the-Air Computation Networks","authors":"Qishuo Wang;Quanzhong Li","doi":"10.1109/LCOMM.2025.3545370","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3545370","url":null,"abstract":"Relays can significantly improve the performance of over-the-air computation (AirComp) networks, especially when the sensors and the fusion center (FC) are far apart. However, the relay’s energy supply is a common constraint factor of relay-assisted AirComp networks. To address the power constrained issue, we introduce power-splitting (PS) relays into an AirComp network, where the relays can harvest energy from the transmitted signals of the sensors and the FC by the PS scheme and then forward the signals to the FC by using the harvested energy. Our objective is to minimize the computational mean square error (CMSE) at the FC by jointly optimizing the transmit coefficients at the sensors, the amplify and forward (AF) coefficients and PS ratios at the relays, and the de-noising factor at the FC, under the individual power constraints at the sensors and relays. The optimization problem is highly non-convex and difficult to solve. By exploiting the inexact block coordinate descent (IBCD) algorithm and the constrained concave-convex procedure (CCCP), we propose an IBCD-CCCP algorithm to solve the optimization problem effectively. Numerical results are presented to demonstrate the effectiveness of our scheme as compared to the baseline methods.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 4","pages":"853-857"},"PeriodicalIF":3.7,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Shuangduo Zhang;Zheng Xiang;Peng Ren;Wei Li;Long Yang
{"title":"Structured SCMA Codebook Design by Joint Parameter Optimization Based on Union Bound","authors":"Shuangduo Zhang;Zheng Xiang;Peng Ren;Wei Li;Long Yang","doi":"10.1109/LCOMM.2025.3545470","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3545470","url":null,"abstract":"In the structured codebook design for sparse code multiple access (SCMA) systems, the constellation structure, constellation mapping matrix (CMM), and bit labeling are critical factors influencing the error performance of optimized codebooks. However, existing multi-stage codebook design methods limit the potential coding gain. Besides, although the minimum Euclidean distance (MED) is commonly used as the performance criterion for additive white Gaussian noise (AWGN) channels, existing works indicate that the MED does not always reflect the actual error performance. This letter proposes a novel structured codebook design for joint parameter optimization based on the union bound, which addresses the mismatch of MED and enhances the error performance. Specifically, we develop strategies for constructing the one-dimensional constellations, CMMs, bit labeling set, and treat these factors as optimizable parameters. The union bound is employed as the design metric to jointly optimize the aforementioned parameters with genetic algorithm (GA). Simulation results demonstrate the superiority of the proposed codebook design method.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"913-917"},"PeriodicalIF":3.7,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jan Radil;Martin Šlapák;Rudolf Vohnout;Jaromír Šíma;Tomáš Novák;Ondřej Havliš;Josef Vojtěch
{"title":"Quantum and Data Signals in a Single Fiber—Multiplexing by Smart Use of High-Grade Filters","authors":"Jan Radil;Martin Šlapák;Rudolf Vohnout;Jaromír Šíma;Tomáš Novák;Ondřej Havliš;Josef Vojtěch","doi":"10.1109/LCOMM.2025.3545315","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3545315","url":null,"abstract":"In this letter, we present the latest findings in coexistence of two rather different classes of optical signals in one fiber – classical data signals and quantum signals. The most significant and notable difference between the two is the optical power, which is several orders (7 or more) of magnitude distinct from each other. There are several approaches to address this issue – in this letter, at a glance, the realistic and practical approach, which relies on the selection of high-grade optical filters, was chosen. Rigorous, however affordable, optical filtering is required to avoid any possible crosstalk, not only from the classical data signals but also from the spontaneous nonlinear Raman scattering effect. In our experimental verification, it has been demonstrated that the selection of high-grade transmission components is a crucial element in the success of multiplexing strong and weak optical signals in a single fiber. In real-world applications, this approach significantly reduces infrastructure costs by eliminating the need for additional fiber.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"908-912"},"PeriodicalIF":3.7,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10902004","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143929859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}