# Presentation: 844652

## GRETINA :   Recent Developments

*ORNL Physics Division*
- JUSTIPEN Workshop              Jan 2008

**GRETINA :   Recent Developments**

## GRETINA

- Gamma-Ray Energy Tracking Array for in-beam nuclear structure studies
- 28 highly segmented Ge detectors, in groups of four
- Total  ~1 steradians
- Funded by DOE, under construction at LBNL
- People:
- Contractor Project Manager:   I-Yang Lee (LBNL)
- GRETINA Advisory Committee (GAC):
- Con Beausang (U. of Richmond)
- Doug Cline (U. of Rochester)
- Thomas Glasmacher (MSU / NSCL)
- Kim Lister (ANL)
- Augusto Macchiavelli (LBNL)
- David Radford (ORNL)
- Mark Riley (Florida State U.)
- Demetrios Sarantites (Washington U.)
- Kai Vetter (LLNL)
- Many others, especially at LBNL

## Highlights of 2006 - 2007 achievements

- Received and tested the first quadruple-detector module
- Developed a new version of signal decomposition program and signal basis.
- Achieved  ≤ 2mm position resolution
- Understood and eliminated preamplifier crosstalk and oscillation
- Designed, fabricated, and tested prototypes of signal digitizer and trigger modules
- Performed an end-to-end test on an eight-node computing cluster
- Received CD2B/3B approval by DOE
- Developed a suggested national lab rotation schedule for the first round of experimental campaigns

## First Quadruple Cluster (Q1)

- Delivered  Dec 2006

**B-type**

**A-type**

**First Quadruple Cluster (Q1)**

## First delivered  Dec 2006
Easily met all mechanical specifications and tolerances
One nonfunctional segment in one of the four crystals
Central channels and front segments were microphonic
Many measurements during 2007, including in-beam
Attempt to repair bad crystal at LBNL was unsuccessful
Detector was returned to Canberra; repaired module was (re)delivered  Dec 2007
Central channel microphonics fixed
Cause of front segment microphonics identified
Now undergoing a second round of tests and measurements at LBNL

- Easily met all mechanical specifications and tolerances
- One nonfunctional segment in one of the four crystals
- Central channels and front segments were microphonic
- Many measurements during 2007, including in-beam
- Attempt to repair bad crystal at LBNL was unsuccessful
- Detector was returned to Canberra; repaired module was (re)delivered  Dec 2007
- Central channel microphonics fixed
- Cause of front segment microphonics identified
- Now undergoing a second round of tests and measurements at LBNL

**First Quadruple Module (Q1)**

## Q1 Signal Rise Times

- Many of the rise times were much slower than the specification  (≤ 70ns)

## Q1 Cross-Talk

- “Integral crosstalk” (energy)
- Average = 0.09%
-  = 0.10%
- “Differential crosstalk”
- Average = 0.11%
-  = 0.42%

- Specifications:  <0.1%

## Cross-talk and Oscillation

- Differential cross talk arises from capacitive coupling across the inputs to the preamplifiers
- Working with Canberra and SPICE models, we have understood and eliminated the preamplifier oscillation
- The rise times of the Q1 preamplifiers have now been reduced to the value required by the specification

## Mechanical Design Completed

**Mechanical Design Completed**

- Mechanical system: Support structure, LN system, target chamber, etc.

## Electronics Prototypes

- Digitizer and trigger modules under test

- Digitizer module

- Designed, fabricated, and tested prototype of
-     digitizer module (LBNL) and trigger module (ANL)
-     -  Worked beautifully together on first try

**Electronics Prototypes**

## Computing System

- an eight-node prototype computer cluster

-  Read out
-  Event building
-  Signal decomposition
-  Tracking
-  Storage
-  Analysis

**Computing System**

## Tracking depends on knowing the positions and energies of the Compton interactions

- Digital pulse processing of segment data
- Extracts multiple -ray interaction positions & energies
- Uses data from both hit segments and image charges from neighbors
- Must allow for at least two interactions per hit segment
- Uses a set of calculated basis pulse shapes
- Done on a per-crystal basis
- Ideally suited to parallel processing
**  **Requires about 90% of CPU cycles used by GRETINA
- The major processing bottleneck
- Baseline design allows only ~ 4 ms/crystal/node for decomposition

