14 September 2021 in IEEE Journal of Selected Topics in Signal Processing
In this paper, the problem of joint transmit waveform and receive filter design for dual-function radar-communication (DFRC) systems is studied. The considered system model involves a multiple antenna base station (BS) of a cellular system serving multiple single antenna users on the downlink. Furthermore, the BS simultaneously introduces sensing capabilities in the form of point-like target detection from the reflected return signals in a signal-dependent interference environment. A novel framework based on constrained optimization problems is proposed for the joint design of the transmit waveform and the radar receive filter such that different constraints related to the power amplifiers and the radar waveform are satisfied. In contrast to the existing approaches in the DFRC systems’ literature, the proposed approach does not require the knowledge of a predetermined radar beampattern in order to optimize the performance of the radar part through its approximation. Instead, a beampattern is generated by maximizing the radar receive signal-to-interference ratio (SINR) thus, enabling a more flexible design. Moreover, the radar receive filter processing and its optimization is considered for the first time on DFRC systems, enabling the effective exploitation of the available degrees of freedom in the radar receive array. Efficient algorithmic solutions with guaranteed convergence are developed for the defined constrained nonconvex optimization problems. The effectiveness of the proposed solutions is verified via numerical results.
6 December 2019 in IEEE Transactions on Signal Processing
8 July 2021 in IEEE Transactions on Signal Processing
The use of a large-scale antenna array (LSAA) has become an important characteristic of multi-antenna communication systems to achieve beamforming gains such as in designing millimeter-wave (mmWave) systems to combat severe propagation losses. In such applications, each antenna element has to be driven by a radio frequency (RF) chain for the implementation of fully-digital beamformers, significantly increasing the hardware cost, complexity, and power consumption. Therefore, constant-modulus analog beamforming (CMAB) becomes a viable solution. In this paper, we consider the scaled analog beamforming (SAB) or constant-modulus analog beamforming (CMAB) architecture and design the system parameters by solving two variants of beampattern matching problem. In the first case, both the magnitude and phase of the beampattern are matched to the given desired beampattern whereas in the second case, only the magnitude of the beampattern is matched. Both the beampattern matching problems are cast as a variant of the constant-modulus least-squares (CLS) problem. We provide efficient algorithms based on the alternating majorization-minimization (AMM) framework that combines the alternating minimization and the MM frameworks and the conventional-cyclic coordinate descent (C-CCD) algorithms to solve the problem in each case. We also propose algorithms based on a new modified-CCD (M-CCD) based approach. For all the developed algorithms we prove convergence to a Karush-Kuhn-Tucker (KKT) point (or a stationary point). Numerical results demonstrate that the proposed algorithms converge faster than the state-of-the-art solutions. Among all the algorithms, the M-CCD-based algorithms have faster convergence when evaluated in terms of the number of iterations and the AMM-based algorithms offer lower complexity.
3 March 2022 in IEEE Transactions on Signal Processing
In this paper, we introduce a novel iterative algorithm for the problem of phase-retrieval where the measurements consist of only the magnitude of linear function of the unknown signal, and the noise in the measurements follow Poisson distribution. The proposed algorithm is based on the principle of majorization-minimization (MM); however, the application of MM here is very novel and distinct from the way MM has been usually used to solve optimization problems in the literature. More precisely, we reformulate the original minimization problem into a saddle point problem by invoking Fenchel dual representation of the $\log (\cdot)$ term in the Poisson likelihood function. We then propose tighter surrogate functions over both primal and dual variables resulting in a double-loop MM algorithm, which we have named as Primal-Dual Majorization-Minimization (PDMM) algorithm. The iterative steps of the resulting algorithm are simple to implement and involve only computing matrix vector products. We also extend our algorithm to handle various $\ell _{1}$ regularized Poisson phase-retrieval problems (which exploit sparsity). The proposed algorithm is compared with previously proposed algorithms such as wirtinger flow (WF), MM (conventional), and alternating direction methods of multipliers (ADMM) for the Poisson data model. The simulation results under different experimental settings show that PDMM is faster than the competing methods, and its performance in recovering the original signal is at par with the state-of-the-art algorithms.
6 April 2022 in IEEE Signal Processing Letters
In this letter, we propose an algorithm for learning a sparse weighted graph by estimating its adjacency matrix under the assumption that the observed signals vary smoothly over the nodes of the graph. The proposed algorithm is based on the principle of majorization minimization (MM), wherein we first obtain a tight surrogate function for the graph learning objective and then solve the resultant surrogate problem which has a simple closed form solution. The proposed algorithm does not require tuning of any hyperparameter and it has the desirable feature of eliminating the inactive variables in the course of the iterations - which can be used to speed up the algorithm. The numerical simulations conducted using both synthetic and real world (brain-network) data show that the proposed algorithm converges faster, in terms of the average number of iterations, than several existing methods in the literature.
8 July 2024 in IEEE Transactions on Radar Systems
In this paper, the problem of linear precoding and radar receive beamforming design for joint radar-communication (JRC) systems is studied. A multiple antenna base station (BS) that serves multiple single-antenna user terminals on the downlink is assumed. Furthermore, the BS employs a simultaneous radar function in the form of point-like target detection from the reflected return signals in a signal-dependent interference environment. In this work, we jointly design the JRC linear precoder and the radar receive beamformer aiming to optimize the performance of the radar part while maintaining a desired quality of service (QoS) for the communication one subject to a total transmit power constraint. To that end, we formulate a challenging fractional nonconvex optimization problem via which the optimal precoder and radar receive beamformer are derived. Then, we develop algorithmic solutions based on the majorization-minimization (MM) principle and the semidefinite relaxation (SDR) methodology for the formulated optimization problem. The performance of both the proposed solutions is examined and compared to the one of a system that supports only the radar functionality via numerical results.