IEEE Transactions on Communications最新文献_第10页

Faster-Than-Nyquist Signaling in the Finite Time-Bandwidth Product Regime 有限时间-带宽积域中比奈奎斯特信号更快的信号

IF 8.3 2区计算机科学

IEEE Transactions on Communications Pub Date : 2026-02-26 DOI: 10.1109/TCOMM.2026.3668158

Yong Jin Daniel Kim

{"title":"Faster-Than-Nyquist Signaling in the Finite Time-Bandwidth Product Regime","authors":"Yong Jin Daniel Kim","doi":"10.1109/TCOMM.2026.3668158","DOIUrl":"10.1109/TCOMM.2026.3668158","url":null,"abstract":"This paper analyzes faster-than-Nyquist (FTN) signaling within a consistent framework based on a fixed time-bandwidth product (TBP), resolving potential ambiguities present in finite blocklength analysis. A key feature of FTN is its ability to increase the number of transmitted symbols in a given time and frequency resource, which can lower the rate penalties inherent in short packet communications. We derive tight bounds on the maximum channel coding rate (MCCR) and demonstrate that FTN’s rate gains over Nyquist signaling can be higher in the finite TBP regime than in the asymptotic case. Performance is benchmarked against the theoretical optimum of transmitting prolate spheroidal wave functions, showing that a well-designed FTN system can closely approach this limit. We present practical design criteria, including the optimal time-acceleration factor for maximizing signaling dimensions, an optimized pulse shape that meets strict out-of-band constraints, and a turbo-equalization-based coding scheme that performs near the derived MCCR bounds. These findings establish FTN as a practical and near-optimal technique for enhancing the rate and reliability of latency-constrained communications.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"74 ","pages":"5605-5618"},"PeriodicalIF":8.3,"publicationDate":"2026-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147319636","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}

引用次数: 0

Trellis Waveform Shaping for Sidelobe Reduction in Integrated Sensing and Communications: A Duality With PAPR Mitigation 栅格波形整形用于集成传感和通信的旁瓣减小：具有PAPR抑制的对偶性

IF 8.3 2区计算机科学

IEEE Transactions on Communications Pub Date : 2026-02-20 DOI: 10.1109/TCOMM.2026.3666646

Henglin Pu;Husheng Li;Zhu Han;H. Vincent Poor

{"title":"Trellis Waveform Shaping for Sidelobe Reduction in Integrated Sensing and Communications: A Duality With PAPR Mitigation","authors":"Henglin Pu;Husheng Li;Zhu Han;H. Vincent Poor","doi":"10.1109/TCOMM.2026.3666646","DOIUrl":"10.1109/TCOMM.2026.3666646","url":null,"abstract":"A key challenge in integrated sensing and communications (ISAC) is the synthesis of waveforms that can modulate communication messages and achieve good sensing performance simultaneously. In ISAC systems, standard communication waveforms can be adapted for sensing, as the sensing receiver (co-located with the transmitter) has knowledge of the communication message and consequently the waveform. However, the randomness of communications may result in waveforms that have high sidelobes masking weak targets. Thus, it is desirable to refine communication waveforms to improve the sensing performance by reducing the integrated sidelobe levels (ISL). This is similar to the peak-to-average power ratio (PAPR) mitigation in orthogonal frequency division multiplexing (OFDM), in which the OFDM-modulated waveform needs to be refined to reduce the PAPR. In this paper, inspired by PAPR reduction algorithms in OFDM, we employ trellis shaping in OFDM-based ISAC systems to refine waveforms for specific sensing metrics using convolutional codes and Viterbi decoding. In such a scheme, the communication data is encoded and then mapped to the signaling constellation in different subcarriers, such that the time-domain sidelobes are reduced. An interesting observation is that sidelobe reduction in OFDM-based ISAC is dual to PAPR reduction in OFDM, thereby sharing a similar signaling structure. Numerical simulations and hardware software defined radio USRP experiments are carried out to demonstrate the effectiveness of the proposed trellis shaping approach.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"74 ","pages":"5473-5488"},"PeriodicalIF":8.3,"publicationDate":"2026-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146230983","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}

引用次数: 0

Theoretical Analysis of Multi-Coding With Arbitrary Correlations Among the Codes 码间任意相关多重编码的理论分析

