Beurling-type density criteria for system identification

Authors

Verner Vlačić, Céline Aubel, and Helmut Bölcskei

Reference

Journal of Fourier Analysis and Applications, Jan. 2021, submitted.

[BibTeX, LaTeX, and HTML Reference]

Abstract

This paper addresses the problem of identifying a linear time-varying (LTV) system characterized by a (possibly infinite) discrete set of delay-Doppler shifts without a lattice (or other “geometry-discretizing”) constraint on the support set. Concretely, we show that a class of such LTV systems is identifiable whenever the upper uniform Beurling density of the delay-Doppler support sets, measured “uniformly over the class”, is strictly less than 1/2. The proof of this result reveals an interesting relation between LTV system identification and interpolation in the Bargmann-Fock space. Moreover, we show that this density condition is also necessary for classes of systems invariant under time-frequency shifts and closed under a natural topology on the support sets. We furthermore show that identifiability guarantees robust recovery of the delay-Doppler support set, as well as the weights of the individual delay-Doppler shifts, both in the sense of asymptotically vanishing reconstruction error for vanishing measurement error.

Keywords

Beurling density, Bargmann-Fock space, interpolation, modulation spaces, short-time Fourier transform, harmonic analysis, uniformly discrete sets, system identification, linear time-varying systems, time-frequency analysis


Download this document:

 

Copyright Notice: © 2021 V. Vlačić, C. Aubel, and H. Bölcskei.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.