文件名称:A-Search-free-DOA-Estimation-Algorithm-for-Coprim
- 所属分类：
- 文件格式
- 资源属性：
- [PDF]
- 上传时间：
- 2015-08-02
- 文件大小：
- 353kb
- 下载次数：
- 0次
- 提 供 者：
- rouak*****
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
In this paper, a fast search-free method for direction-of-arrival (DOA) estimation
with coprime arrays was proposed. It is based on the use of methods that operate
on the uniform linear subarrays of the coprime array and that enjoy many
processing advantages. We rst estimate the DOAs for each uniform linear
subarray separately and then combine the estimates the subarrays. For
combining the estimates, we propose a method that projects the estimated
point in the two-dimensional plane onto one-dimensional line segments that
correspond to the entire angular domain. By doing so, we avoid the search
step and consequently, we greatly reduce the computational complexity of
the method. We demonstrate the performance of the method with computer
simulations and compare it with that of the FD-root MUSIC method.- In this paper, a fast search-free method for direction-of-arrival (DOA) estimation
with coprime arrays was proposed. It is based on the use of methods that operate
on the uniform linear subarrays of the coprime array and that enjoy many
processing advantages. We rst estimate the DOAs for each uniform linear
subarray separately and then combine the estimates the subarrays. For
combining the estimates, we propose a method that projects the estimated
point in the two-dimensional plane onto one-dimensional line segments that
correspond to the entire angular domain. By doing so, we avoid the search
step and consequently, we greatly reduce the computational complexity of
the method. We demonstrate the performance of the method with computer
simulations and compare it with that of the FD-root MUSIC method.
with coprime arrays was proposed. It is based on the use of methods that operate
on the uniform linear subarrays of the coprime array and that enjoy many
processing advantages. We rst estimate the DOAs for each uniform linear
subarray separately and then combine the estimates the subarrays. For
combining the estimates, we propose a method that projects the estimated
point in the two-dimensional plane onto one-dimensional line segments that
correspond to the entire angular domain. By doing so, we avoid the search
step and consequently, we greatly reduce the computational complexity of
the method. We demonstrate the performance of the method with computer
simulations and compare it with that of the FD-root MUSIC method.- In this paper, a fast search-free method for direction-of-arrival (DOA) estimation
with coprime arrays was proposed. It is based on the use of methods that operate
on the uniform linear subarrays of the coprime array and that enjoy many
processing advantages. We rst estimate the DOAs for each uniform linear
subarray separately and then combine the estimates the subarrays. For
combining the estimates, we propose a method that projects the estimated
point in the two-dimensional plane onto one-dimensional line segments that
correspond to the entire angular domain. By doing so, we avoid the search
step and consequently, we greatly reduce the computational complexity of
the method. We demonstrate the performance of the method with computer
simulations and compare it with that of the FD-root MUSIC method.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
A Search free DOA Estimation Algorithm for Coprime.pdf