Astha Saini

Astha Saini

Auto-generated profile, based on publicly available information

Astha Saini

Centre for Applied Research in Electronics, Indian Institute of Technology, Delhi, India

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 January 2025 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
BTBo Tang
Bo Tang
DLDa Li
Da Li
WWWenjun Wu
Wenjun Wu
ASAstha Saini
Astha Saini
PBPrabhu Babu
Prabhu Babu
PSPetre Stoica
Petre Stoica
This paper investigates the transmit beamforming design for multiple-input multiple-output systems to support both multi-target localization and multi-user communications. To enhance the target localization performance, we derive the asymptotic Cramér-Rao bound (CRB) for target angle estimation by assuming that the receive array is linear and uniform. Then we formulate a beamforming design problem based on minimizing an upper bound on the asymptotic CRB (which is shown to be equivalent to maximizing the harmonic mean of the weighted beampattern responses at the target directions). Moreover, we impose a constraint on the SINR of each received communication signal to guarantee reliable communication performance. Two iterative algorithms are derived to tackle the non-convex design problem: one is based on the alternating direction method of multipliers, and the other uses the majorization-minimization technique to solve an equivalent minimax problem. Numerical results show that, through elaborate dual-function beamforming matrix design, the proposed algorithms can simultaneously achieve superior angle estimation performance as well as high-quality multi-user communications.

20 March 2025 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
ASAstha Saini
Astha Saini
PSPetre Stoica
Petre Stoica
PBPrabhu Babu
Prabhu Babu
In this correspondence we develop an algorithm for maximum likelihood (ML) source localization using received signal strength (RSS) measurements. Unlike the conventional methods that resort to first-order Taylor series approximations to linearize the RSS data model, we use the actual non-linear data model and propose an algorithm for solving the associated ML estimation problem. More specifically, we reformulate the original ML minimization as a min-max problem which we solve using a majorization-minimization technique. Each iteration of the resultant algorithm involves solving a simple convex problem and monotonically decreases the (negative) ML criterion. Several numerical simulation results illustrate the accuracy of the proposed method when compared against state-of-the-art methods.

1 September 2023 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
ASAstha Saini
Astha Saini
AAAakash Arora
Aakash Arora
PBPrabhu Babu
Prabhu Babu
In this paper, we present a novel iterative primal-dual algorithm based on the Majorization Minimization (MM) principle to solve the problem of robust phase-retrieval. The algorithm minimizes the Reverse Kullback-Leibler Divergence (RKLD) loss function, which is known to be not dependent on the statistical distribution of the noise in the measurements and also robust to presence of additive outliers. As the RKLD objective function is nonconvex, we reformulate the RKLD minimization problem to a minimax optimization problem by using the Fenchel dual representation of some term in the objective function. We then solve this minimax problem using the MM technique over the primal and dual variables, resulting in an iterative algorithm, referred to as RKLD-MM. The primal problem admits a closed-form solution, and we obtain the solution to the dual problem by solving the associated KKT condition, which requires the use of the Lambert function. We also extend the proposed algorithm to solve the problem with the ℓ 1 -regularization that promotes sparsity, which we refer to as RKLD-MMR. The proposed algorithm does not require tuning of any hyperparameter and it is guaranteed to converge to a stationary point of the problem. We present various numerical simulations under different noise distributions on synthetic and experimental datasets. The RKLD-MM algorithm consistently performs better than the other state of the art algorithms in terms of Normalized Root-Mean-Square Error (NRMSE) in recovering the unknown signal and also effectively handles the outliers in the measurements.