**Signal Decomposition**

## Status

- Status of GRETINA signal decomposition algorithm
- Three orders of magnitude improvement in CPU time
- Much improved fits (2 values)
- Can now handle any number of hit detector segments, each with up to two interactions
- Never fails to converge
- Developed new optimized, irregular grid for the basis signals
- Incorporated fitting of signal start time t0
- Developed method to accurately correct calculated signals for preamplifier response and for two types of cross talk
- Although some work remains to be done, we have demonstrated that the problem of signal decomposition for GRETINA is solved

## Latest Decomposition Algorithm:  Excellent Fits

-   Red:  Two typical multi-segment events measured in prototype triplet cluster		- concatenated signals from 36 segments, 500ns time range
-   Blue:  Fits from decomposition algorithm (linear combination of basis signals)		- includes differential cross talk from capacitive coupling between channels

## Optimized Quasi-Cylindrical Grid

- Spacing arranged such that 2 between neighbors is approximately uniform,	 i.e. inversely proportional to sensitivity
- Optimizes RAM usage and greatly simplifies programming of constraints etc.

## Collimated Cs-source test

- Pencil beam of 662 keV:				  	Distribution of deduced interactions points throughout the 	crystal, from decomposition plus tracking algorithms

-  Position resolution:     x = 1.5 mm; y = 1.7 mm

## Singular Value Decomposition

- Funded under DOE SBIR grant to investigate alternative algorithms
- Developed two-step SVD:
- Coarse grid  (50 eigenvalues) to localize interaction region,		followed by fine grid (200 eigenvalues) over reduced space
- Works perfectly for a single interaction
- Currently tested for up to  3 segments x 2 interactions
- Results are certainly good enough to be used as input for standard least-squares
- < 6 ms / segment / CPU  (2GHz G5)
**Recent breakthrough:**
**   **Speed-up of SVD algorithm by factor 30 to 40 using Graphics Processing Units (GPUs) rather than CPUs.

**Singular Value Decomposition**

## Approval to start construction of all systems

Presentations at DOE panel (Aug. 14-15, 2007)
Responded to 12 recommendations from the review panel  (Sept. 6)
Energy Systems Acquisition Advisory Board approval granted (Oct. 30)
Scheduled completion date (CD4) :  Feb. 14, 2011

- Presentations at DOE panel (*Aug. 14-15, 2007*)
- Responded to 12 recommendations from the review panel  (*Sept. 6*)
- Energy Systems Acquisition Advisory Board approval granted (*Oct. 30*)
**Scheduled completion date (CD4) :  *****Feb. 14, 2011***

**CD2B / 3B**

## GRETINA is scheduled for completion by Feb 2011; it is time to begin planning for its utilization
Workshop in Oct 2007, organized by the GAC
“Optimizing GRETINA Science: A workshop dedicated to planning the first rounds of operation.”
Focused on how to best optimize the physics impact of GRETINA with unstable and stable beams. Also discussed the physics opportunities and infrastructure issues at each lab.
Participation and presenation by Susumu Shimoura, U. of Tokyo; expressed interest in hosting GRETINA at RIKEN

- Workshop in Oct 2007, organized by the GAC
- “Optimizing GRETINA Science: A workshop dedicated to planning the first rounds of operation.”
- Focused on how to best optimize the physics impact of GRETINA with unstable and stable beams. Also discussed the physics opportunities and infrastructure issues at each lab.
- Participation and presenation by Susumu Shimoura, U. of Tokyo; expressed interest in hosting GRETINA at RIKEN

**Siting**

## Outcomes of the workshop:
Unanimous agreement on a plan for the first physics campaigns
GRETINA should be assembled, tested, and commissioned at LBNL
Commissioning runs coupled to the BGS, coordinated by the GAC
Will serve as the major debugging phase for GRETINA, and produce important physics results on the spectroscopy of super heavy elements
Then rotated among the other national laboratories
~ 6 month campaigns at each location 
Suggested sequence for the first cycle:
MSU    -  NSCL
ORNL  -  HRIBF
ANL     -  ATLAS
“We look forward to further discussions with our Japanese colleagues and are excited about the possibility of future collaborations.”

