NDLI: Fast subspace decomposition of data matrices

Content Provider	IEEE Xplore Digital Library
Author	Xu, G. Kailath, T.
Copyright Year	1991
Description	Author affiliation: Inf. Syst. Lab., Stanford Univ., CA, USA (Xu, G.; Kailath, T.)
Abstract	The authors present a fast subspace decomposition method (Bi-FSD) for (rectangular) data matrices, employing the bidiagonalization Lanczos algorithm. It only requires O(NMd) flops for a N*M data matrix and achieves almost an order of magnitude computational reduction over the O(NM/sup 2/+M/sup 3/) SVD (singular value decomposition) or ED (eigendecomposition) approach. A novel detection scheme is also presented that can be implemented at each intermediate step of estimating the signal subspace. Unlike many fast algorithms that trade performance for speed, rigorous performance analysis shows that Bi-FSD has the same asymptotic performance as the more costly SVD, and the Bi-FSD detection scheme is strongly consistent. Also, the most computationally intensive part (i.e., O(NM) operations) is O(d) matrix-vector products, which can be easily implemented in parallel for even faster computation. All these features of the Bi-FSD algorithm make it easier to implement a class of high-resolution array signal processing algorithms in real time.
Starting Page	908
Ending Page	912
File Size	357969
Page Count	5
File Format	PDF
ISBN	0818624701
ISSN	10586393
DOI	10.1109/ACSSC.1991.186578
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1991-11-04
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Matrix decomposition Covariance matrix Sensor arrays Array signal processing Costs Signal processing Direction of arrival estimation Information systems Laboratories Computational complexity
Content Type	Text
Resource Type	Article
Subject	Signal Processing Computer Networks and Communications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fast Subspace Tracking

Reduced complexity covariance matrix estimate for subspace-based array processing

Strong consistency of FSD detection schemes

Structured covariance matrices and dimensionality reduction in array processing

RECENT RESULTS IN SENSOR ARRAY PROCESSING

A Low-Complexity Nyström-Based Algorithm for Array Subspace Estimation

Locally optimal covariance matrix estimation techniques for array signal processing applications

Decomposition of the focusing transformation in coherent signal-subspace DOA estimation

Transform covariance differencing method for correlated sources under unknown symmetric Toeplitz noise

Fast subspace decomposition of data matrices

Similar Documents

Fast Subspace Tracking

Reduced complexity covariance matrix estimate for subspace-based array processing

Strong consistency of FSD detection schemes

Structured covariance matrices and dimensionality reduction in array processing

RECENT RESULTS IN SENSOR ARRAY PROCESSING

A Low-Complexity Nyström-Based Algorithm for Array Subspace Estimation

Locally optimal covariance matrix estimation techniques for array signal processing applications

Decomposition of the focusing transformation in coherent signal-subspace DOA estimation

Transform covariance differencing method for correlated sources under unknown symmetric Toeplitz noise

Fast subspace decomposition of data matrices