國立虎尾科技大學 |

Data Driven Algorithms for the Estimation of Low Rank Signals in Structured Subspaces.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Data Driven Algorithms for the Estimation of Low Rank Signals in Structured Subspaces./
作者:	Suryaprakash, Raj Tejas.
面頁冊數:	1 online resource (201 pages)
附註:	Source: Dissertation Abstracts International, Volume: 79-07(E), Section: B.
Contained By:	Dissertation Abstracts International79-07B(E).
標題:	Electrical engineering. -
電子資源:	click for full text (PQDT)
ISBN:	9780355656862

Data Driven Algorithms for the Estimation of Low Rank Signals in Structured Subspaces.
Suryaprakash, Raj Tejas.

Data Driven Algorithms for the Estimation of Low Rank Signals in Structured Subspaces. - 1 online resource (201 pages)

Source: Dissertation Abstracts International, Volume: 79-07(E), Section: B.

Thesis (Ph.D.)--University of Michigan, 2017.

Includes bibliographical references

The estimation of low rank signals in noise is a ubiquitous task in signal processing, communications, machine learning, data science, econometrics, etc. A critical step in the estimation of such low rank signals is to identify the signal subspace from the noise subspace via the singular value decomposition (SVD).

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780355656862Subjects--Topical Terms:

596380
Electrical engineering.
Index Terms--Genre/Form:

554714
Electronic books.

Data Driven Algorithms for the Estimation of Low Rank Signals in Structured Subspaces.
LDR:04229ntm a2200385Ki 4500 001 920737
005 20181203094033.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9780355656862
035 $a (MiAaPQ)AAI10760064
035 $a (MiAaPQ)umichrackham:001027
035 $a AAI10760064
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Suryaprakash, Raj Tejas. $3 1195610
245 1 0 $a Data Driven Algorithms for the Estimation of Low Rank Signals in Structured Subspaces.
264 0 $c 2017
300 $a 1 online resource (201 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 79-07(E), Section: B.
500 $a Adviser: Raj Rao Nadakuditi.
502 $a Thesis (Ph.D.)--University of Michigan, 2017.
504 $a Includes bibliographical references
520 $a The estimation of low rank signals in noise is a ubiquitous task in signal processing, communications, machine learning, data science, econometrics, etc. A critical step in the estimation of such low rank signals is to identify the signal subspace from the noise subspace via the singular value decomposition (SVD).
520 $a In this thesis, we focus on both the design of new SVD based algorithms for problems arising in array processing and the theoretical analysis of their performance. Common array processing tasks include the estimation of direction of arrival (DOA) and clutter suppression for enhanced target detection via beamforming.
520 $a We study the estimation performance of a Multiple Signal Classification (MUSIC), a popular algorithm for DOA estimation, for a single source system when the observations are corrupted by noise and randomly missing samples. We show that the MUSIC DOA estimate is consistent even in the presence of randomly missing samples for the single source case. We present a unified analysis of MUSIC based on random matrix theory that is valid in both the sample rich and deficient regimes, and derive an analytical expression the mean squared error (MSE) performance of the estimate. Our analysis uncovers a phase transition phenomenon, in terms of a critical SNR, and critical fraction of entries observed, below which the MUSIC algorithm breaks down.
520 $a We consider the problem of clutter suppression in ordinary space time adaptive processing (STAP), and multiple input, multiple output STAP (MIMO STAP). For the case of single clutter, we propose new algorithms for improved estimation of clutter subspace, which exploits the double Kronecker product structure (STAP) or triple Kronecker product structure (MIMO STAP) of the underlying singular vector. These algorithms are based on a rearrangement operator introduced by Van Loan and Pitsianis. We use random matrix theory based analysis to quantify the relative estimation performance of the algorithms, and their breakdown points. We discover via simulations and analysis that algorithms which first compute the SVD of the data, and then exploit the Kronecker product structure provide better estimation performance than algorithms which first exploit the Kronecker product structure and then use the SVD.
520 $a We consider the problem of dominant mode rejection (DMR) beamforming. We derive optimal (rank one case) and approximate (higher rank case) shrinkage weights for clutter subspace estimates computed via the SVD, for improved inverse covariance matrix estimation. We highlight the role of singular vector informativeness in this shrinkage operation. We also use this idea to derive an approximate shrinkage weighting for improved low rank tensor estimation. We propose a data driven algorithms that compute these shrinkage weights for both beamforming and tensor estimation.
520 $a Throughout, we validate our analyses with numerical simulations.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Electrical engineering. $3 596380
655 7 $a Electronic books. $2 local $3 554714
690 $a 0544
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Michigan. $b Electrical Engineering: Systems. $3 1195611
773 0 $t Dissertation Abstracts International $g 79-07B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10760064 $z click for full text (PQDT)