Sibel Kurt Toplu, Talha Arikan, Pinar AydoğDu, OğUz Yayla
The Reed-Muller codes are a family of error-correcting codes that have been widely studied in coding theory. In 2020, Wei Yan and Sian-Jheng Lin introduced a variant of Reed-Muller codes so called symmetric Reed-Muller codes. We investigate linear maps of the automorphism group of symmetric Reed-Muller codes and show that the set of these linear maps forms a subgroup of the general linear group, which is the automorphism group of punctured Reed-Muller codes. We provide a method to determine all the automorphisms in this subgroup explicitly for some special cases.
里德-穆勒码是编码理论中被广泛研究的纠错码系列。2020 年，Wei Yan 和 Sian-Jheng Lin 提出了 Reed-Muller 码的一种变体，称为对称 Reed-Muller 码。我们研究了对称里德-穆勒码自形群的线性映射，并证明这些线性映射的集合构成了一般线性群的一个子群，而一般线性群是穿刺里德-穆勒码的自形群。我们提供了一种方法，可以在某些特殊情况下明确确定这个子群中的所有自变群。
{"title":"On a Group Under Which Symmetric Reed-Muller Codes are Invariant","authors":"Sibel Kurt Toplu, Talha Arikan, Pinar AydoğDu, OğUz Yayla","doi":"arxiv-2401.11496","DOIUrl":"https://doi.org/arxiv-2401.11496","url":null,"abstract":"The Reed-Muller codes are a family of error-correcting codes that have been\u0000widely studied in coding theory. In 2020, Wei Yan and Sian-Jheng Lin introduced\u0000a variant of Reed-Muller codes so called symmetric Reed-Muller codes. We\u0000investigate linear maps of the automorphism group of symmetric Reed-Muller\u0000codes and show that the set of these linear maps forms a subgroup of the\u0000general linear group, which is the automorphism group of punctured Reed-Muller\u0000codes. We provide a method to determine all the automorphisms in this subgroup\u0000explicitly for some special cases.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559337","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}
Kangjian Chen, Chenhao Qi, Octavia A. Dobre, Geoffrey Ye Li
This paper investigates beam training for extremely large-scale multiple-input multiple-output systems. By considering both the near field and far field, a triple-refined hybrid-field beam training scheme is proposed, where high-accuracy estimates of channel parameters are obtained through three steps of progressive beam refinement. First, the hybrid-field beam gain (HFBG)-based first refinement method is developed. Based on the analysis of the HFBG, the first-refinement codebook is designed and the beam training is performed accordingly to narrow down the potential region of the channel path. Then, the maximum likelihood (ML)-based and principle of stationary phase (PSP)-based second refinement methods are developed. By exploiting the measurements of the beam training, the ML is used to estimate the channel parameters. To avoid the high computational complexity of ML, closed-form estimates of the channel parameters are derived according to the PSP. Moreover, the Gaussian approximation (GA)-based third refinement method is developed. The hybrid-field neighboring search is first performed to identify the potential region of the main lobe of the channel steering vector. Afterwards, by applying the GA, a least-squares estimator is developed to obtain the high-accuracy channel parameter estimation. Simulation results verify the effectiveness of the proposed scheme.
本文研究了超大规模多输入多输出系统的波束训练。通过同时考虑近场和远场，提出了一种三重细化混合场波束训练方案，通过三步渐进式波束细化获得高精度的信道参数估计。首先，开发了基于混合场波束增益（HFBG）的第一次细化方法。然后，开发了基于最大似然（ML）和基于静止相位原理（PSP）的第二次细化方法。通过利用波束训练的主题测量，最大似然法被用来估计信道参数。为了避免 ML 的高计算复杂性，根据 PSP 得出了信道参数的闭式估计值。此外，还开发了基于高斯近似（GA）的第三次细化方法。首先进行混合场邻域搜索，以确定信道转向矢量主叶的潜在区域。然后，通过应用 GA，开发出最小二乘估计器，以获得高精度信道参数估计。仿真结果验证了所提方案的有效性。
{"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}
Jintao Wang, Chengzhi Ma, Shiqi Gong, Xi Yang, Shaodan Ma
Considering the appealing distribution gains of distributed antenna systems (DAS) and passive gains of reconfigurable intelligent surface (RIS), a flexible reconfigurable architecture called reconfigurable distributed antenna and reflecting surface (RDARS) is proposed. RDARS encompasses DAS and RIS as two special cases and maintains the advantages of distributed antennas while reducing the hardware cost by replacing some active antennas with low-cost passive reflecting surfaces. In this paper, we present a RDARS-aided uplink multi-user communication system and investigate the system transmission reliability with the newly proposed architecture. Specifically, in addition to the distribution gain and the reflection gain provided by the connection and reflection modes, respectively, we also consider the dynamic mode switching of each element which introduces an additional degree of freedom (DoF) and thus results in a selection gain. As such, we aim to minimize the total sum mean-square-error (MSE) of all data streams by jointly optimizing the receive beamforming matrix, the reflection phase shifts and the channel-aware placement of elements in the connection mode. To tackle this nonconvex problem with intractable binary and cardinality constraints, we propose an inexact block coordinate descent (BCD) based penalty dual decomposition (PDD) algorithm with the guaranteed convergence. Since the PDD algorithm usually suffers from high computational complexity, a low-complexity greedy-search-based alternating optimization (AO) algorithm is developed to yield a semi-closed-form solution with acceptable performance. Numerical results demonstrate the superiority of the proposed architecture compared to the conventional fully passive RIS or DAS. Furthermore, some insights about the practical implementation of RDARS are provided.
考虑到分布式天线系统（DAS）诱人的分布增益和可重构智能表面（RIS）的无源增益，一种名为可重构分布式天线和反射表面（RDARS）的灵活可重构架构被提出。RDARS 包括 DAS 和 RIS 两种特殊情况，既保持了分布式天线的优势，又通过用低成本的无源反射面取代部分有源天线降低了硬件成本。本文提出了一种 RDARS 辅助上行链路多用户通信系统，并研究了新提出架构下的系统传输可靠性。具体来说，除了连接模式和反射模式分别提供的分布增益和反射增益外，我们还考虑了每个元件的动态模式切换，这将引入额外的自由度（DoF），从而产生选择增益。因此，我们的目标是通过联合优化接收波束成形矩阵、反射相移和连接模式中的信道感知元件位置，最大限度地减少所有数据流的总均方误差（MSE）。为了解决这个具有难解的二进制和卡片数约束的非凸问题，我们提出了一种基于非精确块坐标下降（BCD）的惩罚性二元分解（PDD）算法，并保证了收敛性。由于 PDD 算法通常具有较高的计算复杂度，因此我们开发了一种基于贪婪搜索的低复杂度交替优化（AO）算法，以获得具有可接受性能的半封闭形式解。数值结果表明，与传统的全被动 RIS 或 DAS 相比，所提出的架构更有优势。此外，还提供了有关 RDARS 实际实现的一些见解。
{"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}
Milad Tatar Mamaghani, Xiangyun Zhou, Nan Yang, A. Lee Swindlehurst, H. Vincent Poor
This paper presents a secrecy performance study of a wiretap communication system with finite blocklength (FBL) transmissions over Rayleigh fading channels, based on the definition of an average information leakage (AIL) metric. We evaluate the exact and closed-form approximate AIL performance, assuming that only statistical channel state information (CSI) of the eavesdropping link is available. Then, we reveal an inherent statistical relationship between the AIL metric in the FBL regime and the commonly-used secrecy outage probability in conventional infinite blocklength communications. Aiming to improve the secure communication performance of the considered system, we formulate a blocklength optimization problem and solve it via a low-complexity approach. Next, we present numerical results to verify our analytical findings and provide various important insights into the impacts of system parameters on the AIL. Specifically, our results indicate that i) compromising a small amount of AIL can lead to significant reliability improvements, and ii) the AIL experiences a secrecy floor in the high signal-to-noise ratio regime.
本文基于平均信息泄漏（AIL）指标的定义，对在瑞利衰减信道上进行有限块长（FBL）传输的窃听通信系统进行了保密性能研究。假设只有窃听链路的统计信道状态信息（CSI）可用，我们评估了精确和闭式近似 AIL 性能。然后，我们揭示了 FBL 机制中的 AIL 指标与传统无限块长通信中常用的泄密概率之间的内在统计关系。为了提高考虑系统的安全通信性能，我们提出了一个块长优化问题，并通过低复杂度方法解决了这个问题。接下来，我们给出了数值结果来验证我们的分析结论，并就系统参数对 AIL 的影响提供了各种重要见解。具体来说，我们的结果表明：i)牺牲少量 AIL 可以显著提高可靠性；ii)AIL 在高信噪比情况下会出现保密下限。
{"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}
In this paper, we investigate the problem of distributed transmission control for unmanned aerial vehicles (UAVs) operating in unlicensed spectrum bands. We develop a rigorous interference-aware queuing analysis framework that jointly considers two inter-dependent factors: (i) limited-size queues with delay-constrained packet arrival, and (ii) in-band interference introduced by other ground/aerial users. We aim to optimize the expected throughput by jointly analyzing these factors. In the queuing analysis, we explore two packet loss probabilities including, buffer overflow model and time threshold model. For interference analysis, we investigate the outage probability and packet losses due to low signal-to-interference-plus-noise ratio (SINR). We introduce two algorithms namely, Interference-Aware Transmission Control (IA-TC), and Interference-Aware Distributed Transmission Control (IA-DTC). These algorithms maximize the expected throughput by adjusting transmission policies to balance the trade-offs between packet drop from queues vs. transmission errors due to low SINRs. We implement the proposed algorithms and demonstrate that the optimal transmission policy under various scenarios is found.
在本文中，我们研究了在未授权频段运行的无人驾驶飞行器（UAV）的分布式传输控制问题。我们开发了一个严格的干扰感知队列分析框架，该框架联合考虑了两个相互依存的因素：(i) 有限大小的队列和延迟受限的数据包到达，以及 (ii) 其他地面/空中用户引入的带内干扰。我们的目标是通过联合分析这些因素来优化预期吞吐量。在队列分析中，我们探讨了两种丢包概率，包括缓冲区溢出模型和时间阈值模型。在干扰分析中，我们研究了低信号干扰加噪声比（SINR）导致的中断概率和丢包情况。我们引入了两种算法，即干扰感知传输控制（IA-TC）和干扰感知分布式传输控制（IA-DTC）。这些算法通过调整传输策略来平衡队列中的数据包丢弃与低信噪比导致的传输错误之间的权衡，从而最大限度地提高预期吞吐量。我们实现了所提出的算法，并证明在各种情况下都能找到最佳传输策略。
{"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}
Ji Wang, Jian Xiao, Yixuan Zou, Wenwu Xie, Yuanwei Liu
A near-field wideband beamforming scheme is investigated for reconfigurable intelligent surface (RIS) assisted multiple-input multiple-output (MIMO) systems, in which a deep learning-based end-to-end (E2E) optimization framework is proposed to maximize the system spectral efficiency. To deal with the near-field double beam split effect, the base station is equipped with frequency-dependent hybrid precoding architecture by introducing sub-connected true time delay (TTD) units, while two specific RIS architectures, namely true time delay-based RIS (TTD-RIS) and virtual subarray-based RIS (SA-RIS), are exploited to realize the frequency-dependent passive beamforming at the RIS. Furthermore, the efficient E2E beamforming models without explicit channel state information are proposed, which jointly exploits the uplink channel training module and the downlink wideband beamforming module. In the proposed network architecture of the E2E models, the classical communication signal processing methods, i.e., polarized filtering and sparsity transform, are leveraged to develop a signal-guided beamforming network. Numerical results show that the proposed E2E models have superior beamforming performance and robustness to conventional beamforming benchmarks. Furthermore, the tradeoff between the beamforming gain and the hardware complexity is investigated for different frequency-dependent RIS architectures, in which the TTD-RIS can achieve better spectral efficiency than the SA-RIS while requiring additional energy consumption and hardware cost.
{"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}
In recent years, the emergence of DNA storage systems has led to a widespread focus on the research of codes correcting insertions, deletions, and classic substitutions. During the initial investigation, Levenshtein discovered the VT codes are precisely capable of correcting single insertion/deletion and then extended the VT construction to single-insertion/deletion/substitution ($1$-ins/del/sub) correcting codes. Inspired by this, we generalize the recent findings of $1$-del $1$-sub correcting codes with redundancy $6log_{2}n+O(1)$ to more general $2$-ins/del/sub correcting codes without increasing the redundancy. Our key technique is to apply higher-order VT syndromes to distinct objects and accomplish a systematic classification of all error patterns.
{"title":"Two-Insertion/Deletion/Substitution Correcting Codes","authors":"Yuhang Pi, Zhifang Zhang","doi":"arxiv-2401.11231","DOIUrl":"https://doi.org/arxiv-2401.11231","url":null,"abstract":"In recent years, the emergence of DNA storage systems has led to a widespread\u0000focus on the research of codes correcting insertions, deletions, and classic\u0000substitutions. During the initial investigation, Levenshtein discovered the VT\u0000codes are precisely capable of correcting single insertion/deletion and then\u0000extended the VT construction to single-insertion/deletion/substitution\u0000($1$-ins/del/sub) correcting codes. Inspired by this, we generalize the recent\u0000findings of $1$-del $1$-sub correcting codes with redundancy $6log_{2}n+O(1)$\u0000to more general $2$-ins/del/sub correcting codes without increasing the\u0000redundancy. Our key technique is to apply higher-order VT syndromes to distinct\u0000objects and accomplish a systematic classification of all error patterns.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"32 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559344","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}
Songjie Xie, Hengtao He, Hongru Li, Shenghui Song, Jun Zhang, Ying-Jun Angela Zhang, Khaled B. Letaief
Deep learning-based joint source-channel coding (DJSCC) is expected to be a key technique for {the} next-generation wireless networks. However, the existing DJSCC schemes still face the challenge of channel adaptability as they are typically trained under specific channel conditions. In this paper, we propose a generic framework for channel-adaptive DJSCC by utilizing hypernetworks. To tailor the hypernetwork-based framework for communication systems, we propose a memory-efficient hypernetwork parameterization and then develop a channel-adaptive DJSCC network, named Hyper-AJSCC. Compared with existing adaptive DJSCC based on the attention mechanism, Hyper-AJSCC introduces much fewer parameters and can be seamlessly combined with various existing DJSCC networks without any substantial modifications to their neural network architecture. Extensive experiments demonstrate the better adaptability to channel conditions and higher memory efficiency of Hyper-AJSCC compared with state-of-the-art baselines.
{"title":"Deep Learning-Based Adaptive Joint Source-Channel Coding using Hypernetworks","authors":"Songjie Xie, Hengtao He, Hongru Li, Shenghui Song, Jun Zhang, Ying-Jun Angela Zhang, Khaled B. Letaief","doi":"arxiv-2401.11155","DOIUrl":"https://doi.org/arxiv-2401.11155","url":null,"abstract":"Deep learning-based joint source-channel coding (DJSCC) is expected to be a\u0000key technique for {the} next-generation wireless networks. However, the\u0000existing DJSCC schemes still face the challenge of channel adaptability as they\u0000are typically trained under specific channel conditions. In this paper, we\u0000propose a generic framework for channel-adaptive DJSCC by utilizing\u0000hypernetworks. To tailor the hypernetwork-based framework for communication\u0000systems, we propose a memory-efficient hypernetwork parameterization and then\u0000develop a channel-adaptive DJSCC network, named Hyper-AJSCC. Compared with\u0000existing adaptive DJSCC based on the attention mechanism, Hyper-AJSCC\u0000introduces much fewer parameters and can be seamlessly combined with various\u0000existing DJSCC networks without any substantial modifications to their neural\u0000network architecture. Extensive experiments demonstrate the better adaptability\u0000to channel conditions and higher memory efficiency of Hyper-AJSCC compared with\u0000state-of-the-art baselines.","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":"139559348","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}
Constructions of infinite families of distance-optimal codes in the Hamming metric and the sum-rank metric are challenging problems and have attracted many attentions. In this paper, we give the following three results. 1) If $lambda|q^{sm}-1$ and $lambda >q-1$. 3) For given positive integers $n$ and $m$ satisfying $m
{"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}
Cell-free massive multi-input multi-output (MIMO) has recently gained much attention for its potential in shaping the landscape of sixth-generation (6G) wireless systems. This paper proposes a hierarchical network architecture tailored for cell-free massive MIMO, seamlessly integrating co-located and distributed antennas. A central base station (CBS), equipped with an antenna array, positions itself near the center of the coverage area, complemented by distributed access points spanning the periphery. The proposed architecture remarkably outperforms conventional cell-free networks, demonstrating superior sum throughput while maintaining a comparable worst-case per-user spectral efficiency. Meanwhile, the implementation cost associated with the fronthaul network is substantially diminished.
{"title":"Hierarchical Cell-Free Massive MIMO for High Capacity with Simple Implementation","authors":"Wei Jiang, Hans D. Schotten","doi":"arxiv-2401.11236","DOIUrl":"https://doi.org/arxiv-2401.11236","url":null,"abstract":"Cell-free massive multi-input multi-output (MIMO) has recently gained much\u0000attention for its potential in shaping the landscape of sixth-generation (6G)\u0000wireless systems. This paper proposes a hierarchical network architecture\u0000tailored for cell-free massive MIMO, seamlessly integrating co-located and\u0000distributed antennas. A central base station (CBS), equipped with an antenna\u0000array, positions itself near the center of the coverage area, complemented by\u0000distributed access points spanning the periphery. The proposed architecture\u0000remarkably outperforms conventional cell-free networks, demonstrating superior\u0000sum throughput while maintaining a comparable worst-case per-user spectral\u0000efficiency. Meanwhile, the implementation cost associated with the fronthaul\u0000network is substantially diminished.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559341","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：