Skip to content
naulon
Not checkedNot checked for notices yet.

Fast PARAFAC Algorithm for Target Localization in Bistatic MIMO Radar in the Co-Existence of Unknown Mutual Coupling and Spatially Colored Noise

Junjie Sui, Fang Ye, Xinhai Wang and 1 more

IEEE Access · 2019

doi:10.1109/access.2019.2961454 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Target positioning using multiple-input multiple-output (MIMO) radar system has aroused extensive attention in the past decade. However, most of the existing positioning algorithms are only suitable for ideal scenarios (e.g., well-calibrated sensors, orthogonal waveforms, Gaussian white noise). In this paper, we focus on the target localization problem in a bistatic MIMO system in the co-existence of mutual coupling and spatially colored noise, i.e., to estimate the direction-of-arrival (DOA) and direction-of-departure (DOD) in such non-ideal scenario. To tackle this issue, a parallel factor (PARAFAC) analysis algorithm is proposed. Firstly, the de-noising operation is carried out to suppress the spatially colored noise. Then a PARAFAC analysis model is constructed to explore the tensor nature of measurement. After computing PARAFAC decomposition on the new tensor, the factor matrices associate with DOD and DOA are obtained. Thereafter, the de-coupling operation is followed to eliminate the mutual coupling. Finally, the idea of least squares is utilized to recovery DOD and DOA from the factor matrices. The proposed algorithm can achieve closed-form solution for DOD and DOA estimation without pairing calculation. Moreover, it provides better estimation performance than the state-of-the-art approaches. Detailed analyses are illustrated and simulation results verify the effectiveness of the proposed algorithm.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.