arXiv - CS - Information Theory最新文献

Massive MIMO CSI Feedback using Channel Prediction: How to Avoid Machine Learning at UE? 使用信道预测的大规模 MIMO CSI 反馈：如何避免 UE 机器学习？

arXiv - CS - Information Theory Pub Date : 2024-03-20 DOI: arxiv-2403.13363

Muhammad Karam Shehzad, Luca Rose, Mohamad Assaad

{"title":"Massive MIMO CSI Feedback using Channel Prediction: How to Avoid Machine Learning at UE?","authors":"Muhammad Karam Shehzad, Luca Rose, Mohamad Assaad","doi":"arxiv-2403.13363","DOIUrl":"https://doi.org/arxiv-2403.13363","url":null,"abstract":"In the literature, machine learning (ML) has been implemented at the base\u0000station (BS) and user equipment (UE) to improve the precision of downlink\u0000channel state information (CSI). However, ML implementation at the UE can be\u0000infeasible for various reasons, such as UE power consumption. Motivated by this\u0000issue, we propose a CSI learning mechanism at BS, called CSILaBS, to avoid ML\u0000at UE. To this end, by exploiting channel predictor (CP) at BS, a light-weight\u0000predictor function (PF) is considered for feedback evaluation at the UE.\u0000CSILaBS reduces over-the-air feedback overhead, improves CSI quality, and\u0000lowers the computation cost of UE. Besides, in a multiuser environment, we\u0000propose various mechanisms to select the feedback by exploiting PF while aiming\u0000to improve CSI accuracy. We also address various ML-based CPs, such as\u0000NeuralProphet (NP), an ML-inspired statistical algorithm. Furthermore, inspired\u0000to use a statistical model and ML together, we propose a novel hybrid framework\u0000composed of a recurrent neural network and NP, which yields better prediction\u0000accuracy than individual models. The performance of CSILaBS is evaluated\u0000through an empirical dataset recorded at Nokia Bell-Labs. The outcomes show\u0000that ML elimination at UE can retain performance gains, for example, precoding\u0000quality.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140198926","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

Reverse em-problem based on Bregman divergence and its application to classical and quantum information theory 基于 Bregman 发散的反向 em 问题及其在经典和量子信息论中的应用

arXiv - CS - Information Theory Pub Date : 2024-03-14 DOI: arxiv-2403.09252

Masahito Hayashi

{"title":"Reverse em-problem based on Bregman divergence and its application to classical and quantum information theory","authors":"Masahito Hayashi","doi":"arxiv-2403.09252","DOIUrl":"https://doi.org/arxiv-2403.09252","url":null,"abstract":"The recent paper (IEEE Trans. IT 69, 1680) introduced an analytical method\u0000for calculating the channel capacity without the need for iteration. This\u0000method has certain limitations that restrict its applicability. Furthermore,\u0000the paper does not provide an explanation as to why the channel capacity can be\u0000solved analytically in this particular case. In order to broaden the scope of\u0000this method and address its limitations, we turn our attention to the reverse\u0000em-problem, proposed by Toyota (Information Geometry, 3, 1355 (2020)). This\u0000reverse em-problem involves iteratively applying the inverse map of the em\u0000iteration to calculate the channel capacity, which represents the maximum\u0000mutual information. However, several open problems remained unresolved in\u0000Toyota's work. To overcome these challenges, we formulate the reverse\u0000em-problem based on Bregman divergence and provide solutions to these open\u0000problems. Building upon these results, we transform the reverse em-problem into\u0000em-problems and derive a non-iterative formula for the reverse em-problem. This\u0000formula can be viewed as a generalization of the aforementioned analytical\u0000calculation method. Importantly, this derivation sheds light on the information\u0000geometrical structure underlying this special case. By effectively addressing\u0000the limitations of the previous analytical method and providing a deeper\u0000understanding of the underlying information geometrical structure, our work\u0000significantly expands the applicability of the proposed method for calculating\u0000the channel capacity without iteration.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"98 3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140148633","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

From "um" to "yeah": Producing, predicting, and regulating information flow in human conversation 从 "嗯 "到 "是"：人类对话中信息流的产生、预测和调节

arXiv - CS - Information Theory Pub Date : 2024-03-13 DOI: arxiv-2403.08890

Claire Augusta Bergey, Simon DeDeo

引用次数: 0

Electrochemical Communication in Bacterial Biofilms: A Study on Potassium Stimulation and Signal Transmission 细菌生物膜中的电化学通讯：钾刺激和信号传输研究

arXiv - CS - Information Theory Pub Date : 2024-03-13 DOI: arxiv-2403.08926

Nithin V. Sabu, Bige Deniz Unluturk

引用次数: 0

Semantics-Empowered Space-Air-Ground-Sea Integrated Network: New Paradigm, Frameworks, and Challenges 语义驱动的空地海一体化网络：新范式、框架和挑战

arXiv - CS - Information Theory Pub Date : 2024-02-22 DOI: arxiv-2402.14297

Siqi Meng, Shaohua Wu, Jiaming Zhang, Junlan Cheng, Haibo Zhou, Rongxing Lu, Qinyu Zhang

{"title":"Semantics-Empowered Space-Air-Ground-Sea Integrated Network: New Paradigm, Frameworks, and Challenges","authors":"Siqi Meng, Shaohua Wu, Jiaming Zhang, Junlan Cheng, Haibo Zhou, Rongxing Lu, Qinyu Zhang","doi":"arxiv-2402.14297","DOIUrl":"https://doi.org/arxiv-2402.14297","url":null,"abstract":"In the coming sixth generation (6G) communication era, to provide seamless\u0000and ubiquitous connections, the space-air-ground-sea integrated network\u0000(SAGSIN) is envisioned to address the challenges of communication coverage in\u0000areas with difficult conditions, such as the forest, desert, and sea.\u0000Considering the fundamental limitations of the SAGSIN including large-scale\u0000scenarios, highly dynamic channels, and limited device capabilities,\u0000traditional communications based on Shannon information theory cannot satisfy\u0000the communication demands. Moreover, bit-level reconstruction is usually\u0000redundant for many human-to-machine or machine-to-machine applications in the\u0000SAGSIN. Therefore, it is imperative to consider high-level communications\u0000towards semantics exchange, called semantic communications. In this survey,\u0000according to the interpretations of the term \"semantics\", including\u0000\"significance\", \"meaning\", and \"effectiveness-related information\", we review\u0000state-of-the-art works on semantic communications from three perspectives,\u0000which are 1) significance representation and protection, 2) meaning similarity\u0000measurement and meaning enhancement, and 3) ultimate effectiveness and\u0000effectiveness yielding. Sequentially, three types of semantic communication\u0000systems can be correspondingly introduced, namely the significance-oriented,\u0000meaning-oriented, and effectiveness/task-oriented semantic communication\u0000systems. Implementation of the above three types of systems in the SAGSIN\u0000necessitates a new perception-communication-computing-actuation-integrated\u0000paradigm (PCCAIP), where all the available perception, computing, and actuation\u0000techniques jointly facilitates significance-oriented sampling & transmission,\u0000semantic extraction & reconstruction, and task decision. Finally, we point out\u0000some future challenges on semantic communications in the SAGSIN. ...","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"13 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139951199","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

Boosting Dynamic TDD in Small Cell Networks by the Multiplicative Weight Update Method 通过乘法权重更新法提升小蜂窝网络中的动态 TDD

arXiv - CS - Information Theory Pub Date : 2024-02-08 DOI: arxiv-2402.05641

Jiaqi Zhu, Nikolaos Pappas, Howard H. Yang

{"title":"Boosting Dynamic TDD in Small Cell Networks by the Multiplicative Weight Update Method","authors":"Jiaqi Zhu, Nikolaos Pappas, Howard H. Yang","doi":"arxiv-2402.05641","DOIUrl":"https://doi.org/arxiv-2402.05641","url":null,"abstract":"We leverage the Multiplicative Weight Update (MWU) method to develop a\u0000decentralized algorithm that significantly improves the performance of dynamic\u0000time division duplexing (D-TDD) in small cell networks. The proposed algorithm\u0000adaptively adjusts the time portion allocated to uplink (UL) and downlink (DL)\u0000transmissions at every node during each scheduled time slot, aligning the\u0000packet transmissions toward the most appropriate link directions according to\u0000the feedback of signal-to-interference ratio information. Our simulation\u0000results reveal that compared to the (conventional) fixed configuration of UL/DL\u0000transmission probabilities in D-TDD, incorporating MWU into D-TDD brings about\u0000a two-fold improvement of mean packet throughput in the DL and a three-fold\u0000improvement of the same performance metric in the UL, resulting in the D-TDD\u0000even outperforming Static-TDD in the UL. It also shows that the proposed scheme\u0000maintains a consistent performance gain in the presence of an ascending traffic\u0000load, validating its effectiveness in boosting the network performance. This\u0000work also demonstrates an approach that accounts for algorithmic considerations\u0000at the forefront when solving stochastic problems.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139761396","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 capacity of the emph{wide} hidden layer treelike neural networks with generic activations 具有通用激活的 emph{wide} 隐藏层树状神经网络的精确容量

arXiv - CS - Information Theory Pub Date : 2024-02-08 DOI: arxiv-2402.05719

Mihailo Stojnic

{"title":"Exact capacity of the emph{wide} hidden layer treelike neural networks with generic activations","authors":"Mihailo Stojnic","doi":"arxiv-2402.05719","DOIUrl":"https://doi.org/arxiv-2402.05719","url":null,"abstract":"Recent progress in studying emph{treelike committee machines} (TCM) neural\u0000networks (NN) in\u0000cite{Stojnictcmspnncaprdt23,Stojnictcmspnncapliftedrdt23,Stojnictcmspnncapdiffactrdt23}\u0000showed that the Random Duality Theory (RDT) and its a emph{partially\u0000lifted}(pl RDT) variant are powerful tools that can be used for very precise\u0000networks capacity analysis. Here, we consider emph{wide} hidden layer networks\u0000and uncover that certain aspects of numerical difficulties faced in\u0000cite{Stojnictcmspnncapdiffactrdt23} miraculously disappear. In particular, we\u0000employ recently developed emph{fully lifted} (fl) RDT to characterize the\u0000emph{wide} ($drightarrow infty$) TCM nets capacity. We obtain explicit,\u0000closed form, capacity characterizations for a very generic class of the hidden\u0000layer activations. While the utilized approach significantly lowers the amount\u0000of the needed numerical evaluations, the ultimate fl RDT usefulness and success\u0000still require a solid portion of the residual numerical work. To get the\u0000concrete capacity values, we take four very famous activations examples:\u0000emph{textbf{ReLU}}, textbf{emph{quadratic}}, textbf{emph{erf}}, and\u0000textbf{emph{tanh}}. After successfully conducting all the residual numerical\u0000work for all of them, we uncover that the whole lifting mechanism exhibits a\u0000remarkably rapid convergence with the relative improvements no better than\u0000$sim 0.1%$ happening already on the 3-rd level of lifting. As a convenient\u0000bonus, we also uncover that the capacity characterizations obtained on the\u0000first and second level of lifting precisely match those obtained through the\u0000statistical physics replica theory methods in cite{ZavPeh21} for the generic\u0000and in cite{BalMalZech19} for the ReLU activations.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"20 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139761411","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

Coded Many-User Multiple Access via Approximate Message Passing 通过近似信息传递实现编码多用户多路访问

arXiv - CS - Information Theory Pub Date : 2024-02-08 DOI: arxiv-2402.05625

Xiaoqi Liu, Kuan Hsieh, Ramji Venkataramanan

引用次数: 0

Physical Layer Security over Fluid Antenna Systems 流体天线系统物理层安全

arXiv - CS - Information Theory Pub Date : 2024-02-08 DOI: arxiv-2402.05722

Farshad Rostami Ghadi, Kai-Kit Wong, F. Javier Lopez-Martinez, Wee Kiat New, Hao Xu, Chan-Byoung Chae

{"title":"Physical Layer Security over Fluid Antenna Systems","authors":"Farshad Rostami Ghadi, Kai-Kit Wong, F. Javier Lopez-Martinez, Wee Kiat New, Hao Xu, Chan-Byoung Chae","doi":"arxiv-2402.05722","DOIUrl":"https://doi.org/arxiv-2402.05722","url":null,"abstract":"This paper investigates the performance of physical layer security (PLS) in\u0000fluid antenna-aided communication systems under arbitrary correlated fading\u0000channels. In particular, it is considered that a single fixed-antenna\u0000transmitter aims to send confidential information to a legitimate receiver\u0000equipped with a planar fluid antenna system (FAS), while an eavesdropper, also\u0000taking advantage of a planar FAS, attempts to decode the desired message. For\u0000this scenario, we first present analytical expressions of the equivalent\u0000channel distributions at the legitimate user and eavesdropper by using copula,\u0000so that the obtained analytical results are valid for any arbitrarily\u0000correlated fading distributions. Then, with the help of Gauss-Laguerre\u0000quadrature, we derive compact analytical expressions for the average secrecy\u0000capacity (ASC), the secrecy outage probability (SOP), and the secrecy energy\u0000efficiency (SEE) for the FAS wiretap channel. Moreover, for exemplary purposes,\u0000we also obtain the compact expression of ASC, SOP, and SEE by utilizing the\u0000Gaussian copula under correlated Rayleigh fading channels as a special case.\u0000Eventually, numerical results indicate that applying the fluid antenna with\u0000only one active port to PLS can guarantee more secure and reliable\u0000transmission, when compared to traditional antenna systems (TAS) exploiting\u0000maximal ratio combining (MRC).","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"13 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139761467","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

Vectorial Negabent Concepts: Similarities, Differences, and Generalizations 矢量否定概念：相似性、差异性和概括性

arXiv - CS - Information Theory Pub Date : 2024-02-08 DOI: arxiv-2402.05677

Nurdagül Anbar, Sadmir Kudin, Wilfried Meidl, Enes Pasalic, Alexandr Polujan

引用次数: 0