2021
DOI: 10.1109/tsp.2021.3112922
|View full text |Cite
|
Sign up to set email alerts
|

Marginal Likelihood Maximization Based Fast Array Manifold Matrix Learning for Direction of Arrival Estimation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 34 publications
0
4
0
Order By: Relevance
“…with R ¼ XX H =L denoting the sample covariance matrix (SCM). Numerous algorithms are available for solving the above optimisation problem, for example, expectation-maximisation algorithm [23], variational Bayesian inference [39], and marginal likelihood maximisation [40,41] etc. Different from the l 2;0 mixed-norm sparsity metric introduced in the previous section, the log-det term in the SBL cost function ( 23) helps promote sparsity [42].…”
Section: Proposed Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…with R ¼ XX H =L denoting the sample covariance matrix (SCM). Numerous algorithms are available for solving the above optimisation problem, for example, expectation-maximisation algorithm [23], variational Bayesian inference [39], and marginal likelihood maximisation [40,41] etc. Different from the l 2;0 mixed-norm sparsity metric introduced in the previous section, the log-det term in the SBL cost function ( 23) helps promote sparsity [42].…”
Section: Proposed Algorithmmentioning
confidence: 99%
“…Mathematically, the cost function is formulated by minimising the marginal likelihood function with respect to bold-italicγ $\boldsymbol{\gamma }$ lefttrueγ=arg0.5emminγln0.25emp()bold-italicX|bold-italicγ,σ2=0.25emarg0.5emminγ0.5emln|boldΦboldΓΦH+σ2bold-italicI|+Tr()ΦΓboldΦH+σ2I1trueRˆ \begin{align*}\tilde{\boldsymbol{\gamma }}=\mathrm{arg}\ \underset{\boldsymbol{\upgamma }}{\min }-\mathrm{ln}\,p\left(\boldsymbol{X}\vert \boldsymbol{\gamma },{\sigma }^{2}\right)\\ \enspace=\,\mathrm{arg}\ \underset{\boldsymbol{\upgamma }}{\min }\ \mathrm{ln}\vert \boldsymbol{\Phi }\boldsymbol{\Gamma }{\boldsymbol{\Phi }}^{H}+{\sigma }^{2}\boldsymbol{I}\vert +\text{Tr}\left({\left(\boldsymbol{\Phi }\boldsymbol{\Gamma }{\boldsymbol{\Phi }}^{H}+{\sigma }^{2}\boldsymbol{I}\right)}^{-1}\widehat{\boldsymbol{R}}\right)\end{align*} with trueRˆ=boldXXH/L $\widehat{\boldsymbol{R}}=\mathbf{X}{\mathbf{X}}^{H}/L$ denoting the sample covariance matrix (SCM). Numerous algorithms are available for solving the above optimisation problem, for example, expectation‐maximisation algorithm [23], variational Bayesian inference [39], and marginal likelihood maximisation [40, 41] etc. Different from the l2,0 ${\mathscr{l}}_{2,0}$ mixed‐norm sparsity metric introduced in the previous section, the log‐det term in the SBL cost function (23) helps promote sparsity [42].…”
Section: Proposed Algorithmmentioning
confidence: 99%
“…Eigenvalues are computed by solving the following equation. (13) where, λ=Eigenvalue, ei=Eigenvector.…”
Section: Computation Of Eigenvaluesmentioning
confidence: 99%
“…Bayesian learning is applied for the linear array to compute the value of array manifold vector, likelihood functionality has the performance parameters such as size complexity and computational complexity which are used for detection of Angle of Arrival [13]. Antenna sensor array performs the signal processing at the Base Station to detect the direction of the incoming electromagnetic wave using Multiple Signal Classification (MUSIC) algorithm [14].…”
Section: Introductionmentioning
confidence: 99%