New results on almost-sure identifiability of 2D-harmonic retrieval

In this paper the 2D harmonic retrieval problem is considered. New stochastic identifiability results are derived which equally holds true for the damped and undamped exponential mixtures. Previous results obtained for the 2D case indicate that up to ┌K/2┐ ┌L/2┐ exponentials can almost-surely be identified. In this contribution, we show that this bound is conservative. Simulations indicate that at least ┌(KL)/3┐ harmonics can uniquely be resolved almost-surely. In the second part of the paper the obtained identifiability conditions are compared to stochastic uniqueness conditions of the 2D RARE algorithm.