Pub Date : 2024-08-13DOI: 10.1109/LCOMM.2024.3443133
Bin Chen;Wen Yin;Yi Lei;Qin Huang;Xiang Li
Product codes (PCs) are widespread in optical communication systems, especially those that use hard-decision decoding (HDD). Soft-decision decoding (SDD) can bring significant performance benefits to PCs, but the substantial increase in complexity poses challenges for practical applications. In this letter, we propose a novel hybrid decoding scheme for PC consisting of systematic polar code and Bose-Chaudhuri-Hocquenghem (BCH) code, which will be referred as polar-BCH PCs. Utilizing such a special structure, a hybrid soft-and hard-decision decoding (HSHD) algorithm is proposed for PCs, which takes the advantages of both HDD and SDD. Via the iterative decoding, the proposed HSHD algorithm can outperform the traditional BCH-BCH PC by 1.15 dB. In addition, the proposed algorithm can close the gap to the long polar code with the same blocklength within 0.5 dB, while heavily reducing the computational complexity by more than an order of magnitude.
产品代码（PC）广泛应用于光通信系统，尤其是使用硬解码（HDD）的系统。软决策解码（SDD）能为 PC 带来显著的性能优势，但其复杂性的大幅增加给实际应用带来了挑战。在这封信中，我们提出了一种由系统极性编码和 Bose-Chaudhuri-Hocquenghem (BCH) 编码组成的新型 PC 混合解码方案，并将其称为极性-BCH PC。利用这种特殊结构，我们提出了一种针对 PC 的混合软硬决定解码（HSHD）算法，它兼具 HDD 和 SDD 的优点。通过迭代解码，所提出的 HSHD 算法比传统的 BCH-BCH PC 性能高出 1.15 dB。此外，所提出的算法还能在 0.5 dB 的范围内缩小与具有相同块长的长极码的差距，同时将计算复杂度大幅降低一个数量级以上。
{"title":"Hybrid Decoding of Asymmetric Product Codes With Systematic Polar and BCH Codes","authors":"Bin Chen;Wen Yin;Yi Lei;Qin Huang;Xiang Li","doi":"10.1109/LCOMM.2024.3443133","DOIUrl":"10.1109/LCOMM.2024.3443133","url":null,"abstract":"Product codes (PCs) are widespread in optical communication systems, especially those that use hard-decision decoding (HDD). Soft-decision decoding (SDD) can bring significant performance benefits to PCs, but the substantial increase in complexity poses challenges for practical applications. In this letter, we propose a novel hybrid decoding scheme for PC consisting of systematic polar code and Bose-Chaudhuri-Hocquenghem (BCH) code, which will be referred as polar-BCH PCs. Utilizing such a special structure, a hybrid soft-and hard-decision decoding (HSHD) algorithm is proposed for PCs, which takes the advantages of both HDD and SDD. Via the iterative decoding, the proposed HSHD algorithm can outperform the traditional BCH-BCH PC by 1.15 dB. In addition, the proposed algorithm can close the gap to the long polar code with the same blocklength within 0.5 dB, while heavily reducing the computational complexity by more than an order of magnitude.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 10","pages":"2223-2227"},"PeriodicalIF":3.7,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142190052","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}
Pub Date : 2024-08-13DOI: 10.1109/LCOMM.2024.3443104
Qian Xie;Yong Wang;Jianyang Ding;Jiajun Niu
Predistortion models of radio frequency (RF) power amplifier (PA), such as the generalized memory polynomial (GMP) model and artificial neural networks (ANNs) model, suffer from limited predistortion precision and high complexity. In this letter, we propose an enhanced digital predistortion (DPD) model based on a light convolutional neural network (CNN) with augmented real-valued and cross-memorized terms (ARCT). To this end, 1-D complex signals of the PA are initially mapped into 2-D real signals in the form of the ARCT matrix, which serves as the input layer. With cross-memorized terms, the matrix contains sophisticated feature information related to nonlinearity and memory effects. Then, a convolutional layer is designed utilizing macro convolutional kernels with a wide receptive field, which could reduce the number of parameters and effectively extract nonlinear feature information. Following this, a max pooling layer contributes to reducing floating-point operations (FLOPs), improving generalization capability, and preventing overfitting of the proposed model. By these means, the proposed model can significantly extract nonlinear basis functions of the PA with low computational complexity, and realize indirect learning of the DPD parameters. The experimental results, based on a 160MHz Doherty PA, indicate that the proposed model effectively decreases error vector magnitude (EVM) and adjacent channel power ratio (ACPR), compared to state-of-the-art models. In addition, the proposed model has fewer parameters and FLOPs.
{"title":"Light Convolutional Neural Network for Digital Predistortion of Radio Frequency Power Amplifiers","authors":"Qian Xie;Yong Wang;Jianyang Ding;Jiajun Niu","doi":"10.1109/LCOMM.2024.3443104","DOIUrl":"10.1109/LCOMM.2024.3443104","url":null,"abstract":"Predistortion models of radio frequency (RF) power amplifier (PA), such as the generalized memory polynomial (GMP) model and artificial neural networks (ANNs) model, suffer from limited predistortion precision and high complexity. In this letter, we propose an enhanced digital predistortion (DPD) model based on a light convolutional neural network (CNN) with augmented real-valued and cross-memorized terms (ARCT). To this end, 1-D complex signals of the PA are initially mapped into 2-D real signals in the form of the ARCT matrix, which serves as the input layer. With cross-memorized terms, the matrix contains sophisticated feature information related to nonlinearity and memory effects. Then, a convolutional layer is designed utilizing macro convolutional kernels with a wide receptive field, which could reduce the number of parameters and effectively extract nonlinear feature information. Following this, a max pooling layer contributes to reducing floating-point operations (FLOPs), improving generalization capability, and preventing overfitting of the proposed model. By these means, the proposed model can significantly extract nonlinear basis functions of the PA with low computational complexity, and realize indirect learning of the DPD parameters. The experimental results, based on a 160MHz Doherty PA, indicate that the proposed model effectively decreases error vector magnitude (EVM) and adjacent channel power ratio (ACPR), compared to state-of-the-art models. In addition, the proposed model has fewer parameters and FLOPs.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 10","pages":"2377-2381"},"PeriodicalIF":3.7,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142190047","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}
Pub Date : 2024-08-12DOI: 10.1109/LCOMM.2024.3441756
Andreas Nicolaides;Constantinos Psomas;Ioannis Krikidis
Time reversal (TR) is a promising technique that exploits multipaths for achieving energy focusing in high-frequency wideband communications. In this letter, we focus on a TR scheme facilitated by a reconfigurable intelligent surface (RIS) which, due to the higher frequency and large array aperture, operates in the near-field region. The proposed scheme enriches the propagation environment for the TR in such weak scattering conditions and does not need channel knowledge for the RIS configuration. Specifically, the RIS is employed to create multiple virtual propagation paths that are required to efficiently apply the TR. We derive a performance bound for the proposed scheme under near-field modeling through the received signal-to-noise ratio (SNR) and we examine how various system design parameters affect the performance. We observe that a linear RIS topology maximizes the number of resolvable paths. It is also demonstrated that the proposed scheme improves the SNR, while for a large number of elements it can outperform the conventional passive beamforming at the RIS.
{"title":"An RIS-Enabled Time Reversal Scheme for Multipath Near-Field Channels","authors":"Andreas Nicolaides;Constantinos Psomas;Ioannis Krikidis","doi":"10.1109/LCOMM.2024.3441756","DOIUrl":"10.1109/LCOMM.2024.3441756","url":null,"abstract":"Time reversal (TR) is a promising technique that exploits multipaths for achieving energy focusing in high-frequency wideband communications. In this letter, we focus on a TR scheme facilitated by a reconfigurable intelligent surface (RIS) which, due to the higher frequency and large array aperture, operates in the near-field region. The proposed scheme enriches the propagation environment for the TR in such weak scattering conditions and does not need channel knowledge for the RIS configuration. Specifically, the RIS is employed to create multiple virtual propagation paths that are required to efficiently apply the TR. We derive a performance bound for the proposed scheme under near-field modeling through the received signal-to-noise ratio (SNR) and we examine how various system design parameters affect the performance. We observe that a linear RIS topology maximizes the number of resolvable paths. It is also demonstrated that the proposed scheme improves the SNR, while for a large number of elements it can outperform the conventional passive beamforming at the RIS.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 10","pages":"2392-2396"},"PeriodicalIF":3.7,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142190049","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}
Pub Date : 2024-08-12DOI: 10.1109/LCOMM.2024.3442370
Wenchao Wu;Yanning Wu;Yuanqing Yang;Yansha Deng
To accomplish various tasks, safe and smooth control of unmanned aerial vehicles (UAVs) needs to be guaranteed, which cannot be met by existing ultra-reliable low latency communications (URLLC). This has attracted the attention of the communication field, where most existing work mainly focused on optimizing communication performance (i.e., delay) and ignored the performance of the task (i.e., tracking accuracy). To explore the effectiveness of communication in completing a task, in this letter, we propose a goal-oriented communication framework adopting a deep reinforcement learning (DRL) algorithm with a proactive repetition scheme (DeepP) to optimize C&C data selection and the maximum number of repetitions in a real-time target tracking task, where a base station (BS) controls a UAV to track a mobile target. The effectiveness of our proposed approach is validated by comparing it with the traditional proportional integral derivative (PID) algorithm.
{"title":"Goal-Oriented UAV Communication Design and Optimization for Target Tracking: A Machine Learning Approach","authors":"Wenchao Wu;Yanning Wu;Yuanqing Yang;Yansha Deng","doi":"10.1109/LCOMM.2024.3442370","DOIUrl":"10.1109/LCOMM.2024.3442370","url":null,"abstract":"To accomplish various tasks, safe and smooth control of unmanned aerial vehicles (UAVs) needs to be guaranteed, which cannot be met by existing ultra-reliable low latency communications (URLLC). This has attracted the attention of the communication field, where most existing work mainly focused on optimizing communication performance (i.e., delay) and ignored the performance of the task (i.e., tracking accuracy). To explore the effectiveness of communication in completing a task, in this letter, we propose a goal-oriented communication framework adopting a deep reinforcement learning (DRL) algorithm with a proactive repetition scheme (DeepP) to optimize C&C data selection and the maximum number of repetitions in a real-time target tracking task, where a base station (BS) controls a UAV to track a mobile target. The effectiveness of our proposed approach is validated by comparing it with the traditional proportional integral derivative (PID) algorithm.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 10","pages":"2338-2341"},"PeriodicalIF":3.7,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142190048","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}
Pub Date : 2024-08-08DOI: 10.1109/LCOMM.2024.3440489
Jian Wu;Min Jia;Ningtao Zhang;Qing Guo
Efficient computation offloading is crucial for resource-constrained users in low earth orbit (LEO) satellite edge computing system. The proposed Dueling Double Deep Q Network (D3QN)-based computation offloading algorithm considers LEO satellite mobility, dynamic load levels, queuing theory, and jointly optimizes system delay and energy consumption. Simulation results show that the proposed algorithm has better system cost than other comparison algorithms.
{"title":"Multi-Agent Deep Reinforcement Learning-Based Computation Offloading in LEO Satellite Edge Computing System","authors":"Jian Wu;Min Jia;Ningtao Zhang;Qing Guo","doi":"10.1109/LCOMM.2024.3440489","DOIUrl":"10.1109/LCOMM.2024.3440489","url":null,"abstract":"Efficient computation offloading is crucial for resource-constrained users in low earth orbit (LEO) satellite edge computing system. The proposed Dueling Double Deep Q Network (D3QN)-based computation offloading algorithm considers LEO satellite mobility, dynamic load levels, queuing theory, and jointly optimizes system delay and energy consumption. Simulation results show that the proposed algorithm has better system cost than other comparison algorithms.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 10","pages":"2352-2356"},"PeriodicalIF":3.7,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141936327","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}
Pub Date : 2024-08-07DOI: 10.1109/LCOMM.2024.3439769
Hongtao Luo;Qiang Wang;Jiaqi Che;Jingyi Chen
This letter investigates the secure degrees of freedom (SDoF) of reconfigurable intelligent surface (RIS) aided 2-user multiple-input multiple-output (MIMO) broadcast channel with confidential messages. In this model, transmitter sends corresponding secure messages to each receiver and ensure the other receiver cannot decode them. Compared to existing studies on broadcast channel with confidential messages, our model employs an active RIS that reduces the rank of channel matrices, enlarging the nullspace for secure transmission to increase the SDoF. In particular, our model can realize secure communication even when the SDoF of original model is zero. According to the different configurations of antennas, the problem is divided into several regimes. We present outer bound and corresponding proof for each regime by utilizing theoretical methods and RIS beamforming. Then we propose universal achievable schemes for different regimes by using zero-forcing decoding. Finally, we determine the exact SDoF of RIS-assisted MIMO broadcast channel with confidential messages and its SDoF gain compared to original model.
{"title":"Secure Degrees of Freedom of RIS-Assisted MIMO Broadcast Channel With Confidential Messages","authors":"Hongtao Luo;Qiang Wang;Jiaqi Che;Jingyi Chen","doi":"10.1109/LCOMM.2024.3439769","DOIUrl":"10.1109/LCOMM.2024.3439769","url":null,"abstract":"This letter investigates the secure degrees of freedom (SDoF) of reconfigurable intelligent surface (RIS) aided 2-user multiple-input multiple-output (MIMO) broadcast channel with confidential messages. In this model, transmitter sends corresponding secure messages to each receiver and ensure the other receiver cannot decode them. Compared to existing studies on broadcast channel with confidential messages, our model employs an active RIS that reduces the rank of channel matrices, enlarging the nullspace for secure transmission to increase the SDoF. In particular, our model can realize secure communication even when the SDoF of original model is zero. According to the different configurations of antennas, the problem is divided into several regimes. We present outer bound and corresponding proof for each regime by utilizing theoretical methods and RIS beamforming. Then we propose universal achievable schemes for different regimes by using zero-forcing decoding. Finally, we determine the exact SDoF of RIS-assisted MIMO broadcast channel with confidential messages and its SDoF gain compared to original model.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 10","pages":"2253-2257"},"PeriodicalIF":3.7,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141936498","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}
This letter investigates a short-packet downlink transmission system using non-orthogonal multiple access (NOMA) enhanced via movable antenna (MA). We focus on maximizing the effective throughput for a core user while ensuring reliable communication for an edge user by optimizing the MAs’ coordinates and the power and rate allocations from the access point (AP). The optimization challenge is approached by decomposing it into two subproblems, utilizing successive convex approximation (SCA) to handle the highly nested non-concave nature of channel gains. Numerical results confirm that the proposed solution offers substantial improvements in effective throughput compared to NOMA short-packet communication with fixed position antennas (FPAs).
这封信研究了一种通过可移动天线（MA）增强的非正交多址（NOMA）短分组下行链路传输系统。我们的重点是通过优化 MA 的坐标以及接入点（AP）的功率和速率分配，最大限度地提高核心用户的有效吞吐量，同时确保边缘用户的可靠通信。通过将优化挑战分解为两个子问题，利用连续凸近似（SCA）来处理信道增益的高度嵌套非凹凸性质。数值结果证实，与使用固定位置天线（FPA）的 NOMA 短包通信相比，所提出的解决方案可大幅提高有效吞吐量。
{"title":"Movable Antenna Enhanced NOMA Short-Packet Transmission","authors":"Xinyuan He;Wen Chen;Qingqing Wu;Xusheng Zhu;Nan Cheng","doi":"10.1109/LCOMM.2024.3440014","DOIUrl":"10.1109/LCOMM.2024.3440014","url":null,"abstract":"This letter investigates a short-packet downlink transmission system using non-orthogonal multiple access (NOMA) enhanced via movable antenna (MA). We focus on maximizing the effective throughput for a core user while ensuring reliable communication for an edge user by optimizing the MAs’ coordinates and the power and rate allocations from the access point (AP). The optimization challenge is approached by decomposing it into two subproblems, utilizing successive convex approximation (SCA) to handle the highly nested non-concave nature of channel gains. Numerical results confirm that the proposed solution offers substantial improvements in effective throughput compared to NOMA short-packet communication with fixed position antennas (FPAs).","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 9","pages":"2196-2200"},"PeriodicalIF":3.7,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141936497","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}
In this letter, we propose a novel constellation design, specifically tailored to contrast the effect of nonlinear channels. The proposed constellations are based on a spiral expression, which, unlike other unstructured designs, makes them easy to build and optimize. Our design approach allows to optimize the distance between symbols in the angular and radial directions, resulting in a constellation that is robust to the nonlinearities, which affect more severely symbols with higher magnitude. Simulation results show that the proposed constellations outperform the solutions usually adopted for nonlinear channels, especially when the constellation size increases.
{"title":"Spiral Constellations for Nonlinear Channels","authors":"Amina Piemontese;Alessandro Ugolini;Marco Morini;Giulio Colavolpe;Thomas Eriksson","doi":"10.1109/LCOMM.2024.3438830","DOIUrl":"10.1109/LCOMM.2024.3438830","url":null,"abstract":"In this letter, we propose a novel constellation design, specifically tailored to contrast the effect of nonlinear channels. The proposed constellations are based on a spiral expression, which, unlike other unstructured designs, makes them easy to build and optimize. Our design approach allows to optimize the distance between symbols in the angular and radial directions, resulting in a constellation that is robust to the nonlinearities, which affect more severely symbols with higher magnitude. Simulation results show that the proposed constellations outperform the solutions usually adopted for nonlinear channels, especially when the constellation size increases.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 9","pages":"2016-2020"},"PeriodicalIF":3.7,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10623499","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141936326","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}
This letter investigates a video streaming system enabled by mobile edge computing (MEC), where we aim to maximize the user quality of experience (QoE) under dynamic mobile environments, through user association, bitrate adaptation and bandwidth allocation. To tackle this hybrid optimization problem, we first decompose it into discrete inter-frame and continuous intra-frame problems. In further, an in-depth analysis of intra-frame bandwidth allocation is conducted, guiding the design of a modified equal bandwidth allocation (MEBA) algorithm. Furthermore, we adopt a deep reinforcement learning (DRL) approach to cope with inter-frame user association and bitrate adaptation in dynamic mobile environments, while embedding MEBA in the DRL algorithm to jointly tackle the hybrid problem. Simulations are finally conducted to verify the superiority of the proposed method under the dynamic environment.
{"title":"Dynamic Bitrate Adaptation and Bandwidth Allocation for MEC-Enabled Video Streaming","authors":"Wenqi Zhou;Yiqin Lu;Weiqiang Pan;Zhuoxing Chen;Jiancheng Qin","doi":"10.1109/LCOMM.2024.3438941","DOIUrl":"10.1109/LCOMM.2024.3438941","url":null,"abstract":"This letter investigates a video streaming system enabled by mobile edge computing (MEC), where we aim to maximize the user quality of experience (QoE) under dynamic mobile environments, through user association, bitrate adaptation and bandwidth allocation. To tackle this hybrid optimization problem, we first decompose it into discrete inter-frame and continuous intra-frame problems. In further, an in-depth analysis of intra-frame bandwidth allocation is conducted, guiding the design of a modified equal bandwidth allocation (MEBA) algorithm. Furthermore, we adopt a deep reinforcement learning (DRL) approach to cope with inter-frame user association and bitrate adaptation in dynamic mobile environments, while embedding MEBA in the DRL algorithm to jointly tackle the hybrid problem. Simulations are finally conducted to verify the superiority of the proposed method under the dynamic environment.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 9","pages":"2121-2125"},"PeriodicalIF":3.7,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141936500","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}
Pub Date : 2024-08-05DOI: 10.1109/LCOMM.2024.3439025
Alireza Vahid;Haijian Sun;Shih-Chun Lin
The emergence of new wireless technologies, such as movable antennas and reconfigurable intelligent surfaces, enable channel morphing. In this new paradigm, variations in channel statistics may be decided and thus known prior to communications, deviating from the conventional ergodic models in which the underlying processes that govern channel statistics are assumed to be temporally independent. To provide a fundamental understanding beyond the typical physical-layer studies, we study the capacity region of movable antenna-aided broadcast packet erasure channels, and provide new inner and outer bounds. The proposed linear network-coding protocol opportunistically benefits from the prior knowledge of future statistical changes, and achieves the outer-bounds for a wide range of parameters. Network capacity can be further maximized in a cross-layer fashion by determining optimal channel statistics controlled by the movable antenna position.
{"title":"Movable Antenna-Aided Broadcast Packet Erasure Channels: Capacity With Dynamic Position Plan","authors":"Alireza Vahid;Haijian Sun;Shih-Chun Lin","doi":"10.1109/LCOMM.2024.3439025","DOIUrl":"10.1109/LCOMM.2024.3439025","url":null,"abstract":"The emergence of new wireless technologies, such as movable antennas and reconfigurable intelligent surfaces, enable channel morphing. In this new paradigm, variations in channel statistics may be decided and thus known prior to communications, deviating from the conventional ergodic models in which the underlying processes that govern channel statistics are assumed to be temporally independent. To provide a fundamental understanding beyond the typical physical-layer studies, we study the capacity region of movable antenna-aided broadcast packet erasure channels, and provide new inner and outer bounds. The proposed linear network-coding protocol opportunistically benefits from the prior knowledge of future statistical changes, and achieves the outer-bounds for a wide range of parameters. Network capacity can be further maximized in a cross-layer fashion by determining optimal channel statistics controlled by the movable antenna position.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 9","pages":"2006-2010"},"PeriodicalIF":3.7,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141936511","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：