ROAST: Rapid Orthogonal Approximate Slepian Transform

In this paper, we provide a Rapid Orthogonal Approximate Slepian Transform (ROAST) for the discrete vector that one obtains when collecting a finite set of uniform samples from a baseband analog signal. The ROAST offers an orthogonal projection, which is an approximation to the orthogonal projection onto the leading discrete prolate spheroidal sequence (DPSS) vectors (also known as Slepian basis vectors). As such, the ROAST is guaranteed to accurately and compactly represent not only oversampled bandlimited signals but also the leading DPSS vectors themselves. Moreover, the subspace angle between the ROAST subspace and the corresponding DPSS subspace can be made arbitrarily small. The complexity of computing the representation of a signal using the ROAST is comparable to the fast Fourier tranform, which is much less than the complexity of using the DPSS basis vectors. We also give non-asymptotic results to guarantee that the proposed basis not only provides a very high degree of approximation accuracy in a mean squared error sense for bandlimited sample vectors, but also that it can provide high-quality approximations of all sampled sinusoids within the band of interest.

[1]  D. Slepian.  Prolate spheroidal wave functions, fourier analysis, and uncertainty — V: the discrete case , 1978, The Bell System Technical Journal.

[2]  Zhihui Zhu,et al.  A super-resolution algorithm for multiband signal identification , 2017, 2017 51st Asilomar Conference on Signals, Systems, and Computers.

[3]  Jiang Qian,et al.  Wall Clutter Mitigation Using Discrete Prolate Spheroidal Sequences for Sparse Reconstruction of Indoor Stationary Scenes , 2015, IEEE Transactions on Geoscience and Remote Sensing.

[4]  Michael B. Wakin,et al.  Compressive Sensing of Analog Signals Using Discrete Prolate Spheroidal Sequences , 2011, ArXiv.

[5]  Bernard Chazelle,et al.  The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors , 2009, SIAM J. Comput..

[6]  B. P. Duggal.  Subspace gaps and range-kernel orthogonality of an elementary operator , 2004 .

[7]  Gene H. Golub,et al.  Algorithm 358: singular value decomposition of a complex matrix [F1, 4, 5] , 1969, CACM.

[8]  Tom Chau,et al.  Compressive sampling of swallowing accelerometry signals using time-frequency dictionaries based on modulated discrete prolate spheroidal sequences , 2012, EURASIP J. Adv. Signal Process..

[9]  Emmanuel J. Candès,et al.  A Nonuniform Sampler for Wideband Spectrally-Sparse Environments , 2012, IEEE Journal on Emerging and Selected Topics in Circuits and Systems.

[10]  Christoph Pacher,et al.  Iterative Detection for Orthogonal Precoding in Doubly Selective Channels , 2017, 2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC).

[11]  Jeffrey M. Hokanson,et al.  Projected Nonlinear Least Squares for Exponential Fitting , 2015, SIAM J. Sci. Comput..

[12]  Christoph Pacher,et al.  Orthogonal Precoding for Ultra Reliable Wireless Communication Links , 2017, ArXiv.

[13]  A. Papoulis.  A new algorithm in spectral analysis and band-limited extrapolation. , 1975 .

[14]  L. Mirsky.  A trace inequality of John von Neumann , 1975 .

[15]  Christoph F. Mecklenbräuker,et al.  Minimum-Energy Band-Limited Predictor With Dynamic Subspace Selection for Time-Variant Flat-Fading Channels , 2007, IEEE Transactions on Signal Processing.

[16]  Zhihui Zhu,et al.  Approximating Sampled Sinusoids and Multiband Signals Using Multiband Modulated DPSS Dictionaries , 2015, Journal of Fourier Analysis and Applications.

[17]  T. Zemen,et al.  Time-variant channel estimation using discrete prolate spheroidal sequences , 2005, IEEE Transactions on Signal Processing.

[18]  Zhihui Zhu,et al.  The fast Slepian transform , 2019, Applied and Computational Harmonic Analysis.

[19]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[20]  Gene H. Golub,et al.  Numerical methods for computing angles between linear subspaces , 1971, Milestones in Matrix Computation.

[21]  Zhihui Zhu,et al.  On the dimensionality of wall and target return subspaces in through-the-wall radar imaging , 2016, 2016 4th International Workshop on Compressed Sensing Theory and its Applications to Radar, Sonar and Remote Sensing (CoSeRa).

[22]  Nathan Halko,et al.  Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..

[23]  C. Eckart,et al.  The approximation of one matrix by another of lower rank , 1936 .

[24]  F. Ahmad,et al.  Wideband synthetic aperture beamforming for through-the-wall imaging [Lecture Notes] , 2008, IEEE Signal Processing Magazine.

[25]  Jeffrey M. Hokanson.  Fast Minimum Uncertainty Estimates for the Exponential Fitting Problem , 2015 .

[26]  M. A. Davenport,et al.  A wideband compressive radio receiver , 2010, 2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE.

[27]  Monson H. Hayes,et al.  On the bandlimited extrapolation of discrete signals , 1983, ICASSP.

[28]  Justin K. Romberg,et al.  Fast orthogonal approximations of sampled sinusoids and bandlimited signals , 2017, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[29]  Zhihui Zhu,et al.  Wall clutter mitigation and target detection using Discrete Prolate Spheroidal Sequences , 2015, 2015 3rd International Workshop on Compressed Sensing Theory and its Applications to Radar, Sonar and Remote Sensing (CoSeRa).