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

RDARS Empowered Massive MIMO System: Two-Timescale Transceiver Design with Imperfect CSI RDARS 增强型大规模多输入多输出系统：具有不完美 CSI 的两倍级收发器设计

arXiv - CS - Information Theory Pub Date : 2023-12-14 DOI: arxiv-2312.08753

Chengzhi Ma, Jintao Wang, Xi Yang, Guanghua Yang, Wei Zhang, Shaodan Ma

{"title":"RDARS Empowered Massive MIMO System: Two-Timescale Transceiver Design with Imperfect CSI","authors":"Chengzhi Ma, Jintao Wang, Xi Yang, Guanghua Yang, Wei Zhang, Shaodan Ma","doi":"arxiv-2312.08753","DOIUrl":"https://doi.org/arxiv-2312.08753","url":null,"abstract":"In this paper, we investigate a novel reconfigurable distributed antennas and\u0000reflecting surface (RDARS) aided multi-user massive MIMO system with imperfect\u0000CSI and propose a practical two-timescale (TTS) transceiver design to reduce\u0000the communication overhead and computational complexity of the system. In the\u0000RDARS-aided system, not only distribution gain but also reflection gain can be\u0000obtained by a flexible combination of the distributed antennas and reflecting\u0000surface, which differentiates the system from the others and also makes the TTS\u0000design challenging. To enable the optimal TTS transceiver design, the\u0000achievable rate of the system is first derived in closed-form. Then the TTS\u0000design aiming at the weighted sum rate maximization is considered. To solve the\u0000challenging non-convex optimization problem with high-order design variables,\u0000i.e., the transmit powers and the phase shifts at the RDARS, a block coordinate\u0000descent based method is proposed to find the optimal solutions in semi-closed\u0000forms iteratively. Specifically, two efficient algorithms are proposed with\u0000provable convergence for the optimal phase shift design, i.e., Riemannian\u0000Gradient Ascent based algorithm by exploiting the unit-modulus constraints, and\u0000Two-Tier Majorization-Minimization based algorithm with closed-form optimal\u0000solutions in each iteration. Simulation results validate the effectiveness of\u0000the proposed algorithm and demonstrate the superiority of deploying RDARS in\u0000massive MIMO systems to provide substantial rate improvement with a\u0000significantly reduced total number of active antennas/RF chains and lower\u0000transmit power when compared to the DAS and RIS-aided systems.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138693177","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

Detecting Active Attacks in Over-the-Air Computation using Dummy Samples 使用假样本检测空中计算中的主动攻击

arXiv - CS - Information Theory Pub Date : 2023-12-14 DOI: arxiv-2312.08950

David Nordlund, Zheng Chen, Erik G. Larsson

{"title":"Detecting Active Attacks in Over-the-Air Computation using Dummy Samples","authors":"David Nordlund, Zheng Chen, Erik G. Larsson","doi":"arxiv-2312.08950","DOIUrl":"https://doi.org/arxiv-2312.08950","url":null,"abstract":"Over-the-Air (OtA) computation is a newly emerged concept for computing\u0000functions of data from distributed nodes by taking advantage of the wave\u0000superposition property of wireless channels. Despite its advantage in\u0000communication efficiency, OtA computation is associated with significant\u0000security and privacy concerns that have so far not been thoroughly\u0000investigated, especially in the case of active attacks. In this paper, we\u0000propose and evaluate a detection scheme against active attacks in OtA\u0000computation systems. More explicitly, we consider an active attacker which is\u0000an external node sending random or misleading data to alter the aggregated data\u0000received by the server. To detect the presence of the attacker, in every\u0000communication period, legitimate users send some dummy samples in addition to\u0000the real data. We propose a detector design that relies on the existence of a\u0000shared secret only known by the legitimate users and the server, that can be\u0000used to hide the transmitted signal in a secret subspace. After the server\u0000projects the received vector back to the original subspace, the dummy samples\u0000can be used to detect active attacks. We show that this design achieves good\u0000detection performance for a small cost in terms of channel resources.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"25 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138689189","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

Semantics-Division Duplexing: A Novel Full-Duplex Paradigm 语义分割双工：新颖的全双工范例

arXiv - CS - Information Theory Pub Date : 2023-12-14 DOI: arxiv-2312.08862

Kai Niu, Zijian Liang, Chao Dong, Jincheng Dai, Zhongwei Si, Ping Zhang

{"title":"Semantics-Division Duplexing: A Novel Full-Duplex Paradigm","authors":"Kai Niu, Zijian Liang, Chao Dong, Jincheng Dai, Zhongwei Si, Ping Zhang","doi":"arxiv-2312.08862","DOIUrl":"https://doi.org/arxiv-2312.08862","url":null,"abstract":"In-band full-duplex (IBFD) is a theoretically effective solution to increase\u0000the overall throughput for the future wireless communications system by\u0000enabling transmission and reception over the same time-frequency resources.\u0000However, reliable source reconstruction remains a great challenge in the\u0000practical IBFD systems due to the non-ideal elimination of the\u0000self-interference and the inherent limitations of the separate source and\u0000channel coding methods. On the other hand, artificial intelligence-enabled\u0000semantic communication can provide a viable direction for the optimization of\u0000the IBFD system. This article introduces a novel IBFD paradigm with the\u0000guidance of semantic communication called semantics-division duplexing (SDD).\u0000It utilizes semantic domain processing to further suppress self-interference,\u0000distinguish the expected semantic information, and recover the desired sources.\u0000Further integration of the digital and semantic domain processing can be\u0000implemented so as to achieve intelligent and concise communications. We present\u0000the advantages of the SDD paradigm with theoretical explanations and provide\u0000some visualized results to verify its effectiveness.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"20 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138689191","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 Uplink and Downlink EMF Exposure and Coverage in Dense Cellular Networks: A Stochastic Geometry Approach 论密集蜂窝网络中的上行和下行电磁场暴露与覆盖：随机几何方法

arXiv - CS - Information Theory Pub Date : 2023-12-14 DOI: arxiv-2312.08978

Quentin Gontier, Charles Wiame, Joe Wiart, François Horlin, Christo Tsigros, Claude Oestges, Philippe De Doncker

{"title":"On the Uplink and Downlink EMF Exposure and Coverage in Dense Cellular Networks: A Stochastic Geometry Approach","authors":"Quentin Gontier, Charles Wiame, Joe Wiart, François Horlin, Christo Tsigros, Claude Oestges, Philippe De Doncker","doi":"arxiv-2312.08978","DOIUrl":"https://doi.org/arxiv-2312.08978","url":null,"abstract":"Existing studies analyzing electromagnetic field (EMF) exposure in wireless\u0000networks have primarily considered downlink (DL) communications. In the uplink\u0000(UL), the EMF exposure caused by the user's smartphone is usually the only\u0000considered source of radiation, thereby ignoring contributions caused by other\u0000active neighboring devices. In addition, the network coverage and EMF exposure\u0000are typically analyzed independently for both the UL and DL, while a joint\u0000analysis would be necessary to fully understand the network performance. This\u0000paper aims at bridging the resulting gaps by presenting a comprehensive\u0000stochastic geometry framework including the above aspects. The proposed\u0000topology features base stations (BS) modeled via a homogeneous Poisson point\u0000process as well as a user process of type II (with users uniformly distributed\u0000in the Voronoi cell of each BS). In addition to the UL to DL exposure ratio, we\u0000derive joint probability metrics considering the UL and DL coverage and EMF\u0000exposure. These metrics are evaluated in two scenarios considering BS and/or\u0000user densifications. Our numerical results highlight the existence of optimal\u0000node densities maximizing these joint probabilities.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138689187","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

LLMind: Orchestrating AI and IoT with LLMs for Complex Task Execution LLMind：利用 LLM 协调人工智能和物联网以执行复杂任务

arXiv - CS - Information Theory Pub Date : 2023-12-14 DOI: arxiv-2312.09007

Hongwei Cui, Yuyang Du, Qun Yang, Yulin Shao, Soung Chang Liew

引用次数: 0

Construction of $(σ,δ)$-cyclic codes over a non-chain ring and their applications in DNA codes 非链环上 $(σ,δ)$ 循环码的构建及其在 DNA 码中的应用

arXiv - CS - Information Theory Pub Date : 2023-12-13 DOI: arxiv-2312.08109

Ashutosh Singh, Priyanka Sharma, Om Prakash

引用次数: 0

The duals of narrow-sense BCH codes with length $frac{q^m-1}λ$ 长度为 $frac{q^m-1}λ$ 的窄义 BCH 码的对偶码

arXiv - CS - Information Theory Pub Date : 2023-12-09 DOI: arxiv-2312.05474

Xiaoqiang Wang, Chengliang Xiao, Dabin Zheng

{"title":"The duals of narrow-sense BCH codes with length $frac{q^m-1}λ$","authors":"Xiaoqiang Wang, Chengliang Xiao, Dabin Zheng","doi":"arxiv-2312.05474","DOIUrl":"https://doi.org/arxiv-2312.05474","url":null,"abstract":"BCH codes are an interesting class of cyclic codes due to their efficient\u0000encoding and decoding algorithms. In the past sixty years, a lot of progress on\u0000the study of BCH codes has been made, but little is known about the properties\u0000of their duals. Recently, in order to study the duals of BCH codes and the\u0000lower bounds on their minimum distances, a new concept called dually-BCH code\u0000was proposed by authors in cite{GDL21}. In this paper, the lower bounds on the\u0000minimum distances of the duals of narrow-sense BCH codes with length\u0000$frac{q^m-1}{lambda}$ over $mathbb{F}_q$ are developed, where $lambda$ is a\u0000positive integer satisfying $lambda, |, q-1$, or $lambda=q^s-1$ and $s,\u0000|,m$. In addition, the sufficient and necessary conditions in terms of the\u0000designed distances for these codes being dually-BCH codes are presented. Many\u0000considered codes in cite{GDL21} and cite{Wang23} are the special cases of the\u0000codes showed in this paper. Our lower bounds on the minimum distances of the duals of BCH codes include\u0000the bounds stated in cite{GDL21} as a special case. Several examples show that\u0000the lower bounds are good in some cases.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138576147","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

Secure Cell-Free Integrated Sensing and Communication in the Presence of Information and Sensing Eavesdroppers 在存在信息和传感窃听者的情况下实现安全的无蜂窝综合传感与通信

arXiv - CS - Information Theory Pub Date : 2023-12-07 DOI: arxiv-2312.04355

Zixiang Ren, Jie Xu, Ling Qiu, Derrick Wing Kwan Ng

{"title":"Secure Cell-Free Integrated Sensing and Communication in the Presence of Information and Sensing Eavesdroppers","authors":"Zixiang Ren, Jie Xu, Ling Qiu, Derrick Wing Kwan Ng","doi":"arxiv-2312.04355","DOIUrl":"https://doi.org/arxiv-2312.04355","url":null,"abstract":"This paper studies a secure cell-free integrated sensing and communication\u0000(ISAC) system, in which multiple ISAC transmitters collaboratively send\u0000confidential information to multiple communication users (CUs) and concurrently\u0000conduct target detection. Different from prior works investigating\u0000communication security against potential information eavesdropping, we consider\u0000the security of both communication and sensing in the presence of both\u0000information and sensing eavesdroppers that aim to intercept confidential\u0000communication information and extract target information, respectively. Towards\u0000this end, we optimize the joint information and sensing transmit beamforming at\u0000these ISAC transmitters for secure cell-free ISAC. Our objective is to maximize\u0000the detection probability over a designated sensing area while ensuring the\u0000minimum signal-to-interference-plus-noise-ratio (SINR) requirements at CUs. Our\u0000formulation also takes into account the maximum tolerable signal-to-noise ratio\u0000(SNR) at information eavesdroppers for ensuring the confidentiality of\u0000information transmission, and the maximum detection probability constraints at\u0000sensing eavesdroppers for preserving sensing privacy. The formulated secure\u0000joint transmit beamforming problem is highly non-convex due to the intricate\u0000interplay between the detection probabilities, beamforming vectors, and SINR\u0000constraints. Fortunately, through strategic manipulation and via applying the\u0000semidefinite relaxation (SDR) technique, we successfully obtain the globally\u0000optimal solution to the design problem by rigorously verifying the tightness of\u0000SDR. Furthermore, we present two alternative joint beamforming designs based on\u0000the sensing SNR maximization over the specific sensing area and the coordinated\u0000beamforming, respectively. Numerical results reveal the benefits of our\u0000proposed design over these alternative benchmarks.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138554059","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

HARQ-IR Aided Short Packet Communications: BLER Analysis and Throughput Maximization HARQ-IR 辅助短分组通信：BLER 分析和吞吐量最大化

arXiv - CS - Information Theory Pub Date : 2023-12-07 DOI: arxiv-2312.04377

Fuchao He, Zheng Shi, Guanghua Yang, Xiaofan Li, Xinrong Ye, Shaodan Ma

{"title":"HARQ-IR Aided Short Packet Communications: BLER Analysis and Throughput Maximization","authors":"Fuchao He, Zheng Shi, Guanghua Yang, Xiaofan Li, Xinrong Ye, Shaodan Ma","doi":"arxiv-2312.04377","DOIUrl":"https://doi.org/arxiv-2312.04377","url":null,"abstract":"This paper introduces hybrid automatic repeat request with incremental\u0000redundancy (HARQ-IR) to boost the reliability of short packet communications.\u0000The finite blocklength information theory and correlated decoding events\u0000tremendously preclude the analysis of average block error rate (BLER).\u0000Fortunately, the recursive form of average BLER motivates us to calculate its\u0000value through the trapezoidal approximation and Gauss-Laguerre quadrature.\u0000Moreover, the asymptotic analysis is performed to derive a simple expression\u0000for the average BLER at high signal-to-noise ratio (SNR). Then, we study the\u0000maximization of long term average throughput (LTAT) via power allocation\u0000meanwhile ensuring the power and the BLER constraints. For tractability, the\u0000asymptotic BLER is employed to solve the problem through geometric programming\u0000(GP). However, the GP-based solution underestimates the LTAT at low SNR due to\u0000a large approximation error in this case. Alternatively, we also develop a deep\u0000reinforcement learning (DRL)-based framework to learn power allocation policy.\u0000In particular, the optimization problem is transformed into a constrained\u0000Markov decision process, which is solved by integrating deep deterministic\u0000policy gradient (DDPG) with subgradient method. The numerical results finally\u0000demonstrate that the DRL-based method outperforms the GP-based one at low SNR,\u0000albeit at the cost of increasing computational burden.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138553805","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

Distributed Approximate Computing with Constant Locality 具有恒定位置性的分布式近似计算

arXiv - CS - Information Theory Pub Date : 2023-12-07 DOI: arxiv-2312.04141

Deheng Yuan, Tao Guo, Zhongyi Huang, Shi Jin

引用次数: 0