首页 > 最新文献

arXiv - CS - Information Theory最新文献

英文 中文
Maximizing Spectral and Energy Efficiency in Multi-user MIMO OFDM Systems with RIS and Hardware Impairment 在具有 RIS 和硬件损伤的多用户 MIMO OFDM 系统中实现频谱和能效最大化
Pub Date : 2024-01-22 DOI: arxiv-2401.11921
Mohammad Soleymani, Ignacio Santamaria, Aydin Sezgin, Eduard Jorswieck
An emerging technology to enhance the spectral efficiency (SE) and energyefficiency (EE) of wireless communication systems is reconfigurable intelligentsurface (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 anindependent optimization of RIS elements at each sub-carrier is impossible inmulti-carrier systems. Thus, this paper investigates the performance of variousRIS technologies like regular (reflective and passive), simultaneously transmitand reflect (STAR), and multi-sector beyond diagonal (BD) RIS in multi-usermultiple-input multiple-output (MIMO) OFDM broadcast channels (BC). Thisrequires to formulate and solve a joint MIMO precoding and RIS optimizationproblem. The obtained solution reveals that RIS can significantly improve thesystem performance even when the number of RIS elements is relatively low.Moreover, we develop resource allocation schemes for STAR-RIS and multi-sectorBD-RIS in MIMO OFDM BCs, and show that these RIS technologies can outperform aregular RIS, especially when the regular RIS cannot assist the communicationsfor all the users.
可重构智能表面(RIS)是提高无线通信系统频谱效率(SE)和能效(EE)的一项新兴技术,在单载波系统中显示出强大的功能。然而,在多用户正交频分复用(OFDM)系统中,RIS的前景可能不如单载波系统,因为在多载波系统中不可能对每个子载波的RIS元素进行独立优化。因此,本文研究了各种 RIS 技术在多用户多输入多输出(MIMO)OFDM 广播信道(BC)中的性能,如常规(反射和被动)、同时发射和反射(STAR)以及多扇区超越对角线(BD)RIS。这就需要提出并解决一个联合 MIMO 预编码和 RIS 优化问题。此外,我们还为 MIMO OFDM 广播信道中的 STAR-RIS 和 multi-sectorBD-RIS 开发了资源分配方案,并表明这些 RIS 技术的性能优于普通 RIS,尤其是当普通 RIS 无法帮助所有用户进行通信时。
{"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 通过矢量化汉克尔提升实现同步盲目解混和超分辨率
Pub Date : 2024-01-22 DOI: arxiv-2401.11805
Haifeng Wang, Jinchi Chen, Hulei Fan, Yuxiang Zhao, Li Yu
In this work, we investigate the problem of simultaneous blind demixing andsuper-resolution. Leveraging the subspace assumption regarding unknown pointspread functions, this problem can be reformulated as a low-rank matrixdemixing problem. We propose a convex recovery approach that utilizes thelow-rank structure of each vectorized Hankel matrix associated with the targetmatrix. Our analysis reveals that for achieving exact recovery, the number ofsamples needs to satisfy the condition $ngtrsim Ksr log (sn)$. Empiricalevaluations demonstrate the recovery capabilities and the computationalefficiency of the convex method.
在这项工作中,我们研究了同步盲目解混和超分辨率问题。利用关于未知点展函数的子空间假设,这个问题可以被重新表述为低秩矩阵解混问题。我们提出了一种凸复原方法,利用与目标矩阵相关的每个矢量化 Hankel 矩阵的低阶结构。我们的分析表明,要实现精确恢复,样本数量需要满足条件 $ngtrsim Ksr log (sn)$。经验评估证明了凸方法的恢复能力和计算效率。
{"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 分布式天线系统中的大规模同步
Pub Date : 2024-01-22 DOI: arxiv-2401.11730
Erik G. Larsson
Distributed antennas must be phase-calibrated (phase-synchronized) forcertain operations, such as reciprocity-based joint coherent downlinkbeamforming, to work. We use rigorous signal processing tools to analyze theaccuracy of calibration protocols that are based on over-the-air measurementsbetween antennas, with a focus on scalability aspects for large systems. Weshow that (i) for some who-measures-on-whom topologies, the errors in thecalibration process are unbounded when the network grows; and (ii) despite thatconclusion, it is optimal -- irrespective of the topology -- to solve a singlecalibration problem for the entire system and use the result everywhere tosupport the beamforming. The analyses are exemplified by investigating specifictopologies, including lines, rings, and two-dimensional surfaces.
分布式天线必须经过相位校准(相位同步)才能进行某些操作,例如基于互惠的联合相干下行波束成形。我们使用严格的信号处理工具来分析基于天线间空中测量的校准协议的准确性,重点关注大型系统的可扩展性。结果表明:(i) 对于某些 "谁测量谁 "的拓扑结构,当网络增长时,校准过程中的误差是无限制的;(ii) 尽管有这样的结论,但无论拓扑结构如何,解决整个系统的单一校准问题并将结果用于支持波束成形都是最优的。通过研究特定拓扑结构,包括线、环和二维曲面,对上述分析进行了举例说明。
{"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 无线通信系统设计优化方法进展概览
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
Mathematical optimization is now widely regarded as an indispensable modelingand solution tool for the design of wireless communications systems. Whileoptimization has played a significant role in the revolutionary progress inwireless communication and networking technologies from 1G to 5G and onto thefuture 6G, the innovations in wireless technologies have also substantiallytransformed the nature of the underlying mathematical optimization problemsupon which the system designs are based and have sparked significantinnovations in the development of methodologies to understand, to analyze, andto solve those problems. In this paper, we provide a comprehensive survey ofrecent advances in mathematical optimization theory and algorithms for wirelesscommunication system design. We begin by illustrating common features ofmathematical optimization problems arising in wireless communication systemdesign. We discuss various scenarios and use cases and their associatedmathematical structures from an optimization perspective. We then provide anoverview of recent advances in mathematical optimization theory and algorithms,from nonconvex optimization, global optimization, and integer programming, todistributed optimization and learning-based optimization. The key to successfulsolution of mathematical optimization problems is in carefully choosing and/ordeveloping suitable optimization algorithms (or neural network architectures)that can exploit the underlying problem structure. We conclude the paper byidentifying several open research challenges and outlining future researchdirections.
目前,数学优化已被广泛视为无线通信系统设计中不可或缺的建模和求解工具。从 1G 到 5G 再到未来的 6G,优化在无线通信和网络技术的革命性进步中发挥了重要作用,同时,无线技术的创新也极大地改变了系统设计所依据的数学优化问题的性质,并在理解、分析和解决这些问题的方法论发展方面引发了重大创新。在本文中,我们将对无线通信系统设计的数学优化理论和算法的最新进展进行全面介绍。我们首先说明了无线通信系统设计中出现的数学优化问题的共同特征。我们从优化的角度讨论了各种方案和用例及其相关的数学结构。然后,我们概述了数学优化理论和算法的最新进展,包括非凸优化、全局优化和整数编程,以及分布式优化和基于学习的优化。成功解决数学优化问题的关键在于精心选择和/或开发合适的优化算法(或神经网络架构),以利用潜在的问题结构。最后,我们指出了几个有待解决的研究难题,并概述了未来的研究方向。
{"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 和全双工中继的能量感知轨迹优化
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
In the evolving landscape of sixth-generation (6G) wireless networks,unmanned aerial vehicles (UAVs) have emerged as transformative tools fordynamic and adaptive connectivity. However, dynamically adjusting theirposition to offer favorable communication channels introduces operationalchallenges in terms of energy consumption, especially when integrating advancedcommunication technologies like reconfigurable intelligent surfaces (RISs) andfull-duplex relays (FDRs). To this end, by recognizing the pivotal role of UAVmobility, the paper introduces an energy-aware trajectory design forUAV-mounted RISs and UAV-mounted FDRs using the decode and forward (DF)protocol, aiming to maximize the network minimum rate and enhance userfairness, while taking into consideration the available on-board energy.Specifically, this work highlights their distinct energy consumptioncharacteristics and their associated integration challenges by developingappropriate energy consumption models for both UAV-mounted RISs and FDRs thatcapture the intricate relationship between key factors such as weight, andtheir operational characteristics. Furthermore, a joint time-division multipleaccess (TDMA) user scheduling-UAV trajectory optimization problem isformulated, considering the power dynamics of both systems, while assuring thatthe UAV energy is not depleted mid-air. Finally, simulation results underscorethe importance of energy considerations in determining the optimal trajectoryand scheduling and provide insights into the performance comparison ofUAV-mounted RISs and FDRs in UAV-assisted wireless networks.
在不断发展的第六代(6G)无线网络中,无人飞行器(UAV)已成为动态和自适应连接的变革性工具。然而,动态调整其位置以提供有利的通信信道会带来能耗方面的操作挑战,尤其是在集成可重构智能表面(RIS)和全双工中继(FDR)等先进通信技术时。为此,本文认识到无人机移动性的关键作用,介绍了使用解码和转发(DF)协议为无人机安装的 RIS 和无人机安装的 FDR 进行能量感知轨迹设计的方法,旨在最大限度地提高网络最小速率并增强用户公平性,同时考虑到可用的机载能量。具体来说,这项工作通过为无人机安装的 RIS 和 FDR 建立合适的能耗模型,捕捉重量等关键因素与其运行特性之间错综复杂的关系,突出了它们不同的能耗特性及其相关的集成挑战。此外,考虑到两个系统的功率动态,还制定了一个联合时分多址(TDMA)用户调度-无人机轨迹优化问题,同时确保无人机的能量不会在空中耗尽。最后,仿真结果强调了能源因素在确定最佳轨迹和调度方面的重要性,并为无人机辅助无线网络中无人机安装的 RIS 和 FDR 的性能比较提供了深入见解。
{"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 流体天线辅助反向散射通信系统的性能分析
Pub Date : 2024-01-22 DOI: arxiv-2401.11820
Farshad Rostami Ghadi, Masoud Kaveh, Kai-Kit Wong
This paper studies the performance of backscatter communications (BC) overemerging fluid antenna (FA) technology. In particular, a single-antenna sourcesends 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 equivalentchannel at the FA receiver, and then we obtain closed-form expressions of theoutage probability (OP) and delay outage rate (DOR) under a correlated Rayleighdistribution. Moreover, in order to gain more insights into the systemperformance, we present analytical expressions of the OP and DOR at the highSNR regime. Numerical results indicate that considering the FA at the readercan significantly improve the performance of BC in terms of the OP and DORcompared with a single-antenna reader.
本文研究了背向散射通信(BC)超越流体天线(FA)技术的性能。具体而言,单天线信号源通过无线前向(即信号源到标签)和反向散射(标签到阅读器)信道向流体天线阅读器发送信息。对于所考虑的 BC,我们首先推导出 FA 接收器处等效信道的累积分布函数 (CDF),然后得到相关 Rayleighdistribution 下的中断概率 (OP) 和延迟中断率 (DOR) 的闭式表达式。此外,为了更深入地了解系统性能,我们还给出了高信噪比情况下 OP 和 DOR 的解析表达式。数值结果表明,与单天线读取器相比,在读取器上考虑 FA 可以显著提高 BC 的 OP 和 DOR 性能。
{"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 全双工全息多输入多输出联合近场目标跟踪与通信
Pub Date : 2024-01-22 DOI: arxiv-2401.12036
Ioannis Gavras, George C. Alexandropoulos
In this paper, we present a simultaneous target tracking and multi-usercommunications system realized by a full duplex holographic Multiple-InputMultiple-Output (MIMO) node equipped with Dynamic Metasurface Antennas (DMAs)at both its communication ends. Focusing on the near-field regime, we extendFresnel's approximation to metasurfaces and devise a subspace tracking schemewith DMA-based hybrid Analog and Digital (A/D) reception as well as hybrid A/Dtransmission with a DMA for sum-rate maximization. The presented simulationresults corroborate the efficiency of the proposed framework for various systemparameters.
在本文中,我们介绍了一种同时跟踪目标和多用户通信系统,该系统由一个全双工全息多输入多输出(MIMO)节点实现,该节点在其通信两端配备了动态元面天线(DMA)。我们以近场机制为重点,将菲涅尔近似法扩展到元表面,并设计了一种子空间跟踪方案,该方案具有基于 DMA 的模拟和数字(A/D)混合接收功能,以及具有 DMA 的混合 A/D 传输功能,以实现总速率最大化。仿真结果证实了针对各种系统参数提出的框架的效率。
{"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 异构系统中的无编码存储编码传输弹性计算与滞后容忍度
Pub Date : 2024-01-22 DOI: arxiv-2401.12151
Xi Zhong, Joerg Kliewer, Mingyue Ji
In 2018, Yang et al. introduced a novel and effective approach, using maximumdistance separable (MDS) codes, to mitigate the impact of elasticity in cloudcomputing systems. This approach is referred to as coded elastic computing.Some limitations of this approach include that it assumes all virtual machineshave the same computing speeds and storage capacities, and it cannot toleratestragglers for matrix-matrix multiplications. In order to resolve theselimitations, in this paper, we introduce a new combinatorial optimizationframework, named uncoded storage coded transmission elastic computing (USCTEC),for heterogeneous speeds and storage constraints, aiming to minimize theexpected computation time for matrix-matrix multiplications, under theconsideration of straggler tolerance. Within this framework, we propose optimalsolutions with straggler tolerance under relaxed storage constraints. Moreover,we propose a heuristic algorithm that considers the heterogeneous storageconstraints. Our results demonstrate that the proposed algorithm outperformsbaseline solutions utilizing cyclic storage placements, in terms of bothexpected computation time and storage size.
2018年,Yang等人提出了一种新颖有效的方法,使用最大距离可分离(MDS)代码来减轻云计算系统中弹性的影响。这种方法被称为编码弹性计算。这种方法的一些局限性包括:它假定所有虚拟机具有相同的计算速度和存储容量,并且不能容忍矩阵-矩阵乘法的延迟。为了解决这些局限性,我们在本文中引入了一个新的组合优化框架,名为 "无编码存储编码传输弹性计算(USCTEC)",用于异构速度和存储约束,目的是在考虑滞后容错的情况下,最大限度地减少矩阵-矩阵乘法的预期计算时间。在此框架内,我们提出了在宽松存储约束条件下具有杂散容差的优化方案。此外,我们还提出了一种考虑异构存储约束的启发式算法。我们的结果表明,所提出的算法在预期计算时间和存储大小两方面都优于利用循环存储放置的基准解决方案。
{"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 中的应用
Pub Date : 2024-01-22 DOI: arxiv-2401.11901
Zhuang Li, Wenyi Zhang
Guessing random additive noise decoding (GRAND) has received widespreadattention recently, and among its variants, ordered reliability bits GRAND(ORBGRAND) is particularly attractive due to its efficient utilization of softinformation and its amenability to hardware implementation. It has beenrecently shown that ORBGRAND is almost capacity-achieving in additive whiteGaussian noise channels under antipodal input. In this work, we first extendthe analysis of ORBGRAND achievable rate to memoryless binary-input bitchannels with general output conditional probability distributions. Theanalytical result also sheds insight into understanding the gap between theORBGRAND achievable rate and the channel mutual information. As an applicationof the analysis, we study the ORBGRAND achievable rate of bit-interleaved codedmodulation (BICM). Numerical results indicate that for BICM, the gap betweenthe ORBGRAND achievable rate and the channel mutual information is typicallysmall, and hence suggest the feasibility of ORBGRAND for channels withhigh-order coded modulation schemes.
猜测随机加性噪声解码(GRAND)近来受到广泛关注,在其变体中,有序可靠性比特GRAND(ORBGRAND)因其对软信息的有效利用和易于硬件实现而特别具有吸引力。最近的研究表明,ORBGRAND 在加性白高斯噪声信道中几乎可以实现反向输入的容量。在这项工作中,我们首先将 ORBGRAND 可实现率的分析扩展到具有一般输出条件概率分布的无记忆二元输入比特通道。分析结果还有助于理解 ORBGRAND 可实现率与信道互信息之间的差距。作为分析的一个应用,我们研究了比特交织编码调制(BICM)的 ORBGRAND 可实现率。数值结果表明,对于 BICM,ORBGRAND 可实现速率与信道互信息之间的差距通常很小,因此表明 ORBGRAND 对于采用高阶编码调制方案的信道是可行的。
{"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 椭圆法基的复杂性
Pub Date : 2024-01-22 DOI: arxiv-2401.11872
Daniel Panario, Mohamadou Sall, Qiang Wang
We study the complexity (that is, the weight of the multiplication table) ofthe elliptic normal bases introduced by Couveignes and Lercier. We give anupper bound on the complexity of these elliptic normal bases, and we analyzethe weight of some special vectors related to the multiplication table of thosebases. This analysis leads us to some perspectives on the search for lowcomplexity normal bases from elliptic periods.
我们研究了库维涅(Couveignes)和勒塞尔(Lercier)引入的椭圆正基的复杂性(即乘法表的权重)。我们给出了这些椭圆正基复杂性的上界,并分析了与这些基的乘法表有关的一些特殊向量的权重。这一分析为我们从椭圆周期中寻找低复杂度正基提供了一些视角。
{"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
期刊
arXiv - CS - Information Theory
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1