arXiv - MATH - Information Theory最新文献_第8页

Optimal SSB Beam Planning and UAV Cell Selection for 5G Connectivity on Aerial Highways 优化 SSB 波束规划和无人机小区选择，在空中高速公路上实现 5G 连接

arXiv - MATH - Information Theory Pub Date : 2024-09-03 DOI: arxiv-2409.01812

Matteo Bernabe, David Lopez-Perez, Nicola Piovesan, Giovanni Geraci, David Gesbert

{"title":"Optimal SSB Beam Planning and UAV Cell Selection for 5G Connectivity on Aerial Highways","authors":"Matteo Bernabe, David Lopez-Perez, Nicola Piovesan, Giovanni Geraci, David Gesbert","doi":"arxiv-2409.01812","DOIUrl":"https://doi.org/arxiv-2409.01812","url":null,"abstract":"In this article, we introduce a method to optimize 5G massive multiple-input\u0000multiple-output (mMIMO) connectivity for unmanned aerial vehicles (UAVs) on\u0000aerial highways through strategic cell association. UAVs operating in 3D space\u0000encounter distinct channel conditions compared to traditional ground user\u0000equipment (gUE); under the typical line of sight (LoS) condition, UAVs perceive\u0000strong reference signal received power (RSRP) from multiple cells within the\u0000network, resulting in a large set of suitable serving cell candidates and in\u0000low signal-to-interference-plus-noise ratio (SINR) due to high interference\u0000levels. Additionally, a downside of aerial highways is to pack possibly many\u0000UAVs along a small portion of space which, when taking into account typical LoS\u0000propagation conditions, results in high channel correlation and severely limits\u0000spatial multiplexing capabilities. In this paper, we propose a solution to both problems based on the suitable\u0000selection of serving cells based on a new metric which differs from the\u0000classical terrestrial approaches based on maximum RSRP. We then introduce an\u0000algorithm for optimal planning of synchronization signal block (SSB) beams for\u0000this set of cells, ensuring maximum coverage and effective management of UAVs\u0000cell associations. Simulation results demonstrate that our approach\u0000significantly improves the rates of UAVs on aerial highways, up to four times\u0000in achievable data rates, without impacting ground user performance.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"7 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142227043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Exploiting Six-Dimensional Movable Antenna for Wireless Sensing 利用六维移动天线进行无线传感

arXiv - MATH - Information Theory Pub Date : 2024-09-03 DOI: arxiv-2409.01965

Xiaodan Shao, Rui Zhang, Robert Schober

{"title":"Exploiting Six-Dimensional Movable Antenna for Wireless Sensing","authors":"Xiaodan Shao, Rui Zhang, Robert Schober","doi":"arxiv-2409.01965","DOIUrl":"https://doi.org/arxiv-2409.01965","url":null,"abstract":"Six-dimensional movable antenna (6DMA) is an emerging technology that is able\u0000to fully exploit the spatial variation of wireless channels by controlling the\u00003D positions and 3D rotations of distributed antennas/antenna surfaces at the\u0000transmitter/receiver. In this letter, we apply 6DMA at the base station (BS) to\u0000enhance its wireless sensing performance over a given set of regions. To this\u0000end, we first divide each region into a number of equal-size subregions and\u0000select one typical target location within each subregion. Then, we derive an\u0000expression for the Cramer-Rao bound (CRB) for estimating the directions of\u0000arrival (DoAs) from these typical target locations in all regions, which sheds\u0000light on the sensing performance of 6DMA enhanced systems in terms of a power\u0000gain and a geometric gain. Next, we minimize the CRB for DoA estimation via\u0000jointly optimizing the positions and rotations of all 6DMAs at the BS, subject\u0000to practical movement constraints, and propose an efficient algorithm to solve\u0000the resulting non-convex optimization problem sub-optimally. Finally,\u0000simulation results demonstrate the significant improvement in DoA estimation\u0000accuracy achieved by the proposed 6DMA sensing scheme as compared to various\u0000benchmark schemes, for both isotropic and directive antenna radiation patterns.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"59 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Power Control and Random Serving Mode Allocation for CJT-NCJT Hybrid Mode Enabled Cell-Free Massive MIMO With Limited Fronthauls 为采用 CJT-NCJT 混合模式、前置信道有限的无小区大规模 MIMO 提供功率控制和随机服务模式分配

arXiv - MATH - Information Theory Pub Date : 2024-09-03 DOI: arxiv-2409.01957

Hangyu Zhang, Rui Zhang, Yongzhao Li, Yuhan Ruan, Tao Li, Dong Yang

{"title":"Power Control and Random Serving Mode Allocation for CJT-NCJT Hybrid Mode Enabled Cell-Free Massive MIMO With Limited Fronthauls","authors":"Hangyu Zhang, Rui Zhang, Yongzhao Li, Yuhan Ruan, Tao Li, Dong Yang","doi":"arxiv-2409.01957","DOIUrl":"https://doi.org/arxiv-2409.01957","url":null,"abstract":"With a great potential of improving the service fairness and quality for user\u0000equipments (UEs), cell-free massive multiple-input multiple-output (mMIMO) has\u0000been regarded as an emerging candidate for 6G network architectures. Under\u0000ideal assumptions, the coherent joint transmission (CJT) serving mode has been\u0000considered as an optimal option for cell-free mMIMO systems, since it can\u0000achieve coherent cooperation gain among the access points. However, when\u0000considering the limited fronthaul constraint in practice, the non-coherent\u0000joint transmission (NCJT) serving mode is likely to outperform CJT, since the\u0000former requires much lower fronthaul resources. In other words, the performance\u0000excellence and worseness of single serving mode (CJT or NCJT) depends on the\u0000fronthaul capacity, and any single transmission mode cannot perfectly adapt the\u0000capacity limited fronthaul. To explore the performance potential of the\u0000cell-free mMIMO system with limited fronthauls by harnessing the merits of CJT\u0000and NCJT, we propose a CJT-NCJT hybrid serving mode framework, in which UEs are\u0000allocated to operate on CJT or NCJT serving mode. To improve the sum-rate of\u0000the system with low complexity, we first propose a probability-based random\u0000serving mode allocation scheme. With a given serving mode, a successive convex\u0000approximation-based power allocation algorithm is proposed to maximize the\u0000system's sum-rate. Simulation results demonstrate the superiority of the\u0000proposed scheme.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"161 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Effective Distance of Higher Dimensional HGPs and Weight-Reduced Quantum LDPC Codes 高维 HGP 和减权量子 LDPC 码的有效距离

arXiv - MATH - Information Theory Pub Date : 2024-09-03 DOI: arxiv-2409.02193

Shi Jie Samuel Tan, Lev Stambler

{"title":"Effective Distance of Higher Dimensional HGPs and Weight-Reduced Quantum LDPC Codes","authors":"Shi Jie Samuel Tan, Lev Stambler","doi":"arxiv-2409.02193","DOIUrl":"https://doi.org/arxiv-2409.02193","url":null,"abstract":"Quantum error correction plays a prominent role in the realization of quantum\u0000computation, and quantum low-density parity-check (qLDPC) codes are believed to\u0000be practically useful stabilizer codes. While qLDPC codes are defined to have\u0000constant weight parity-checks, the weight of these parity checks could be large\u0000constants that make implementing these codes challenging. Large constants can\u0000also result in long syndrome extraction times and bad error propagation that\u0000can impact error correction performance. Hastings recently introduced weight\u0000reduction techniques for qLDPC codes that reduce the weight of the parity\u0000checks as well as the maximum number of checks that acts on any data qubit.\u0000However, the fault tolerance of these techniques remains an open question. In\u0000this paper, we analyze the effective distance of the weight-reduced code when\u0000single-ancilla syndrome extraction circuits are considered for error\u0000correction. We prove that there exists single-ancilla syndrome extraction\u0000circuits that largely preserve the effective distance of the weight-reduced\u0000qLDPC codes. In addition, we also show that the distance balancing technique\u0000introduced by Evra et al. preserves effective distance. As a corollary, our\u0000result shows that higher-dimensional hypergraph product (HGP) codes, also known\u0000as homological product codes corresponding to the product of 1-complexes, have\u0000no troublesome hook errors when using any single-ancilla syndrome extraction\u0000circuit.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"10 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142227859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Exploring Hannan Limitation for 3D Antenna Array 探索三维天线阵列的汉南限制

arXiv - MATH - Information Theory Pub Date : 2024-09-03 DOI: arxiv-2409.01566

Ran Ji, Chongwen Huang, Xiaoming Chen, Wei E. I. Sha, Zhaoyang Zhang, Jun Yang, Kun Yang, Chau Yuen, Mérouane Debbah

{"title":"Exploring Hannan Limitation for 3D Antenna Array","authors":"Ran Ji, Chongwen Huang, Xiaoming Chen, Wei E. I. Sha, Zhaoyang Zhang, Jun Yang, Kun Yang, Chau Yuen, Mérouane Debbah","doi":"arxiv-2409.01566","DOIUrl":"https://doi.org/arxiv-2409.01566","url":null,"abstract":"Hannan Limitation successfully links the directivity characteristics of 2D\u0000arrays with the aperture gain limit, providing the radiation efficiency upper\u0000limit for large 2D planar antenna arrays. This demonstrates the inevitable\u0000radiation efficiency degradation caused by mutual coupling effects between\u0000array elements. However, this limitation is derived based on the assumption of\u0000infinitely large 2D arrays, which means that it is not an accurate law for\u0000small-size arrays. In this paper, we extend this theory and propose an\u0000estimation formula for the radiation efficiency upper limit of finite-sized 2D\u0000arrays. Furthermore, we analyze a 3D array structure consisting of two parallel\u00002D arrays. Specifically, we provide evaluation formulas for the mutual coupling\u0000strengths for both infinite and finite size arrays and derive the fundamental\u0000efficiency limit of 3D arrays. Moreover, based on the established gain limit of\u0000antenna arrays with fixed aperture sizes, we derive the achievable gain limit\u0000of finite size 3D arrays. Besides the performance analyses, we also investigate\u0000the spatial radiation characteristics of the considered 3D array structure,\u0000offering a feasible region for 2D phase settings under a given energy\u0000attenuation threshold. Through simulations, we demonstrate the effectiveness of\u0000our proposed theories and gain advantages of 3D arrays for better spatial\u0000coverage under various scenarios.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Exact Error Exponents of Concatenated Codes for DNA Storage 用于 DNA 存储的串联代码的精确误差指数

arXiv - MATH - Information Theory Pub Date : 2024-09-02 DOI: arxiv-2409.01223

Yan Hao Ling, Jonathan Scarlett

{"title":"Exact Error Exponents of Concatenated Codes for DNA Storage","authors":"Yan Hao Ling, Jonathan Scarlett","doi":"arxiv-2409.01223","DOIUrl":"https://doi.org/arxiv-2409.01223","url":null,"abstract":"In this paper, we consider a concatenated coding based class of DNA storage\u0000codes in which the selected molecules are constrained to be taken from an\u0000``inner'' codebook associated with the sequencing channel. This codebook is\u0000used in a ``black-box'' manner, and is only assumed to operate at an achievable\u0000rate in the sense of attaining asymptotically vanishing maximal (inner) error\u0000probability. We first derive the exact error exponent in a widely-studied\u0000regime of constant rate and a linear number of sequencing reads, and show\u0000strict improvements over an existing achievable error exponent. Moreover, our\u0000achievability analysis is based on a coded-index strategy, implying that such\u0000strategies attain the highest error exponents within the broader class of codes\u0000that we consider. We then extend our results to other scaling regimes,\u0000including a super-linear number of reads, as well as several certain low-rate\u0000regimes. We find that the latter comes with notable intricacies, such as the\u0000suboptimality of codewords with all distinct molecules, and certain\u0000dependencies of the error exponents on the model for sequencing errors.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"37 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Conversational Complexity for Assessing Risk in Large Language Models 评估大型语言模型风险的对话复杂性

arXiv - MATH - Information Theory Pub Date : 2024-09-02 DOI: arxiv-2409.01247

John Burden, Manuel Cebrian, Jose Hernandez-Orallo

{"title":"Conversational Complexity for Assessing Risk in Large Language Models","authors":"John Burden, Manuel Cebrian, Jose Hernandez-Orallo","doi":"arxiv-2409.01247","DOIUrl":"https://doi.org/arxiv-2409.01247","url":null,"abstract":"Large Language Models (LLMs) present a dual-use dilemma: they enable\u0000beneficial applications while harboring potential for harm, particularly\u0000through conversational interactions. Despite various safeguards, advanced LLMs\u0000remain vulnerable. A watershed case was Kevin Roose's notable conversation with\u0000Bing, which elicited harmful outputs after extended interaction. This contrasts\u0000with simpler early jailbreaks that produced similar content more easily,\u0000raising the question: How much conversational effort is needed to elicit\u0000harmful information from LLMs? We propose two measures: Conversational Length\u0000(CL), which quantifies the conversation length used to obtain a specific\u0000response, and Conversational Complexity (CC), defined as the Kolmogorov\u0000complexity of the user's instruction sequence leading to the response. To\u0000address the incomputability of Kolmogorov complexity, we approximate CC using a\u0000reference LLM to estimate the compressibility of user instructions. Applying\u0000this approach to a large red-teaming dataset, we perform a quantitative\u0000analysis examining the statistical distribution of harmful and harmless\u0000conversational lengths and complexities. Our empirical findings suggest that\u0000this distributional analysis and the minimisation of CC serve as valuable tools\u0000for understanding AI safety, offering insights into the accessibility of\u0000harmful information. This work establishes a foundation for a new perspective\u0000on LLM safety, centered around the algorithmic complexity of pathways to harm.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"287 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Bounds for Joint Detection and Decoding on the Binary-Input AWGN Channel 二进制输入 AWGN 信道上的联合检测和解码边界

arXiv - MATH - Information Theory Pub Date : 2024-09-02 DOI: arxiv-2409.01119

Simon Obermüller, Jannis Clausius, Marvin Geiselhart, Stephan ten Brink

引用次数: 0

Uplink Over-the-Air Aggregation for Multi-Model Wireless Federated Learning 多模式无线联合学习的上行链路空中聚合

arXiv - MATH - Information Theory Pub Date : 2024-09-02 DOI: arxiv-2409.00978

Chong Zhang, Min Dong, Ben Liang, Ali Afana, Yahia Ahmed

引用次数: 0

Refined Statistical Bounds for Classification Error Mismatches with Constrained Bayes Error 受约束贝叶斯误差分类误差不匹配的精炼统计边界

arXiv - MATH - Information Theory Pub Date : 2024-09-02 DOI: arxiv-2409.01309

Zijian Yang, Vahe Eminyan, Ralf Schlüter, Hermann Ney

引用次数: 0