Muralidhar Rangaswamy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Muralidhar Rangaswamy has a total of 77 co-authors. Here are the top co-authors by number of shared publications:
- Bosung Kang
University of Dayton Research Institute, Dayton, OH, USA
10 shared publications - Fulvio Gini
University of Pisa
10 shared publications - Sandeep Gogineni
Information Systems Laboratories Inc., Dayton, OH, USA
10 shared publications - Maria Sabrina Greco
University of Pisa
9 shared publications - Vikram Krishnamurthy
School of Electrical and Computer Engineering, Cornell University, Ithaca, NY, USA
9 shared publications - Phillip M. Corbell
Air Force Research Laboratory, 80 Scott Drive, Hanscom AFB, MA 01731-2909
7 shared publications
Latest Publications
- 24 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 1856-1871
Approximate MLE of High-Dimensional STAP Covariance Matrices With Banded and Spiked Structure—A Convex Relaxation Approach
Estimating the clutter-plus-noise covariance matrix in high-dimensional (stap) is challenging in the presence of Internal Clutter Motion (ICM) and a high noise floor. The problem becomes more difficult in low-sample regimes, where the Sample Covariance Matrix (SCM) becomes ill-conditioned. To capture the ICM and high noise floor, we model the covariance matrix using a “Banded+Spiked” structure. Since the Maximum Likelihood Estimation (MLE) for this model is non-convex, we propose a convex relaxation which is formulated as a Frobenius norm minimization with non-smooth convex constraints enforcing banded sparsity. This relaxation serves as a provable upper bound for the non-convex likelihood maximization and extends to cases where the covariance matrix dimension exceeds the number of samples. We derive a variational inequality-based bound to assess its quality. We introduce an algorithm to jointly estimate the banded clutter covariance and noise power. Additionally, we establish conditions ensuring the estimated covariance matrix remains positive definite and the bandsize is accurately recovered. Numerical results using the high-fidelity RFView radar simulation environment demonstrate that our algorithm achieves a higher Signal–to–Clutter–plus–Noise Ratio (SCNR) than state–of–the–art methods, including TABASCO, Spiked Covariance Stein Shrinkage, and Diagonal Loading, particularly when the covariance matrix dimension exceeds the number of samples.
- 24 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 1856-1871
Approximate MLE of High-Dimensional STAP Covariance Matrices With Banded and Spiked Structure—A Convex Relaxation Approach
Estimating the clutter-plus-noise covariance matrix in high-dimensional (stap) is challenging in the presence of Internal Clutter Motion (ICM) and a high noise floor. The problem becomes more difficult in low-sample regimes, where the Sample Covariance Matrix (SCM) becomes ill-conditioned. To capture the ICM and high noise floor, we model the covariance matrix using a “Banded+Spiked” structure. Since the Maximum Likelihood Estimation (MLE) for this model is non-convex, we propose a convex relaxation which is formulated as a Frobenius norm minimization with non-smooth convex constraints enforcing banded sparsity. This relaxation serves as a provable upper bound for the non-convex likelihood maximization and extends to cases where the covariance matrix dimension exceeds the number of samples. We derive a variational inequality-based bound to assess its quality. We introduce an algorithm to jointly estimate the banded clutter covariance and noise power. Additionally, we establish conditions ensuring the estimated covariance matrix remains positive definite and the bandsize is accurately recovered. Numerical results using the high-fidelity RFView radar simulation environment demonstrate that our algorithm achieves a higher Signal–to–Clutter–plus–Noise Ratio (SCNR) than state–of–the–art methods, including TABASCO, Spiked Covariance Stein Shrinkage, and Diagonal Loading, particularly when the covariance matrix dimension exceeds the number of samples.
- 3 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (3) , 7165-7178
Model-Based Learning for MIMO Radar Waveform Design in the Presence of Multiple Targets
This study addresses detecting multiple targets in the presence of signal-dependent clutter using a Multiple-Input Multiple-Output (MIMO) radar system. Our primary objective is to design transmit waveforms that maximize the worst-case Signal-to-Interference-Noise-Ratio (SINR) across multiple targets. Practical constraints enforced in our work are the waveform similarity constraint (SC) and the constant modulus constraint (CMC). We confront a complex max-min and fractional non-convex optimization problem. For tractability, we introduce a surrogate cost function based on the sum-of-reciprocals of SINRs. We show that despite the fractional form, an exact gradient can be computed for this cost function, leading to a sum-of-reciprocals exact descent (SRED) numerical optimization approach. We then propose a model-based deep learning technique that evolves the iterative SRED algorithm into a Sum-of-Reciprocals Exact Learning (SREL) approach. SREL enhances waveform optimization by learning key parameters, including descent direction and step sizes, via distinct training frameworks for intra- and inter-target parameters. We first develop intra-target training focusing on a single SINR maximization. Inter-target parameters are then trained to balance between the multiple gradients, each corresponding to a SINR reciprocal, in order to maximize the worst-case SINR. Numerical experiments conducted for benchmark scenarios demonstrate that both SRED and SREL surpass the state-of-the-art counterparts in achieving superior worst-case SINR and generating favorable range-azimuth beampattern profiles. Notably, SREL, by virtue of parameter learning, also brings computational benefits in that the SREL requires a smaller number of steps than SRED iterations.
- 3 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (3) , 7165-7178
Model-Based Learning for MIMO Radar Waveform Design in the Presence of Multiple Targets
This study addresses detecting multiple targets in the presence of signal-dependent clutter using a Multiple-Input Multiple-Output (MIMO) radar system. Our primary objective is to design transmit waveforms that maximize the worst-case Signal-to-Interference-Noise-Ratio (SINR) across multiple targets. Practical constraints enforced in our work are the waveform similarity constraint (SC) and the constant modulus constraint (CMC). We confront a complex max-min and fractional non-convex optimization problem. For tractability, we introduce a surrogate cost function based on the sum-of-reciprocals of SINRs. We show that despite the fractional form, an exact gradient can be computed for this cost function, leading to a sum-of-reciprocals exact descent (SRED) numerical optimization approach. We then propose a model-based deep learning technique that evolves the iterative SRED algorithm into a Sum-of-Reciprocals Exact Learning (SREL) approach. SREL enhances waveform optimization by learning key parameters, including descent direction and step sizes, via distinct training frameworks for intra- and inter-target parameters. We first develop intra-target training focusing on a single SINR maximization. Inter-target parameters are then trained to balance between the multiple gradients, each corresponding to a SINR reciprocal, in order to maximize the worst-case SINR. Numerical experiments conducted for benchmark scenarios demonstrate that both SRED and SREL surpass the state-of-the-art counterparts in achieving superior worst-case SINR and generating favorable range-azimuth beampattern profiles. Notably, SREL, by virtue of parameter learning, also brings computational benefits in that the SREL requires a smaller number of steps than SRED iterations.
- 27 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Aerospace and Electronic Systems Magazine
- Vol. 40 (6) , 122-126
Emerging Trends in Radar: Natural Language Processing
Advancements in deep learning have significantly enhanced natural language processing (NLP) technologies, leading to the development of large language models (LLMs) that have garnered widespread public interest. While these models offer generalized solutions across various domains, their application to domain-specific problems, such as radar systems, has not been extensively explored. In this article, we illustrate how recent advancements in NLP are applied to develop solutions for several radar-related challenges. We discuss the current state-of-the-art approaches, address the challenges in developing NLP models for radar applications, and identify avenues for future research.
- 27 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Aerospace and Electronic Systems Magazine
- Vol. 40 (6) , 122-126
Emerging Trends in Radar: Natural Language Processing
Advancements in deep learning have significantly enhanced natural language processing (NLP) technologies, leading to the development of large language models (LLMs) that have garnered widespread public interest. While these models offer generalized solutions across various domains, their application to domain-specific problems, such as radar systems, has not been extensively explored. In this article, we illustrate how recent advancements in NLP are applied to develop solutions for several radar-related challenges. We discuss the current state-of-the-art approaches, address the challenges in developing NLP models for radar applications, and identify avenues for future research.
- 22 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (1) , 233-249
Fisher Information Approach for Masking the Sensing Plan: Applications in Multifunction Radars
How to design a Markov Decision Process (MDP) based radar controller that makes small sacrifices in performance to mask its sensing plan from an adversary? The radar controller purposefully minimizes the Fisher information of its emissions so that an adversary cannot identify the controller's model parameters accurately. Unlike classical open loop statistical inference, where the Fisher information serves as a lower bound for the achievable covariance, this paper employs the Fisher information as a design constraint for a closed loop radar controller to mask its sensing plan. We analytically derive a closed-form expression for the determinant of the Fisher Information Matrix (FIM) pertaining to the parameters of the MDP-based controller. Subsequently, we formulate an MDP which is regularized by the determinant of the adversary's FIM. This results in the perturbations to total cost of operation, stateaction costs, and the transition matrix. Additionally, we propose a Maximum Entropy-based convex lower bound for the FIMconstrained MDP, whose solution can serve as an initialization point for the proposed nonlinear optimization problem. This convex lower bound aligns with existing work that employs the same Maximum Entropy criteria to mask the sensing plan. Numerical results show that the introduction of minor perturbations to the MDP's stateaction costs, transition kernel and the total operation cost can reduce the Fisher Information of the emissions. Consequently, this reduction amplifies the variability in policy and transition kernel estimation errors, thwarting the adversary's accuracy in estimating the controller's sensing plan. We demonstrate this by comparing the error in the estimate of the transition kernel under different criteria: the FIM criteria, the Maximum Entropy criteria, a sensing plan where actions are chosen uniformly, and the unmasked sensing plan.
- 22 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (1) , 233-249
Fisher Information Approach for Masking the Sensing Plan: Applications in Multifunction Radars
How to design a Markov Decision Process (MDP) based radar controller that makes small sacrifices in performance to mask its sensing plan from an adversary? The radar controller purposefully minimizes the Fisher information of its emissions so that an adversary cannot identify the controller's model parameters accurately. Unlike classical open loop statistical inference, where the Fisher information serves as a lower bound for the achievable covariance, this paper employs the Fisher information as a design constraint for a closed loop radar controller to mask its sensing plan. We analytically derive a closed-form expression for the determinant of the Fisher Information Matrix (FIM) pertaining to the parameters of the MDP-based controller. Subsequently, we formulate an MDP which is regularized by the determinant of the adversary's FIM. This results in the perturbations to total cost of operation, stateaction costs, and the transition matrix. Additionally, we propose a Maximum Entropy-based convex lower bound for the FIMconstrained MDP, whose solution can serve as an initialization point for the proposed nonlinear optimization problem. This convex lower bound aligns with existing work that employs the same Maximum Entropy criteria to mask the sensing plan. Numerical results show that the introduction of minor perturbations to the MDP's stateaction costs, transition kernel and the total operation cost can reduce the Fisher Information of the emissions. Consequently, this reduction amplifies the variability in policy and transition kernel estimation errors, thwarting the adversary's accuracy in estimating the controller's sensing plan. We demonstrate this by comparing the error in the estimate of the transition kernel under different criteria: the FIM criteria, the Maximum Entropy criteria, a sensing plan where actions are chosen uniformly, and the unmasked sensing plan.
- Open Access
- 19 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (1) , 296-313
CoFAR Clutter Estimation Using Covariance-Free Bayesian Learning
A cognitive fully adaptive radar (CoFAR) adapts its behavior on its own within a short period of time in response to changes in the target environment. For the CoFAR to function properly, it is critical to understand its operating environment through estimation of the clutter channel impulse response (CCIR). In general, CCIR is sparse but prior works either ignore it or estimate the CCIR by imposing sparsity as an explicit constraint in their optimization problem. In this paper, contrary to these studies, we develop covariance-free Bayesian learning (CoFBL) techniques for estimating sparse CCIR in a CoFAR system. In particular, we consider a multiple measurement vector scenario and estimate a simultaneously sparse (row sparse) CCIR matrix. Our CoFBL framework reduces the complexity of conventional sparse Bayesian learning through the use of the diagonal element estimation rule and conjugate gradient descent algorithm. We show that the framework is applicable to various forms of CCIR sparsity models: group, joint, and joint-cum-group. We evaluate our method through numerical experiments on a data set generated using RFView®, a high-fidelity modeling and simulation tool. We derive Bayesian Cramér-Rao bounds for the various considered scenarios to benchmark the performance of our algorithms. Our results demonstrate that the proposed CoFBL-based approaches perform better than the existing popular approaches such as multiple focal underdetermined system solver and simultaneous orthogonal matching pursuit.
- 19 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (1) , 296-313
Open AccessCoFAR Clutter Estimation Using Covariance-Free Bayesian Learning
A cognitive fully adaptive radar (CoFAR) adapts its behavior on its own within a short period of time in response to changes in the target environment. For the CoFAR to function properly, it is critical to understand its operating environment through estimation of the clutter channel impulse response (CCIR). In general, CCIR is sparse but prior works either ignore it or estimate the CCIR by imposing sparsity as an explicit constraint in their optimization problem. In this paper, contrary to these studies, we develop covariance-free Bayesian learning (CoFBL) techniques for estimating sparse CCIR in a CoFAR system. In particular, we consider a multiple measurement vector scenario and estimate a simultaneously sparse (row sparse) CCIR matrix. Our CoFBL framework reduces the complexity of conventional sparse Bayesian learning through the use of the diagonal element estimation rule and conjugate gradient descent algorithm. We show that the framework is applicable to various forms of CCIR sparsity models: group, joint, and joint-cum-group. We evaluate our method through numerical experiments on a data set generated using RFView®, a high-fidelity modeling and simulation tool. We derive Bayesian Cramér-Rao bounds for the various considered scenarios to benchmark the performance of our algorithms. Our results demonstrate that the proposed CoFBL-based approaches perform better than the existing popular approaches such as multiple focal underdetermined system solver and simultaneous orthogonal matching pursuit.
- 13 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 60 (6) , 9204-9220
MIMO Radar Beampattern Design via Algorithm Unrolling
Optimizing a transmit Multiple-Input Multiple-Output (MIMO) radar waveform subject to the non-convex constant modulus constraint (CMC) remains a problem of enduring interest. The past decade has seen a variety of tailored iterative approaches with various performance-complexity trade-offs. Despite promising work, iterative algorithms have a speed handicap and require meticulous parameter tuning. Deep learning has recently been proposed for MIMO radar waveform design, where iterative optimization is replaced by a neural network that regresses from the problem specification to the desired waveform. Once trained, a deep network can quickly regress the desired waveform coefficients, but it is a black box and may excel only when generous training is available. We present a fast, learned, and explainable deep (FLED) learning approach by unrolling a state-of-the-art iterative algorithm. We particularly leverage the recently proposed Projection-Descent-Retraction (PDR) algorithm and design a neural network where each PDR iteration is mapped to a step of the network while preserving the CMC. Alongside an interpretable network architecture, we propose learning of key algorithm parameters such as the direction of descent, while introducing learning of FLED initialization and solution refinement through trainable prune-expand blocks. By enforcing appropriate regularizers in the learning of these parameters, FLED breaks the trade-off between computational speed and performance. Compared to the state-of-the-art alternatives, it is near real-time with boosted performance – fidelity to the desired beampattern. Crucially, the benefits of FLED over competing deep learning techniques are enhanced in the regime of limited training, i.e., FLED exhibits superior generalizability.
- 13 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 60 (6) , 9204-9220
MIMO Radar Beampattern Design via Algorithm Unrolling
Optimizing a transmit Multiple-Input Multiple-Output (MIMO) radar waveform subject to the non-convex constant modulus constraint (CMC) remains a problem of enduring interest. The past decade has seen a variety of tailored iterative approaches with various performance-complexity trade-offs. Despite promising work, iterative algorithms have a speed handicap and require meticulous parameter tuning. Deep learning has recently been proposed for MIMO radar waveform design, where iterative optimization is replaced by a neural network that regresses from the problem specification to the desired waveform. Once trained, a deep network can quickly regress the desired waveform coefficients, but it is a black box and may excel only when generous training is available. We present a fast, learned, and explainable deep (FLED) learning approach by unrolling a state-of-the-art iterative algorithm. We particularly leverage the recently proposed Projection-Descent-Retraction (PDR) algorithm and design a neural network where each PDR iteration is mapped to a step of the network while preserving the CMC. Alongside an interpretable network architecture, we propose learning of key algorithm parameters such as the direction of descent, while introducing learning of FLED initialization and solution refinement through trainable prune-expand blocks. By enforcing appropriate regularizers in the learning of these parameters, FLED breaks the trade-off between computational speed and performance. Compared to the state-of-the-art alternatives, it is near real-time with boosted performance – fidelity to the desired beampattern. Crucially, the benefits of FLED over competing deep learning techniques are enhanced in the regime of limited training, i.e., FLED exhibits superior generalizability.
- Open Access
CoFAR Clutter Estimation using Covariance-Free Bayesian Learning
A cognitive fully adaptive radar (CoFAR) adapts its behavior on its own within a short period of time in response to changes in the target environment. For the CoFAR to function properly, it is critical to understand its operating environment through estimation of the clutter channel impulse response (CCIR). In general, CCIR is sparse but prior works either ignore it or estimate the CCIR by imposing sparsity as an explicit constraint in their optimization problem. In this paper, contrary to these studies, we develop covariance-free Bayesian learning (CoFBL) techniques for estimating sparse CCIR in a CoFAR system. In particular, we consider a multiple measurement vector scenario and estimate a simultaneously sparse (row sparse) CCIR matrix. Our CoFBL framework reduces the complexity of conventional sparse Bayesian learning through the use of the diagonal element estimation rule and conjugate gradient descent algorithm. We show that the framework is applicable to various forms of CCIR sparsity models: group, joint, and joint-cum-group. We evaluate our method through numerical experiments on a data set generated using RFView, a high-fidelity modeling and simulation tool. We derive Bayesian Cramér-Rao bounds for the various considered scenarios to benchmark the performance of our algorithms. Our results demonstrate that the proposed CoFBL-based approaches perform better than the existing popular approaches such as multiple focal underdetermined system solver and simultaneous orthogonal matching pursuit.
Open AccessCoFAR Clutter Estimation using Covariance-Free Bayesian Learning
A cognitive fully adaptive radar (CoFAR) adapts its behavior on its own within a short period of time in response to changes in the target environment. For the CoFAR to function properly, it is critical to understand its operating environment through estimation of the clutter channel impulse response (CCIR). In general, CCIR is sparse but prior works either ignore it or estimate the CCIR by imposing sparsity as an explicit constraint in their optimization problem. In this paper, contrary to these studies, we develop covariance-free Bayesian learning (CoFBL) techniques for estimating sparse CCIR in a CoFAR system. In particular, we consider a multiple measurement vector scenario and estimate a simultaneously sparse (row sparse) CCIR matrix. Our CoFBL framework reduces the complexity of conventional sparse Bayesian learning through the use of the diagonal element estimation rule and conjugate gradient descent algorithm. We show that the framework is applicable to various forms of CCIR sparsity models: group, joint, and joint-cum-group. We evaluate our method through numerical experiments on a data set generated using RFView, a high-fidelity modeling and simulation tool. We derive Bayesian Cramér-Rao bounds for the various considered scenarios to benchmark the performance of our algorithms. Our results demonstrate that the proposed CoFBL-based approaches perform better than the existing popular approaches such as multiple focal underdetermined system solver and simultaneous orthogonal matching pursuit.
- Open Access
Data-Driven Target Localization: Benchmarking Gradient Descent Using the Cramer-Rao Bound
In modern radar systems, precise target localization using azimuth and velocity estimation is paramount. Traditional unbiased estimation methods have utilized gradient descent algorithms to reach the theoretical limits of the Cramer Rao Bound (CRB) for the error of the parameter estimates. As an extension, we demonstrate on a realistic simulated example scenario that our earlier presented data-driven neural network model outperforms these traditional methods, yielding improved accuracies in target azimuth and velocity estimation. We emphasize, however, that this improvement does not imply that the neural network outperforms the CRB itself. Rather, the enhanced performance is attributed to the biased nature of the neural network approach. Our findings underscore the potential of employing deep learning methods in radar systems to achieve more accurate localization in cluttered and dynamic environments.
Open AccessData-Driven Target Localization: Benchmarking Gradient Descent Using the Cramer-Rao Bound
In modern radar systems, precise target localization using azimuth and velocity estimation is paramount. Traditional unbiased estimation methods have utilized gradient descent algorithms to reach the theoretical limits of the Cramer Rao Bound (CRB) for the error of the parameter estimates. As an extension, we demonstrate on a realistic simulated example scenario that our earlier presented data-driven neural network model outperforms these traditional methods, yielding improved accuracies in target azimuth and velocity estimation. We emphasize, however, that this improvement does not imply that the neural network outperforms the CRB itself. Rather, the enhanced performance is attributed to the biased nature of the neural network approach. Our findings underscore the potential of employing deep learning methods in radar systems to achieve more accurate localization in cluttered and dynamic environments.