## EKH vs shift-and-add restoration

Two kinds of restoration algorithms for wobbler switched data are available: The EKH [Emerson et al. 1979] and shift-and-add algorithms. EKH is much more elaborated and it enables to recover all the source structure as long as the source stays undetected at the edges of the map along the scanning direction. However, it works well only for relatively small source size (i.e. ). Now, there are scientific projects which search for point sources (at least sources whose size is smaller than the half wobbler throw) on much larger sky areas. For these (i.e. search for point sources on very large field of views), the shift-and-add restoration method works well.

We thus offer the user the following choice:

EKH restoration
  The PI must give the source size in both perpendicular directions: . The PI can request unrelated sources in this mode (the sources must share the same pointing calibrator...).
Shift-and-add restoration
  The PI must give the sizes of the final mosaic: . We then assume that this area will be observed in square submaps, whose typical duration is set to so that is an integer number. If we define , we then find the size through the following equation:
  (15)
  This second order equation has a single physical solution
  (16)
  There are then two cases:
  1. If , then we use the user inputs:

     |  |  |  | (17)
     |  |  |  | (18)
     |  |  |  | (19)

  2. Else we use:

     |  |  |  | (20)
     |  |  |  | (21)
     |  |  |  | (22)

     We note that in this case, is not a real number of sources in this case. It is a number of submap and it thus does not need to be an integer.