| 1 | /* ======================================================================== *\
|
|---|
| 2 | !
|
|---|
| 3 | ! *
|
|---|
| 4 | ! * This file is part of MARS, the MAGIC Analysis and Reconstruction
|
|---|
| 5 | ! * Software. It is distributed to you in the hope that it can be a useful
|
|---|
| 6 | ! * and timesaving tool in analyzing Data of imaging Cerenkov telescopes.
|
|---|
| 7 | ! * It is distributed WITHOUT ANY WARRANTY.
|
|---|
| 8 | ! *
|
|---|
| 9 | ! * Permission to use, copy, modify and distribute this software and its
|
|---|
| 10 | ! * documentation for any purpose is hereby granted without fee,
|
|---|
| 11 | ! * provided that the above copyright notice appear in all copies and
|
|---|
| 12 | ! * that both that copyright notice and this permission notice appear
|
|---|
| 13 | ! * in supporting documentation. It is provided "as is" without express
|
|---|
| 14 | ! * or implied warranty.
|
|---|
| 15 | ! *
|
|---|
| 16 | !
|
|---|
| 17 | ! Author(s): Markus Gaug 05/2004 <mailto:markus@ifae.es>
|
|---|
| 18 | !
|
|---|
| 19 | ! Copyright: MAGIC Software Development, 2002-2004
|
|---|
| 20 | !
|
|---|
| 21 | !
|
|---|
| 22 | \* ======================================================================== */
|
|---|
| 23 |
|
|---|
| 24 | //////////////////////////////////////////////////////////////////////////////
|
|---|
| 25 | //
|
|---|
| 26 | // MExtractTimeAndChargeSpline
|
|---|
| 27 | //
|
|---|
| 28 | // Fast Spline extractor using a cubic spline algorithm of Numerical Recipes.
|
|---|
| 29 | // It returns the integral below the interpolating spline.
|
|---|
| 30 | //
|
|---|
| 31 | // Call: SetRange(fHiGainFirst, fHiGainLast, fLoGainFirst, fLoGainLast)
|
|---|
| 32 | // to modify the ranges. Ranges have to be an even number. In case of odd
|
|---|
| 33 | // ranges, the last slice will be reduced by one.
|
|---|
| 34 | //
|
|---|
| 35 | // Defaults are:
|
|---|
| 36 | //
|
|---|
| 37 | // fHiGainFirst = fgHiGainFirst = 3
|
|---|
| 38 | // fHiGainLast = fgHiGainLast = 14
|
|---|
| 39 | // fLoGainFirst = fgLoGainFirst = 3
|
|---|
| 40 | // fLoGainLast = fgLoGainLast = 14
|
|---|
| 41 | //
|
|---|
| 42 | //////////////////////////////////////////////////////////////////////////////
|
|---|
| 43 | #include "MExtractFixedWindowSpline.h"
|
|---|
| 44 |
|
|---|
| 45 | #include "MExtractedSignalCam.h"
|
|---|
| 46 |
|
|---|
| 47 | #include "MLog.h"
|
|---|
| 48 | #include "MLogManip.h"
|
|---|
| 49 |
|
|---|
| 50 | ClassImp(MExtractFixedWindowSpline);
|
|---|
| 51 |
|
|---|
| 52 | using namespace std;
|
|---|
| 53 |
|
|---|
| 54 | const Byte_t MExtractFixedWindowSpline::fgHiGainFirst = 2;
|
|---|
| 55 | const Byte_t MExtractFixedWindowSpline::fgHiGainLast = 14;
|
|---|
| 56 | const Byte_t MExtractFixedWindowSpline::fgLoGainFirst = 3;
|
|---|
| 57 | const Byte_t MExtractFixedWindowSpline::fgLoGainLast = 14;
|
|---|
| 58 | // --------------------------------------------------------------------------
|
|---|
| 59 | //
|
|---|
| 60 | // Default constructor.
|
|---|
| 61 | //
|
|---|
| 62 | // Calls:
|
|---|
| 63 | // - SetRange(fgHiGainFirst, fgHiGainLast, fgLoGainFirst, fgLoGainLast)
|
|---|
| 64 | //
|
|---|
| 65 | MExtractFixedWindowSpline::MExtractFixedWindowSpline(const char *name, const char *title)
|
|---|
| 66 | : fHiGainFirstDeriv(NULL), fLoGainFirstDeriv(NULL),
|
|---|
| 67 | fHiGainSecondDeriv(NULL), fLoGainSecondDeriv(NULL)
|
|---|
| 68 | {
|
|---|
| 69 |
|
|---|
| 70 | fName = name ? name : "MExtractFixedWindowSpline";
|
|---|
| 71 | fTitle = title ? title : "Signal Extractor for a fixed FADC window using a fast spline";
|
|---|
| 72 |
|
|---|
| 73 | SetRange(fgHiGainFirst, fgHiGainLast, fgLoGainFirst, fgLoGainLast);
|
|---|
| 74 | }
|
|---|
| 75 |
|
|---|
| 76 | MExtractFixedWindowSpline::~MExtractFixedWindowSpline()
|
|---|
| 77 | {
|
|---|
| 78 |
|
|---|
| 79 | if (fHiGainFirstDeriv)
|
|---|
| 80 | delete [] fHiGainFirstDeriv;
|
|---|
| 81 | if (fLoGainFirstDeriv)
|
|---|
| 82 | delete [] fLoGainFirstDeriv;
|
|---|
| 83 | if (fHiGainSecondDeriv)
|
|---|
| 84 | delete [] fHiGainSecondDeriv;
|
|---|
| 85 | if (fLoGainSecondDeriv)
|
|---|
| 86 | delete [] fLoGainSecondDeriv;
|
|---|
| 87 |
|
|---|
| 88 | }
|
|---|
| 89 |
|
|---|
| 90 | // --------------------------------------------------------------------------
|
|---|
| 91 | //
|
|---|
| 92 | // SetRange:
|
|---|
| 93 | //
|
|---|
| 94 | // Checks:
|
|---|
| 95 | // - if the window defined by (fHiGainLast-fHiGainFirst-1) are odd, subtract one
|
|---|
| 96 | // - if the window defined by (fLoGainLast-fLoGainFirst-1) are odd, subtract one
|
|---|
| 97 | // - if the Hi Gain window is smaller than 2, set fHiGainLast to fHiGainFirst+1
|
|---|
| 98 | // - if the Lo Gain window is smaller than 2, set fLoGainLast to fLoGainFirst+1
|
|---|
| 99 | //
|
|---|
| 100 | // Calls:
|
|---|
| 101 | // - MExtractor::SetRange(hifirst,hilast,lofirst,lolast);
|
|---|
| 102 | //
|
|---|
| 103 | // Sets:
|
|---|
| 104 | // - fNumHiGainSamples to: (Float_t)(fHiGainLast-fHiGainFirst+1)
|
|---|
| 105 | // - fNumLoGainSamples to: (Float_t)(fLoGainLast-fLoGainFirst+1)
|
|---|
| 106 | // - fSqrtHiGainSamples to: TMath::Sqrt(fNumHiGainSamples)
|
|---|
| 107 | // - fSqrtLoGainSamples to: TMath::Sqrt(fNumLoGainSamples)
|
|---|
| 108 | //
|
|---|
| 109 | void MExtractFixedWindowSpline::SetRange(Byte_t hifirst, Byte_t hilast, Byte_t lofirst, Byte_t lolast)
|
|---|
| 110 | {
|
|---|
| 111 |
|
|---|
| 112 | const Byte_t windowhi = hilast-hifirst+1;
|
|---|
| 113 | const Byte_t whieven = windowhi & ~1;
|
|---|
| 114 |
|
|---|
| 115 | if (whieven != windowhi)
|
|---|
| 116 | {
|
|---|
| 117 | *fLog << warn << GetDescriptor()
|
|---|
| 118 | << Form("%s%2i%s%2i",": Hi Gain window size has to be even, set last slice from "
|
|---|
| 119 | ,(int)hilast," to ",(int)(hilast-1)) << endl;
|
|---|
| 120 | hilast -= 1;
|
|---|
| 121 | }
|
|---|
| 122 |
|
|---|
| 123 | if (whieven<2)
|
|---|
| 124 | {
|
|---|
| 125 | *fLog << warn << GetDescriptor()
|
|---|
| 126 | << Form("%s%2i%s%2i",": Hi Gain window is smaller than 2 FADC sampes, set last slice from"
|
|---|
| 127 | ,(int)hilast," to ",(int)(hifirst+1)) << endl;
|
|---|
| 128 | hilast = hifirst+1;
|
|---|
| 129 | }
|
|---|
| 130 |
|
|---|
| 131 | const Byte_t windowlo = lolast-lofirst+1;
|
|---|
| 132 | const Byte_t wloeven = windowlo & ~1;
|
|---|
| 133 |
|
|---|
| 134 | if (lolast != 0)
|
|---|
| 135 | {
|
|---|
| 136 | if (wloeven != windowlo)
|
|---|
| 137 | {
|
|---|
| 138 | *fLog << warn << GetDescriptor()
|
|---|
| 139 | << Form("%s%2i%s%2i",": Lo Gain window size has to be even, set last slice from "
|
|---|
| 140 | ,(int)lolast," to ",(int)(lolast-1)) << endl;
|
|---|
| 141 | lolast -= 1;
|
|---|
| 142 | }
|
|---|
| 143 |
|
|---|
| 144 |
|
|---|
| 145 | if (wloeven<2)
|
|---|
| 146 | {
|
|---|
| 147 | *fLog << warn << GetDescriptor()
|
|---|
| 148 | << Form("%s%2i%s%2i",": Lo Gain window is smaller than 2 FADC sampes, set last slice from"
|
|---|
| 149 | ,(int)lolast," to ",(int)(lofirst+1)) << endl;
|
|---|
| 150 | lolast = lofirst+1;
|
|---|
| 151 | }
|
|---|
| 152 | }
|
|---|
| 153 |
|
|---|
| 154 |
|
|---|
| 155 | MExtractor::SetRange(hifirst,hilast,lofirst,lolast);
|
|---|
| 156 |
|
|---|
| 157 | //
|
|---|
| 158 | // Very important: Because the spline interpolates between the slice,
|
|---|
| 159 | // the number of samples for the pedestal subtraction
|
|---|
| 160 | // is now 1 less than with e.g. MExtractFixedWindow
|
|---|
| 161 | //
|
|---|
| 162 | fNumHiGainSamples = (Float_t)(fHiGainLast-fHiGainFirst);
|
|---|
| 163 | if (fLoGainLast != 0)
|
|---|
| 164 | fNumLoGainSamples = (Float_t)(fLoGainLast-fLoGainFirst);
|
|---|
| 165 | else
|
|---|
| 166 | fNumLoGainSamples = 0.;
|
|---|
| 167 |
|
|---|
| 168 | fSqrtHiGainSamples = TMath::Sqrt(fNumHiGainSamples);
|
|---|
| 169 | fSqrtLoGainSamples = TMath::Sqrt(fNumLoGainSamples);
|
|---|
| 170 |
|
|---|
| 171 | }
|
|---|
| 172 |
|
|---|
| 173 | // --------------------------------------------------------------------------
|
|---|
| 174 | //
|
|---|
| 175 | // ReInit
|
|---|
| 176 | //
|
|---|
| 177 | // Calls:
|
|---|
| 178 | // - MExtractor::ReInit(pList);
|
|---|
| 179 | // - fSignals->SetUsedFADCSlices(fHiGainFirst, fHiGainLast+fHiLoLast, fNumHiGainSamples,
|
|---|
| 180 | // fLoGainFirst, fLoGainLast, fNumLoGainSamples);
|
|---|
| 181 | //
|
|---|
| 182 | // Deletes all arrays, if not NULL
|
|---|
| 183 | // Creates new arrays according to the extraction range
|
|---|
| 184 | //
|
|---|
| 185 | Bool_t MExtractFixedWindowSpline::ReInit(MParList *pList)
|
|---|
| 186 | {
|
|---|
| 187 |
|
|---|
| 188 | if (!MExtractor::ReInit(pList))
|
|---|
| 189 | return kFALSE;
|
|---|
| 190 |
|
|---|
| 191 | fSignals->SetUsedFADCSlices(fHiGainFirst, fHiGainLast+fHiLoLast, fNumHiGainSamples,
|
|---|
| 192 | fLoGainFirst, fLoGainLast, fNumLoGainSamples);
|
|---|
| 193 |
|
|---|
| 194 | if (fHiGainFirstDeriv)
|
|---|
| 195 | delete [] fHiGainFirstDeriv;
|
|---|
| 196 | if (fLoGainFirstDeriv)
|
|---|
| 197 | delete [] fLoGainFirstDeriv;
|
|---|
| 198 | if (fHiGainSecondDeriv)
|
|---|
| 199 | delete [] fHiGainSecondDeriv;
|
|---|
| 200 | if (fLoGainSecondDeriv)
|
|---|
| 201 | delete [] fLoGainSecondDeriv;
|
|---|
| 202 |
|
|---|
| 203 | Int_t range = fHiGainLast - fHiGainFirst + 1 + fHiLoLast;
|
|---|
| 204 |
|
|---|
| 205 | fHiGainFirstDeriv = new Float_t[range];
|
|---|
| 206 | memset(fHiGainFirstDeriv,0,range*sizeof(Float_t));
|
|---|
| 207 | fHiGainSecondDeriv = new Float_t[range];
|
|---|
| 208 | memset(fHiGainSecondDeriv,0,range*sizeof(Float_t));
|
|---|
| 209 |
|
|---|
| 210 | range = fLoGainLast - fLoGainFirst + 1;
|
|---|
| 211 |
|
|---|
| 212 | fLoGainFirstDeriv = new Float_t[range];
|
|---|
| 213 | memset(fLoGainFirstDeriv,0,range*sizeof(Float_t));
|
|---|
| 214 | fLoGainSecondDeriv = new Float_t[range];
|
|---|
| 215 | memset(fLoGainSecondDeriv,0,range*sizeof(Float_t));
|
|---|
| 216 |
|
|---|
| 217 | return kTRUE;
|
|---|
| 218 | }
|
|---|
| 219 |
|
|---|
| 220 |
|
|---|
| 221 | // --------------------------------------------------------------------------
|
|---|
| 222 | //
|
|---|
| 223 | // FindSignalHiGain:
|
|---|
| 224 | //
|
|---|
| 225 | // - Loop from ptr to (ptr+fHiGainLast-fHiGainFirst)
|
|---|
| 226 | // - Sum up contents of *ptr
|
|---|
| 227 | // - If *ptr is greater than fSaturationLimit, raise sat by 1
|
|---|
| 228 | //
|
|---|
| 229 | // - If fHiLoLast is not 0, loop also from logain to (logain+fHiLoLast)
|
|---|
| 230 | // - Sum up contents of logain
|
|---|
| 231 | // - If *logain is greater than fSaturationLimit, raise sat by 1
|
|---|
| 232 | //
|
|---|
| 233 | void MExtractFixedWindowSpline::FindSignalHiGain(Byte_t *ptr, Byte_t *logain, Float_t &sum, Byte_t &sat) const
|
|---|
| 234 | {
|
|---|
| 235 |
|
|---|
| 236 | const Byte_t *end = ptr + fHiGainLast - fHiGainFirst;
|
|---|
| 237 | Int_t range = fHiGainLast - fHiGainFirst + fHiLoLast + 1;
|
|---|
| 238 |
|
|---|
| 239 | Float_t pp;
|
|---|
| 240 | Int_t i = 0;
|
|---|
| 241 |
|
|---|
| 242 | Int_t summ = 0;
|
|---|
| 243 | sum = (Float_t)*ptr++/2.;
|
|---|
| 244 | //
|
|---|
| 245 | // Check for saturation in all other slices
|
|---|
| 246 | //
|
|---|
| 247 | while (ptr<end)
|
|---|
| 248 | {
|
|---|
| 249 |
|
|---|
| 250 | summ += *ptr;
|
|---|
| 251 | i++;
|
|---|
| 252 |
|
|---|
| 253 | pp = fHiGainSecondDeriv[i-1] + 4.;
|
|---|
| 254 | fHiGainSecondDeriv[i] = -1.0/pp;
|
|---|
| 255 | fHiGainFirstDeriv [i] = *(ptr+1) - 2.* *(ptr) + *(ptr-1);
|
|---|
| 256 | fHiGainFirstDeriv [i] = (6.0*fHiGainFirstDeriv[i]-fHiGainFirstDeriv[i-1])/pp;
|
|---|
| 257 |
|
|---|
| 258 | if (*ptr++ >= fSaturationLimit)
|
|---|
| 259 | sat++;
|
|---|
| 260 | }
|
|---|
| 261 |
|
|---|
| 262 | if (*ptr++ >= fSaturationLimit)
|
|---|
| 263 | sat++;
|
|---|
| 264 |
|
|---|
| 265 | if (fHiLoLast == 0)
|
|---|
| 266 | {
|
|---|
| 267 | sum += (Float_t)*ptr/2.;
|
|---|
| 268 | fHiGainSecondDeriv[++i] = 0.;
|
|---|
| 269 |
|
|---|
| 270 | }
|
|---|
| 271 | else
|
|---|
| 272 | {
|
|---|
| 273 | summ += *ptr;
|
|---|
| 274 | i++;
|
|---|
| 275 |
|
|---|
| 276 | pp = fHiGainSecondDeriv[i-1] + 4.;
|
|---|
| 277 | fHiGainSecondDeriv[i] = -1.0/pp;
|
|---|
| 278 | fHiGainFirstDeriv [i] = *(logain) - 2.* *(ptr) + *(ptr-1);
|
|---|
| 279 | fHiGainFirstDeriv [i] = (6.0*fHiGainFirstDeriv[i]-fHiGainFirstDeriv[i-1])/pp;
|
|---|
| 280 |
|
|---|
| 281 | end = logain + fHiLoLast - 1;
|
|---|
| 282 |
|
|---|
| 283 | while (logain<end)
|
|---|
| 284 | {
|
|---|
| 285 |
|
|---|
| 286 | summ += *logain;
|
|---|
| 287 | i++;
|
|---|
| 288 |
|
|---|
| 289 | pp = fHiGainSecondDeriv[i-1] + 4.;
|
|---|
| 290 | fHiGainSecondDeriv[i] = -1.0/pp;
|
|---|
| 291 | fHiGainFirstDeriv [i] = *(logain+1) - 2.* *(logain) + *(ptr-1);
|
|---|
| 292 | fHiGainFirstDeriv [i] = (6.0*fHiGainFirstDeriv[i]-fHiGainFirstDeriv[i-1])/pp;
|
|---|
| 293 |
|
|---|
| 294 | if (*logain++ >= fSaturationLimit)
|
|---|
| 295 | sat++;
|
|---|
| 296 |
|
|---|
| 297 | }
|
|---|
| 298 | sum += (Float_t)*logain/2;
|
|---|
| 299 | fHiGainSecondDeriv[++i] = 0.;
|
|---|
| 300 | }
|
|---|
| 301 |
|
|---|
| 302 | for (Int_t k=range-2;k>0;k--)
|
|---|
| 303 | {
|
|---|
| 304 | fHiGainSecondDeriv[k] = fHiGainSecondDeriv[k]*fHiGainSecondDeriv[k+1] + fHiGainFirstDeriv[k];
|
|---|
| 305 | sum += 0.25*fHiGainSecondDeriv[k];
|
|---|
| 306 | }
|
|---|
| 307 |
|
|---|
| 308 | sum += (Float_t)summ;
|
|---|
| 309 | }
|
|---|
| 310 |
|
|---|
| 311 | // --------------------------------------------------------------------------
|
|---|
| 312 | //
|
|---|
| 313 | // FindSignalLoGain:
|
|---|
| 314 | //
|
|---|
| 315 | // - Loop from ptr to (ptr+fLoGainLast-fLoGainFirst)
|
|---|
| 316 | // - Sum up contents of *ptr
|
|---|
| 317 | // - If *ptr is greater than fSaturationLimit, raise sat by 1
|
|---|
| 318 | //
|
|---|
| 319 | void MExtractFixedWindowSpline::FindSignalLoGain(Byte_t *ptr, Float_t &sum, Byte_t &sat) const
|
|---|
| 320 | {
|
|---|
| 321 |
|
|---|
| 322 | const Byte_t *end = ptr + fLoGainLast - fLoGainFirst;
|
|---|
| 323 | Int_t range = fLoGainLast - fLoGainFirst + 1;
|
|---|
| 324 |
|
|---|
| 325 | Float_t pp;
|
|---|
| 326 | Int_t i = 0;
|
|---|
| 327 |
|
|---|
| 328 | fLoGainSecondDeriv[0] = 0.;
|
|---|
| 329 | fLoGainFirstDeriv[0] = 0.;
|
|---|
| 330 |
|
|---|
| 331 | Int_t summ = 0;
|
|---|
| 332 | sum = (Float_t)*ptr++/2.;
|
|---|
| 333 | //
|
|---|
| 334 | // Check for saturation in all other slices
|
|---|
| 335 | //
|
|---|
| 336 | while (ptr<end)
|
|---|
| 337 | {
|
|---|
| 338 |
|
|---|
| 339 | summ += *ptr;
|
|---|
| 340 | i++;
|
|---|
| 341 |
|
|---|
| 342 | pp = fLoGainSecondDeriv[i-1] + 4.;
|
|---|
| 343 | fLoGainSecondDeriv[i] = -1.0/pp;
|
|---|
| 344 | fLoGainFirstDeriv [i] = *(ptr+1) - 2.* *(ptr) + *(ptr-1);
|
|---|
| 345 | fLoGainFirstDeriv [i] = (6.0*fLoGainFirstDeriv[i]-fLoGainFirstDeriv[i-1])/pp;
|
|---|
| 346 |
|
|---|
| 347 | if (*ptr++ >= fSaturationLimit)
|
|---|
| 348 | sat++;
|
|---|
| 349 | }
|
|---|
| 350 |
|
|---|
| 351 | if (*ptr++ >= fSaturationLimit)
|
|---|
| 352 | sat++;
|
|---|
| 353 |
|
|---|
| 354 | sum += (Float_t)*ptr/2.;
|
|---|
| 355 | fLoGainSecondDeriv[++i] = 0.;
|
|---|
| 356 |
|
|---|
| 357 | for (Int_t k=range-2;k>0;k--)
|
|---|
| 358 | {
|
|---|
| 359 | fLoGainSecondDeriv[k] = fLoGainSecondDeriv[k]*fLoGainSecondDeriv[k+1] + fLoGainFirstDeriv[k];
|
|---|
| 360 | sum += 0.25*fLoGainSecondDeriv[k];
|
|---|
| 361 | }
|
|---|
| 362 |
|
|---|
| 363 | sum += (Float_t)summ;
|
|---|
| 364 | }
|
|---|
| 365 |
|
|---|