- Unanimous agreement on a plan for the first physics campaigns
- GRETINA should be assembled, tested, and commissioned at LBNL
- Commissioning runs coupled to the BGS, coordinated by the GAC
- Will serve as the major debugging phase for GRETINA, and produce important physics results on the spectroscopy of super heavy elements
- Then rotated among the other national laboratories
- ~ 6 month campaigns at each location
- Suggested sequence for the first cycle:
- MSU    -  NSCL
- ORNL  -  HRIBF
- ANL     -  ATLAS
- “We look forward to further discussions with our Japanese colleagues and are excited about the possibility of future collaborations.”

**Siting**

## 1  4 coverage,   28  120 detectors

- Greater resolving power by factors of up to 100
- GRETA will be in great demand at the next generation RIB facility     - RIA Facility Workshop,   March 2004

**From GRETINA to GRETA**

-  GRETINA

-  GRETA

-  Gammasphere

## Gamma-Ray Tracking
	“... The construction of GRETA should begin upon successful completion of GRETINA. This gamma-ray energy tracking array will enable full exploitation of compelling science opportunities in nuclear structure, nuclear astrophysics, and weak interactions.”

- 	“... The construction of GRETA should begin upon successful completion of GRETINA. This gamma-ray energy tracking array will enable full exploitation of compelling science opportunities in nuclear structure, nuclear astrophysics, and weak interactions.”

**GRETA in the 2007 NSAC Long Range Plan**

## GRETINA design is complete

Construction is proceeding
Received  CD2B / 3B approval  Oct 2007

Scheduled completion date:  14 Feb 2011

We have proposed a plan for the first round of physics campaigns

GRETA received strong community support in LRP
“... construction of GRETA should begin upon successful completion of GRETINA”

- Construction is proceeding
- Received  CD2B / 3B approval  Oct 2007
- Scheduled completion date:  14 Feb 2011
- We have proposed a plan for the first round of physics campaigns
- GRETA received strong community support in LRP
- “... construction of GRETA should begin upon successful completion of GRETINA”

**Summary**

## Backup Slides

**Backup Slides**

## Front segmentation lines are within 0.2 mm of correct position
Accuracy of measurement is 0.15 mm
Reproducibility after crystal replacement is 0.2 mm

- Accuracy of measurement is 0.15 mm
- Reproducibility after crystal replacement is 0.2 mm

**Best fit to the segmentation lines**

**Q1 Front Surface Scan**

## Energy resolution specifications (keV FWHM)
				(mean)	(max.)
	Central Contact  	2.25	2.35 	   at 1332 keV
			      	1.25 	1.35	   at   122 keV
	Segments			 2.3 	   at 1332 keV
					 1.4	   at   122 keV

- 				(mean)	(max.)
- 	Central Contact  	2.25	2.35 	   at 1332 keV
- 			      	1.25 	1.35	   at   122 keV
- 	Segments			 2.3 	   at 1332 keV
- 					 1.4	   at   122 keV

**Q1 Energy Resolution**

## Signal Decomposition

- GEANT simulations;
- 1 MeV gamma into GRETA
- Most hit crystals have one or two hit segments
- Most hit segments have one or two interactions

**Signal Decomposition**

## Examples of calculated signals: Sensitivity to position

- Hit segment

- Image charge

**Examples of calculated signals: Sensitivity to position**

- Image charge

**Signals color-coded for position**

## Event Building Data Flow:

*Segment events*

*Crystal events*

**Signal Decomposition **

*Interaction points*

**Global Event Builder**

**Tracking**

- 36 segments
- per detector

- 1-30 crystals

*Global Events*

- Data from
- Auxiliary
- Detectors

**Analysis & Archiving**

**Signal Decomposition**

## The old Signal Decomposition algorithm for GRETINA made use of a Cartesian grid.

An irregular quasi-cylindrical grid has several important advantages:
The possibility to optimize the spacing of points in the grid based on separation in "Chi-squared space"
Reducing the number of grid points results in improved speed
Constructing the grid around the real segment volumes allows much better and faster constraints to be programmed into the least-squares search algorithms

