The DOI matches its Crossref record.
Fast subspace decomposition
Abstract
Many recent signal processing techniques in various areas, e.g., array signal processing, system identification, and spectrum estimation, require a step of extracting the low-dimensional subspace from a large space. This step is usually called subspace decomposition, which is conventionally accomplished by an eigendecomposition (ED). Since an ED requires O(M/sup 3/) flops for an M/spl times/M matrix, it may represent a barrier to the real-time implementation of these algorithms. The authors present a fast algorithm for signal subspace decomposition, which is termed FSD, that exploits the special matrix structure (low-rank plus identity) associated with signal subspace algorithms and requires only O(M/sup 2/d) flops, where d(often/spl Lt/M) denotes the signal subspace dimension. Unlike most of alternatives, the dimension of the signal subspace is not assumed known apriori and is estimated as part of the procedure. Moreover, theoretical analysis has been conducted, and its results show the strong consistency of the new detection scheme and the asymptotic equivalence between FSD and ED in estimating the signal subspace. Their new approach can also exploit other matrix structure common in signal processing areas, e.g., Toeplitz or Hankel, and thus achieve another order of computational reduction. Moreover, it can be easily implemented in parallel to reduce further the computation time to as little as O(Md) (using O(M) simple processors).>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Two decades of array signal processing research: the parametric approach
Krim, H., & Viberg, M. (1996) · IEEE Signal Processing Magazine · doi:10.1109/79.526899 · Cited by 4,719
The Geometry of Algorithms with Orthogonality Constraints
Edelman, A., Arias, T. A., & Smith, S. T. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895290954 · Cited by 2,685
Blind identification and equalization based on second-order statistics: a time domain approach
Tong, L., Xu, G., & Kailath, T. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.312157 · Cited by 1,078
Self-citationA least-squares approach to blind channel identification
Xu, G., Liu, H., Tong, L., & Kailath, T. (1995) · IEEE Transactions on Signal Processing · doi:10.1109/78.476442 · Cited by 777
Self-citationSubspace-based methods for the identification of linear time-invariant systems
Viberg, M. (1995) · Automatica · doi:10.1016/0005-1098(95)00107-5 · Cited by 615
Metadata
- Authors
- Xu, G., & Kailath, T.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 1994-03
- Volume
- 42
- Issue
- 3
- Pages
- 539-551
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W1978671687
- Cited by
- 212
- References
- 0
- FWCI
- 14.06
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast subspace decomposition. https://app.cochat.ai/papers/10.1109/78.277846
- The paper
- Xu, G., & Kailath, T. (1994). Fast subspace decomposition. IEEE Transactions on Signal Processing. https://doi.org/10.1109/78.277846
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.