GLAST/LAT > DAQ and FSW > FSW > Doxygen Index > GRBP / V1-0-1
Constituent: grbpsiu     Tag: linux-gcc
#include "GRBP_cluster.h"
#include "GRBP_cache.h"
#include "dprintf.h"
#include "EDS/FFS.h"
Include dependency graph for GRBP_cluster.c:
Defines | |
#define | report_prms(_min_idx,_max_idx,_max,_pdists,_hi_pdists, _lo_pdists,_pdts,_hi_pdts,_lo_pdts,_j,_logP_sum,_threshold) |
#define | report_masks(_title, _masks, _nmasks) |
#define | report_newline() |
#define | NULL ((void *)0) |
Functions | |
static __inline int | find (const unsigned int *bl, int idx, unsigned int mask, int max) |
Finds the first set bit in the bit list. | |
static __inline unsigned int * | copy (unsigned int *dst, const unsigned int *src, int beg, int cnt, int max) |
Copies cnt 32-bit words starting at offset beg in src to dst. src is treated as a circular array of length max. Note that dst is not treated as a circular array. | |
static __inline unsigned int * | copy_or (unsigned int *dst, const unsigned int *src, int beg, int cnt, int max) |
Or's in cnt 32-bit words starting at offset beg in src to dst. src is treated as a circular array of length max. Note that dst is not treated as a circular array. | |
int | GRBP_clusterGammasGather (const GRBP_cluster *clusters, int beg, int end, int max, const unsigned short int *list, int cnt, double contrast, double threshold, unsigned int *bl, GRBP_probabilityLogs *plog_max) |
Scans the circular list of clusters looking for clusters that are over the probability threshold. A list of photons that are members of such clusters is accumulated (in the form of a bit list) and returned in masks. |
CVS $Id: GRBP_cluster.c,v 1.5 2008/09/01 22:05:02 russell Exp $
The cluster is the object used to detect a GRB. It has almost no role in locating a GRB. It is really a pattern recognition object. Each input photon acts a the parent of a cluster. A cluster is formed around that parent photon by photons that are within a configurable angular distance from the parent. When a new photon arrives, the previous N photons are checked. When a new photon arrives, the oldest photon in the cluster is retired and replaced with the new photon. This continues until the parent photon itself is retired.
When a photon is added to the cluster, its probability of being within the specified angular distance and within the time (based on the background rate) is computed. The sum of all the spatial and temporal probabilities gives a measure of the likelihood that this photon and its neighbors are from a GRB.
|
Copies cnt 32-bit words starting at offset beg in src to dst. src is treated as a circular array of length max. Note that dst is not treated as a circular array.
|
|
Or's in cnt 32-bit words starting at offset beg in src to dst. src is treated as a circular array of length max. Note that dst is not treated as a circular array.
|
|
Finds the first set bit in the bit list.
|
|
Scans the circular list of clusters looking for clusters that are over the probability threshold. A list of photons that are members of such clusters is accumulated (in the form of a bit list) and returned in masks.
|