IF 8.3 2区计算机科学

IEEE Transactions on Communications Pub Date : 2026-02-17 DOI: 10.1109/TCOMM.2026.3665758

Brian Nelson;Behrouz Farhang-Boroujeny

{"title":"Theoretical Analysis of Multi-Coding With Arbitrary Correlations Among the Codes","authors":"Brian Nelson;Behrouz Farhang-Boroujeny","doi":"10.1109/TCOMM.2026.3665758","DOIUrl":"10.1109/TCOMM.2026.3665758","url":null,"abstract":"The use of non-orthogonal signals has several benefits over orthogonal signals in multi-coded communications. We provide a novel, theoretical study of non-orthogonal signaling to expand the applicability of these schemes. Motivated by a class of multi-carrier spread spectrum systems, this paper presents a thorough symbol error rate analysis of the broad class of multi-code signaling methods when they make use of codes which are not necessarily orthogonal. Our analysis is also extended to the case where the code set includes the negative of each code vector, i.e., an extension to biorthogonal signaling. Moreover, it is shown that the symbol error rate results derived in this paper reduce to those available in the literature when the multi-codes are orthogonal or have equal correlation between vectors. Additionally, we show how Monte Carlo integration can be used to evaluate the integrals in the error probability calculation and derive low complexity upper bounds on the error probabilities. We show that by combining these techniques, the error probability can be efficiently computed across the full SNR regime. Finally, we use the upper bound of the error probability to develop some analytical insights about the impacts of non-orthogonality among the code vectors on the symbol error probability.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"74 ","pages":"5534-5545"},"PeriodicalIF":8.3,"publicationDate":"2026-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146208692","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}

引用次数: 0

Multimodal Fusion-Based Channel Prediction and Characterization for mmWave UAV A2G Communications 基于多模态融合的毫米波无人机A2G通信信道预测与表征

IF 8.3 2区计算机科学

IEEE Transactions on Communications Pub Date : 2026-02-13 DOI: 10.1109/TCOMM.2026.3664434

Zhichao Xin;Yu Liu;Jianping Xing;Jie Huang;Ji Bian;Zongkai Bai;Chuanteng Wang

{"title":"Multimodal Fusion-Based Channel Prediction and Characterization for mmWave UAV A2G Communications","authors":"Zhichao Xin;Yu Liu;Jianping Xing;Jie Huang;Ji Bian;Zongkai Bai;Chuanteng Wang","doi":"10.1109/TCOMM.2026.3664434","DOIUrl":"10.1109/TCOMM.2026.3664434","url":null,"abstract":"A channel prediction modeling method based on multimodal fusion perception is proposed for complex environments in unmanned aerial vehicle (UAV) air-to-ground (A2G) communications. Two-dimensional (2D) environmental information and three-dimensional (3D) point cloud data are fused to enhance the model’s ability to capture environment blockage, reflection, and multipath effects. The 2D information provides target objects’ planar distribution and texture features, while the 3D point clouds supplement spatial position, size, and height information. These complementary modalities comprehensively describe the geometric structures present in complex environments. A multimodal modeling network is constructed to explore the nonlinear mapping between environmental perception data and channel data. The network takes 2D building distribution, 3D point cloud data, global image features, UAV and receiver positions, and communication parameters as joint inputs. Feature extraction and fusion modules achieve effective joint encoding of heterogeneous multimodal features. A spatial feature decoupling (SFD) module is designed to address interference caused by coupled features. It separates the data distributions corresponding to different channel characteristics, improving the accuracy of channel impulse response (CIR) prediction. Experimental results demonstrate that the proposed method significantly improves the reliability and adaptability of UAV channel modeling in complex urban scenarios.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"74 ","pages":"5089-5104"},"PeriodicalIF":8.3,"publicationDate":"2026-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146198528","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}

引用次数: 0

Synesthesia of Machines-Based Multi-Modal Intelligent V2V Channel Model 基于多模态智能V2V通道模型的机器联觉

IF 8.3 2区计算机科学

IEEE Transactions on Communications Pub Date : 2026-02-13 DOI: 10.1109/TCOMM.2026.3664443

Zengrui Han;Lu Bai;Ziwei Huang;Xiang Cheng

