Algorithm 4: Signal detection using the greedy approach with an unknown number of signal occurrences.

Input:  $y\in {\mathbb{R}}^N$, $x\in {\mathbb{R}}^L$, $K_{max}$    1:for$K=1$ to $K_{max}$ do    2:   Evaluate ${\gamma }_K$ with respect to y using Algorithm 2    3:   for $i=1$ to P do    4:     Compute ${\tilde{\gamma }}_{K,i}$ with respect to ${\tilde{y}}_i$ (a permutation of y) using Algorithm 2    5:   end for    6:   Compute ${\mathrm{Gap}}_N\left(K\right)=\frac{1}{P}{\sum }_{i=1}^P{\tilde{\gamma }}_{K,i}-{\gamma }_K$    7: end for    8:return$\widehat{K}$ (an estimate of the number of signal occurrence in the measurement), and estimates of the locations of the signal occurrences ${\widehat{n}}_1,\dots ,{\widehat{n}}_{\widehat{K}}$