4.6 Article

IDBD-Based Beamforming Algorithm for Improving the Performance of Phased Array Radar in Nonstationary Environments

Journal

SENSORS
Volume 23, Issue 6, Pages -

Publisher

MDPI
DOI: 10.3390/s23063211

Keywords

phased array radar; beamforming; IDBD algorithm; nonstationary environment

Ask authors/readers for more resources

This paper introduces an adaptive array processing technology for phased array radar, which uses the incremental delta-bar-delta algorithm to control the time-varying learning rates. The results show that this algorithm improves performance in nonstationary environments.
Adaptive array processing technology for a phased array radar is usually based on the assumption of a stationary environment; however, in real-world scenarios, nonstationary interference and noise deteriorate the performance of the traditional gradient descent algorithm, in which the learning rate of the tap weights is fixed, leading to errors in the beam pattern and a reduced output signal-to-noise ratio (SNR). In this paper, we use the incremental delta-bar-delta (IDBD) algorithm, which has been widely used for system identification problems in nonstationary environments, to control the time-varying learning rates of the tap weights. The designed iteration formula for the learning rate ensures that the tap weights adaptively track the Wiener solution. The results of numerical simulations show that in a nonstationary environment, the traditional gradient descent algorithm with a fixed learning rate has a distorted beam pattern and reduced output SNR; however, the IDBD-based beamforming algorithm, in which a secondary control mechanism is used to adaptively update the learning rates, showed a similar beam pattern and output SNR to a traditional beamformer in a Gaussian white noise background; that is, the main beam and null satisfied the pointing constraints, and the optimal output SNR was obtained. Although the proposed algorithm contains a matrix inversion operation, which has considerable computational complexity, this operation could be replaced by the Levinson-Durbin iteration due to the Toeplitz characteristic of the matrix; therefore, the computational complexity could be decreased to O(n), so additional computing resources are not required. Moreover, according to some intuitive interpretations, the reliability and stability of the algorithm are guaranteed.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available