{"title":"Synesthesia of Machines-Based Multi-Modal Intelligent V2V Channel Model","authors":"Zengrui Han;Lu Bai;Ziwei Huang;Xiang Cheng","doi":"10.1109/TCOMM.2026.3664443","DOIUrl":"10.1109/TCOMM.2026.3664443","url":null,"abstract":"This paper proposes a novel sixth-generation (6G) multi-modal intelligent vehicle-to-vehicle (V2V) channel model from light detection and ranging (LiDAR) point clouds based on Synesthesia of Machines (SoM). To explore the mapping relationship between physical environment and electromagnetic space, we construct a new V2V high-fidelity mixed sensing-communication integration simulation dataset with different vehicular traffic densities (VTDs). Based on the constructed dataset, we develop a novel scatterer recognition (ScaR) algorithm utilizing neural network SegNet to recognize scatterer spatial attributes from LiDAR point clouds via SoM. Subsequently, the developed ScaR algorithm is incorporated into channel modeling to recognize scatterers in a physically informed manner. We further distinguish recognized scatterers into dynamic and static scatterers based on LiDAR point cloud features. The aforementioned procedures determine parameters related to dynamic and static scatterers, e.g., distance, angle, and number, enabling the channel model to generate the corresponding channel impulse responses (CIRs). Through the ScaR algorithm, dynamic and static scatterers change with the variation of LiDAR point clouds over time, which precisely models channel non-stationarity and consistency under different VTDs. Some important channel statistical properties, such as time-frequency correlation function (TF-CF) and Doppler power spectral density (DPSD), are obtained and analyzed. Simulation results match well with ray-tracing (RT)-based results, thus demonstrating the necessity of exploring the mapping relationship and the utility of the proposed model.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"74 ","pages":"5058-5073"},"PeriodicalIF":8.3,"publicationDate":"2026-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146198527","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}

引用次数: 0

Joint Trajectory and Resource Optimization for Interference Management in Space-Air-Ground Integrated Networks Under Probabilistic LoS Channels 概率LoS信道下天空地一体化网络干扰管理联合轨迹与资源优化

IF 8.3 2区计算机科学

IEEE Transactions on Communications Pub Date : 2026-02-13 DOI: 10.1109/TCOMM.2026.3664437

Kisong Lee;Gitae Park;Sung Ho Chae

{"title":"Joint Trajectory and Resource Optimization for Interference Management in Space-Air-Ground Integrated Networks Under Probabilistic LoS Channels","authors":"Kisong Lee;Gitae Park;Sung Ho Chae","doi":"10.1109/TCOMM.2026.3664437","DOIUrl":"10.1109/TCOMM.2026.3664437","url":null,"abstract":"This study explores interference coordination for space-air-ground integrated networks under probabilistic line-of-sight (LoS) channel models, where the LoS probability of a wireless channel is statistically modeled based on the elevation angle between an unmanned aerial vehicle (UAV) and a ground node (GN). Unlike conventional approaches that simplify the model by neglecting either LoS or non-LoS (NLoS) channel components, we jointly optimize user scheduling, transmit power, and three-dimensional trajectory while fully accounting for both components. The objective is to maximize the minimum average spectral efficiency (SE) among GNs while ensuring the required SE for earth stations (ESs) served by satellites. Given the nonconvexity of the optimization problem, we decompose it into four subproblems and apply a successive convex approximation to make each subproblem convex with respect to the relevant optimization variable. Subsequently, we propose a low-complexity algorithm based on the block coordinate descent method to iteratively determine the optimal solution for each convex subproblem. Extensive simulations under various scenarios confirm that the UAV optimizes its horizontal and vertical trajectories to increase the LoS probability of the signal channel and the NLoS probability of the interference channel. This allows the UAV to serve GNs with high SE while reducing interference to the ESs. The results also demonstrate that the proposed scheme outperforms baseline schemes in terms of average SE by jointly optimizing the three-dimensional trajectory and communication resources.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"74 ","pages":"5504-5518"},"PeriodicalIF":8.3,"publicationDate":"2026-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146198525","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}

引用次数: 0

Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing 二值分布假设检验的实用短长度编码方案

IF 8.3 2区计算机科学

IEEE Transactions on Communications Pub Date : 2026-02-13 DOI: 10.1109/TCOMM.2026.3664684

