{"title":"Dynamic Transmit-Receive Beampattern Optimization of Colocated MIMO Radars for Multi-Target Tracking Under Suppression Jamming","authors":"Jun Sun;Wei Yi;Ye Yuan;Pramod K. Varshney","doi":"10.1109/TSP.2025.3572503","DOIUrl":"10.1109/TSP.2025.3572503","url":null,"abstract":"In this paper, we propose a dynamic transmit and receive beampattern optimization (DTRBO) method for colocated MIMO (C-MIMO) radars in cognitive multi-target tracking (MTT) scenarios under suppression jamming. To accurately account for the effects of suppression jamming on MTT performance, we develop a comprehensive signal model that integrates the complete transmit-receive beamforming process into the resource optimization framework. Based on this enhanced signal model, we derive an enumeration-based posterior Cramér-Rao lower bound (PCRLB), which incorporates both measurement errors and target miss detections, providing a more accurate performance metric under suppression jamming. Using the derived PCRLB, the DTRBO strategy is formulated to dynamically optimize transmit and receive beams for each tracking interval, thereby maximizing global MTT performance. Due to the coupling of optimization variables and the non-convexity of the derived PCRLB, the resulting optimization problem is computationally challenging. To address this, we propose a partition-based three-stage iterative method to decouple the variables, employing a first-order Taylor expansion-based convex approximation technique to solve the non-convex problem efficiently. Simulation results demonstrate the effectiveness and the superiority of the proposed DTRBO strategy in terms of both MTT performance and anti-jamming capabilities, outperforming existing approaches that omit the beampattern modeling process in resource-aware optimization.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"2271-2287"},"PeriodicalIF":4.6,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144130582","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Direction Finding in Partly Calibrated Arrays With Hybrid Imperfections","authors":"Yihan Su;Lei Wang;Zhiyong Hu;Yimin Liu","doi":"10.1109/TSP.2025.3571836","DOIUrl":"10.1109/TSP.2025.3571836","url":null,"abstract":"Direction finding in partly calibrated arrays has received significant attention in recent years. From the perspective of the calibration imperfections, existing literature predominantly focuses on inter-subarray displacement, while there has been relatively limited discussion regarding subarray inclination. This article introduces a comprehensive signal model that accounts for hybrid imperfections, including inter-subarray displacement, gain/phase uncertainty, and particularly subarray inclination. Building on this, we propose a gridless two-stage method based on block-structured steering matrix recovery for direction finding, termed BSSMR. Initially, we leverage the covariance matrix of the measurements to recover the steering matrix, followed by the estimation of direction-of-arrivals (DOA) based on the block-structured array manifold. We provide a sufficient condition for BSSMR and conduct an analysis of its asymptotic convergence behavior. Numerical simulations demonstrate the robust performance of our proposed method in scenarios of hybrid imperfections, which reaches the Cramér-Rao lower bound (CRLB).","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1979-1992"},"PeriodicalIF":4.6,"publicationDate":"2025-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144113853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Generalization of Geometric Graph Neural Networks With Lipschitz Loss Functions","authors":"Zhiyang Wang;Juan Cerviño;Alejandro Ribeiro","doi":"10.1109/TSP.2025.3553378","DOIUrl":"10.1109/TSP.2025.3553378","url":null,"abstract":"In this paper, we study the generalization capabilities of geometric graph neural networks (GNNs). We consider GNNs over a geometric graph constructed from a finite set of randomly sampled points over an embedded manifold with topological information captured. We prove a generalization gap between the optimal empirical risk and the optimal statistical risk of this GNN, which decreases with the number of sampled points from the manifold and increases with the dimension of the underlying manifold. This generalization gap ensures that the GNN trained on a graph on a set of sampled points can be utilized to process other unseen graphs constructed from the same underlying manifold. The most important observation is that the generalization capability can be realized with one large graph instead of being limited to the size of the graph as in previous results. The generalization gap is derived based on the non-asymptotic convergence result of a GNN on the sampled graph to the underlying manifold neural networks (MNNs). We verify this theoretical result with experiments on multiple real-world datasets.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1549-1561"},"PeriodicalIF":4.6,"publicationDate":"2025-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143672542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Robust Online Reconstruction of Continuous-Time Signals From a Lean Spike Train Ensemble Code","authors":"Anik Chattopadhyay;Arunava Banerjee","doi":"10.1109/TSP.2025.3569798","DOIUrl":"10.1109/TSP.2025.3569798","url":null,"abstract":"Sensory stimuli in animals are encoded into spike trains by neurons, offering advantages such as sparsity, energy efficiency, and high temporal resolution. This paper presents a signal processing framework that deterministically encodes continuous-time signals into biologically feasible spike trains, and addresses the questions about representable signal classes and reconstruction bounds. The framework considers encoding of a signal through spike trains generated by an ensemble of neurons using a convolve-then-threshold mechanism with various convolution kernels. A closed-form solution to the inverse problem, from spike trains to signal reconstruction, is derived in the Hilbert space of shifted kernel functions, ensuring sparse representation of a generalized Finite Rate of Innovation (FRI) class of signals. Additionally, inspired by real-time processing in biological systems, an efficient iterative version of the optimal reconstruction is formulated that considers only a finite window of past spikes, ensuring robustness of the technique to ill-conditioned encoding; convergence guarantees of the windowed reconstruction to the optimal solution are then provided. Experiments on a large audio dataset demonstrate excellent reconstruction accuracy at spike rates as low as one-third of the Nyquist rate, while showing clear competitive advantage in comparison to state-of-the-art sparse coding techniques in the low spike rate regime.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"2008-2021"},"PeriodicalIF":4.6,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144104783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Globally Optimal Max-Min Rate Joint Channel and Power Allocation for Hybrid NOMA-OMA Downlink Systems","authors":"Tanin Sultana;Sorina Dumitrescu","doi":"10.1109/TSP.2025.3553084","DOIUrl":"10.1109/TSP.2025.3553084","url":null,"abstract":"This work proposes a globally optimal solution algorithm to the joint power allocation (PA) and channel allocation (CA) problem for downlink hybrid NOMA-OMA systems with the objective of maximizing the minimum user rate. In the hybrid NOMA-OMA scenario, the users are divided into clusters, each cluster shares one channel using NOMA (Non-Orthogonal Multiple Access), while different clusters are assigned channels orthogonally. The optimization problem is converted to the problem of maximizing the user rate under the constraint that all rates be equal. It is further decomposed into PA and CA subproblems, which are solved iteratively. The PA subproblem is handled by first deriving an analytical expression of the total power as a function of the common user rate, and then solving it via bisection search. The CA subproblem keeps the equal-rate assignment fixed and aims to find the CA that minimizes the total power. We prove that the CA subproblem is equivalent to a minimum bipartite graph matching problem, for which efficient algorithms exist. Finally, we demonstrate that the proposed iterative algorithm converges to the globally optimal solution after a finite number of iterations. In addition, we prove that the number of iterations is at most three when the power budget is sufficiently large. Extensive experiments demonstrate the effectiveness of the proposed scheme.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1674-1690"},"PeriodicalIF":4.6,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143661538","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Direct Multipath-Based SLAM","authors":"Mingchao Liang;Erik Leitinger;Florian Meyer","doi":"10.1109/TSP.2025.3552747","DOIUrl":"10.1109/TSP.2025.3552747","url":null,"abstract":"Radio-based localization approaches that make use of reflections in the propagation environment to improve the accuracy and robustness of location estimates have a variety of potential applications in future wireless communication networks. Multipath-based simultaneous localization and mapping (SLAM) aims at estimating the position of agents and reflecting features in the environment by exploiting the relationship between the local geometry and multipath components (MPCs) in received radio signals. Existing multipath-based SLAM methods preprocess received radio signals using a channel estimator. The channel estimator lowers the data rate by extracting a set of dispersion parameters for each MPC. These parameters are then used as measurements for SLAM. Bayesian estimation for multipath-based SLAM is facilitated by the lower data rate. However, due to finite resolution capabilities limited by signal bandwidth, channel estimation is prone to errors and MPC parameters may be extracted incorrectly and lead to a reduced SLAM performance. We propose a multipath-based SLAM approach that directly uses received radio signals as inputs. A new statistical model that can effectively be represented by a factor graph is introduced. The factor graph is the starting point for the development of an efficient belief propagation (BP) method for multipath-based SLAM that avoids data preprocessing by a channel estimator. Numerical results based on synthetic and real data in challenging single-input, single-output (SISO) scenarios demonstrate that the proposed method outperforms conventional methods in terms of localization and mapping accuracy.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"2336-2352"},"PeriodicalIF":4.6,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143661537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jiaojiao Zhang;Linglingzhi Zhu;Dominik Fay;Mikael Johansson
{"title":"Locally Differentially Private Online Federated Learning With Correlated Noise","authors":"Jiaojiao Zhang;Linglingzhi Zhu;Dominik Fay;Mikael Johansson","doi":"10.1109/TSP.2025.3553355","DOIUrl":"10.1109/TSP.2025.3553355","url":null,"abstract":"We introduce a locally differentially private (LDP) algorithm for online federated learning that employs temporally correlated noise to improve utility while preserving privacy. To address challenges posed by the correlated noise and local updates with streaming non-IID data, we develop a perturbed iterate analysis that controls the impact of the noise on the utility. Moreover, we demonstrate how the drift errors from local updates can be effectively managed for several classes of nonconvex loss functions. Subject to an (ε, δ)-LDP budget, we establish a dynamic regret bound that quantifies the impact of key parameters and the intensity of changes in the dynamic environment on the learning performance. Numerical experiments confirm the efficacy of the proposed algorithm.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1518-1531"},"PeriodicalIF":4.6,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10934741","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143661536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mengjiao Tang;Augusto Aubry;Antonio De Maio;Yao Rong
{"title":"Invariance Theory for Radar Detection in Disturbance With Kronecker Product Covariance Structure—Part I: Gaussian Environment","authors":"Mengjiao Tang;Augusto Aubry;Antonio De Maio;Yao Rong","doi":"10.1109/TSP.2025.3551204","DOIUrl":"10.1109/TSP.2025.3551204","url":null,"abstract":"This two-part paper addresses maximally invariant detection of range-spread targets embedded in disturbance characterized by an unknown Kronecker product-structured covariance matrix. Part I focuses on Gaussian interference, whereas Part II extends the study to compound-Gaussian, clutter-dominated environments. Leveraging the principle of invariance, this part identifies a suitable transformation group that effectively compresses the nuisance parameter space, ensuring the constant false alarm rate (CFAR) property (with respect to the Kronecker-structured covariance matrix) for all invariant detectors. A maximal invariant and an induced maximal invariant are subsequently derived, serving as powerful tools to guide the design of CFAR detectors. Some existing two-step CFAR detectors for this structured situation are expressed as functions of the derived maximal invariant. Furthermore, two novel detectors (whose CFARity holds true under some mild technical conditions) are devised: the former employs a pseudo-missing strategy by treating elements possibly contaminated by target signals as missing and utilizes an Expectation-Maximization algorithm to perform the covariance matrix estimation; the latter is based on the one-step generalized likelihood ratio test criterion and is implemented via an alternate optimization algorithm. Finally, their CFAR behavior and detection performance are assessed through numerical examples, demonstrating their superiority with respect to some conventional decision rules.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1577-1593"},"PeriodicalIF":4.6,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143640562","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mengjiao Tang;Augusto Aubry;Antonio De Maio;Yao Rong
{"title":"Invariance Theory for Radar Detectionin Disturbance With Kronecker ProductCovariance Structure—Part II: CompoundGaussian Environment","authors":"Mengjiao Tang;Augusto Aubry;Antonio De Maio;Yao Rong","doi":"10.1109/TSP.2025.3551199","DOIUrl":"10.1109/TSP.2025.3551199","url":null,"abstract":"In this part of the paper, we consider the invariant framework and the novel constant false alarm rate (CFAR) detector design of Part I in compound Gaussian clutter. Specifically, the focus is on detecting range-spread targets embedded in compound Gaussian clutter that exhibits a Kronecker covariance structure. A suitable transformation group has been identified, ensuring that invariance implies the fully CFAR property, i.e., with respect to both the Kronecker covariance matrix and the texture. A maximal invariant is derived and used to gain insightful re-expressions of some established two-step adaptive CFAR detectors. At the stage of detector design, the pseudo-missing strategy proposed in Part I is adapted to the compound Gaussian case and then integrated into the test architectures to yield modified adaptive detectors. Furthermore, the one-step generalized likelihood ratio test is derived. Both detection strategies result in fully CFAR detectors under some mild technical conditions, as evidenced by their invariance with respect to the identified transformation group. For performance evaluation, their CFAR behavior and detection probability are assessed and analyzed across different experimental setups and signal models, highlighting the superior performance of the newly proposed detectors compared to some conventional counterparts and to those that do not leverage the prior (Kronecker) structure.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1594-1610"},"PeriodicalIF":4.6,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143640847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Detection and Multiparameter Estimation for NLoS Targets: An RIS-Assisted Framework","authors":"Zhouyuan Yu;Xiaoling Hu;Chenxi Liu;Qin Tao;Mugen Peng","doi":"10.1109/TSP.2025.3546991","DOIUrl":"10.1109/TSP.2025.3546991","url":null,"abstract":"Reconfigurable intelligent surface (RIS) has the potential to enhance sensing performance, due to its capability of reshaping the echo signals. Different from the existing literature, which has commonly focused on RIS beamforming optimization, in this paper, we pay special attention to designing effective signal processing approaches to extract sensing information from RIS-reshaped echo signals. To this end, we investigate an RIS-assisted non-line-of-sight (NLoS) target detection and multi-parameter estimation problem in orthogonal frequency division multiplexing (OFDM) systems. To address this problem, we first propose a novel detection and direction estimation framework, including a low-overhead hierarchical codebook that allows the RIS to generate three-dimensional beams with adjustable beam direction and width, a delay spectrum peak-based beam training scheme for detection and direction estimation, and a beam refinement scheme for further enhancing the accuracy of the direction estimation. Then, we propose a target range and velocity estimation scheme by extracting the delay-Doppler information from the RIS-reshaped echo signals. Numerical results demonstrate that the proposed schemes can achieve a <inline-formula><tex-math>$99.7%$</tex-math></inline-formula> target detection rate, a <inline-formula><tex-math>$10^{-3}$</tex-math></inline-formula>-rad level direction estimation accuracy, and a <inline-formula><tex-math>$10^{-6}$</tex-math></inline-formula>-m/<inline-formula><tex-math>$10^{-5}$</tex-math></inline-formula>-m/s level range/velocity estimation accuracy.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1470-1484"},"PeriodicalIF":4.6,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143640563","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}