The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Projection approximation subspace tracking
Abstract
Subspace estimation plays an important role in a variety of modern signal processing applications. We present a new approach for tracking the signal subspace recursively. It is based on a novel interpretation of the signal subspace as the solution of a projection like unconstrained minimization problem. We show that recursive least squares techniques can be applied to solve this problem by making an appropriate projection approximation. The resulting algorithms have a computational complexity of O(nr) where n is the input vector dimension and r is the number of desired eigencomponents. Simulation results demonstrate that the tracking capability of these algorithms is similar to and in some cases more robust than the computationally expensive batch eigenvalue decomposition. Relations of the new algorithms to other subspace tracking methods and numerical issues are also discussed.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Multiple emitter location and signal parameter estimation
Schmidt, R. (1986) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.1986.1143830 · Cited by 14,718
Rogers, S. (1996) · Control Engineering Practice · doi:10.1016/0967-0661(96)82838-3 · Cited by 9,278
ESPRIT-estimation of signal parameters via rotational invariance techniques
Roy, R., & Kailath, T. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.32276 · Cited by 7,289
Detection of signals by information theoretic criteria
Wax, M., & Kailath, T. (1985) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1985.1164557 · Cited by 3,426
Simplified neuron model as a principal component analyzer
Oja, E. (1982) · Journal of Mathematical Biology · doi:10.1007/bf00275687 · Cited by 2,309
Marlow, B. K. (1979) · Optica Acta: International Journal of Optics · doi:10.1080/716099475 · Cited by 1,004
Estimating the Angles of Arrival of Multiple Plane Waves
Kumaresan, R., & Tufts, D. W. (1983) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.1983.309427 · Cited by 849
A complex gradient operator and its application in adaptive array theory
Brandwood (1983) · IEE Proceedings F Communications Radar and Signal Processing · doi:10.1049/ip-f-1:19830003 · Cited by 566
Detection and estimation in sensor arrays using weighted subspace fitting
Viberg, M., Ottersten, B., & Kailath, T. (1991) · IEEE Transactions on Signal Processing · doi:10.1109/78.97999 · Cited by 512
Tracking a few extreme singular values and vectors in signal processing
Comon, P., & Golub, G. H. (1990) · Proceedings of the IEEE · doi:10.1109/5.58320 · Cited by 489
Rank-one modification of the symmetric eigenproblem
Bunch, J. R., Nielsen, C. P., & Sorensen, D. C. (1978) · Numerische Mathematik · doi:10.1007/bf01396012 · Cited by 482
A complex gradient operator and its application in adaptive array theory
Brandwood, D. H. (1983) · IEE Proceedings H Microwaves, Optics and Antennas · doi:10.1049/ip-h-1.1983.0004 · Cited by 347
An updating algorithm for subspace tracking
Stewart, G. W. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.139256 · Cited by 326
Estimating the covariance matrix by signal subspace averaging
Karasalo, I. (1986) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1986.1164779 · Cited by 132
Least squares type algorithm for adaptive implementation of Pisarenko's harmonic retrieval method
Reddy, V. U., Egardt, B. S., & Kailath, T. (1982) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1982.1163905 · Cited by 123
Adaptive data orthogonalization
Owsley, N. L. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1978.1170425 · Cited by 118
Bischof, C. H., & Shroff, G. M. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.157185 · Cited by 105
Yang, B., & Böhme, J. F. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.134478 · Cited by 100
Self-citationAn adaptive approach for optimal data reduction using recursive least squares learning method
Bannour, S., & Azimi-Sadjadi, M. R. (1992) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1992.226061 · Cited by 12
Cited by
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
A feasible method for optimization with orthogonality constraints
Wen, Z., & Yin, W. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0584-1 · Cited by 849
Blind multiuser detection: a subspace approach
Wang, X., & Poor, H. V. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661512 · Cited by 737
Signal enhancement using beamforming and nonstationarity with applications to speech
Gannot, S., Burshtein, D., & Weinstein, E. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.934132 · Cited by 696
A Consolidated Perspective on Multimicrophone Speech Enhancement and Source Separation
Gannot, S., Vincent, E., Markovich-Golan, S., & Ozerov, A. (2017) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2016.2647702 · Cited by 563
Metadata
- Authors
- Yang, B.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 1995
- Volume
- 43
- Issue
- 1
- Pages
- 95-107
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2133515443
- Cited by
- 1,273
- References
- 19
- FWCI
- 22.98
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.