Ismaila Salihou Adamou;Elsa Dupraz;Reza Asvadi;Tadashi Matsumoto

{"title":"Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing","authors":"Ismaila Salihou Adamou;Elsa Dupraz;Reza Asvadi;Tadashi Matsumoto","doi":"10.1109/TCOMM.2026.3664684","DOIUrl":"10.1109/TCOMM.2026.3664684","url":null,"abstract":"This paper addresses the design of practical short-length coding schemes for Distributed Hypothesis Testing (DHT). While most prior work on DHT has focused on information-theoretic analyses—deriving bounds on Type-II error exponents via achievability schemes based on quantization and quantize-binning—the practical implementation of DHT coding schemes has remained largely unexplored. Moreover, existing practical coding solutions for quantization and quantize-binning approaches were developed for source reconstruction tasks considering very long code lengths, and they are not directly applicable to DHT. In this context, this paper introduces efficient short-length implementations of quantization and quantize-binning schemes for DHT, constructed from short binary linear block codes. Numerical results show the efficiency of the proposed coding schemes compared to uncoded cases and to existing schemes initially developed for data reconstruction. In addition to practical code design, the paper derives exact analytical expressions for the Type-I and Type-II error probabilities associated with each proposed scheme. The provided analytical expressions are shown to predict accurately the practical performance measured from Monte Carlo simulations of the proposed schemes. These theoretical results are novel and offer a useful framework for optimizing and comparing practical DHT schemes across a wide range of source and code parameters.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"74 ","pages":"5045-5057"},"PeriodicalIF":8.3,"publicationDate":"2026-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146198523","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}

引用次数: 0

A Highway Vehicular Channel Model for OTFS Performance Evaluation 用于OTFS性能评价的公路车辆通道模型

IF 8.3 2区计算机科学

IEEE Transactions on Communications Pub Date : 2026-02-10 DOI: 10.1109/TCOMM.2026.3663522

A. Compagnoni;R. Tuninato;C. F. Chiasserini;R. Garello;A. Nordio;E. Viterbo

{"title":"A Highway Vehicular Channel Model for OTFS Performance Evaluation","authors":"A. Compagnoni;R. Tuninato;C. F. Chiasserini;R. Garello;A. Nordio;E. Viterbo","doi":"10.1109/TCOMM.2026.3663522","DOIUrl":"10.1109/TCOMM.2026.3663522","url":null,"abstract":"In vehicular communications, accurate modeling of real-world radio propagation channels is essential. To this end, we propose a novel stochastic model, named Vehicular-Tapped Delay-Line (V-TDL) that accurately captures the statistical behavior of multipath channels characterized by path-dependent gains, delays, and Doppler shifts. V-TDL supports diverse traffic conditions and road geometries by generating channel instances through well-established probability distributions. Also, it effectively models the parameters of the distributions through realistic geometry-based simulations, achieving the accuracy of a ray-tracing-based model while maintaining the low complexity of a purely stochastic approach. In contrast to existing models, V-TDL accounts for the correlation between propagation paths. Our findings show that this correlation is inherent in high-speed vehicular environments and neglecting it leads to a significant overestimation of channel diversity and system performance. We compare our model to existing alternatives to assess the performance of OTFS and OFDM modulations. The results demonstrate that, unlike traditional models such as the 3GPP EVA, V-TDL captures variations in channel diversity influenced by traffic intensity and road geometry, which impact the OTFS and OFDM performance. Although OTFS is penalized by path correlation, it consistently outperforms OFDM in all evaluated vehicular environments, confirming its suitability for high-speed vehicular communication scenarios.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"74 ","pages":"5074-5088"},"PeriodicalIF":8.3,"publicationDate":"2026-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146161390","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}

引用次数: 0

Efficient Encoding/Decoding Algorithms for Irreducible Polynomial Remainder Codes via Additive FFT 基于加性FFT的不可约多项式剩余码的高效编码/解码算法

IF 8.3 2区计算机科学

IEEE Transactions on Communications Pub Date : 2026-02-10 DOI: 10.1109/TCOMM.2026.3663509

Wenhao Liu;Zhengyi Jiang;Zhongyi Huang;Weitao Xu;Linqi Song;Hanxu Hou

