Most existing radar algorithms are developed under the assumption that the environment, data clutter, is known and stationary. However, in practice, the characteristics of clutter can vary enormously in time depending on the operational scenarios. If unaccounted for, these nonstationary variabilities may drastically hinder the radar performance. It is essential that the radar systems dynamically detect changes in the environment, and adapt to these changes by learning the new statistical characteristics of the environment. In this paper, we employ sparse recovery for clutter identification, specifically we identify the statistical profile the clutter follows. We use Monte Carlo simulations to simulate and test clutter data coming from various distributions.
|