The search functionality is under construction.

The search functionality is under construction.

Sparse arrays can usually achieve larger array apertures than uniform linear arrays (ULA) with the same number of physical antennas. However, the conventional direction-of-arrival (DOA) estimation algorithms for sparse arrays usually require the spatial smoothing operation to recover the matrix rank which inevitably involves heavy computational complexity and leads to a reduction in the degrees-of-freedom (DOFs). In this paper, a low-complex DOA estimation algorithm by exploiting the discrete Fourier transform (DFT) is proposed. Firstly, the spatial spectrum of the virtual array constructed from the sparse array is established by exploiting the DFT operation. The initial DOA estimation can obtain directly by searching the peaks in the DFT spectrum. However, since the number of array antennas is finite, there exists spectrum power leakage which will cause the performance degradation. To further improve the angle resolution, an iterative process is developed to suppress the spectrum power leakage. Thus, the proposed algorithm does not require the spatial smoothing operation and the computational complexity is reduced effectively. In addition, due to the extention of DOF with the application of the sparse arrays, the proposed algorithm can resolve the underdetermined DOA estimation problems. The superiority of the proposed algorithm is demonstrated by simulation results.

- Publication
- IEICE TRANSACTIONS on Communications Vol.E102-B No.11 pp.2159-2166

- Publication Date
- 2019/11/01

- Publicized
- 2019/05/16

- Online ISSN
- 1745-1345

- DOI
- 10.1587/transcom.2018EBP3265

- Type of Manuscript
- PAPER

- Category
- Antennas and Propagation

Zhenyu WEI

Harbin Engineering University

Wei WANG

Harbin Engineering University

Ben WANG

Harbin Engineering University

Ping LIU

Harbin Engineering University,University of Central Florida

Linshu GONG

Harbin Engineering University

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Zhenyu WEI, Wei WANG, Ben WANG, Ping LIU, Linshu GONG, "Effective Direction-of-Arrival Estimation Algorithm by Exploiting Fourier Transform for Sparse Array" in IEICE TRANSACTIONS on Communications,
vol. E102-B, no. 11, pp. 2159-2166, November 2019, doi: 10.1587/transcom.2018EBP3265.

Abstract: Sparse arrays can usually achieve larger array apertures than uniform linear arrays (ULA) with the same number of physical antennas. However, the conventional direction-of-arrival (DOA) estimation algorithms for sparse arrays usually require the spatial smoothing operation to recover the matrix rank which inevitably involves heavy computational complexity and leads to a reduction in the degrees-of-freedom (DOFs). In this paper, a low-complex DOA estimation algorithm by exploiting the discrete Fourier transform (DFT) is proposed. Firstly, the spatial spectrum of the virtual array constructed from the sparse array is established by exploiting the DFT operation. The initial DOA estimation can obtain directly by searching the peaks in the DFT spectrum. However, since the number of array antennas is finite, there exists spectrum power leakage which will cause the performance degradation. To further improve the angle resolution, an iterative process is developed to suppress the spectrum power leakage. Thus, the proposed algorithm does not require the spatial smoothing operation and the computational complexity is reduced effectively. In addition, due to the extention of DOF with the application of the sparse arrays, the proposed algorithm can resolve the underdetermined DOA estimation problems. The superiority of the proposed algorithm is demonstrated by simulation results.

URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2018EBP3265/_p

Copy

@ARTICLE{e102-b_11_2159,

author={Zhenyu WEI, Wei WANG, Ben WANG, Ping LIU, Linshu GONG, },

journal={IEICE TRANSACTIONS on Communications},

title={Effective Direction-of-Arrival Estimation Algorithm by Exploiting Fourier Transform for Sparse Array},

year={2019},

volume={E102-B},

number={11},

pages={2159-2166},

abstract={Sparse arrays can usually achieve larger array apertures than uniform linear arrays (ULA) with the same number of physical antennas. However, the conventional direction-of-arrival (DOA) estimation algorithms for sparse arrays usually require the spatial smoothing operation to recover the matrix rank which inevitably involves heavy computational complexity and leads to a reduction in the degrees-of-freedom (DOFs). In this paper, a low-complex DOA estimation algorithm by exploiting the discrete Fourier transform (DFT) is proposed. Firstly, the spatial spectrum of the virtual array constructed from the sparse array is established by exploiting the DFT operation. The initial DOA estimation can obtain directly by searching the peaks in the DFT spectrum. However, since the number of array antennas is finite, there exists spectrum power leakage which will cause the performance degradation. To further improve the angle resolution, an iterative process is developed to suppress the spectrum power leakage. Thus, the proposed algorithm does not require the spatial smoothing operation and the computational complexity is reduced effectively. In addition, due to the extention of DOF with the application of the sparse arrays, the proposed algorithm can resolve the underdetermined DOA estimation problems. The superiority of the proposed algorithm is demonstrated by simulation results.},

keywords={},

doi={10.1587/transcom.2018EBP3265},

ISSN={1745-1345},

month={November},}

Copy

TY - JOUR

TI - Effective Direction-of-Arrival Estimation Algorithm by Exploiting Fourier Transform for Sparse Array

T2 - IEICE TRANSACTIONS on Communications

SP - 2159

EP - 2166

AU - Zhenyu WEI

AU - Wei WANG

AU - Ben WANG

AU - Ping LIU

AU - Linshu GONG

PY - 2019

DO - 10.1587/transcom.2018EBP3265

JO - IEICE TRANSACTIONS on Communications

SN - 1745-1345

VL - E102-B

IS - 11

JA - IEICE TRANSACTIONS on Communications

Y1 - November 2019

AB - Sparse arrays can usually achieve larger array apertures than uniform linear arrays (ULA) with the same number of physical antennas. However, the conventional direction-of-arrival (DOA) estimation algorithms for sparse arrays usually require the spatial smoothing operation to recover the matrix rank which inevitably involves heavy computational complexity and leads to a reduction in the degrees-of-freedom (DOFs). In this paper, a low-complex DOA estimation algorithm by exploiting the discrete Fourier transform (DFT) is proposed. Firstly, the spatial spectrum of the virtual array constructed from the sparse array is established by exploiting the DFT operation. The initial DOA estimation can obtain directly by searching the peaks in the DFT spectrum. However, since the number of array antennas is finite, there exists spectrum power leakage which will cause the performance degradation. To further improve the angle resolution, an iterative process is developed to suppress the spectrum power leakage. Thus, the proposed algorithm does not require the spatial smoothing operation and the computational complexity is reduced effectively. In addition, due to the extention of DOF with the application of the sparse arrays, the proposed algorithm can resolve the underdetermined DOA estimation problems. The superiority of the proposed algorithm is demonstrated by simulation results.

ER -