Mohammad Soleymani, Ignacio Santamaria, Aydin Sezgin, Eduard Jorswieck
An emerging technology to enhance the spectral efficiency (SE) and energy efficiency (EE) of wireless communication systems is reconfigurable intelligent surface (RIS), which is shown to be very powerful in single-carrier systems. However, in multi-user orthogonal frequency division multiplexing (OFDM) systems, RIS may not be as promising as in single-carrier systems since an independent optimization of RIS elements at each sub-carrier is impossible in multi-carrier systems. Thus, this paper investigates the performance of various RIS technologies like regular (reflective and passive), simultaneously transmit and reflect (STAR), and multi-sector beyond diagonal (BD) RIS in multi-user multiple-input multiple-output (MIMO) OFDM broadcast channels (BC). This requires to formulate and solve a joint MIMO precoding and RIS optimization problem. The obtained solution reveals that RIS can significantly improve the system performance even when the number of RIS elements is relatively low. Moreover, we develop resource allocation schemes for STAR-RIS and multi-sector BD-RIS in MIMO OFDM BCs, and show that these RIS technologies can outperform a regular RIS, especially when the regular RIS cannot assist the communications for 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}
Haifeng Wang, Jinchi Chen, Hulei Fan, Yuxiang Zhao, Li Yu
In this work, we investigate the problem of simultaneous blind demixing and super-resolution. Leveraging the subspace assumption regarding unknown point spread functions, this problem can be reformulated as a low-rank matrix demixing problem. We propose a convex recovery approach that utilizes the low-rank structure of each vectorized Hankel matrix associated with the target matrix. Our analysis reveals that for achieving exact recovery, the number of samples needs to satisfy the condition $ngtrsim Ksr log (sn)$. Empirical evaluations demonstrate the recovery capabilities and the computational efficiency of the convex method.
{"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}
Distributed antennas must be phase-calibrated (phase-synchronized) for certain operations, such as reciprocity-based joint coherent downlink beamforming, to work. We use rigorous signal processing tools to analyze the accuracy of calibration protocols that are based on over-the-air measurements between antennas, with a focus on scalability aspects for large systems. We show that (i) for some who-measures-on-whom topologies, the errors in the calibration process are unbounded when the network grows; and (ii) despite that conclusion, it is optimal -- irrespective of the topology -- to solve a single calibration problem for the entire system and use the result everywhere to support the beamforming. The analyses are exemplified by investigating specific topologies, including lines, rings, and two-dimensional surfaces.
{"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}
Ya-Feng Liu, Tsung-Hui Chang, Mingyi Hong, Zheyu Wu, Anthony Man-Cho So, Eduard A. Jorswieck, Wei Yu
Mathematical optimization is now widely regarded as an indispensable modeling and solution tool for the design of wireless communications systems. While optimization has played a significant role in the revolutionary progress in wireless communication and networking technologies from 1G to 5G and onto the future 6G, the innovations in wireless technologies have also substantially transformed the nature of the underlying mathematical optimization problems upon which the system designs are based and have sparked significant innovations in the development of methodologies to understand, to analyze, and to solve those problems. In this paper, we provide a comprehensive survey of recent advances in mathematical optimization theory and algorithms for wireless communication system design. We begin by illustrating common features of mathematical optimization problems arising in wireless communication system design. We discuss various scenarios and use cases and their associated mathematical structures from an optimization perspective. We then provide an overview of recent advances in mathematical optimization theory and algorithms, from nonconvex optimization, global optimization, and integer programming, to distributed optimization and learning-based optimization. The key to successful solution of mathematical optimization problems is in carefully choosing and/or developing suitable optimization algorithms (or neural network architectures) that can exploit the underlying problem structure. We conclude the paper by identifying several open research challenges and outlining future research directions.
{"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}
Dimitrios Tyrovolas, Nikos A. Mitsiou, Thomas G. Boufikos, Prodromos-Vasileios Mekikis, Sotiris A. Tegos, Panagiotis D. Diamantoulakis, Sotiris Ioannidis, Christos K. Liaskos, George K. Karagiannidis
In the evolving landscape of sixth-generation (6G) wireless networks, unmanned aerial vehicles (UAVs) have emerged as transformative tools for dynamic and adaptive connectivity. However, dynamically adjusting their position to offer favorable communication channels introduces operational challenges in terms of energy consumption, especially when integrating advanced communication technologies like reconfigurable intelligent surfaces (RISs) and full-duplex relays (FDRs). To this end, by recognizing the pivotal role of UAV mobility, the paper introduces an energy-aware trajectory design for UAV-mounted RISs and UAV-mounted FDRs using the decode and forward (DF) protocol, aiming to maximize the network minimum rate and enhance user fairness, while taking into consideration the available on-board energy. Specifically, this work highlights their distinct energy consumption characteristics and their associated integration challenges by developing appropriate energy consumption models for both UAV-mounted RISs and FDRs that capture the intricate relationship between key factors such as weight, and their operational characteristics. Furthermore, a joint time-division multiple access (TDMA) user scheduling-UAV trajectory optimization problem is formulated, considering the power dynamics of both systems, while assuring that the UAV energy is not depleted mid-air. Finally, simulation results underscore the importance of energy considerations in determining the optimal trajectory and scheduling and provide insights into the performance comparison of UAV-mounted RISs and FDRs in UAV-assisted wireless networks.
{"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}
This paper studies the performance of backscatter communications (BC) over emerging fluid antenna (FA) technology. In particular, a single-antenna source sends information to a FA reader through the wireless forward (i.e., source-to-tag) and backscatter (tag-to-reader) channels. For the considered BC, we first derive the cumulative distribution function (CDF) of the equivalent channel at the FA receiver, and then we obtain closed-form expressions of the outage probability (OP) and delay outage rate (DOR) under a correlated Rayleigh distribution. Moreover, in order to gain more insights into the system performance, we present analytical expressions of the OP and DOR at the high SNR regime. Numerical results indicate that considering the FA at the reader can significantly improve the performance of BC in terms of the OP and DOR compared 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}
In this paper, we present a simultaneous target tracking and multi-user communications system realized by a full duplex holographic Multiple-Input Multiple-Output (MIMO) node equipped with Dynamic Metasurface Antennas (DMAs) at both its communication ends. Focusing on the near-field regime, we extend Fresnel's approximation to metasurfaces and devise a subspace tracking scheme with DMA-based hybrid Analog and Digital (A/D) reception as well as hybrid A/D transmission with a DMA for sum-rate maximization. The presented simulation results corroborate the efficiency of the proposed framework for various system parameters.
{"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}
In 2018, Yang et al. introduced a novel and effective approach, using maximum distance separable (MDS) codes, to mitigate the impact of elasticity in cloud computing systems. This approach is referred to as coded elastic computing. Some limitations of this approach include that it assumes all virtual machines have the same computing speeds and storage capacities, and it cannot tolerate stragglers for matrix-matrix multiplications. In order to resolve these limitations, in this paper, we introduce a new combinatorial optimization framework, named uncoded storage coded transmission elastic computing (USCTEC), for heterogeneous speeds and storage constraints, aiming to minimize the expected computation time for matrix-matrix multiplications, under the consideration of straggler tolerance. Within this framework, we propose optimal solutions with straggler tolerance under relaxed storage constraints. Moreover, we propose a heuristic algorithm that considers the heterogeneous storage constraints. Our results demonstrate that the proposed algorithm outperforms baseline solutions utilizing cyclic storage placements, in terms of both expected computation time and storage size.
{"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}
Guessing random additive noise decoding (GRAND) has received widespread attention recently, and among its variants, ordered reliability bits GRAND (ORBGRAND) is particularly attractive due to its efficient utilization of soft information and its amenability to hardware implementation. It has been recently shown that ORBGRAND is almost capacity-achieving in additive white Gaussian noise channels under antipodal input. In this work, we first extend the analysis of ORBGRAND achievable rate to memoryless binary-input bit channels with general output conditional probability distributions. The analytical result also sheds insight into understanding the gap between the ORBGRAND achievable rate and the channel mutual information. As an application of the analysis, we study the ORBGRAND achievable rate of bit-interleaved coded modulation (BICM). Numerical results indicate that for BICM, the gap between the ORBGRAND achievable rate and the channel mutual information is typically small, and hence suggest the feasibility of ORBGRAND for channels with high-order coded modulation schemes.
{"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}
We study the complexity (that is, the weight of the multiplication table) of the elliptic normal bases introduced by Couveignes and Lercier. We give an upper bound on the complexity of these elliptic normal bases, and we analyze the weight of some special vectors related to the multiplication table of those bases. This analysis leads us to some perspectives on the search for low complexity normal bases from elliptic periods.
{"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}