Fast algorithms for direction-of-arrival finding using large ESPRIT arrays

DOI10.1016/0165-1684(95)00128-XzbMATH Open0875.94050OpenAlexW2152023143MaRDI QIDQ672116

Hongyuan Zha

Publication date: 27 February 1997

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-1684(95)00128-x

zbMATH Keywords

QR decompositionSingular value decompositionArray signal processingEigenvalue decompositionESPRITFast algorithmsDirection-of-arrivalUpdating

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (2)

Efficient realisation of alternating projection algorithm for maximum likelihood direction finding ⋮ Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A fast algorithm for 2-D direction-of-arrival estimation 👍 👎
• DOA estimation using fast EM and SAGE algorithms 👍 👎
• DOA and frequency estimation using fast subspace algorithms 👍 👎
• Efficient realisation of alternating projection algorithm for maximum likelihood direction finding 👍 👎
• ESPRIT Direction-of-Arrival Estimation in the Presence of Spatially Correlated Noise 👍 👎
• Estimation of Direction of Arrival Using Multipath on Array Platforms 👍 👎
• Direction of Arrival Estimation of Wideband Sources Using Sparse Linear Arrays 👍 👎

This page was built for publication: Fast algorithms for direction-of-arrival finding using large ESPRIT arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672116)