no code implementations • 12 Jan 2024 • Yinyan Bu, Robin Rajamäki, Pulak Sarangi, Piya Pal
We explore deliberately introducing holes into this virtual array to leverage resolution gains provided by the increased aperture.
no code implementations • 12 Jan 2024 • Robin Rajamäki, Mehmet Can Hücümenoğlu, Pulak Sarangi, Piya Pal
In this paper, we make advances towards solidifying this understanding by revealing the role of the physical beampattern of the sparse array on the performance of low rank matrix completion techniques.
no code implementations • 4 Jan 2023 • Pulak Sarangi, Mehmet Can Hucumenoglu, Robin Rajamaki, Piya Pal
Our results also formally prove the well-known empirical resolution benefits of sparse arrays, by establishing that the minimum separation between sources can be $\Omega(1/P^2)$, as opposed to separation $\Omega(1/P)$ required by a ULA with the same number of sensors.
no code implementations • 4 Jan 2023 • Pulak Sarangi, Ryoma Hattori, Takaki Komiyama, Piya Pal
Distinct from prior works which exploit sparsity in appropriate domains in order to solve the resulting ill-posed problem, this paper explores the role of binary priors in super-resolution, where the spike (or source) amplitudes are assumed to be binary-valued.