2015/04/20 by Céline Aubel, Helmut Bölcskei, Aubel, Céline +1 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Adaptive Filtering Techniques #Control Systems and Identification #FOS: Computer and information sciences #FOS: Mathematics #Functional Analysis (math.FA) #Information Theory (cs.IT) #Mathematical Analysis and Transform Methods #cs.IT #math.FA #math.IT
paper · pdf · doi:10.48550/arxiv.1504.05036
IEEE International Symposium on Information Theory (ISIT), Hong Kong, China, June 2015
arxiv created 2015/04/20 · openalex publication_date 2015/04/20 · arxiv updated 2015/04/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper addresses the problem of identifying a linear time-varying (LTV) system characterized by a (possibly infinite) discrete set of delays and Doppler shifts. We prove that stable identifiability is possible if the upper uniform Beurling density of the delay-Doppler support set is strictly smaller than 1/2 and stable identifiability is impossible for densities strictly larger than 1/2. The proof of this density theorem reveals an interesting relation between LTV system identification and interpolation in the Bargmann-Fock space. Finally, we introduce a subspace method for solving the system identification problem at hand.