#include <EcalFenixMaxof2.h>

Public Member Functions
	EcalFenixMaxof2 (int maxNrSamples, int nbMaxStrips)

void	process (std::vector< std::vector< int >> &, int nStr, int bitMask, int bitOddEven, std::vector< int > &out)

virtual	~EcalFenixMaxof2 ()

Private Attributes
int	nbMaxStrips_

std::vector< std::vector< int > >	sumby2_

Detailed Description

finds max sum of two adjacent samples

input: 5x 12 bits (les 12 premiers bits sortant du bypasslin) output: 12 bits

computes 4 sums of 2 strips and gives the max max limited by 0xfff

As in the firmware the computation is performed only on the even energy sum, so the oddEvenFlag (14th bit) is used to exclude the energy of the odd strips from the computation. D.Valsecchi.

Definition at line 20 of file EcalFenixMaxof2.h.

Constructor & Destructor Documentation

◆ EcalFenixMaxof2()

EcalFenixMaxof2::EcalFenixMaxof2	(	int	maxNrSamples,
		int	nbMaxStrips
	)

Definition at line 5 of file EcalFenixMaxof2.cc.

                                                                   : nbMaxStrips_(nbMaxStrips) {
   std::vector<int> vec(maxNrSamples, 0);
   for (int i2strip = 0; i2strip < nbMaxStrips_ - 1; ++i2strip)
     sumby2_.push_back(vec);
 }

References nbMaxStrips_, and sumby2_.

◆ ~EcalFenixMaxof2()

EcalFenixMaxof2::~EcalFenixMaxof2 ( )

virtual

Definition at line 11 of file EcalFenixMaxof2.cc.

11 {}

Member Function Documentation

◆ process()

void EcalFenixMaxof2::process	(	std::vector< std::vector< int >> &	bypasslinout,
		int	nStr,
		int	bitMask,
		int	bitOddEven,
		std::vector< int > &	out
	)

Definition at line 13 of file EcalFenixMaxof2.cc.

                                                                                                               {
   int mask = (1 << bitMask) - 1;
   bool strip_oddmask[nstrip][output.size()];
  
   for (int i2strip = 0; i2strip < nstrip - 1; ++i2strip)
     for (unsigned int i = 0; i < output.size(); i++)
       sumby2_[i2strip][i] = 0;
   for (unsigned int i = 0; i < output.size(); i++)
     output[i] = 0;
  
   // Prepare also the mask of strips to be avoided because of the odd>even energy flag
   for (int istrip = 0; istrip < nstrip; ++istrip) {
     for (unsigned int i = 0; i < output.size(); i++) {
       if ((bypasslinout[istrip][i] >> bitOddEven) & 1)
         strip_oddmask[istrip][i] = false;
       else
         strip_oddmask[istrip][i] = true;
     }
   }
  
   for (unsigned int i = 0; i < output.size(); i++) {
     if (nstrip - 1 == 0) {
       output[i] = strip_oddmask[0][i] * ((bypasslinout[0][i]) & mask);
     } else {
       for (int i2strip = 0; i2strip < nstrip - 1; ++i2strip) {
         sumby2_[i2strip][i] = strip_oddmask[i2strip][i] * ((bypasslinout[i2strip][i]) & mask) +
                               strip_oddmask[i2strip + 1][i] * ((bypasslinout[i2strip + 1][i]) & mask);
         if (sumby2_[i2strip][i] > output[i]) {
           output[i] = sumby2_[i2strip][i];
         }
       }
     }
   }
   return;
 }