arXiv - EE - Signal Processing最新文献_第5页

Graph-Based Signal Sampling with Adaptive Subspace Reconstruction for Spatially-Irregular Sensor Data 基于图的信号采样与自适应子空间重构，用于空间不规则传感器数据

arXiv - EE - Signal Processing Pub Date : 2024-09-14 DOI: arxiv-2409.09526

Darukeesan Pakiyarajah, Eduardo Pavez, Antonio Ortega

{"title":"Graph-Based Signal Sampling with Adaptive Subspace Reconstruction for Spatially-Irregular Sensor Data","authors":"Darukeesan Pakiyarajah, Eduardo Pavez, Antonio Ortega","doi":"arxiv-2409.09526","DOIUrl":"https://doi.org/arxiv-2409.09526","url":null,"abstract":"Choosing an appropriate frequency definition and norm is critical in graph\u0000signal sampling and reconstruction. Most previous works define frequencies\u0000based on the spectral properties of the graph and use the same frequency\u0000definition and $ell_2$-norm for optimization for all sampling sets. Our\u0000previous work demonstrated that using a sampling set-adaptive norm and\u0000frequency definition can address challenges in classical bandlimited\u0000approximation, particularly with model mismatches and irregularly distributed\u0000data. In this work, we propose a method for selecting sampling sets tailored to\u0000the sampling set adaptive GFT-based interpolation. When the graph models the\u0000inverse covariance of the data, we show that this adaptive GFT enables\u0000localizing the bandlimited model mismatch error to high frequencies, and the\u0000spectral folding property allows us to track this error in reconstruction.\u0000Based on this, we propose a sampling set selection algorithm to minimize the\u0000worst-case bandlimited model mismatch error. We consider partitioning the\u0000sensors in a sensor network sampling a continuous spatial process as an\u0000application. Our experiments show that sampling and reconstruction using\u0000sampling set adaptive GFT significantly outperform methods that used fixed GFTs\u0000and bandwidth-based criterion.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251371","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

Cislunar Communication Performance and System Analysis with Uncharted Phenomena 星际通信性能与未知现象系统分析

arXiv - EE - Signal Processing Pub Date : 2024-09-14 DOI: arxiv-2409.09426

Selen Gecgel Cetin, Angeles Vazquez-Castro, Gunes Karabulut Kurt

{"title":"Cislunar Communication Performance and System Analysis with Uncharted Phenomena","authors":"Selen Gecgel Cetin, Angeles Vazquez-Castro, Gunes Karabulut Kurt","doi":"arxiv-2409.09426","DOIUrl":"https://doi.org/arxiv-2409.09426","url":null,"abstract":"The Moon and its surrounding cislunar space have numerous unknowns,\u0000uncertainties, or partially charted phenomena that need to be investigated to\u0000determine the extent to which they affect cislunar communication. These include\u0000temperature fluctuations, spacecraft distance and velocity dynamics, surface\u0000roughness, and the diversity of propagation mechanisms. To develop robust and\u0000dynamically operative Cislunar space networks (CSNs), we need to analyze the\u0000communication system by incorporating inclusive models that account for the\u0000wide range of possible propagation environments and noise characteristics. In\u0000this paper, we consider that the communication signal can be subjected to both\u0000Gaussian and non-Gaussian noise, but also to different fading conditions.\u0000First, we analyze the communication link by showing the relationship between\u0000the brightness temperatures of the Moon and the equivalent noise temperature at\u0000the receiver of the Lunar Gateway. We propose to analyze the ergodic capacity\u0000and the outage probability, as they are essential metrics for the development\u0000of reliable communication. In particular, we model the noise with the additive\u0000symmetric alpha-stable distribution, which allows a generic analysis for\u0000Gaussian and non-Gaussian signal characteristics. Then, we present the\u0000closed-form bounds for the ergodic capacity and the outage probability.\u0000Finally, the results show the theoretically and operationally achievable\u0000performance bounds for the cislunar communication. To give insight into further\u0000designs, we also provide our results with comprehensive system settings that\u0000include mission objectives as well as orbital and system dynamics.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251421","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

Hyperedge Representations with Hypergraph Wavelets: Applications to Spatial Transcriptomics 使用超图小波的 Hyperedge 表示法：空间转录组学应用

arXiv - EE - Signal Processing Pub Date : 2024-09-14 DOI: arxiv-2409.09469

Xingzhi Sun, Charles Xu, João F. Rocha, Chen Liu, Benjamin Hollander-Bodie, Laney Goldman, Marcello DiStasio, Michael Perlmutter, Smita Krishnaswamy

引用次数: 0

Joint Semantic Knowledge Distillation and Masked Acoustic Modeling for Full-band Speech Restoration with Improved Intelligibility 联合语义知识提炼和掩蔽声学建模，实现具有更高可懂度的全频段语音修复

arXiv - EE - Signal Processing Pub Date : 2024-09-14 DOI: arxiv-2409.09357

Xiaoyu Liu, Xu Li, Joan Serrà, Santiago Pascual

引用次数: 0

Foundations of Vision-Based Localization: A New Approach to Localizability Analysis Using Stochastic Geometry 基于视觉的定位基础：利用随机几何进行可定位性分析的新方法

arXiv - EE - Signal Processing Pub Date : 2024-09-14 DOI: arxiv-2409.09525

Haozhou Hu, Harpreet S. Dhillon, R. Michael Buehrer

{"title":"Foundations of Vision-Based Localization: A New Approach to Localizability Analysis Using Stochastic Geometry","authors":"Haozhou Hu, Harpreet S. Dhillon, R. Michael Buehrer","doi":"arxiv-2409.09525","DOIUrl":"https://doi.org/arxiv-2409.09525","url":null,"abstract":"Despite significant algorithmic advances in vision-based positioning, a\u0000comprehensive probabilistic framework to study its performance has remained\u0000unexplored. The main objective of this paper is to develop such a framework\u0000using ideas from stochastic geometry. Due to limitations in sensor resolution,\u0000the level of detail in prior information, and computational resources, we may\u0000not be able to differentiate between landmarks with similar appearances in the\u0000vision data, such as trees, lampposts, and bus stops. While one cannot\u0000accurately determine the absolute target position using a single\u0000indistinguishable landmark, obtaining an approximate position fix is possible\u0000if the target can see multiple landmarks whose geometric placement on the map\u0000is unique. Modeling the locations of these indistinguishable landmarks as a\u0000Poisson point process (PPP) $Phi$ on $mathbb{R}^2$, we develop a new approach\u0000to analyze the localizability in this setting. From the target location\u0000$mathbb{x}$, the measurements are obtained from landmarks within the\u0000visibility region. These measurements, including ranges and angles to the\u0000landmarks, denoted as $f(mathbb{x})$, can be treated as mappings from the\u0000target location. We are interested in understanding the probability that the\u0000measurements $f(mathbb{x})$ are sufficiently distinct from the measurement\u0000$f(mathbb{x}_0)$ at the given location, which we term localizability.\u0000Expressions of localizability probability are derived for specific\u0000vision-inspired measurements, such as ranges to landmarks and snapshots of\u0000their locations. Our analysis reveals that the localizability probability\u0000approaches one when the landmark intensity tends to infinity, which means that\u0000error-free localization is achievable in this limiting regime.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251419","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

Fast DCT+: A Family of Fast Transforms Based on Rank-One Updates of the Path Graph 快速 DCT+：基于路径图一级更新的快速变换系列

arXiv - EE - Signal Processing Pub Date : 2024-09-13 DOI: arxiv-2409.08970

Samuel Fernández-Menduiña, Eduardo Pavez, Antonio Ortega

{"title":"Fast DCT+: A Family of Fast Transforms Based on Rank-One Updates of the Path Graph","authors":"Samuel Fernández-Menduiña, Eduardo Pavez, Antonio Ortega","doi":"arxiv-2409.08970","DOIUrl":"https://doi.org/arxiv-2409.08970","url":null,"abstract":"This paper develops fast graph Fourier transform (GFT) algorithms with O(n\u0000log n) runtime complexity for rank-one updates of the path graph. We first show\u0000that several commonly-used audio and video coding transforms belong to this\u0000class of GFTs, which we denote by DCT+. Next, starting from an arbitrary\u0000generalized graph Laplacian and using rank-one perturbation theory, we provide\u0000a factorization for the GFT after perturbation. This factorization is our\u0000central result and reveals a progressive structure: we first apply the\u0000unperturbed Laplacian's GFT and then multiply the result by a Cauchy matrix. By\u0000specializing this decomposition to path graphs and exploiting the properties of\u0000Cauchy matrices, we show that Fast DCT+ algorithms exist. We also demonstrate\u0000that progressivity can speed up computations in applications involving multiple\u0000transforms related by rank-one perturbations (e.g., video coding) when combined\u0000with pruning strategies. Our results can be extended to other graphs and rank-k\u0000perturbations. Runtime analyses show that Fast DCT+ provides computational\u0000gains over the naive method for graph sizes larger than 64, with runtime\u0000approximately equal to that of 8 DCTs.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251423","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

An Efficient Low-Complexity RSMA Scheme for Multi-User Decode-and-Forward Relay Systems 多用户解码前向中继系统的高效低复杂度 RSMA 方案

arXiv - EE - Signal Processing Pub Date : 2024-09-13 DOI: arxiv-2409.08880

Ahmet Sacid Sümer, Mehmet Mert Şahin, Hüseyin Arslan

{"title":"An Efficient Low-Complexity RSMA Scheme for Multi-User Decode-and-Forward Relay Systems","authors":"Ahmet Sacid Sümer, Mehmet Mert Şahin, Hüseyin Arslan","doi":"arxiv-2409.08880","DOIUrl":"https://doi.org/arxiv-2409.08880","url":null,"abstract":"Rate-Splitting Multiple Access (RSMA) is a promising strategy for ensuring\u0000robust transmission in multi-antenna wireless systems. In this paper, we\u0000investigate the performance of RSMA in a downlink Decode-and-Forward (DF) relay\u0000scenario under two phases with imperfect Channel State Information (CSI) at the\u0000transmitter and the relay. In particular, in the first phase, the Base Station\u0000(BS) initially transmits to both BS Users (BUs) and the relay. In the second\u0000phase, the relay decodes and forwards the received signals to Relay Users (RUs)\u0000outside the BS coverage area. Furthermore, we investigate a scenario where the\u0000relay broadcasts a common stream intended for the RUs in the second phase. Due\u0000to the broadcast nature of the transmission, this stream is inadvertently\u0000received by both the RUs and the BUs. Concurrently, the BS utilizes Spatial\u0000Division Multiple Access (SDMA) to transmit private streams to the BUs,\u0000resulting in BUs experiencing residual interference from the common stream\u0000transmitted from relay. Incorporating this residual common stream interference\u0000into our model results in a significant enhancement of the overall sum-rate\u0000achieved at the BUs. We derive a tractable lower bound on the ergodic\u0000sum-rates, enables us to develop closed-form solutions for power allocation\u0000that maximize the overall sum-rate in both phases. Extensive simulations\u0000validate that our proposed power allocation algorithm, in conjunction with a\u0000low-complexity precoder, significantly improves the sum-rate performance of DF\u0000relay RSMA networks compared to the SDMA-based benchmark designs under\u0000imperfect CSI at the transmitter and relay.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251424","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

SIMRP: Self-Interference Mitigation Using RIS and Phase Shifter Network SIMRP：利用 RIS 和移相器网络缓解自干扰

arXiv - EE - Signal Processing Pub Date : 2024-09-13 DOI: arxiv-2409.08600

Zhang Wei, Chen Ding, Bin Zhou, Yi Jiang, Zhiyong Bu

引用次数: 0

RF Challenge: The Data-Driven Radio Frequency Signal Separation Challenge 射频挑战：数据驱动的射频信号分离挑战

arXiv - EE - Signal Processing Pub Date : 2024-09-13 DOI: arxiv-2409.08839

Alejandro Lancho, Amir Weiss, Gary C. F. Lee, Tejas Jayashankar, Binoy Kurien, Yury Polyanskiy, Gregory W. Wornell

{"title":"RF Challenge: The Data-Driven Radio Frequency Signal Separation Challenge","authors":"Alejandro Lancho, Amir Weiss, Gary C. F. Lee, Tejas Jayashankar, Binoy Kurien, Yury Polyanskiy, Gregory W. Wornell","doi":"arxiv-2409.08839","DOIUrl":"https://doi.org/arxiv-2409.08839","url":null,"abstract":"This paper addresses the critical problem of interference rejection in\u0000radio-frequency (RF) signals using a novel, data-driven approach that leverages\u0000state-of-the-art AI models. Traditionally, interference rejection algorithms\u0000are manually tailored to specific types of interference. This work introduces a\u0000more scalable data-driven solution and contains the following contributions.\u0000First, we present an insightful signal model that serves as a foundation for\u0000developing and analyzing interference rejection algorithms. Second, we\u0000introduce the RF Challenge, a publicly available dataset featuring diverse RF\u0000signals along with code templates, which facilitates data-driven analysis of RF\u0000signal problems. Third, we propose novel AI-based rejection algorithms,\u0000specifically architectures like UNet and WaveNet, and evaluate their\u0000performance across eight different signal mixture types. These models\u0000demonstrate superior performance exceeding traditional methods like matched\u0000filtering and linear minimum mean square error estimation by up to two orders\u0000of magnitude in bit-error rate. Fourth, we summarize the results from an open\u0000competition hosted at 2024 IEEE International Conference on Acoustics, Speech,\u0000and Signal Processing (ICASSP 2024) based on the RF Challenge, highlighting the\u0000significant potential for continued advancements in this area. Our findings\u0000underscore the promise of deep learning algorithms in mitigating interference,\u0000offering a strong foundation for future research.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251425","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

Why some audio signal short-time Fourier transform coefficients have nonuniform phase distributions 为什么某些音频信号的短时傅里叶变换系数具有不均匀的相位分布

arXiv - EE - Signal Processing Pub Date : 2024-09-13 DOI: arxiv-2409.08981

Stephen D. Voran

引用次数: 0