{"title":"Efficient Encoding/Decoding Algorithms for Irreducible Polynomial Remainder Codes via Additive FFT","authors":"Wenhao Liu;Zhengyi Jiang;Zhongyi Huang;Weitao Xu;Linqi Song;Hanxu Hou","doi":"10.1109/TCOMM.2026.3663509","DOIUrl":"10.1109/TCOMM.2026.3663509","url":null,"abstract":"Polynomial remainder codes form a class of linear codes constructed based on the Chinese Remainder Theorem over polynomial rings, with Reed-Solomon codes as a special case. In particular, irreducible polynomial remainder codes are those where the moduli are pairwise coprime irreducible polynomials. This paper presents an efficient encoding and decoding method for irreducible polynomial remainder codes over <inline-formula> <tex-math>$mathbb {F}_{2^{m}}$ </tex-math></inline-formula>, leveraging the additive Fast Fourier Transform (additive FFT). The proposed approach achieves a computational complexity of <inline-formula> <tex-math>$mathcal {O}(Nlog ^{2}(N-K))$ </tex-math></inline-formula>, where <inline-formula> <tex-math>$N$ </tex-math></inline-formula> and <inline-formula> <tex-math>$K$ </tex-math></inline-formula> denote the code length and dimension, with the additional requirement that <inline-formula> <tex-math>$N-K lt 2^{m-1}$ </tex-math></inline-formula> and <inline-formula> <tex-math>$N-K$ </tex-math></inline-formula> is a power of 2. This substantially outperforms the best known algorithm for such codes, which has a complexity of <inline-formula> <tex-math>$mathcal {O}(N^{2})$ </tex-math></inline-formula>. Furthermore, we conduct a non-asymptotic complexity comparison under specific parameters, with numerical results demonstrating that the proposed algorithms effectively reduces computational complexity. For example, with code length <inline-formula> <tex-math>$N=256$ </tex-math></inline-formula> and dimension <inline-formula> <tex-math>$K=224$ </tex-math></inline-formula>, our method achieves an approximately 83% reduction in multiplicative complexity for encoding and a 50% reduction for decoding compared to the state-of-the-art approach for polynomial remainder codes.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"74 ","pages":"5574-5589"},"PeriodicalIF":8.3,"publicationDate":"2026-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146161379","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}

引用次数: 0

An Analytical Framework for HAPS Downlink Coverage Based on Stochastic Geometry 基于随机几何的HAPS下行覆盖分析框架

IF 8.3 2区计算机科学

IEEE Transactions on Communications Pub Date : 2026-02-10 DOI: 10.1109/TCOMM.2026.3663511

Geewon Jang;Dong-eui Kim;Jihwan P. Choi

{"title":"An Analytical Framework for HAPS Downlink Coverage Based on Stochastic Geometry","authors":"Geewon Jang;Dong-eui Kim;Jihwan P. Choi","doi":"10.1109/TCOMM.2026.3663511","DOIUrl":"10.1109/TCOMM.2026.3663511","url":null,"abstract":"The high-altitude platform station (HAPS), which is anticipated to play a key role in future networks, has drawn increasing attention in both industry and academia. In this paper, a realistic downlink communication scenario is introduced in which an aerodynamic HAPS flies along a circular trajectory and serves handheld users in an urban environment. Stochastic geometry-based analysis is conducted, along with the assimilation of approximations using simulation data to incorporate the circular aperture antenna model of the HAPS. Analytical expressions are derived for the coverage probability and the ergodic capacity, and the validity of these expressions is demonstrated through extensive Monte Carlo simulations. Although there are slight gaps in the performance analysis, the general tendencies between the analysis and simulation results show a close match. The impact of aerodynamic parameters such as flight radius and altitude on the coverage probability is demonstrated to be relatively marginal to that of communication system parameters such as the number of simultaneous service users and the total transmission power. In terms of ergodic capacity, both aerodynamic parameters show improved performance as their values decrease, with the altitude being more dominant. Although smaller flight radii are favorable for improving network performance, such configurations impose additional constraints on aircraft design, highlighting the need to carefully consider the limitations of size, weight, and power (SWaP). A discussion on real-world HAPS design is supplemented in order to offer practical guidelines for balancing communication performances with the SWaP constraints of the HAPS.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"74 ","pages":"5122-5137"},"PeriodicalIF":8.3,"publicationDate":"2026-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146161375","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}

引用次数: 0