A Study on Subspace-Based Algorithms for Practical DOA Estimation

博士 === 國立成功大學 === 電機工程學系碩博士班 === 98 === The problem of the direction-of-arrival (DOA) is to estimate the directions of multiple incident signals from noisy measurements received at a sensor array. For practical DOA estimation applications, the conventional subspace-based method has some inherent pro...

Full description

Bibliographic Details
Main Authors: Ching-JerHung, 洪經哲
Other Authors: Chin-Hsing Chen
Format: Others
Language:en_US
Published: 2010
Online Access:http://ndltd.ncl.edu.tw/handle/31780401531427193534
id ndltd-TW-098NCKU5442042
record_format oai_dc
spelling ndltd-TW-098NCKU54420422015-10-13T18:26:16Z http://ndltd.ncl.edu.tw/handle/31780401531427193534 A Study on Subspace-Based Algorithms for Practical DOA Estimation 應用於實際方位估測之次空間演算法之研究 Ching-JerHung 洪經哲 博士 國立成功大學 電機工程學系碩博士班 98 The problem of the direction-of-arrival (DOA) is to estimate the directions of multiple incident signals from noisy measurements received at a sensor array. For practical DOA estimation applications, the conventional subspace-based method has some inherent problems. Recently, Kim and Wen proposed pseudocovariance matrix techniques to improve the performance of subspace-based algorithms in the practical DOA estimation applications. But they still are against real-time requirement due to high computation complexity. In this dissertation, we proposed two different approaches with application to the uniform linear sensor array (ULA) in a single snapshot case to satisfy the demands of practical applications for conventional subspace algorithms. The first part of our approaches presents a novel fast DOA algorithm, using an orthogonal projection and noise pseudo-eigenvector technique with forward-backward data model. The second part of our approaches presents another novel fast DOA algorithm, using the technologies of the shrinking signal subspace and the noise pseudo-eigenvector with forward data model. Without eigendecomposition computation and employing shrinking signal subspace technique, our proposed approaches can reduce computational complexity(the computational complexity of Kim’s and Wen’s methods is while ours is , where denotes the number of sensors) while maintaining better or similar resolution capability when contrasted to Kim’s and Wen’s fast DOA estimation algorithms. Simulation results showed that for SNR=5 dB, three uncorrelated signals from [2.3,9.7,17.8] and =23, the resolution probability of the first approach and Wen’s method were about 0.8 while Kim’s method is less than 0.6, and for SNR=5 dB, two coherent signals from [5,10.5] and one uncorrelated signal from [16] and =22, the resolution probability of the second approach was close to 0.2 while Kim’s method was close to 0. Chin-Hsing Chen 陳進興 2010 學位論文 ; thesis 104 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 博士 === 國立成功大學 === 電機工程學系碩博士班 === 98 === The problem of the direction-of-arrival (DOA) is to estimate the directions of multiple incident signals from noisy measurements received at a sensor array. For practical DOA estimation applications, the conventional subspace-based method has some inherent problems. Recently, Kim and Wen proposed pseudocovariance matrix techniques to improve the performance of subspace-based algorithms in the practical DOA estimation applications. But they still are against real-time requirement due to high computation complexity. In this dissertation, we proposed two different approaches with application to the uniform linear sensor array (ULA) in a single snapshot case to satisfy the demands of practical applications for conventional subspace algorithms. The first part of our approaches presents a novel fast DOA algorithm, using an orthogonal projection and noise pseudo-eigenvector technique with forward-backward data model. The second part of our approaches presents another novel fast DOA algorithm, using the technologies of the shrinking signal subspace and the noise pseudo-eigenvector with forward data model. Without eigendecomposition computation and employing shrinking signal subspace technique, our proposed approaches can reduce computational complexity(the computational complexity of Kim’s and Wen’s methods is while ours is , where denotes the number of sensors) while maintaining better or similar resolution capability when contrasted to Kim’s and Wen’s fast DOA estimation algorithms. Simulation results showed that for SNR=5 dB, three uncorrelated signals from [2.3,9.7,17.8] and =23, the resolution probability of the first approach and Wen’s method were about 0.8 while Kim’s method is less than 0.6, and for SNR=5 dB, two coherent signals from [5,10.5] and one uncorrelated signal from [16] and =22, the resolution probability of the second approach was close to 0.2 while Kim’s method was close to 0.
author2 Chin-Hsing Chen
author_facet Chin-Hsing Chen
Ching-JerHung
洪經哲
author Ching-JerHung
洪經哲
spellingShingle Ching-JerHung
洪經哲
A Study on Subspace-Based Algorithms for Practical DOA Estimation
author_sort Ching-JerHung
title A Study on Subspace-Based Algorithms for Practical DOA Estimation
title_short A Study on Subspace-Based Algorithms for Practical DOA Estimation
title_full A Study on Subspace-Based Algorithms for Practical DOA Estimation
title_fullStr A Study on Subspace-Based Algorithms for Practical DOA Estimation
title_full_unstemmed A Study on Subspace-Based Algorithms for Practical DOA Estimation
title_sort study on subspace-based algorithms for practical doa estimation
publishDate 2010
url http://ndltd.ncl.edu.tw/handle/31780401531427193534
work_keys_str_mv AT chingjerhung astudyonsubspacebasedalgorithmsforpracticaldoaestimation
AT hóngjīngzhé astudyonsubspacebasedalgorithmsforpracticaldoaestimation
AT chingjerhung yīngyòngyúshíjìfāngwèigūcèzhīcìkōngjiānyǎnsuànfǎzhīyánjiū
AT hóngjīngzhé yīngyòngyúshíjìfāngwèigūcèzhīcìkōngjiānyǎnsuànfǎzhīyánjiū
AT chingjerhung studyonsubspacebasedalgorithmsforpracticaldoaestimation
AT hóngjīngzhé studyonsubspacebasedalgorithmsforpracticaldoaestimation
_version_ 1718033593034342400