- An irregular quasi-cylindrical grid has several important advantages:
- The possibility to optimize the spacing of points in the grid based on separation in "Chi-squared space"
- Reducing the number of grid points results in improved speed
- Constructing the grid around the real segment volumes allows much better and faster constraints to be programmed into the least-squares search algorithms

**Quasi-Cylindrical Grid for GRETINA Signal Decomposition**

- Different colors show active regions for the different segments

## GRETINA signal decomposition algorithm

Was the part of GRETINA that entailed the largest technological risk
Current algorithm is a hybrid
Adaptive Grid Search with Linear Least-Squares (for energies)
Non-linear Least-Squares  (a.k.a. SQP)
Have also been developing Singular Value Decomposition
Plan to incorporate SVD into final algorithm for Nseg > 2

CPU time required goes as
   	Adaptive Grid Search :         ~ O(300n)
   	Singular Value Decomp :     ~ O(n)
   	Nonlinear Least-Squares :   ~ O(n  + n2)
					for  n  interactions

- Was the part of GRETINA that entailed the largest technological risk
- Current algorithm is a hybrid
*Adaptive Grid Search with Linear Least-Squares (for energies)*
*Non-linear Least-Squares  (a.k.a. SQP)*
- Have also been developing *Singular Value Decomposition*
- Plan to incorporate SVD into final algorithm for Nseg > 2
- CPU time required goes as
-    	Adaptive Grid Search :         ~ O(300n)
-    	Singular Value Decomp :     ~ O(n)
-    	Nonlinear Least-Squares :   ~ O(n  + n2)
- 					for  n  interactions

**Signal Decomposition**

## Why is it hard?

- Average segment ~ 6000 mm3, so for ~ 1 mm position sensitivity
-  two interactions in one segment: ~ 2 x 106 possible positions
-   two interactions in each of two segments:   ~ 4 x 1012 positions
-   two interactions in each of three segments: ~ 8 x 1018 positions
- 		PLUS energy sharing, time-zero, ...
- Underconstrained fits, especially with > 1 interaction/segment
- For one segment, the signals provide only 					~ 9 x 40 = 360  nontrivial numbers
- Strongly-varying, nonlinear sensitivity
-  2/(z)  is much larger near segment boundaries

**Why is it hard?**

## Fitting to Extract Cross-Talk Parameters

-   36 “superpulses” : averaged signals from many single-segment events (red)
-   Monte-Carlo simulations used to generate corresponding calculated signals (green)
-   996 parameters fitted (integral and differential cross-talk, delays, rise times) (blue)
-   Calculated response can then be applied to decomposition “basis signals”

## In-Beam test

- Crystal A of prototype-III triple; new grid and basis

-  Derived average effective position resolution:    x = 2.1 mm in 3D

## Comparison – Old Basis and Code vs. New

**Old**

**New**

- Distribution of deduced interactions points throughout the crystal

## Signal Decomposition

**Signal Decomposition**

## Signal Decomposition

**Signal Decomposition**

## Singular Value Decomposition

- The full signal -vs.- grid position matrix can be decomposed into the product of three matrices, one of which contains the correlations (eigenvalues).

**Singular Value Decomposition**

- =

-  MxN	             MxN	    NxN	        NxN

- N voltages

- M interaction sites

- A = UWVT

## Singular Value Decomposition

- The full signal -vs.- grid position matrix can be decomposed into the product of three matrices, one of which contains the correlations (eigenvalues).
- By neglecting the small eigenvalues, the length of the signal vectors (and hence computation with them) can be greatly reduced.

**Singular Value Decomposition**

- =

- 

-  MxN	             MxN	    NxN	        NxN               Mxn   nxn        nxN

- N voltages

- M interaction sites

- A = UWVT

## Singular Value Decomposition

- The full signal -vs.- grid position matrix can be decomposed into the product of three matrices, one of which contains the correlations (eigenvalues).
- By neglecting the small eigenvalues, the length of the signal vectors (and hence computation with them) can be greatly reduced.
- The more eigenvalues kept, the higher the quality of the fit.

**Singular Value Decomposition**

- =

- 

-  MxN	             MxN	    NxN	        NxN               Mxn   nxn        nxN

- N voltages

