arXiv - CS - Information Theory最新文献_第6页

On a Group Under Which Symmetric Reed-Muller Codes are Invariant 论对称里德-穆勒码不变的群组

arXiv - CS - Information Theory Pub Date : 2024-01-21 DOI: arxiv-2401.11496

Sibel Kurt Toplu, Talha Arikan, Pinar AydoğDu, OğUz Yayla

引用次数: 0

Triple-Refined Hybrid-Field Beam Training for mmWave Extremely Large-Scale MIMO 用于毫米波超大规模多输入多输出的三重定义混合场波束训练

arXiv - CS - Information Theory Pub Date : 2024-01-20 DOI: arxiv-2401.11195

Kangjian Chen, Chenhao Qi, Octavia A. Dobre, Geoffrey Ye Li

{"title":"Triple-Refined Hybrid-Field Beam Training for mmWave Extremely Large-Scale MIMO","authors":"Kangjian Chen, Chenhao Qi, Octavia A. Dobre, Geoffrey Ye Li","doi":"arxiv-2401.11195","DOIUrl":"https://doi.org/arxiv-2401.11195","url":null,"abstract":"This paper investigates beam training for extremely large-scale\u0000multiple-input multiple-output systems. By considering both the near field and\u0000far field, a triple-refined hybrid-field beam training scheme is proposed,\u0000where high-accuracy estimates of channel parameters are obtained through three\u0000steps of progressive beam refinement. First, the hybrid-field beam gain\u0000(HFBG)-based first refinement method is developed. Based on the analysis of the\u0000HFBG, the first-refinement codebook is designed and the beam training is\u0000performed accordingly to narrow down the potential region of the channel path.\u0000Then, the maximum likelihood (ML)-based and principle of stationary phase\u0000(PSP)-based second refinement methods are developed. By exploiting the\u0000measurements of the beam training, the ML is used to estimate the channel\u0000parameters. To avoid the high computational complexity of ML, closed-form\u0000estimates of the channel parameters are derived according to the PSP. Moreover,\u0000the Gaussian approximation (GA)-based third refinement method is developed. The\u0000hybrid-field neighboring search is first performed to identify the potential\u0000region of the main lobe of the channel steering vector. Afterwards, by applying\u0000the GA, a least-squares estimator is developed to obtain the high-accuracy\u0000channel parameter estimation. Simulation results verify the effectiveness of\u0000the proposed scheme.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"105 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559350","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

Joint Beamforming Optimization and Mode Selection for RDARS-aided MIMO Systems RDARS 辅助多输入多输出系统的联合波束成形优化和模式选择

arXiv - CS - Information Theory Pub Date : 2024-01-20 DOI: arxiv-2401.11205

Jintao Wang, Chengzhi Ma, Shiqi Gong, Xi Yang, Shaodan Ma

{"title":"Joint Beamforming Optimization and Mode Selection for RDARS-aided MIMO Systems","authors":"Jintao Wang, Chengzhi Ma, Shiqi Gong, Xi Yang, Shaodan Ma","doi":"arxiv-2401.11205","DOIUrl":"https://doi.org/arxiv-2401.11205","url":null,"abstract":"Considering the appealing distribution gains of distributed antenna systems\u0000(DAS) and passive gains of reconfigurable intelligent surface (RIS), a flexible\u0000reconfigurable architecture called reconfigurable distributed antenna and\u0000reflecting surface (RDARS) is proposed. RDARS encompasses DAS and RIS as two\u0000special cases and maintains the advantages of distributed antennas while\u0000reducing the hardware cost by replacing some active antennas with low-cost\u0000passive reflecting surfaces. In this paper, we present a RDARS-aided uplink\u0000multi-user communication system and investigate the system transmission\u0000reliability with the newly proposed architecture. Specifically, in addition to\u0000the distribution gain and the reflection gain provided by the connection and\u0000reflection modes, respectively, we also consider the dynamic mode switching of\u0000each element which introduces an additional degree of freedom (DoF) and thus\u0000results in a selection gain. As such, we aim to minimize the total sum\u0000mean-square-error (MSE) of all data streams by jointly optimizing the receive\u0000beamforming matrix, the reflection phase shifts and the channel-aware placement\u0000of elements in the connection mode. To tackle this nonconvex problem with\u0000intractable binary and cardinality constraints, we propose an inexact block\u0000coordinate descent (BCD) based penalty dual decomposition (PDD) algorithm with\u0000the guaranteed convergence. Since the PDD algorithm usually suffers from high\u0000computational complexity, a low-complexity greedy-search-based alternating\u0000optimization (AO) algorithm is developed to yield a semi-closed-form solution\u0000with acceptable performance. Numerical results demonstrate the superiority of\u0000the proposed architecture compared to the conventional fully passive RIS or\u0000DAS. Furthermore, some insights about the practical implementation of RDARS are\u0000provided.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"122 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559440","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

On the Information Leakage Performance of Secure Finite Blocklength Transmissions over Rayleigh Fading Channels 论瑞利衰减信道上有限块长安全传输的信息泄漏性能

arXiv - CS - Information Theory Pub Date : 2024-01-20 DOI: arxiv-2401.11219

Milad Tatar Mamaghani, Xiangyun Zhou, Nan Yang, A. Lee Swindlehurst, H. Vincent Poor

{"title":"On the Information Leakage Performance of Secure Finite Blocklength Transmissions over Rayleigh Fading Channels","authors":"Milad Tatar Mamaghani, Xiangyun Zhou, Nan Yang, A. Lee Swindlehurst, H. Vincent Poor","doi":"arxiv-2401.11219","DOIUrl":"https://doi.org/arxiv-2401.11219","url":null,"abstract":"This paper presents a secrecy performance study of a wiretap communication\u0000system with finite blocklength (FBL) transmissions over Rayleigh fading\u0000channels, based on the definition of an average information leakage (AIL)\u0000metric. We evaluate the exact and closed-form approximate AIL performance,\u0000assuming that only statistical channel state information (CSI) of the\u0000eavesdropping link is available. Then, we reveal an inherent statistical\u0000relationship between the AIL metric in the FBL regime and the commonly-used\u0000secrecy outage probability in conventional infinite blocklength communications.\u0000Aiming to improve the secure communication performance of the considered\u0000system, we formulate a blocklength optimization problem and solve it via a\u0000low-complexity approach. Next, we present numerical results to verify our\u0000analytical findings and provide various important insights into the impacts of\u0000system parameters on the AIL. Specifically, our results indicate that i)\u0000compromising a small amount of AIL can lead to significant reliability\u0000improvements, and ii) the AIL experiences a secrecy floor in the high\u0000signal-to-noise ratio regime.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"256 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559145","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

Interference-Aware Queuing Analysis for Distributed Transmission Control in UAV Networks 无人机网络分布式传输控制的干扰感知排队分析

arXiv - CS - Information Theory Pub Date : 2024-01-20 DOI: arxiv-2401.11084

Masoud Ghazikor, Keenan Roach, Kenny Cheung, Morteza Hashemi

{"title":"Interference-Aware Queuing Analysis for Distributed Transmission Control in UAV Networks","authors":"Masoud Ghazikor, Keenan Roach, Kenny Cheung, Morteza Hashemi","doi":"arxiv-2401.11084","DOIUrl":"https://doi.org/arxiv-2401.11084","url":null,"abstract":"In this paper, we investigate the problem of distributed transmission control\u0000for unmanned aerial vehicles (UAVs) operating in unlicensed spectrum bands. We\u0000develop a rigorous interference-aware queuing analysis framework that jointly\u0000considers two inter-dependent factors: (i) limited-size queues with\u0000delay-constrained packet arrival, and (ii) in-band interference introduced by\u0000other ground/aerial users. We aim to optimize the expected throughput by\u0000jointly analyzing these factors. In the queuing analysis, we explore two packet\u0000loss probabilities including, buffer overflow model and time threshold model.\u0000For interference analysis, we investigate the outage probability and packet\u0000losses due to low signal-to-interference-plus-noise ratio (SINR). We introduce\u0000two algorithms namely, Interference-Aware Transmission Control (IA-TC), and\u0000Interference-Aware Distributed Transmission Control (IA-DTC). These algorithms\u0000maximize the expected throughput by adjusting transmission policies to balance\u0000the trade-offs between packet drop from queues vs. transmission errors due to\u0000low SINRs. We implement the proposed algorithms and demonstrate that the\u0000optimal transmission policy under various scenarios is found.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"66 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559141","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

Wideband Beamforming for RIS Assisted Near-Field Communications 用于 RIS 辅助近场通信的宽带波束成形

arXiv - CS - Information Theory Pub Date : 2024-01-20 DOI: arxiv-2401.11141

Ji Wang, Jian Xiao, Yixuan Zou, Wenwu Xie, Yuanwei Liu

{"title":"Wideband Beamforming for RIS Assisted Near-Field Communications","authors":"Ji Wang, Jian Xiao, Yixuan Zou, Wenwu Xie, Yuanwei Liu","doi":"arxiv-2401.11141","DOIUrl":"https://doi.org/arxiv-2401.11141","url":null,"abstract":"A near-field wideband beamforming scheme is investigated for reconfigurable\u0000intelligent surface (RIS) assisted multiple-input multiple-output (MIMO)\u0000systems, in which a deep learning-based end-to-end (E2E) optimization framework\u0000is proposed to maximize the system spectral efficiency. To deal with the\u0000near-field double beam split effect, the base station is equipped with\u0000frequency-dependent hybrid precoding architecture by introducing sub-connected\u0000true time delay (TTD) units, while two specific RIS architectures, namely true\u0000time delay-based RIS (TTD-RIS) and virtual subarray-based RIS (SA-RIS), are\u0000exploited to realize the frequency-dependent passive beamforming at the RIS.\u0000Furthermore, the efficient E2E beamforming models without explicit channel\u0000state information are proposed, which jointly exploits the uplink channel\u0000training module and the downlink wideband beamforming module. In the proposed\u0000network architecture of the E2E models, the classical communication signal\u0000processing methods, i.e., polarized filtering and sparsity transform, are\u0000leveraged to develop a signal-guided beamforming network. Numerical results\u0000show that the proposed E2E models have superior beamforming performance and\u0000robustness to conventional beamforming benchmarks. Furthermore, the tradeoff\u0000between the beamforming gain and the hardware complexity is investigated for\u0000different frequency-dependent RIS architectures, in which the TTD-RIS can\u0000achieve better spectral efficiency than the SA-RIS while requiring additional\u0000energy consumption and hardware cost.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"210 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559159","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

Two-Insertion/Deletion/Substitution Correcting Codes 双插入/删除/替换校正码

arXiv - CS - Information Theory Pub Date : 2024-01-20 DOI: arxiv-2401.11231

Yuhang Pi, Zhifang Zhang

引用次数: 0

Deep Learning-Based Adaptive Joint Source-Channel Coding using Hypernetworks 利用超网络进行基于深度学习的自适应源-信道联合编码

arXiv - CS - Information Theory Pub Date : 2024-01-20 DOI: arxiv-2401.11155

Songjie Xie, Hengtao He, Hongru Li, Shenghui Song, Jun Zhang, Ying-Jun Angela Zhang, Khaled B. Letaief

引用次数: 0

New Perfect and Distance-Optimal Sum-Rank Codes 新的完美代码和距离最优和值代码

arXiv - CS - Information Theory Pub Date : 2024-01-20 DOI: arxiv-2401.11160

Hao Chen

{"title":"New Perfect and Distance-Optimal Sum-Rank Codes","authors":"Hao Chen","doi":"arxiv-2401.11160","DOIUrl":"https://doi.org/arxiv-2401.11160","url":null,"abstract":"Constructions of infinite families of distance-optimal codes in the Hamming\u0000metric and the sum-rank metric are challenging problems and have attracted many\u0000attentions. In this paper, we give the following three results. 1) If $lambda|q^{sm}-1$ and $lambda\u0000<sqrt{frac{(q^s-1)}{2(q-1)^2(1+epsilon)}}$, an infinite family of\u0000distance-optimal $q$-ary cyclic sum-rank codes with the block length\u0000$t=frac{q^{sm}-1}{lambda}$, the matrix size $s times s$, the cardinality\u0000$q^{s^2t-s(2m+3)}$ and the minimum sum-rank distance four is constructed. 2) Block length $q^4-1$ and the matrix size $2 times 2$ distance-optimal\u0000sum-rank codes with the minimum sum-rank distance four and the Singleton defect\u0000four are constructed. These sum-rank codes are close to the sphere packing\u0000bound , the Singleton-like bound and have much larger block length\u0000$q^4-1>>q-1$. 3) For given positive integers $n$ and $m$ satisfying $m<n$, an infinite\u0000family of perfect sum-rank codes with the matrix size $m times n$, and the\u0000minimum sum-rank distance three is also constructed. The construction of perfect sum-rank codes of the matrix size $m times n$,\u0000$1<m<n$, answers the open problem proposed by U. Mart'{i}nez-Pe~{n}as in\u00002019 positively.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559328","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

Hierarchical Cell-Free Massive MIMO for High Capacity with Simple Implementation 分层无小区大规模多输入多输出（MIMO），实现简单的高容量

arXiv - CS - Information Theory Pub Date : 2024-01-20 DOI: arxiv-2401.11236

Wei Jiang, Hans D. Schotten

引用次数: 0