2000
DOI: 10.1080/0025570x.2000.11996794
|View full text |Cite
|
Sign up to set email alerts
|

On Minimum Spanning Trees and Determinants

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
5
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 2 publications
0
5
0
Order By: Relevance
“…Because of the incoherent measurement, only I m − 1 phase differences have to be evaluated. Hence, a matrix A m of rank I m − 1, resulting in a spanning tree [29] between all antennas, is sufficient to maintain all information. The Appendix A provides a more detailed discussion.…”
Section: B Measurement Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…Because of the incoherent measurement, only I m − 1 phase differences have to be evaluated. Hence, a matrix A m of rank I m − 1, resulting in a spanning tree [29] between all antennas, is sufficient to maintain all information. The Appendix A provides a more detailed discussion.…”
Section: B Measurement Modelmentioning
confidence: 99%
“…In this way, the unambiguity range (−π, π] implicitly provides the information about the maximally allowed displacement of the predicted beacon position. In the cost function of the maximum a posteriori estimator (29), this is reflected in the non-convex measurement part J meas,k , which has, apart from its global minima, multiple local minima due to the 2π phase ambiguity, while the prediction part J pred,k is a quadratic function. To discuss the ambiguity problem in more detail, a closer look is taken at the measurement residual, caused by a wrongly estimated beacon position.…”
Section: Solution Of the Maximum A Posteriori Cost Functionmentioning
confidence: 99%
See 1 more Smart Citation
“…To assure that all antennas' phase information is incorporated, T pre,nR needs to have full rank. Hence, the evaluated phase differences should create a spanning tree between all antennas of the array [42] to assure a full rank of the first N A,nR − 1 rows of T pre,nR . Since the phase difference unambiguity range of an evaluated antenna pair increases with decreasing antenna distance, it is advisable to choose the evaluated phase differences in T pre,nR so that each receive antenna is connected to the spanning tree via the most closely spaced neighboring antenna.…”
Section: B Phase Preprocessingmentioning
confidence: 99%
“…Therefore, it can be solved very efficiently with a standard network simplex algorithm. Moreover, the resulting optimal spanning tree solution U * has full rank (Wright, 2000). The last step is to randomize this binary matrix to obtain the desired matrix.…”
mentioning
confidence: 99%