2011
DOI: 10.1049/iet-rsn.2011.0041
|View full text |Cite
|
Sign up to set email alerts
|

Optimised complexity reduction for maximum likelihood position estimation in spread spectrum navigation receivers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 20 publications
0
5
0
Order By: Relevance
“…We refer to the recursion in (29) as the MLMS algorithm. It is important to note that since the LMS algorithm is a local optimization approach, as opposed to the recursion in (23) which is a global optimization technique, the convergence of the algorithm also depends on the choice of the initial values in addition to the step size.…”
Section: A Matrix Least-mean-square Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…We refer to the recursion in (29) as the MLMS algorithm. It is important to note that since the LMS algorithm is a local optimization approach, as opposed to the recursion in (23) which is a global optimization technique, the convergence of the algorithm also depends on the choice of the initial values in addition to the step size.…”
Section: A Matrix Least-mean-square Algorithmmentioning
confidence: 99%
“…Since G is a known matrix, its inverse is also known beforehand and hence the computations in (42) and (43) do not increase the computational complexity of the system. When a feedback error mechanism is applied in the structure of the recursive algorithms in the last sections, d k is replaced by e d k in the recursions in (29), (A-1), (36), and (41).…”
Section: Los Signal Estimationmentioning
confidence: 99%
See 1 more Smart Citation
“…Modifications of the CRMM include extension of data size reduction to time-variant signals (Groh et al, 2011), optimized correlator computation (Groh and Sand, 2012), and replacement of the Newton-type optimization with expectation maximization or space alternating general expectation maximization algorithms . In this paper, the focus is on the data size reduction of CRMM and its realizability in hardware in the subsequent sections.…”
Section: Crmmmentioning
confidence: 99%
“…Several publications on CRMM discuss various implementation aspects of the algorithm, e.g. Groh and Sand (2008); Groh et al (2011); Groh and Sand (2012). However, none provides a more detailed analysis with respect to real-time or hardware implementation issues.…”
Section: Introductionmentioning
confidence: 99%