[Gate-users] Coincidence Sorting Algorithm

[Jonathan Poon]

Hi Everyone,

I am trying to write a custom coincidence sorting algorithm using the
singles data from a GATE simulation.  At the same time, I filter the singles
data through the GATE coincidence sorter to see how my algorithm compares.
At low rates, I see minor differences between my code and the output of the
GATE coincidence sorter. However, at higher rates I see larger differences
in the number of randoms that are counted.

I am using the following settings for the digitizer module:

#       D I G I T I Z E R
/gate/digitizer/Singles/insert adder
/gate/digitizer/Singles/insert readout
/gate/digitizer/Singles/readout/setDepth 3
/gate/digitizer/Singles/insert blurring
/gate/digitizer/Singles/blurring/setResolution 0.12
/gate/digitizer/Singles/blurring/setEnergyOfReference 511.0 keV
/gate/digitizer/Singles/insert thresholder
/gate/digitizer/Singles/thresholder/setThreshold 425. keV
/gate/digitizer/Singles/insert upholder
/gate/digitizer/Singles/upholder/setUphold 650. keV

#       C O I N C I    S O R T E R
/gate/digitizer/Coincidences/setInputName Singles
/gate/digitizer/Coincidences/setWindow 4.5 ns
/gate/digitizer/Coincidences/MultiplesPolicy takeAllGoods
/gate/digitizer/Coincidences/minSectorDifference 10


I am trying to read through the source code, but having trouble
understanding the algorithm!  Is there a white paper available on how the
GATE coincidence sorting algorithm works in greater detail than explained in
the manual?

Any helps would be greatly appreciated!  Thanks!

Jonathan