- M interaction sites

- A = UWVT

## Singular Value Decomposition

- Very roughly:
- The full signal -vs.- grid position matrix can be decomposed into the product of three matrices, one of which contains the correlations (eigenvalues).
- By neglecting the small eigenvalues, the length of the signal vectors (and hence computation with them) can be greatly reduced.
- The more eigenvalues kept, the higher the quality of the fit.
- Measured signals can be compressed the same way as, and then compared to, the calculated library signals.
- Different similarity measures can be used to emphasize different aspects.

- Dot Product
- Cosine
- Euclidean Distance

## 2D projections of SVD amplitudes
	Interaction sites at (13,9,11) and (8,11,11)

- 	Interaction sites at (13,9,11) and (8,11,11)

**New SVD Results**

## Adaptive grid search fitting:

- Energies *e**i** *and *e**j* are constrained, such that 0.1(*e**i*+*e**j*)  *e**i*  0.9(*e**i*+*e**j*)
- Once the best pair of positions (lowest 2) is found, then all neighbor pairs are examined on the finer (1x1x1 mm) grid.  This is 26x26 = 676 pairs.  If any of them are better, the procedure is repeated.
- For this later procedure, the summed signal-products cannot be precalculated.
- Finally, nonlinear least-squares (SQP) can be used to interpolate off the grid.  This improves the fit ~ 50% of the time.

**Signal Decomposition**

## Some numbers for adaptive grid search:

- ~35000 grid points in 1/6 crystal  (one column, 1x1x1 mm)
- 2x2x2mm (slices 1-3) or 3x3x3 mm (slices 4-6) coarse grid gives 		N  600 course grid points *per segment.*
- For two interactions in one segment, have N(N-1)/2  1.8 x 105 pairs of 	points for grid search.  This takes ~ 3 ms/cpu  to run through.
- But (N(N-1)/2)2  ~  3.2 x 1010  combinations for two interactions in each 	of 2 segments; totally unfeasible!
- Limit N to only 64 points; then   (N(N-1)/2)2  ~ 4 x 106
-       --  this may be okay.  But 4 unknowns will require matrix inversion.
- But (N(N-1)/2)3  ~  8 x 109  combinations for two interactions in each of 3 	segments; still impossible.

**Signal Decomposition**

## Remaining To-Do List

Improve understanding of charge carrier mobilities

Allow for occasional three interactions per segment

Incorporate Singular Value Decomposition
 		   e.g.   	SVD  least-squares
			SVD  grid search  least-squares

Develop better metrics and examine failure modes in detail

Try to determine basis signals directly from observed calibration source signals, either collimated or uncollimated

- Improve understanding of charge carrier mobilities
- Allow for occasional three interactions per segment
- Incorporate Singular Value Decomposition
-  		   e.g.   	SVD  least-squares
- 			SVD  grid search  least-squares
- Develop better metrics and examine failure modes in detail
- Try to determine basis signals directly from observed calibration source signals, either collimated or uncollimated

**Signal Decomposition**

## Karin Lagergren (ORNL / UTK)
Signal calculation code in C
Optimized pseudo-cylindrical grid

I-Yang Lee
Original signal calculation code

M. Cromaz, A. Machiavelli, P. Fallon, M. Descovich, J. Pavan, ...
In-beam data analysis, simulations, electric field calculations, etc.

Tech-X Corp, especially Isidoros Doxas
SVD development

- Signal calculation code in C
- Optimized pseudo-cylindrical grid
- I-Yang Lee
- Original signal calculation code
- M. Cromaz, A. Machiavelli, P. Fallon, M. Descovich, J. Pavan, ...
- In-beam data analysis, simulations, electric field calculations, etc.
- Tech-X Corp, especially Isidoros Doxas
- SVD development

**Acknowledgements**

## GRETA Cost and Schedule

**Start FY08, complete FY16**

-  As fast as allowed by detector production schedule.
-  No gap between GRETINA and GRETA
-  Physics program to start 2011 with continued growth of capabilities.
-  Match FRIB schedule, GRETA will be ready when FRIB starts
-  Competing European project AGATA plan to be completed in 2016

**Program**
**Starts**

**GRETA Cost and Schedule**