{"title":"Joint Transmit Antenna Selection and Beamforming Design for Millimeter Wave Massive MIMO NOMA Secure Networks","authors":"Junbin Yu;Sai Zhao;Maoxin Tian;Quanzhong Li;Dong Tang","doi":"10.1109/LCOMM.2024.3438876","DOIUrl":"10.1109/LCOMM.2024.3438876","url":null,"abstract":"In this letter, we investigate the joint beamforming design and antenna selection (AS) of a millimeter wave (mmWave) massive multiple-input-multiple-output (m-MIMO) secure network. Our objective is to maximize the system secrecy sum rate while considering the successful successive interference cancellation (SIC) constraint, base station (BS) maximum transmit power and the transmit AS constraint. Considering the sparsity of the antenna selection matrix in mmWave m-MIMO network, we propose a sparse optimization approach coupled with the weighted mean squared error minimization (WMMSE) method for the joint beamforming design and AS problem, in which an \u0000<inline-formula> <tex-math>$l_{0}$ </tex-math></inline-formula>\u0000 norm constraint involving the coupling of AS and transmit beamforming is introduced. To address the challenges posed by the \u0000<inline-formula> <tex-math>$l_{0}$ </tex-math></inline-formula>\u0000 norm constraint, we employ bisection search to transform the optimization problem into a sequence of feasibility problems. In each feasibility problem, we replace the \u0000<inline-formula> <tex-math>$l_{0}$ </tex-math></inline-formula>\u0000 norm with continuous surrogate functions based on the majorization-minimization (MM) method where the valid quadratic functions with smooth optimization are utilized. Monte-Carlo simulation results show the effectiveness of the proposed scheme.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 10","pages":"2407-2411"},"PeriodicalIF":3.7,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141936499","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}
Liqin Shi;Jiayao Shi;Yinghui Ye;Gan Zheng;Guangyue Lu
{"title":"Ambient Backscatter Communication With HARQ Assisted Hybrid Long-Short Packets","authors":"Liqin Shi;Jiayao Shi;Yinghui Ye;Gan Zheng;Guangyue Lu","doi":"10.1109/LCOMM.2024.3438231","DOIUrl":"10.1109/LCOMM.2024.3438231","url":null,"abstract":"This letter investigates the performance of an ambient backscatter communication (BackCom) network with hybrid automatic repeat request (HARQ) assisted hybrid long and short packets, where a base station transmits long packets to a cellular user while an Internet of Things (IoT) node performs short-packet BackCom with retransmissions. For the IoT node’s short-packet BackCom, we adopt both the HARQ with chase combining (HARQ-CC) scheme and the practical non-linear energy harvesting model and investigate scenarios involving short-packet retransmissions spanning single or multiple cellular transmission blocks, where the closed-form expression for the IoT node’s block error rate (BLER) is derived by considering the energy causality constraint and the decoding error in the process of successive interference cancellation. For the cellular long-packet transmission, the outage probability is derived. Simulation results illustrate the correctness of the derived expressions and show that the utilization of the HARQ-CC scheme demonstrates a notable enhancement in the IoT node’s BLER performance without observable impact on the outage probability.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 10","pages":"2258-2262"},"PeriodicalIF":3.7,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141936328","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":"Symbol-Level Precoding for Near-Field ISAC","authors":"Nithin Babu;Alva Kosasih;Christos Masouros;Emil Björnson","doi":"10.1109/LCOMM.2024.3438882","DOIUrl":"10.1109/LCOMM.2024.3438882","url":null,"abstract":"The forthcoming 6G and beyond wireless networks are anticipated to introduce new groundbreaking applications, such as Integrated Sensing and Communications (ISAC), potentially leveraging much wider bandwidths at higher frequencies and using significantly larger antenna arrays at base stations. This puts the system operation in the radiative near-field regime of the BS antenna array, characterized by spherical rather than flat wavefronts. In this letter, we refer to such a system as near-field ISAC. Unlike the far-field regime, the near-field regime allows for precise focusing of transmission beams on specific areas, making it possible to simultaneously determine a target’s direction and range from a single base station and resolve targets located in the same direction. This work designs the transmit symbol vector in near-field ISAC to maximize a weighted combination of sensing and communication performances subject to a total power constraint using symbol-level precoding (SLP). The formulated optimization problem is convex, and the solution is used to estimate the angle and range of the considered targets using the 2D MUSIC algorithm. The simulation results suggest that the SLP-based design outperforms the block-level-based counterpart. Moreover, the 2D MUSIC algorithm accurately estimates the targets’ parameters.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 9","pages":"2041-2045"},"PeriodicalIF":3.7,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141936329","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 Dynamic-Confined Iterative GRAND Algorithm With Anchor Decoding for Product Codes","authors":"Yile Peng;Xinwei Zhao;Shancheng Zhao","doi":"10.1109/LCOMM.2024.3436699","DOIUrl":"10.1109/LCOMM.2024.3436699","url":null,"abstract":"In this letter, we propose two novel low-complexity iterative guessing random additive noise decoding (IGRAND) schemes for product codes with enhanced anchor decoding (EAD). Both schemes are motivated by the observation that errors typically occur at the intersections of rows and columns that declare decoding failure by bounded distance decoding (BDD). For the first decoding scheme, termed confined IGRAND with EAD, the generation of test error patterns (TEPs) for the component GRAND is strictly confined to the intersections of invalid codewords which are detected before decoding. To further reduce the decoding complexity, we propose the second decoding scheme where the constraint on the generation of TEPs is dynamically updated according to the hard reliability scores (HRSs) in EAD. Specifically, the codewords are classified into reliable and unreliable subsets by a threshold and the generation of TEPs is strictly confined to the intersections of unreliable codewords during the decoding process. Such a decoding algorithm is referred to as dynamic-confined IGRAND with EAD. Extensive simulation results show that both decoding schemes achieve significant complexity reduction with only negligible performance loss. These results confirm the potential of the proposed decoding schemes in high-throughput applications.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 9","pages":"1976-1980"},"PeriodicalIF":3.7,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141886109","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":"Beam-Domain-Based Pilot Assignment for Energy Efficient Cell-Free Massive MIMO","authors":"Mariam Mussbah;Stefan Schwarz;Markus Rupp","doi":"10.1109/LCOMM.2024.3436886","DOIUrl":"10.1109/LCOMM.2024.3436886","url":null,"abstract":"In this letter, an efficient beam-domain-based pilot assignment scheme is proposed to mitigate the pilot contamination caused by pilot reuse in cell-free massive multiple-input multiple-output systems. By exploiting the information provided through beam management during the initial access, we construct a graph that captures the potential interference in the beam domain and apply graph coloring for pilot assignment. In addition, we consider a radio frequency chain switch on/off strategy to improve energy efficiency. Numerical results verify that the proposed pilot assignment scheme can significantly improve both spectral efficiency and energy efficiency compared to existing schemes.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 9","pages":"2176-2180"},"PeriodicalIF":3.7,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10620234","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141886178","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}
{"title":"Single-BS Simultaneous Environment Sensing and UE Localization Without LoS Path by Exploiting Near-Field Scatterers","authors":"Zhiwen Zhou;Zhiqiang Xiao;Yong Zeng","doi":"10.1109/LCOMM.2024.3436839","DOIUrl":"10.1109/LCOMM.2024.3436839","url":null,"abstract":"As the mobile communication network evolves over the past few decades, localizing user equipment (UE) has become an important network service. While localization in line-of-sight (LoS) scenarios has reached a level of maturity, it is known that in far-field scenarios without a LoS path nor any prior information about the scatterers, accurately localizing the UE is impossible. In this letter, we show that this becomes possible if there are scatterers in the near-field region of the base station (BS) antenna arrays. Specifically, by exploiting the additional distance sensing capability of extremely large-scale antenna arrays (XL-arrays) provided by near-field effects, we propose a novel method that simultaneously performs environment sensing and non-line-of-sight (NLoS) UE localization using one single BS. In the proposed method, the BS leverages the near-field characteristics of XL-arrays to directly estimate the locations of the near-field scatterers with array signal processing, which then serves as virtual anchors for UE localization. Then, the propagation delay for each path is estimated and the position of the UE is obtained based on the positions of scatterers and the path delays. Simulation results demonstrate that the proposed method achieves superior accuracy and robustness with similar complexity compared with benchmark methods.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 9","pages":"2071-2075"},"PeriodicalIF":3.7,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141886177","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":"New Gridless Method-Based Channel Estimation for Millimeter Wave MIMO-OFDM Systems","authors":"Lijun Zhu;Zheng Li;Ran Zhang;Zheng Chu;De Mi;Zhengyu Zhu;Gaojie Chen;Li Zhen","doi":"10.1109/LCOMM.2024.3436917","DOIUrl":"10.1109/LCOMM.2024.3436917","url":null,"abstract":"Accurate channel estimation is crucial for millimeter-wave (mmWave) multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. Conventional grid-based compressive sensing approaches encounter the base mismatch problem, which degrades channel estimation accuracy. To address this issue, this letter proposes a novel gridless channel estimation strategy tailored for mmWave MIMO-OFDM systems. Specifically, the channel estimation problem is formulated as a joint sparse signal recovery problem by exploiting the inherent sparsity in the angle-delay domain of the mmWave channel. We then introduce a Hankel-Toeplitz block model-based new atomic norm minimization (NANM) algorithm with multiple measurement vectors (MMV), representing the formulated problem as a semi-definite programming (SDP) problem with structured sparsity. To efficiently solve the SDP problem, we employ a low-complexity alternating direction multiplier method (ADMM). Simulation results verify that the proposed method significantly enhances channel estimation accuracy with reduced pilot overhead, compared with conventional channel estimation techniques.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 9","pages":"2166-2170"},"PeriodicalIF":3.7,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141887288","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":"TinyAirNet: TinyML Model Transmission for Energy-Efficient Image Retrieval From IoT Devices","authors":"Junya Shiraishi;Mathias Thorsager;Shashi Raj Pandey;Petar Popovski","doi":"10.1109/LCOMM.2024.3436816","DOIUrl":"10.1109/LCOMM.2024.3436816","url":null,"abstract":"This letter introduces an energy-efficient pull-based data collection framework for Internet of Things (IoT) devices that use Tiny Machine Learning (TinyML) to interpret data queries. A TinyML model is transmitted from the edge server to the IoT devices. The devices employ the model to facilitate the subsequent semantic queries. This reduces the transmission of irrelevant data, but receiving the ML model and its processing at the IoT devices consume additional energy. We consider the specific instance of image retrieval in a single device scenario and investigate the gain brought by the proposed scheme in terms of energy efficiency and retrieval accuracy, while considering the cost of computation and communication, as well as memory constraints. Numerical evaluation shows that, compared to a baseline scheme, the proposed scheme reaches up to 67% energy reduction under the accuracy constraint when many images are stored. Although focused on image retrieval, our analysis is indicative of a broader set of communication scenarios in which the preemptive transmission of an ML model can increase communication efficiency.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 9","pages":"2101-2105"},"PeriodicalIF":3.7,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141886108","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 Embedded Pilot-Aided OCDM System Over Time-Varying Channels","authors":"Zhaopeng Du;Lin Mei;Xu Lin;Zhiyang Li;Bo Zhang","doi":"10.1109/LCOMM.2024.3436579","DOIUrl":"10.1109/LCOMM.2024.3436579","url":null,"abstract":"In this letter, we propose a novel embedded pilot orthogonal chirp division multiplexing (OCDM) system. This system is mainly used for time-varying (TV) channels to reduce the overhead of OCDM channel estimation. In this system, a novel embedded chirp pilot arrangement in the discrete Fresnel domain with low overhead is designed. Furthermore, two channel estimation strategies are proposed for this pilot arrangement: a low-complexity data interference avoidance (IA) strategy and a higher-performance data interference suppression (IS) strategy. For the IS strategy, we also develop a novel channel estimator. Through simulation and analysis, we have demonstrated that the proposed system effectively improves the spectrum efficiency, energy efficiency, and transmission rate (SET) compared to traditional embedded pilot OCDM systems, while maintaining similar performance levels.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2643-2647"},"PeriodicalIF":3.7,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141886110","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}