To estimate the channel correlation matrix (CCM) in areas where channel information cannot be collected in advance, this paper proposes a way to spatially extrapolate CCM based on the calibration of the surface roughness parameters of scatterers in the propagation scene. We calibrate the roughness parameters of scene scatters based on CCM data in some specific areas. From these calibrated roughness parameters, we are able to generate a good prediction of the CCM for any other area in the scene by performing ray tracing. Simulation results show that the channel extrapolation method proposed in this paper can effectively realize the extrapolation of the CCM between different areas in frequency domain, or even from one domain to another.
{"title":"Channel Correlation Matrix Extrapolation Based on Roughness Calibration of Scatterers","authors":"Heling Zhang, Xiujun Zhang, Xiaofeng Zhong, Shidong Zhou","doi":"arxiv-2409.10900","DOIUrl":"https://doi.org/arxiv-2409.10900","url":null,"abstract":"To estimate the channel correlation matrix (CCM) in areas where channel\u0000information cannot be collected in advance, this paper proposes a way to\u0000spatially extrapolate CCM based on the calibration of the surface roughness\u0000parameters of scatterers in the propagation scene. We calibrate the roughness\u0000parameters of scene scatters based on CCM data in some specific areas. From\u0000these calibrated roughness parameters, we are able to generate a good\u0000prediction of the CCM for any other area in the scene by performing ray\u0000tracing. Simulation results show that the channel extrapolation method proposed\u0000in this paper can effectively realize the extrapolation of the CCM between\u0000different areas in frequency domain, or even from one domain to another.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251319","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 recently introduced the "Virtual VNA" concept which estimates the $N times N$ scattering matrix characterizing an arbitrarily complex linear system with $N$ monomodal ports by inputting and outputting waves only via $N_mathrm{A}
我们最近提出了 "虚拟 VNA "的概念，它通过仅通过 $N_mathrm{A}
{"title":"Virtual VNA 2.0: Ambiguity-Free Scattering Matrix Estimation by Terminating Inaccessible Ports With Tunable and Coupled Loads","authors":"Philipp del Hougne","doi":"arxiv-2409.10977","DOIUrl":"https://doi.org/arxiv-2409.10977","url":null,"abstract":"We recently introduced the \"Virtual VNA\" concept which estimates the $N\u0000times N$ scattering matrix characterizing an arbitrarily complex linear system\u0000with $N$ monomodal ports by inputting and outputting waves only via\u0000$N_mathrm{A}<N$ ports while terminating the $N_mathrm{S}=N-N_mathrm{A}$\u0000remaining ports with known tunable individual loads. However, vexing\u0000ambiguities about the signs of the off-diagonal scattering coefficients\u0000involving the $N_mathrm{S}$ not-directly-accessible (NDA) ports remained. If\u0000only phase-insensitive measurements were used, an additional blockwise phase\u0000ambiguity ensued. Here, inspired by the emergence of \"beyond-diagonal\u0000reconfigurable intelligent surfaces\" in wireless communications, we lift all\u0000ambiguities with at most $N_mathrm{S}$ additional measurements involving a\u0000known multi-port load network. We experimentally validate our approach based on\u0000an 8-port chaotic cavity, using a simple coaxial cable as two-port load\u0000network. Endowed with the multi-port load network, the \"Virtual VNA 2.0\" is now\u0000able to estimate the entire scattering matrix without any ambiguity, even\u0000without ever measuring phase information explicitly. Potential applications\u0000include the characterization of antenna arrays.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":"14 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251324","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}
Arvind Kumar, Nikumani Choudhury, Jayendra N. Bandyopadhyay, S. M. Zafaruddin
Signal transmission over underwater optical wireless communication (UOWC) experiences the combined effect of oceanic turbulence and pointing errors statistically modeled using the sum of two Meijer-G functions. There is a research gap in the exact statistical analysis of multi-aperture UOWC systems that use selection combining diversity techniques to enhance performance compared to single-aperture systems. In this paper, we develop a general framework for the continued product and positive integer exponent for the sum of Meijer-G functions to analyze the exact statistical performance of the UOWC system in terms of multivariate Fox-H function for both independent and non-identically distributed (i.ni.d.) and independent and identically distributed (i.i.d.) channels. We also approximate the performance of a multi-aperture UOWC system with i.i.d. channels using the single-variate Fox-H function. Using the generalized approach, we present analytical expressions for average bit-error rate (BER) and ergodic capacity for the considered system operating over exponential generalized gamma (EGG) oceanic turbulence combined with zero-boresight pointing errors. We also develop asymptotic expressions for the average BER at a high signal-to-noise (SNR) to capture insights into the system's performance. Our simulation findings confirm the accuracy of our derived expressions and illustrate the impact of turbulence parameters for i.ni.d. and i.i.d. models for the average BER and ergodic capacity, which may provide a better estimate for the efficient deployment of UOWC.
{"title":"Meijer-G Function with Continued Product and Integer Exponent: Performance of Multi-Aperture UOWC System over EGG Turbulence","authors":"Arvind Kumar, Nikumani Choudhury, Jayendra N. Bandyopadhyay, S. M. Zafaruddin","doi":"arxiv-2409.11337","DOIUrl":"https://doi.org/arxiv-2409.11337","url":null,"abstract":"Signal transmission over underwater optical wireless communication (UOWC)\u0000experiences the combined effect of oceanic turbulence and pointing errors\u0000statistically modeled using the sum of two Meijer-G functions. There is a\u0000research gap in the exact statistical analysis of multi-aperture UOWC systems\u0000that use selection combining diversity techniques to enhance performance\u0000compared to single-aperture systems. In this paper, we develop a general\u0000framework for the continued product and positive integer exponent for the sum\u0000of Meijer-G functions to analyze the exact statistical performance of the UOWC\u0000system in terms of multivariate Fox-H function for both independent and\u0000non-identically distributed (i.ni.d.) and independent and identically\u0000distributed (i.i.d.) channels. We also approximate the performance of a\u0000multi-aperture UOWC system with i.i.d. channels using the single-variate Fox-H\u0000function. Using the generalized approach, we present analytical expressions for\u0000average bit-error rate (BER) and ergodic capacity for the considered system\u0000operating over exponential generalized gamma (EGG) oceanic turbulence combined\u0000with zero-boresight pointing errors. We also develop asymptotic expressions for\u0000the average BER at a high signal-to-noise (SNR) to capture insights into the\u0000system's performance. Our simulation findings confirm the accuracy of our\u0000derived expressions and illustrate the impact of turbulence parameters for\u0000i.ni.d. and i.i.d. models for the average BER and ergodic capacity, which may\u0000provide a better estimate for the efficient deployment of UOWC.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":"41 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251313","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}
Geraldo Gomes, Pedro Freire, Jaroslaw E. Prilepsky, Sergei K. Turitsyn
Power efficiency remains a significant challenge in modern optical fiber communication systems, driving efforts to reduce the computational complexity of digital signal processing, particularly in chromatic dispersion compensation (CDC) algorithms. While various strategies for complexity reduction have been proposed, many lack the necessary hardware implementation to validate their benefits. This paper provides a theoretical analysis of the tap overlapping effect in CDC filters for coherent receivers, introduces a novel Time-Domain Clustered Equalizer (TDCE) technique based on this concept, and presents a Field-Programmable Gate Array (FPGA) implementation for validation. We developed an innovative parallelization method for TDCE, implementing it in hardware for fiber lengths up to 640 km. A fair comparison with the state-of-the-art frequency domain equalizer (FDE) under identical conditions is also conducted. Our findings highlight that implementation strategies, including parallelization and memory management, are as crucial as computational complexity in determining hardware complexity and energy efficiency. The proposed TDCE hardware implementation achieves up to 70.7% energy savings and 71.4% multiplier usage savings compared to FDE, despite its higher computational complexity.
{"title":"Geometric Clustering for Hardware-Efficient Implementation of Chromatic Dispersion Compensation","authors":"Geraldo Gomes, Pedro Freire, Jaroslaw E. Prilepsky, Sergei K. Turitsyn","doi":"arxiv-2409.10416","DOIUrl":"https://doi.org/arxiv-2409.10416","url":null,"abstract":"Power efficiency remains a significant challenge in modern optical fiber\u0000communication systems, driving efforts to reduce the computational complexity\u0000of digital signal processing, particularly in chromatic dispersion compensation\u0000(CDC) algorithms. While various strategies for complexity reduction have been\u0000proposed, many lack the necessary hardware implementation to validate their\u0000benefits. This paper provides a theoretical analysis of the tap overlapping\u0000effect in CDC filters for coherent receivers, introduces a novel Time-Domain\u0000Clustered Equalizer (TDCE) technique based on this concept, and presents a\u0000Field-Programmable Gate Array (FPGA) implementation for validation. We\u0000developed an innovative parallelization method for TDCE, implementing it in\u0000hardware for fiber lengths up to 640 km. A fair comparison with the\u0000state-of-the-art frequency domain equalizer (FDE) under identical conditions is\u0000also conducted. Our findings highlight that implementation strategies,\u0000including parallelization and memory management, are as crucial as\u0000computational complexity in determining hardware complexity and energy\u0000efficiency. The proposed TDCE hardware implementation achieves up to 70.7%\u0000energy savings and 71.4% multiplier usage savings compared to FDE, despite its\u0000higher computational complexity.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":"41 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251368","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}
Speech Emotion Recognition (SER) systems rely on speech input and emotional labels annotated by humans. However, various emotion databases collect perceptional evaluations in different ways. For instance, the IEMOCAP dataset uses video clips with sounds for annotators to provide their emotional perceptions. However, the most significant English emotion dataset, the MSP-PODCAST, only provides speech for raters to choose the emotional ratings. Nevertheless, using speech as input is the standard approach to training SER systems. Therefore, the open question is the emotional labels elicited by which scenarios are the most effective for training SER systems. We comprehensively compare the effectiveness of SER systems trained with labels elicited by different modality stimuli and evaluate the SER systems on various testing conditions. Also, we introduce an all-inclusive label that combines all labels elicited by various modalities. We show that using labels elicited by voice-only stimuli for training yields better performance on the test set, whereas labels elicited by voice-only stimuli.
语音情感识别（SER）系统依赖于语音输入和人类注释的情感标签。然而，各种情感数据库收集感知评估的方式各不相同。例如，IEMOCAP 数据集利用带有声音的视频片段让注释者提供他们的情感感知。然而，最重要的英语情感数据集--MSP-PODCAST--只提供语音供评分者选择情感评分。然而，使用语音作为输入是训练 SER 系统的标准方法。然而，使用语音作为输入是训练 SER 系统的标准方法。因此，一个悬而未决的问题是，哪种情景下激发的情感标签对训练 SER 系统最有效。我们全面比较了使用不同模式刺激激发的标签训练 SER 系统的效果，并在各种测试条件下对 SER 系统进行了评估。此外，我们还引入了一种包罗万象的标签，它结合了各种模态激发的所有标签。我们的研究表明，使用纯声音刺激激发的标签进行训练，在测试集上的表现比使用纯声音刺激激发的标签更好。
{"title":"Stimulus Modality Matters: Impact of Perceptual Evaluations from Different Modalities on Speech Emotion Recognition System Performance","authors":"Huang-Cheng Chou, Haibin Wu, Chi-Chun Lee","doi":"arxiv-2409.10762","DOIUrl":"https://doi.org/arxiv-2409.10762","url":null,"abstract":"Speech Emotion Recognition (SER) systems rely on speech input and emotional\u0000labels annotated by humans. However, various emotion databases collect\u0000perceptional evaluations in different ways. For instance, the IEMOCAP dataset\u0000uses video clips with sounds for annotators to provide their emotional\u0000perceptions. However, the most significant English emotion dataset, the\u0000MSP-PODCAST, only provides speech for raters to choose the emotional ratings.\u0000Nevertheless, using speech as input is the standard approach to training SER\u0000systems. Therefore, the open question is the emotional labels elicited by which\u0000scenarios are the most effective for training SER systems. We comprehensively\u0000compare the effectiveness of SER systems trained with labels elicited by\u0000different modality stimuli and evaluate the SER systems on various testing\u0000conditions. Also, we introduce an all-inclusive label that combines all labels\u0000elicited by various modalities. We show that using labels elicited by\u0000voice-only stimuli for training yields better performance on the test set,\u0000whereas labels elicited by voice-only stimuli.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":"6 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251367","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}
Islam M. Tanash, Ayush Kumar Dwivedi, Fatemeh Rafiei Maleki, Taneli Riihonen
This paper presents and analyzes a reconfigurable intelligent surface (RIS)-based high-altitude platform (HAP) network. Stochastic geometry is used to model the arbitrary locations of the HAPs and RISs as a homogenous Poisson point process. Considering that the links between the HAPs, RISs, and users are $kappa$--$mu$ faded, the coverage and ergodic capacity of the proposed system are expressed. The analytically derived performance measures are verified through Monte Carlo simulations. Significant improvements in system performance and the impact of system parameters are demonstrated in the results. Thus, the proposed system concept can improve connectivity and data offloading in smart cities and dense urban environments.
{"title":"Enhancing HAP Networks with Reconfigurable Intelligent Surfaces","authors":"Islam M. Tanash, Ayush Kumar Dwivedi, Fatemeh Rafiei Maleki, Taneli Riihonen","doi":"arxiv-2409.10040","DOIUrl":"https://doi.org/arxiv-2409.10040","url":null,"abstract":"This paper presents and analyzes a reconfigurable intelligent surface\u0000(RIS)-based high-altitude platform (HAP) network. Stochastic geometry is used\u0000to model the arbitrary locations of the HAPs and RISs as a homogenous Poisson\u0000point process. Considering that the links between the HAPs, RISs, and users are\u0000$kappa$--$mu$ faded, the coverage and ergodic capacity of the proposed system\u0000are expressed. The analytically derived performance measures are verified\u0000through Monte Carlo simulations. Significant improvements in system performance\u0000and the impact of system parameters are demonstrated in the results. Thus, the\u0000proposed system concept can improve connectivity and data offloading in smart\u0000cities and dense urban environments.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":"6 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251376","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 wideband systems operating at mmWave frequencies, intelligent reflecting surfaces (IRSs) equipped with many passive elements can compensate for channel propagation losses. Then, a phenomenon known as the beam-split (B-SP) occurs in which the phase shifters at the IRS elements fail to beamform at a desired user equipment (UE) over the total allotted bandwidth (BW). Although B-SP is usually seen as an impairment, in this paper, we take an optimistic view and exploit the B-SP effect to enhance the system performance via an orthogonal frequency division multiple access (OFDMA). We argue that due to the B-SP, when an IRS is tuned to beamform at a particular angle on one frequency, it also forms beams in different directions on other frequencies. Then, by opportunistically scheduling different UEs on different subcarriers (SCs), we show that, almost surely, the optimal array gain that scales quadratically in the number of IRS elements can be achieved on all SCs in the system. We derive the achievable throughput of the proposed scheme and deduce that the system also enjoys additional multi-user diversity benefits on top of the optimal beamforming gain over the full BW. Finally, we verify our findings via numerical simulations.
{"title":"Exploiting Beam-Split in IRS-aided Systems via OFDMA","authors":"P. Siddhartha, L. Yashvanth, Chandra R. Murthy","doi":"arxiv-2409.10404","DOIUrl":"https://doi.org/arxiv-2409.10404","url":null,"abstract":"In wideband systems operating at mmWave frequencies, intelligent reflecting\u0000surfaces (IRSs) equipped with many passive elements can compensate for channel\u0000propagation losses. Then, a phenomenon known as the beam-split (B-SP) occurs in\u0000which the phase shifters at the IRS elements fail to beamform at a desired user\u0000equipment (UE) over the total allotted bandwidth (BW). Although B-SP is usually\u0000seen as an impairment, in this paper, we take an optimistic view and exploit\u0000the B-SP effect to enhance the system performance via an orthogonal frequency\u0000division multiple access (OFDMA). We argue that due to the B-SP, when an IRS is\u0000tuned to beamform at a particular angle on one frequency, it also forms beams\u0000in different directions on other frequencies. Then, by opportunistically\u0000scheduling different UEs on different subcarriers (SCs), we show that, almost\u0000surely, the optimal array gain that scales quadratically in the number of IRS\u0000elements can be achieved on all SCs in the system. We derive the achievable\u0000throughput of the proposed scheme and deduce that the system also enjoys\u0000additional multi-user diversity benefits on top of the optimal beamforming gain\u0000over the full BW. Finally, we verify our findings via numerical simulations.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":"88 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251373","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}
Nianzu Li, Peiran Wu, Boyu Ning, Lipeng Zhu, Weidong Mei
Movable antenna (MA) has emerged as a promising technology for improving the performance of wireless communication systems, which enables local movement of the antennas to create more favorable channel conditions. In this letter, we advance its application for over-the-air computation (AirComp) network, where an access point is equipped with a two-dimensional (2D) MA array to aggregate wireless data from massive users. We aim to minimize the computation mean square error (CMSE) by jointly optimizing the antenna position vector (APV), the receive combining vector at the access point and the transmit coefficients from all users. To tackle this highly non-convex problem, we propose a two-loop iterative algorithm, where the particle swarm optimization (PSO) approach is leveraged to obtain a suboptimal APV in the outer loop while the receive combining vector and transmit coefficients are alternately optimized in the inner loop. Numerical results demonstrate that the proposed MA-enhanced AirComp network outperforms the conventional network with fixed-position antennas (FPAs).
可移动天线（MA）已成为提高无线通信系统性能的一项前景广阔的技术，它可以实现天线的局部移动，从而创造更有利的信道条件。在这封信中，我们介绍了可移动天线在空中计算（AirComp）网络中的应用，在该网络中，接入点配备了一个二维（2D）可移动天线阵列，用于汇聚来自大量用户的无线数据。我们的目标是通过联合优化天线位置矢量（APV）、接入点的接收组合矢量和所有用户的发射系数，最大限度地降低计算均方误差（CMSE）。为了解决这个高度非凸的问题，我们提出了一种双回路迭代算法，其中粒子群优化（PSO）方法被用来在外环中获得次优 APV，而接收组合矢量和发射系数则在内环中交替优化。数值结果表明，所提出的 MA 增强型 AirComp 网络优于采用固定位置天线（FPA）的传统网络。
{"title":"Over-the-Air Computation via 2D Movable Antenna Array","authors":"Nianzu Li, Peiran Wu, Boyu Ning, Lipeng Zhu, Weidong Mei","doi":"arxiv-2409.10351","DOIUrl":"https://doi.org/arxiv-2409.10351","url":null,"abstract":"Movable antenna (MA) has emerged as a promising technology for improving the\u0000performance of wireless communication systems, which enables local movement of\u0000the antennas to create more favorable channel conditions. In this letter, we\u0000advance its application for over-the-air computation (AirComp) network, where\u0000an access point is equipped with a two-dimensional (2D) MA array to aggregate\u0000wireless data from massive users. We aim to minimize the computation mean\u0000square error (CMSE) by jointly optimizing the antenna position vector (APV),\u0000the receive combining vector at the access point and the transmit coefficients\u0000from all users. To tackle this highly non-convex problem, we propose a two-loop\u0000iterative algorithm, where the particle swarm optimization (PSO) approach is\u0000leveraged to obtain a suboptimal APV in the outer loop while the receive\u0000combining vector and transmit coefficients are alternately optimized in the\u0000inner loop. Numerical results demonstrate that the proposed MA-enhanced AirComp\u0000network outperforms the conventional network with fixed-position antennas\u0000(FPAs).","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":"10857 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251369","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}
Dynamic metasurface antennas (DMAs) are an alternative application of metasurfaces as active reconfigurable antennas with advanced analog signal processing and beamforming capabilities, which have been proposed to replace conventional antenna arrays for next generation transceivers. Motivated by this, we investigate the bit error probability (BEP) optimization in a DMA-based system, propose an iterative optimization algorithm, which adjusts the transmit precoder and the weights of the DMA elements, prove its convergence and derive complexity.
{"title":"On the Bit Error Probability of DMA-Based Systems","authors":"Nemanja Stefan Perović","doi":"arxiv-2409.10112","DOIUrl":"https://doi.org/arxiv-2409.10112","url":null,"abstract":"Dynamic metasurface antennas (DMAs) are an alternative application of\u0000metasurfaces as active reconfigurable antennas with advanced analog signal\u0000processing and beamforming capabilities, which have been proposed to replace\u0000conventional antenna arrays for next generation transceivers. Motivated by\u0000this, we investigate the bit error probability (BEP) optimization in a\u0000DMA-based system, propose an iterative optimization algorithm, which adjusts\u0000the transmit precoder and the weights of the DMA elements, prove its\u0000convergence and derive complexity.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251380","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}
Wenrui Yu, Richard Heusdens, Jun Pang, Qiongxiu Li
In distributed networks, calculating the maximum element is a fundamental task in data analysis, known as the distributed maximum consensus problem. However, the sensitive nature of the data involved makes privacy protection essential. Despite its importance, privacy in distributed maximum consensus has received limited attention in the literature. Traditional privacy-preserving methods typically add noise to updates, degrading the accuracy of the final result. To overcome these limitations, we propose a novel distributed optimization-based approach that preserves privacy without sacrificing accuracy. Our method introduces virtual nodes to form an augmented graph and leverages a carefully designed initialization process to ensure the privacy of honest participants, even when all their neighboring nodes are dishonest. Through a comprehensive information-theoretical analysis, we derive a sufficient condition to protect private data against both passive and eavesdropping adversaries. Extensive experiments validate the effectiveness of our approach, demonstrating that it not only preserves perfect privacy but also maintains accuracy, outperforming existing noise-based methods that typically suffer from accuracy loss.
{"title":"Privacy-Preserving Distributed Maximum Consensus Without Accuracy Loss","authors":"Wenrui Yu, Richard Heusdens, Jun Pang, Qiongxiu Li","doi":"arxiv-2409.10226","DOIUrl":"https://doi.org/arxiv-2409.10226","url":null,"abstract":"In distributed networks, calculating the maximum element is a fundamental\u0000task in data analysis, known as the distributed maximum consensus problem.\u0000However, the sensitive nature of the data involved makes privacy protection\u0000essential. Despite its importance, privacy in distributed maximum consensus has\u0000received limited attention in the literature. Traditional privacy-preserving\u0000methods typically add noise to updates, degrading the accuracy of the final\u0000result. To overcome these limitations, we propose a novel distributed\u0000optimization-based approach that preserves privacy without sacrificing\u0000accuracy. Our method introduces virtual nodes to form an augmented graph and\u0000leverages a carefully designed initialization process to ensure the privacy of\u0000honest participants, even when all their neighboring nodes are dishonest.\u0000Through a comprehensive information-theoretical analysis, we derive a\u0000sufficient condition to protect private data against both passive and\u0000eavesdropping adversaries. Extensive experiments validate the effectiveness of\u0000our approach, demonstrating that it not only preserves perfect privacy but also\u0000maintains accuracy, outperforming existing noise-based methods that typically\u0000suffer from accuracy loss.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251384","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：