2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2014
DOI: 10.1109/icassp.2014.6854489
|View full text |Cite
|
Sign up to set email alerts
|

Approximate least squares

Abstract: We present a novel iterative algorithm for approximating the linear least squares solution with low complexity. After a motivation of the algorithm we discuss the algorithm's properties including its complexity, and we present theoretical results as well as simulation based performance results. We describe the analysis of its convergence behavior and show that in the noise free case the algorithm converges to the least squares solution.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Year Published

2015
2015
2017
2017

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 12 publications
(17 citation statements)
references
References 8 publications
0
17
0
Order By: Relevance
“…For n = 0, a persistent noise-dependent error term remains for the approximation such thatx (E)ALS =x BLS [24]. In Tab.…”
Section: Estimation Schemementioning
confidence: 99%
See 4 more Smart Citations
“…For n = 0, a persistent noise-dependent error term remains for the approximation such thatx (E)ALS =x BLS [24]. In Tab.…”
Section: Estimation Schemementioning
confidence: 99%
“…In the next step, we analyze the influence of the choice of µ. In [24] we show that the ALS estimator converges if µ is chosen to…”
Section: Analysis: Setting Of the Iteration Step Widthmentioning
confidence: 99%
See 3 more Smart Citations