Table 1 2-D search algorithm

for m = 0 to N _G - 1

   Θmax(k) = - maxValue; % the smallest negative value

   for k = 0 to N + N _G - 1 % find the max. value for all k at a given m

      if Λ(k, m) > Θ_max(k) then

         Θ_max(k) = Λ(k, m);

      else

         break; % break for

      end if

   end for

   if Θ_max(k) > ϒ_max(m) then

      ϒ_max(m) = Θ_max(k);

      $\widehat{\theta }=k$;

      $\widehat{L}=m$;

   else

      break; % break for

   end if

end for

${\widehat{\theta }}_o=\widehat{\theta }+\frac{N_G}{2}+⌈\frac{\widehat{L}}{2}⌉$;