Affordable Access

Access to the full text

Low-Complexity MUSIC-Like Algorithm with Sparse Array

Authors
  • Liu, Sheng1
  • Yang, Lisheng1
  • Chen, Zhixiang1
  • Jiang, Qingping1
  • 1 Chongqing University, The State Key Laboratory of Aerocraft Tracking Telemetering Command and Communication, Chongqing, 400044, China , Chongqing (China)
Type
Published Article
Journal
Wireless Personal Communications
Publisher
Springer-Verlag
Publication Date
Aug 02, 2015
Volume
86
Issue
3
Pages
1265–1279
Identifiers
DOI: 10.1007/s11277-015-2987-9
Source
Springer Nature
Keywords
License
Yellow

Abstract

This paper presents a low-complexity MUSIC-like algorithm with sparse linear array. Three uniform linear arrays are combined into a sparse linear array. An extended signal subspace is got by organizing the forth-order-cumulant of array received data. During this process, no eigen-value decomposition (EVD) or singular-value decomposition needs to be implemented. Then, a MUSIC-like method is proposed to estimate the direction-of-arrival of incident signals. In order to bring down the computational complexity further, an ESPRIT-like algorithm is used to obtain the initial estimations of direction angles, by which the search range can be diminished significantly. Compared with the classical MUSIC and PM, the proposed MUSIC-like algorithm shows better angular resolution and higher estimation accuracy. Moreover, because of the avoidance of EVD and the reduction of search range, the computational burden of the proposed MUSIC-like algorithm with per-estimation by ESPRIT-like algorithm is small. The performance of the proposed method is demonstrated through numerical simulations.

Report this publication

Statistics

Seen <100 times