arXiv - CS - Information Theory最新文献

筛选
英文 中文
Maximizing Spectral and Energy Efficiency in Multi-user MIMO OFDM Systems with RIS and Hardware Impairment 在具有 RIS 和硬件损伤的多用户 MIMO OFDM 系统中实现频谱和能效最大化
arXiv - CS - Information Theory Pub Date : 2024-01-22 DOI: arxiv-2401.11921
Mohammad Soleymani, Ignacio Santamaria, Aydin Sezgin, Eduard Jorswieck
{"title":"Maximizing Spectral and Energy Efficiency in Multi-user MIMO OFDM Systems with RIS and Hardware Impairment","authors":"Mohammad Soleymani, Ignacio Santamaria, Aydin Sezgin, Eduard Jorswieck","doi":"arxiv-2401.11921","DOIUrl":"https://doi.org/arxiv-2401.11921","url":null,"abstract":"An emerging technology to enhance the spectral efficiency (SE) and energy\u0000efficiency (EE) of wireless communication systems is reconfigurable intelligent\u0000surface (RIS), which is shown to be very powerful in single-carrier systems.\u0000However, in multi-user orthogonal frequency division multiplexing (OFDM)\u0000systems, RIS may not be as promising as in single-carrier systems since an\u0000independent optimization of RIS elements at each sub-carrier is impossible in\u0000multi-carrier systems. Thus, this paper investigates the performance of various\u0000RIS technologies like regular (reflective and passive), simultaneously transmit\u0000and reflect (STAR), and multi-sector beyond diagonal (BD) RIS in multi-user\u0000multiple-input multiple-output (MIMO) OFDM broadcast channels (BC). This\u0000requires to formulate and solve a joint MIMO precoding and RIS optimization\u0000problem. The obtained solution reveals that RIS can significantly improve the\u0000system performance even when the number of RIS elements is relatively low.\u0000Moreover, we develop resource allocation schemes for STAR-RIS and multi-sector\u0000BD-RIS in MIMO OFDM BCs, and show that these RIS technologies can outperform a\u0000regular RIS, especially when the regular RIS cannot assist the communications\u0000for all the users.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"113 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559155","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
Simultaneous Blind Demixing and Super-resolution via Vectorized Hankel Lift 通过矢量化汉克尔提升实现同步盲目解混和超分辨率
arXiv - CS - Information Theory Pub Date : 2024-01-22 DOI: arxiv-2401.11805
Haifeng Wang, Jinchi Chen, Hulei Fan, Yuxiang Zhao, Li Yu
{"title":"Simultaneous Blind Demixing and Super-resolution via Vectorized Hankel Lift","authors":"Haifeng Wang, Jinchi Chen, Hulei Fan, Yuxiang Zhao, Li Yu","doi":"arxiv-2401.11805","DOIUrl":"https://doi.org/arxiv-2401.11805","url":null,"abstract":"In this work, we investigate the problem of simultaneous blind demixing and\u0000super-resolution. Leveraging the subspace assumption regarding unknown point\u0000spread functions, this problem can be reformulated as a low-rank matrix\u0000demixing problem. We propose a convex recovery approach that utilizes the\u0000low-rank structure of each vectorized Hankel matrix associated with the target\u0000matrix. Our analysis reveals that for achieving exact recovery, the number of\u0000samples needs to satisfy the condition $ngtrsim Ksr log (sn)$. Empirical\u0000evaluations demonstrate the recovery capabilities and the computational\u0000efficiency of the convex method.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559331","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
Massive Synchrony in Distributed Antenna Systems 分布式天线系统中的大规模同步
arXiv - CS - Information Theory Pub Date : 2024-01-22 DOI: arxiv-2401.11730
Erik G. Larsson
{"title":"Massive Synchrony in Distributed Antenna Systems","authors":"Erik G. Larsson","doi":"arxiv-2401.11730","DOIUrl":"https://doi.org/arxiv-2401.11730","url":null,"abstract":"Distributed antennas must be phase-calibrated (phase-synchronized) for\u0000certain operations, such as reciprocity-based joint coherent downlink\u0000beamforming, to work. We use rigorous signal processing tools to analyze the\u0000accuracy of calibration protocols that are based on over-the-air measurements\u0000between antennas, with a focus on scalability aspects for large systems. We\u0000show that (i) for some who-measures-on-whom topologies, the errors in the\u0000calibration process are unbounded when the network grows; and (ii) despite that\u0000conclusion, it is optimal -- irrespective of the topology -- to solve a single\u0000calibration problem for the entire system and use the result everywhere to\u0000support the beamforming. The analyses are exemplified by investigating specific\u0000topologies, including lines, rings, and two-dimensional surfaces.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559352","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
A Survey of Advances in Optimization Methods for Wireless Communication System Design 无线通信系统设计优化方法进展概览
arXiv - CS - Information Theory Pub Date : 2024-01-22 DOI: arxiv-2401.12025
Ya-Feng Liu, Tsung-Hui Chang, Mingyi Hong, Zheyu Wu, Anthony Man-Cho So, Eduard A. Jorswieck, Wei Yu
{"title":"A Survey of Advances in Optimization Methods for Wireless Communication System Design","authors":"Ya-Feng Liu, Tsung-Hui Chang, Mingyi Hong, Zheyu Wu, Anthony Man-Cho So, Eduard A. Jorswieck, Wei Yu","doi":"arxiv-2401.12025","DOIUrl":"https://doi.org/arxiv-2401.12025","url":null,"abstract":"Mathematical optimization is now widely regarded as an indispensable modeling\u0000and solution tool for the design of wireless communications systems. While\u0000optimization has played a significant role in the revolutionary progress in\u0000wireless communication and networking technologies from 1G to 5G and onto the\u0000future 6G, the innovations in wireless technologies have also substantially\u0000transformed the nature of the underlying mathematical optimization problems\u0000upon which the system designs are based and have sparked significant\u0000innovations in the development of methodologies to understand, to analyze, and\u0000to solve those problems. In this paper, we provide a comprehensive survey of\u0000recent advances in mathematical optimization theory and algorithms for wireless\u0000communication system design. We begin by illustrating common features of\u0000mathematical optimization problems arising in wireless communication system\u0000design. We discuss various scenarios and use cases and their associated\u0000mathematical structures from an optimization perspective. We then provide an\u0000overview of recent advances in mathematical optimization theory and algorithms,\u0000from nonconvex optimization, global optimization, and integer programming, to\u0000distributed optimization and learning-based optimization. The key to successful\u0000solution of mathematical optimization problems is in carefully choosing and/or\u0000developing suitable optimization algorithms (or neural network architectures)\u0000that can exploit the underlying problem structure. We conclude the paper by\u0000identifying several open research challenges and outlining future research\u0000directions.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"11 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139558516","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
Energy-aware Trajectory Optimization for UAV-mounted RIS and Full-duplex Relay 无人机安装 RIS 和全双工中继的能量感知轨迹优化
arXiv - CS - Information Theory Pub Date : 2024-01-22 DOI: arxiv-2401.12107
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
{"title":"Energy-aware Trajectory Optimization for UAV-mounted RIS and Full-duplex Relay","authors":"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","doi":"arxiv-2401.12107","DOIUrl":"https://doi.org/arxiv-2401.12107","url":null,"abstract":"In the evolving landscape of sixth-generation (6G) wireless networks,\u0000unmanned aerial vehicles (UAVs) have emerged as transformative tools for\u0000dynamic and adaptive connectivity. However, dynamically adjusting their\u0000position to offer favorable communication channels introduces operational\u0000challenges in terms of energy consumption, especially when integrating advanced\u0000communication technologies like reconfigurable intelligent surfaces (RISs) and\u0000full-duplex relays (FDRs). To this end, by recognizing the pivotal role of UAV\u0000mobility, the paper introduces an energy-aware trajectory design for\u0000UAV-mounted RISs and UAV-mounted FDRs using the decode and forward (DF)\u0000protocol, aiming to maximize the network minimum rate and enhance user\u0000fairness, while taking into consideration the available on-board energy.\u0000Specifically, this work highlights their distinct energy consumption\u0000characteristics and their associated integration challenges by developing\u0000appropriate energy consumption models for both UAV-mounted RISs and FDRs that\u0000capture the intricate relationship between key factors such as weight, and\u0000their operational characteristics. Furthermore, a joint time-division multiple\u0000access (TDMA) user scheduling-UAV trajectory optimization problem is\u0000formulated, considering the power dynamics of both systems, while assuring that\u0000the UAV energy is not depleted mid-air. Finally, simulation results underscore\u0000the importance of energy considerations in determining the optimal trajectory\u0000and scheduling and provide insights into the performance comparison of\u0000UAV-mounted RISs and FDRs in UAV-assisted wireless networks.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559153","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
Performance Analysis of Fluid Antenna-aided Backscatter Communications Systems 流体天线辅助反向散射通信系统的性能分析
arXiv - CS - Information Theory Pub Date : 2024-01-22 DOI: arxiv-2401.11820
Farshad Rostami Ghadi, Masoud Kaveh, Kai-Kit Wong
{"title":"Performance Analysis of Fluid Antenna-aided Backscatter Communications Systems","authors":"Farshad Rostami Ghadi, Masoud Kaveh, Kai-Kit Wong","doi":"arxiv-2401.11820","DOIUrl":"https://doi.org/arxiv-2401.11820","url":null,"abstract":"This paper studies the performance of backscatter communications (BC) over\u0000emerging fluid antenna (FA) technology. In particular, a single-antenna source\u0000sends information to a FA reader through the wireless forward (i.e.,\u0000source-to-tag) and backscatter (tag-to-reader) channels. For the considered BC,\u0000we first derive the cumulative distribution function (CDF) of the equivalent\u0000channel at the FA receiver, and then we obtain closed-form expressions of the\u0000outage probability (OP) and delay outage rate (DOR) under a correlated Rayleigh\u0000distribution. Moreover, in order to gain more insights into the system\u0000performance, we present analytical expressions of the OP and DOR at the high\u0000SNR regime. Numerical results indicate that considering the FA at the reader\u0000can significantly improve the performance of BC in terms of the OP and DOR\u0000compared with a single-antenna reader.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559164","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Joint Near-Field Target Tracking and Communications with Full Duplex Holographic MIMO 全双工全息多输入多输出联合近场目标跟踪与通信
arXiv - CS - Information Theory Pub Date : 2024-01-22 DOI: arxiv-2401.12036
Ioannis Gavras, George C. Alexandropoulos
{"title":"Joint Near-Field Target Tracking and Communications with Full Duplex Holographic MIMO","authors":"Ioannis Gavras, George C. Alexandropoulos","doi":"arxiv-2401.12036","DOIUrl":"https://doi.org/arxiv-2401.12036","url":null,"abstract":"In this paper, we present a simultaneous target tracking and multi-user\u0000communications system realized by a full duplex holographic Multiple-Input\u0000Multiple-Output (MIMO) node equipped with Dynamic Metasurface Antennas (DMAs)\u0000at both its communication ends. Focusing on the near-field regime, we extend\u0000Fresnel's approximation to metasurfaces and devise a subspace tracking scheme\u0000with DMA-based hybrid Analog and Digital (A/D) reception as well as hybrid A/D\u0000transmission with a DMA for sum-rate maximization. The presented simulation\u0000results corroborate the efficiency of the proposed framework for various system\u0000parameters.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"39 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559334","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
Uncoded Storage Coded Transmission Elastic Computing with Straggler Tolerance in Heterogeneous Systems 异构系统中的无编码存储编码传输弹性计算与滞后容忍度
arXiv - CS - Information Theory Pub Date : 2024-01-22 DOI: arxiv-2401.12151
Xi Zhong, Joerg Kliewer, Mingyue Ji
{"title":"Uncoded Storage Coded Transmission Elastic Computing with Straggler Tolerance in Heterogeneous Systems","authors":"Xi Zhong, Joerg Kliewer, Mingyue Ji","doi":"arxiv-2401.12151","DOIUrl":"https://doi.org/arxiv-2401.12151","url":null,"abstract":"In 2018, Yang et al. introduced a novel and effective approach, using maximum\u0000distance separable (MDS) codes, to mitigate the impact of elasticity in cloud\u0000computing systems. This approach is referred to as coded elastic computing.\u0000Some limitations of this approach include that it assumes all virtual machines\u0000have the same computing speeds and storage capacities, and it cannot tolerate\u0000stragglers for matrix-matrix multiplications. In order to resolve these\u0000limitations, in this paper, we introduce a new combinatorial optimization\u0000framework, named uncoded storage coded transmission elastic computing (USCTEC),\u0000for heterogeneous speeds and storage constraints, aiming to minimize the\u0000expected computation time for matrix-matrix multiplications, under the\u0000consideration of straggler tolerance. Within this framework, we propose optimal\u0000solutions with straggler tolerance under relaxed storage constraints. Moreover,\u0000we propose a heuristic algorithm that considers the heterogeneous storage\u0000constraints. Our results demonstrate that the proposed algorithm outperforms\u0000baseline solutions utilizing cyclic storage placements, in terms of both\u0000expected computation time and storage size.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559143","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
ORBGRAND: Achievable Rate for General Bit Channels and Application in BICM ORBGRAND:通用比特信道的可实现速率及在 BICM 中的应用
arXiv - CS - Information Theory Pub Date : 2024-01-22 DOI: arxiv-2401.11901
Zhuang Li, Wenyi Zhang
{"title":"ORBGRAND: Achievable Rate for General Bit Channels and Application in BICM","authors":"Zhuang Li, Wenyi Zhang","doi":"arxiv-2401.11901","DOIUrl":"https://doi.org/arxiv-2401.11901","url":null,"abstract":"Guessing random additive noise decoding (GRAND) has received widespread\u0000attention recently, and among its variants, ordered reliability bits GRAND\u0000(ORBGRAND) is particularly attractive due to its efficient utilization of soft\u0000information and its amenability to hardware implementation. It has been\u0000recently shown that ORBGRAND is almost capacity-achieving in additive white\u0000Gaussian noise channels under antipodal input. In this work, we first extend\u0000the analysis of ORBGRAND achievable rate to memoryless binary-input bit\u0000channels with general output conditional probability distributions. The\u0000analytical result also sheds insight into understanding the gap between the\u0000ORBGRAND achievable rate and the channel mutual information. As an application\u0000of the analysis, we study the ORBGRAND achievable rate of bit-interleaved coded\u0000modulation (BICM). Numerical results indicate that for BICM, the gap between\u0000the ORBGRAND achievable rate and the channel mutual information is typically\u0000small, and hence suggest the feasibility of ORBGRAND for channels with\u0000high-order coded modulation schemes.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559349","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
The complexity of elliptic normal bases 椭圆法基的复杂性
arXiv - CS - Information Theory Pub Date : 2024-01-22 DOI: arxiv-2401.11872
Daniel Panario, Mohamadou Sall, Qiang Wang
{"title":"The complexity of elliptic normal bases","authors":"Daniel Panario, Mohamadou Sall, Qiang Wang","doi":"arxiv-2401.11872","DOIUrl":"https://doi.org/arxiv-2401.11872","url":null,"abstract":"We study the complexity (that is, the weight of the multiplication table) of\u0000the elliptic normal bases introduced by Couveignes and Lercier. We give an\u0000upper bound on the complexity of these elliptic normal bases, and we analyze\u0000the weight of some special vectors related to the multiplication table of those\u0000bases. This analysis leads us to some perspectives on the search for low\u0000complexity normal bases from elliptic periods.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559572","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信