2012Chinese Journal of Radio ScienceRequires access

Two-dimentional direction finding using a sparse coprime L-sharped array

Can Wang

Open publisher page 0 citations

Abstract

The sparse array with determined elements can increase the array aperture to improve two-dimentional direction-of-arrival(2D-DOA)accuracy,but it brings direction finding ambiguity too.To solve this problem,A sparse coprime L-shaped array and two-dimensional direction finding algorithm based on it are presented.The proposed algorithm utilizes the array extending capability of fourth-order cumulant and the coprime relationship between the interelement spacings in L-shaped array so that 2D-DOA without ambiguity can be realized under sparse array structure.Compared with two-dimentional virtual-ESPRIT algorithm,the proposed algorithm allows the spacings between the reference elements more than one-half wavelength,which leads to improve direction finding accuracy.Meanwhile,the larger system tolerance is guaranteed by a step-by-step reduction of the number of ambiguities.Computer simulation results verify the effectiveness of the proposed algorithm.

About this research paper

What this paper is about

The sparse array with determined elements can increase the array aperture to improve two-dimentional direction-of-arrival(2D-DOA)accuracy,but it brings direction finding ambiguity too.To solve this problem,A sparse coprime L-shaped array and two-dimensional direction finding algorithm based on it are presented.The proposed algorithm utilizes the array extending capability of fourth-order cumulant and the coprime relationship between the interelement spacings in L-shaped array so that 2D-DOA without ambiguity can be realized under sparse array structure.Compared with two-dimentional virtual-ESPRIT algorithm,the proposed algorithm allows the spacings between the reference elements more than one-half wavelength,which leads to improve direction finding accuracy.Meanwhile,the larger system tolerance is guaranteed by a step-by-step reduction of the number of ambiguities.Computer simulation results verify the effectiveness of the proposed algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The sparse array with determined elements can increase the array aperture to improve two-dimentional direction-of-arrival(2D-DOA)accuracy,but it brings direction finding ambiguity too.To solve this problem,A sparse coprime L-shaped array and two-dimensional direction finding algorithm based on it are presented.The proposed algorithm utilizes the array extending capability of fourth-order cumulant and the coprime relationship between the interelement spacings in L-shaped array so that 2D-DOA without ambiguity can be realized under sparse array structure.Compared with two-dimentional virtual-ESPRIT algorithm,the proposed algorithm allows the spacings between the reference elements more than one-half wavelength,which leads to improve direction finding accuracy.Meanwhile,the larger system tolerance is guaranteed by a step-by-step reduction of the number of ambiguities.Computer simulation results verify the effectiveness of the proposed algorithm.

Key concepts: Coprime integers, Sparse array, Algorithm, Direction finding, Aperture (computer memory), Direction of arrival, Reduction (mathematics), Array data structure

Related papers

Back to paper searchBrowse research topicsOriginal source
Two-dimentional direction finding using a sparse coprime L-sharped array — Research Paper | ScholarLens