-
Reverse em-problem based on Bregman divergence and its application to classical and quantum information theory arXiv.cs.IT Pub Date : 2024-03-14 Masahito Hayashi
The recent paper (IEEE Trans. IT 69, 1680) introduced an analytical method for calculating the channel capacity without the need for iteration. This method has certain limitations that restrict its applicability. Furthermore, the paper does not provide an explanation as to why the channel capacity can be solved analytically in this particular case. In order to broaden the scope of this method and address
-
Electrochemical Communication in Bacterial Biofilms: A Study on Potassium Stimulation and Signal Transmission arXiv.cs.IT Pub Date : 2024-03-13 Nithin V. Sabu, Bige Deniz Unluturk
Electrochemical communication is a mechanism that enables intercellular interaction among bacteria within communities. Bacteria achieves synchronization and coordinates collective actions at the population level through the utilization of electrochemical signals. In this work, we investigate the response of bacterial biofilms to artificial potassium concentration stimulation. We introduce signal inputs
-
From "um" to "yeah": Producing, predicting, and regulating information flow in human conversation arXiv.cs.IT Pub Date : 2024-03-13 Claire Augusta Bergey, Simon DeDeo
Conversation demands attention. Speakers must call words to mind, listeners must make sense of them, and both together must negotiate this flow of information, all in fractions of a second. We used large language models to study how this works in a large-scale dataset of English-language conversation, the CANDOR corpus. We provide a new estimate of the information density of unstructured conversation
-
Ultimate codes arXiv.cs.IT Pub Date : 2024-03-03 Ted Hurley
A linear block code over a field can be derived from a unit scheme. Looking at codes as structures within a unit scheme greatly extends the availability of linear block and convolutional codes and allows the construction of the codes to required length, rate, distance and type. Properties of a code emanate from properties of the unit from which it was derived. %% can thus be constructed and analysed
-
The Road to Next-Generation Multiple Access: A 50-Year Tutorial Review arXiv.cs.IT Pub Date : 2024-02-29 Yuanwei Liu, Chongjun Ouyang, Zhiguo Ding, Robert Schober
The evolution of wireless communications has been significantly influenced by remarkable advancements in multiple access (MA) technologies over the past five decades, shaping the landscape of modern connectivity. Within this context, a comprehensive tutorial review is presented, focusing on representative MA techniques developed over the past 50 years. The following areas are explored: i) The foundational
-
Semantics-Empowered Space-Air-Ground-Sea Integrated Network: New Paradigm, Frameworks, and Challenges arXiv.cs.IT Pub Date : 2024-02-22 Siqi Meng, Shaohua Wu, Jiaming Zhang, Junlan Cheng, Haibo Zhou, Rongxing Lu, Qinyu Zhang
In the coming sixth generation (6G) communication era, to provide seamless and ubiquitous connections, the space-air-ground-sea integrated network (SAGSIN) is envisioned to address the challenges of communication coverage in areas with difficult conditions, such as the forest, desert, and sea. Considering the fundamental limitations of the SAGSIN including large-scale scenarios, highly dynamic channels
-
Localized and Distributed Beyond Diagonal Reconfigurable Intelligent Surfaces with Lossy Interconnections: Modeling and Optimization arXiv.cs.IT Pub Date : 2024-02-08 Matteo Nerini, Golsa Ghiaasi, Bruno Clerckx
Reconfigurable intelligent surface (RIS) is a key technology to control the communication environment in future wireless networks. Recently, beyond diagonal RIS (BD-RIS) emerged as a generalization of RIS achieving larger coverage through additional tunable impedance components interconnecting the RIS elements. However, conventional RIS and BD-RIS can effectively serve only users in their proximity
-
Physical Layer Security over Fluid Antenna Systems arXiv.cs.IT Pub Date : 2024-02-08 Farshad Rostami Ghadi, Kai-Kit Wong, F. Javier Lopez-Martinez, Wee Kiat New, Hao Xu, Chan-Byoung Chae
This paper investigates the performance of physical layer security (PLS) in fluid antenna-aided communication systems under arbitrary correlated fading channels. In particular, it is considered that a single fixed-antenna transmitter aims to send confidential information to a legitimate receiver equipped with a planar fluid antenna system (FAS), while an eavesdropper, also taking advantage of a planar
-
Boosting Dynamic TDD in Small Cell Networks by the Multiplicative Weight Update Method arXiv.cs.IT Pub Date : 2024-02-08 Jiaqi Zhu, Nikolaos Pappas, Howard H. Yang
We leverage the Multiplicative Weight Update (MWU) method to develop a decentralized algorithm that significantly improves the performance of dynamic time division duplexing (D-TDD) in small cell networks. The proposed algorithm adaptively adjusts the time portion allocated to uplink (UL) and downlink (DL) transmissions at every node during each scheduled time slot, aligning the packet transmissions
-
Coded Many-User Multiple Access via Approximate Message Passing arXiv.cs.IT Pub Date : 2024-02-08 Xiaoqi Liu, Kuan Hsieh, Ramji Venkataramanan
We consider communication over the Gaussian multiple-access channel in the regime where the number of users grows linearly with the codelength. We investigate coded CDMA schemes where each user's information is encoded via a linear code before being modulated with a signature sequence. We propose an efficient approximate message passing (AMP) decoder that can be tailored to the structure of the linear
-
Optimized Denial-of-Service Threats on the Scalability of LT Coded Blockchains arXiv.cs.IT Pub Date : 2024-02-08 Harikrishnan K., J. Harshan, Anwitaman Datta
Coded blockchains have acquired prominence in the recent past as a promising approach to slash the storage costs as well as to facilitate scalability. Within this class, Luby Transform (LT) coded blockchains are an appealing choice for scalability in heterogeneous networks owing to the availability of a wide range of low-complexity LT decoders. While these architectures have been studied from the aspects
-
On the Spectral Efficiency of Indoor Wireless Networks with a Rotary Uniform Linear Array arXiv.cs.IT Pub Date : 2024-02-08 Eduardo Noboro Tominaga, Onel Luis Alcaraz López, Tommy Svensson, Richard Demo Souza, Hirley Alves
Contemporary wireless communication systems rely on Multi-User Multiple-Input Multiple-Output (MU-MIMO) techniques. In such systems, each Access Point (AP) is equipped with multiple antenna elements and serves multiple devices simultaneously. Notably, traditional systems utilize fixed antennas, i.e., antennas without any movement capabilities, while the idea of movable antennas has recently gained
-
Can Channels be Fully Inferred Between Two Antenna Panels? arXiv.cs.IT Pub Date : 2024-02-08 Y. Qiu, D. W, Y. Zeng
This letter considers a two-panel massive multiple-input multiple-output (MIMO) communication system, where the base station (BS) is equipped with two antenna panels that may use different frequency bands for communication. By exploiting the geometric relationships between antenna panels, efficient channel inference methods across antenna panels are proposed to reduce the overhead of real-time channel
-
$L$-systems and the Lovász number arXiv.cs.IT Pub Date : 2024-02-08 William Linz
Given integers $n > k > 0$, and a set of integers $L \subset [0, k-1]$, an $L$-system is a family of sets $\mathcal{F} \subset \binom{[n]}{k}$ such that $|F \cap F'| \in L$ for distinct $F, F'\in \mathcal{F}$. $L$-systems correspond to independent sets in a certain generalized Johnson graph $G(n, k, L)$, so that the maximum size of an $L$-system is equivalent to finding the independence number of the
-
Exact quantum sensing limits for bosonic dephasing channels arXiv.cs.IT Pub Date : 2024-02-08 Zixin Huang, Ludovico Lami, Mark M. Wilde
Dephasing is a prominent noise mechanism that afflicts quantum information carriers, and it is one of the main challenges towards realizing useful quantum computation, communication, and sensing. Here we consider discrimination and estimation of bosonic dephasing channels, when using the most general adaptive strategies allowed by quantum mechanics. We reduce these difficult quantum problems to simple
-
Exact capacity of the \emph{wide} hidden layer treelike neural networks with generic activations arXiv.cs.IT Pub Date : 2024-02-08 Mihailo Stojnic
Recent progress in studying \emph{treelike committee machines} (TCM) neural networks (NN) in \cite{Stojnictcmspnncaprdt23,Stojnictcmspnncapliftedrdt23,Stojnictcmspnncapdiffactrdt23} showed that the Random Duality Theory (RDT) and its a \emph{partially lifted}(pl RDT) variant are powerful tools that can be used for very precise networks capacity analysis. Here, we consider \emph{wide} hidden layer networks
-
Fixed width treelike neural networks capacity analysis -- generic activations arXiv.cs.IT Pub Date : 2024-02-08 Mihailo Stojnic
We consider the capacity of \emph{treelike committee machines} (TCM) neural networks. Relying on Random Duality Theory (RDT), \cite{Stojnictcmspnncaprdt23} recently introduced a generic framework for their capacity analysis. An upgrade based on the so-called \emph{partially lifted} RDT (pl RDT) was then presented in \cite{Stojnictcmspnncapliftedrdt23}. Both lines of work focused on the networks with
-
Vectorial Negabent Concepts: Similarities, Differences, and Generalizations arXiv.cs.IT Pub Date : 2024-02-08 Nurdagül Anbar, Sadmir Kudin, Wilfried Meidl, Enes Pasalic, Alexandr Polujan
In Pasalic et al., IEEE Trans. Inform. Theory 69 (2023), 2702--2712, and in Anbar, Meidl, Cryptogr. Commun. 10 (2018), 235--249, two different vectorial negabent and vectorial bent-negabent concepts are introduced, which leads to seemingly contradictory results. One of the main motivations for this article is to clarify the differences and similarities between these two concepts. Moreover, the negabent
-
S$Ω$I: Score-based O-INFORMATION Estimation arXiv.cs.IT Pub Date : 2024-02-08 Mustapha Bounoua, Giulio Franzese, Pietro Michiardi
The analysis of scientific data and complex multivariate systems requires information quantities that capture relationships among multiple random variables. Recently, new information-theoretic measures have been developed to overcome the shortcomings of classical ones, such as mutual information, that are restricted to considering pairwise interactions. Among them, the concept of information synergy
-
Improved upper bounds for wide-sense frameproof codes arXiv.cs.IT Pub Date : 2024-02-08 Yuhao Zhao, Xiande Zhang
Frameproof codes have been extensively studied for many years due to their application in copyright protection and their connection to extremal set theory. In this paper, we investigate upper bounds on the cardinality of wide-sense $t$-frameproof codes. For $t=2$, we apply results from Sperner theory to give a better upper bound, which significantly improves a recent bound by Zhou and Zhou. For $t\geq
-
Resources of the Quantum World arXiv.cs.IT Pub Date : 2024-02-08 Gilad Gour
This book delves into the burgeoning field of quantum resource theories, a novel and vibrant area of research within quantum information science that seeks to unify diverse quantum phenomena under a single framework. By recognizing various attributes of physical systems as "resources," this approach offers a fresh perspective on quantum phenomena, transforming our understanding and application of concepts
-
TexShape: Information Theoretic Sentence Embedding for Language Models arXiv.cs.IT Pub Date : 2024-02-05 H. Kaan Kale, Homa Esfahanizadeh, Noel Elias, Oguzhan Baser, Muriel Medard, Sriram Vishwanath
With the exponential growth in data volume and the emergence of data-intensive applications, particularly in the field of machine learning, concerns related to resource utilization, privacy, and fairness have become paramount. This paper focuses on the textual domain of data and addresses challenges regarding encoding sentences to their optimized representations through the lens of information-theory
-
Characterization of the Distortion-Perception Tradeoff for Finite Channels with Arbitrary Metrics arXiv.cs.IT Pub Date : 2024-02-03 Dror Freirich, Nir Weinberger, Ron Meir
Whenever inspected by humans, reconstructed signals should not be distinguished from real ones. Typically, such a high perceptual quality comes at the price of high reconstruction error, and vice versa. We study this distortion-perception (DP) tradeoff over finite-alphabet channels, for the Wasserstein-$1$ distance induced by a general metric as the perception index, and an arbitrary distortion matrix
-
Properties of Shannon and Rényi entropies of the Poisson distribution as the functions of intensity parameter arXiv.cs.IT Pub Date : 2024-02-06 Volodymyr Braiman, Anatoliy Malyarenko, Yuliya Mishura, Yevheniia Anastasiia Rudyk
We consider two types of entropy, namely, Shannon and R\'{e}nyi entropies of the Poisson distribution, and establish their properties as the functions of intensity parameter. More precisely, we prove that both entropies increase with intensity. While for Shannon entropy the proof is comparatively simple, for R\'{e}nyi entropy, which depends on additional parameter $\alpha>0$, we can characterize it
-
Age of Actuated Information and Age of Actuation in a Data-Caching Energy Harvesting Actuator arXiv.cs.IT Pub Date : 2024-01-30 Ali Nikkhah, Anthony Ephremides, Nikolaos Pappas
In this paper, we introduce two metrics, namely, age of actuation (AoA) and age of actuated information (AoAI), within a discrete-time system model that integrates data caching and energy harvesting (EH). AoA evaluates the timeliness of actions irrespective of the age of the information, while AoAI considers the freshness of the utilized data packet. We use Markov Chain analysis to model the system's
-
The Information of Large Language Model Geometry arXiv.cs.IT Pub Date : 2024-02-01 Zhiquan Tan, Chenghai Li, Weiran Huang
This paper investigates the information encoded in the embeddings of large language models (LLMs). We conduct simulations to analyze the representation entropy and discover a power law relationship with model sizes. Building upon this observation, we propose a theory based on (conditional) entropy to elucidate the scaling law phenomenon. Furthermore, we delve into the auto-regressive structure of LLMs
-
Blind Channel Estimation and Joint Symbol Detection with Data-Driven Factor Graphs arXiv.cs.IT Pub Date : 2024-01-23 Luca Schmid, Tomer Raviv, Nir Shlezinger, Laurent Schmalen
We investigate the application of the factor graph framework for blind joint channel estimation and symbol detection on time-variant linear inter-symbol interference channels. In particular, we consider the expectation maximization (EM) algorithm for maximum likelihood estimation, which typically suffers from high complexity as it requires the computation of the symbol-wise posterior distributions
-
Rate-Distortion-Perception Tradeoff Based on the Conditional-Distribution Perception Measure arXiv.cs.IT Pub Date : 2024-01-22 Sadaf Salehkalaibar, Jun Chen, Ashish Khisti, Wei Yu
We study the rate-distortion-perception (RDP) tradeoff for a memoryless source model in the asymptotic limit of large block-lengths. Our perception measure is based on a divergence between the distributions of the source and reconstruction sequences conditioned on the encoder output, which was first proposed in [1], [2]. We consider the case when there is no shared randomness between the encoder and
-
Uncoded Storage Coded Transmission Elastic Computing with Straggler Tolerance in Heterogeneous Systems arXiv.cs.IT Pub Date : 2024-01-22 Xi Zhong, Joerg Kliewer, Mingyue Ji
In 2018, Yang et al. introduced a novel and effective approach, using maximum distance separable (MDS) codes, to mitigate the impact of elasticity in cloud computing systems. This approach is referred to as coded elastic computing. Some limitations of this approach include that it assumes all virtual machines have the same computing speeds and storage capacities, and it cannot tolerate stragglers for
-
Personalized Over-the-Air Federated Learning with Personalized Reconfigurable Intelligent Surfaces arXiv.cs.IT Pub Date : 2024-01-22 Jiayu Mao, Aylin Yener
Over-the-air federated learning (OTA-FL) provides bandwidth-efficient learning by leveraging the inherent superposition property of wireless channels. Personalized federated learning balances performance for users with diverse datasets, addressing real-life data heterogeneity. We propose the first personalized OTA-FL scheme through multi-task learning, assisted by personal reconfigurable intelligent
-
Energy-aware Trajectory Optimization for UAV-mounted RIS and Full-duplex Relay arXiv.cs.IT Pub Date : 2024-01-22 Dimitrios Tyrovolas, Nikos A. Mitsiou, Thomas G. Boufikos, Prodromos-Vasileios Mekikis, Sotiris A. Tegos, Panagiotis D. Diamantoulakis, Sotiris Ioannidis, Christos K. Liaskos, George K. Karagiannidis
In the evolving landscape of sixth-generation (6G) wireless networks, unmanned aerial vehicles (UAVs) have emerged as transformative tools for dynamic and adaptive connectivity. However, dynamically adjusting their position to offer favorable communication channels introduces operational challenges in terms of energy consumption, especially when integrating advanced communication technologies like
-
Joint Near-Field Target Tracking and Communications with Full Duplex Holographic MIMO arXiv.cs.IT Pub Date : 2024-01-22 Ioannis Gavras, George C. Alexandropoulos
In this paper, we present a simultaneous target tracking and multi-user communications system realized by a full duplex holographic Multiple-Input Multiple-Output (MIMO) node equipped with Dynamic Metasurface Antennas (DMAs) at both its communication ends. Focusing on the near-field regime, we extend Fresnel's approximation to metasurfaces and devise a subspace tracking scheme with DMA-based hybrid
-
Near-Field Localization with $1$-bit Quantized Hybrid A/D Reception arXiv.cs.IT Pub Date : 2024-01-22 Ioannis Gavras, Italo Atzeni, George C. Alexandropoulos
In this paper, we consider a hybrid Analog and Digital (A/D) receiver architecture with an extremely large Dynamic Metasurface Antenna (DMA) and an $1$-bit resolution Analog-to-Digital Converter (ADC) at each of its reception radio-frequency chains, and present a localization approach for User Equipment (UE) lying in its near-field regime. The proposed algorithm scans the UE area of interest to identify
-
A Survey of Advances in Optimization Methods for Wireless Communication System Design arXiv.cs.IT Pub Date : 2024-01-22 Ya-Feng Liu, Tsung-Hui Chang, Mingyi Hong, Zheyu Wu, Anthony Man-Cho So, Eduard A. Jorswieck, Wei Yu
Mathematical optimization is now widely regarded as an indispensable modeling and solution tool for the design of wireless communications systems. While optimization has played a significant role in the revolutionary progress in wireless communication and networking technologies from 1G to 5G and onto the future 6G, the innovations in wireless technologies have also substantially transformed the nature
-
Maximizing Spectral and Energy Efficiency in Multi-user MIMO OFDM Systems with RIS and Hardware Impairment arXiv.cs.IT Pub Date : 2024-01-22 Mohammad Soleymani, Ignacio Santamaria, Aydin Sezgin, Eduard Jorswieck
An emerging technology to enhance the spectral efficiency (SE) and energy efficiency (EE) of wireless communication systems is reconfigurable intelligent surface (RIS), which is shown to be very powerful in single-carrier systems. However, in multi-user orthogonal frequency division multiplexing (OFDM) systems, RIS may not be as promising as in single-carrier systems since an independent optimization
-
ORBGRAND: Achievable Rate for General Bit Channels and Application in BICM arXiv.cs.IT Pub Date : 2024-01-22 Zhuang Li, Wenyi Zhang
Guessing random additive noise decoding (GRAND) has received widespread attention recently, and among its variants, ordered reliability bits GRAND (ORBGRAND) is particularly attractive due to its efficient utilization of soft information and its amenability to hardware implementation. It has been recently shown that ORBGRAND is almost capacity-achieving in additive white Gaussian noise channels under
-
The complexity of elliptic normal bases arXiv.cs.IT Pub Date : 2024-01-22 Daniel Panario, Mohamadou Sall, Qiang Wang
We study the complexity (that is, the weight of the multiplication table) of the elliptic normal bases introduced by Couveignes and Lercier. We give an upper bound on the complexity of these elliptic normal bases, and we analyze the weight of some special vectors related to the multiplication table of those bases. This analysis leads us to some perspectives on the search for low complexity normal bases
-
Performance Analysis of Fluid Antenna-aided Backscatter Communications Systems arXiv.cs.IT Pub Date : 2024-01-22 Farshad Rostami Ghadi, Masoud Kaveh, Kai-Kit Wong
This paper studies the performance of backscatter communications (BC) over emerging fluid antenna (FA) technology. In particular, a single-antenna source sends information to a FA reader through the wireless forward (i.e., source-to-tag) and backscatter (tag-to-reader) channels. For the considered BC, we first derive the cumulative distribution function (CDF) of the equivalent channel at the FA receiver
-
Simultaneous Blind Demixing and Super-resolution via Vectorized Hankel Lift arXiv.cs.IT Pub Date : 2024-01-22 Haifeng Wang, Jinchi Chen, Hulei Fan, Yuxiang Zhao, Li Yu
In this work, we investigate the problem of simultaneous blind demixing and super-resolution. Leveraging the subspace assumption regarding unknown point spread functions, this problem can be reformulated as a low-rank matrix demixing problem. We propose a convex recovery approach that utilizes the low-rank structure of each vectorized Hankel matrix associated with the target matrix. Our analysis reveals
-
Data-oriented Coordinated Uplink Transmission for Massive IoT System arXiv.cs.IT Pub Date : 2024-01-22 Jyri Hämäläinen, Rui Dinis, Mehmet C. Ilter
Recently, the paradigm of massive ultra-reliable low-latency IoT communications (URLLC-IoT) has gained growing interest. Reliable delay-critical uplink transmission in IoT is a challenging task since low-complex devices typically do not support multiple antennas or demanding signal processing tasks. However, in many IoT services the data volumes are small and deployments may include massive number
-
Massive Synchrony in Distributed Antenna Systems arXiv.cs.IT Pub Date : 2024-01-22 Erik G. Larsson
Distributed antennas must be phase-calibrated (phase-synchronized) for certain operations, such as reciprocity-based joint coherent downlink beamforming, to work. We use rigorous signal processing tools to analyze the accuracy of calibration protocols that are based on over-the-air measurements between antennas, with a focus on scalability aspects for large systems. We show that (i) for some who-measures-on-whom
-
The Markov-Chain Polytope with Applications arXiv.cs.IT Pub Date : 2024-01-21 Mordecai J. Golin, Albert John Lalim Patupat
This paper addresses the problem of finding a minimum-cost $m$-state Markov chain $(S_0,\ldots,S_{m-1})$ in a large set of chains. The chains studied have a reward associated with each state. The cost of a chain is its "gain", i.e., its average reward under its stationary distribution. Specifically, for each $k=0,\ldots,m-1$ there is a known set ${\mathbb S}_k$ of type-$k$ states. A permissible Markov
-
Age of Gossip in Random and Bipartite Networks arXiv.cs.IT Pub Date : 2024-01-21 Thomas maranzatto
In this paper we study gossip networks where a source observing a process sends updates to an underlying graph. Nodes in the graph communicate to their neighbors by randomly sending updates. Our interest is studying the version age of information (vAoI) metric over various classes of networks. It is known that the version age of $K_n$ is logarithmic, and the version age of $\overline{K_n}$ is linear
-
On a Group Under Which Symmetric Reed-Muller Codes are Invariant arXiv.cs.IT Pub Date : 2024-01-21 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
-
Error-Correcting Codes on Projective Bundles over Deligne-Lusztig varieties arXiv.cs.IT Pub Date : 2024-01-21 Daniel Camazón Portela, Juan Antonio López Ramos
The aim of this article is to give lower bounds on the parameters of algebraic geometric error-correcting codes constructed from projective bundles over Deligne--Lusztig surfaces. The methods based on an intensive use of the intersection theory allow us to extend the codes previously constructed from higher-dimensional varieties, as well as those coming from curves. General bounds are obtained for
-
Joint Downlink and Uplink Optimization for RIS-Aided FDD MIMO Communication Systems arXiv.cs.IT Pub Date : 2024-01-21 Gyoseung Lee, Hyeongtaek Lee, Donghwan Kim, Jaehoon Chung, A. Lee. Swindlehurst, Junil Choi
This paper investigates reconfigurable intelligent surface (RIS)-aided frequency division duplexing (FDD) communication systems. Since the downlink and uplink signals are simultaneously transmitted in FDD, the phase shifts at the RIS should be designed to support both transmissions. Considering a single-user multiple-input multiple-output system, we formulate a weighted sum-rate maximization problem
-
Robust Beamforming for Downlink Multi-Cell Systems: A Bilevel Optimization Perspective arXiv.cs.IT Pub Date : 2024-01-21 Xingdi Chen, Yu Xiong, Kai Yang
Utilization of inter-base station cooperation for information processing has shown great potential in enhancing the overall quality of communication services (QoS) in wireless communication networks. Nevertheless, such cooperations require the knowledge of channel state information (CSI) at base stations (BSs), which is assumed to be perfectly known. However, CSI errors are inevitable in practice which
-
A Transformation of Repairing Reed-Solomon Codes from Rack-Aware Storage Model to Homogeneous Storage Model arXiv.cs.IT Pub Date : 2024-01-21 Yumeng Yang, Han Cai, Xiaohu Tang
In this paper, we address the node repair problem of Reed-Solomon (RS) coded distributed storage systems. Specifically, to overcome the challenges of multiple-node failures of RS codes under the rack-aware storage model, we employ good polynomials to guide the placement of the conventional RS codes into racks and then propose a novel repair framework for the resultant rack-aware RS codes, which can
-
Hierarchical Cell-Free Massive MIMO for High Capacity with Simple Implementation arXiv.cs.IT Pub Date : 2024-01-20 Wei Jiang, Hans D. Schotten
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
-
Two-Insertion/Deletion/Substitution Correcting Codes arXiv.cs.IT Pub Date : 2024-01-20 Yuhang Pi, Zhifang Zhang
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
-
On the Information Leakage Performance of Secure Finite Blocklength Transmissions over Rayleigh Fading Channels arXiv.cs.IT Pub Date : 2024-01-20 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
-
Joint Beamforming Optimization and Mode Selection for RDARS-aided MIMO Systems arXiv.cs.IT Pub Date : 2024-01-20 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
-
Triple-Refined Hybrid-Field Beam Training for mmWave Extremely Large-Scale MIMO arXiv.cs.IT Pub Date : 2024-01-20 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
-
New Perfect and Distance-Optimal Sum-Rank Codes arXiv.cs.IT Pub Date : 2024-01-20 Hao Chen
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 <\sqrt{\frac{(q^s-1)}{2(q-1)^2(1+\epsilon)}}$, an infinite family of distance-optimal $q$-ary cyclic sum-rank codes with the block length $t=\
-
Deep Learning-Based Adaptive Joint Source-Channel Coding using Hypernetworks arXiv.cs.IT Pub Date : 2024-01-20 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
-
Wideband Beamforming for RIS Assisted Near-Field Communications arXiv.cs.IT Pub Date : 2024-01-20 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
-
Interference-Aware Queuing Analysis for Distributed Transmission Control in UAV Networks arXiv.cs.IT Pub Date : 2024-01-20 Masoud Ghazikor, Keenan Roach, Kenny Cheung, Morteza Hashemi
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
-
Generalization and Informativeness of Conformal Prediction arXiv.cs.IT Pub Date : 2024-01-22 Matteo Zecchin, Sangwoo Park, Osvaldo Simeone, Fredrik Hellström
The safe integration of machine learning modules in decision-making processes hinges on their ability to quantify uncertainty. A popular technique to achieve this goal is conformal prediction (CP), which transforms an arbitrary base predictor into a set predictor with coverage guarantees. While CP certifies the predicted set to contain the target quantity with a user-defined tolerance, it does not
-
Information-Theoretic State Variable Selection for Reinforcement Learning arXiv.cs.IT Pub Date : 2024-01-21 Charles Westphal, Stephen Hailes, Mirco Musolesi
Identifying the most suitable variables to represent the state is a fundamental challenge in Reinforcement Learning (RL). These variables must efficiently capture the information necessary for making optimal decisions. In order to address this problem, in this paper, we introduce the Transfer Entropy Redundancy Criterion (TERC), an information-theoretic criterion, which determines if there is \textit{entropy
-
Interactive AI with Retrieval-Augmented Generation for Next Generation Networking arXiv.cs.IT Pub Date : 2024-01-21 Ruichen Zhang, Hongyang Du, Yinqiu Liu, Dusit Niyato, Jiawen Kang, Sumei Sun, Xuemin Shen, H. Vincent Poor
With the advance of artificial intelligence (AI), the emergence of Google Gemini and OpenAI Q* marks the direction towards artificial general intelligence (AGI). To implement AGI, the concept of interactive AI (IAI) has been introduced, which can interactively understand and respond not only to human user input but also to dynamic system and network conditions. In this article, we explore an integration