1. 1 Hot/dead map 22 Jul 2011 Hiroyuki Sako JAEA 1. Run-by-run bad chip map 2. Hot/dead pixel map

2. 2 1. Run-by-run dead/hot chip selection Purpose To identify bad (dead or hot) chips for each run Selected “best” data set –200 GeV Au data after last repair –Run 346973-349680 –~60 % of the total 200 GeV Au

3. 3 Procedure For each chip, plot rate / chip for each run If the rate distribution has a clean single peak, fit by Gaussian to determine the rate range to select good runs (+-5  )

4. 4 Rate/chip Example (B0) M0 M1 M2 M3 M4 Red=fit Blue=data C0 C7 C1 C2C3 C4C5C6

5. 5 Range 1 Module 28, Chip 0 Range 0 Cut0 Cut1 –If the distribution has multiple peaks, check run dependence If there is a discrete change, separate run ranges –Fit the peak in each range separately to define the cuts –Run ranges are different for each chip »Mostly the ranges are common within a module (half-ladder) »Separating map for each chip is necessary in DB A pixel map for each chip in each run range Run boundary Rate Run number

6. 6 Rate/chip example (B1) M29 M28 M27 Double peaks M26 M25 C0 C7 C1 C2C3 C4C5C6

7. 7 Other examples

8. 8 Some sick chips Continuous variations Scattered (unstable) distributions Those chips are masked forever

9. 9 Summary of chips Sick(7) Dead(99) Multiple peaks(45)

10. 10 Fit results Rate mean Rate sigma Barrel 0 Barrel 1 Module*8+chip

11. 11 Check for the run-by-run cuts Dead chip (107/480) Hot chip (4/480)

12. 12 2. Hot/dead pixel map A map in a long run range for each chip Dead and hot pixel criteria All chips in B0All chips in B1 Module 0 (B0) Module 20 (B1) Hot Nor mal Nor mal Dead 0.0004 0.0034 0.000150.0023

13. 13 Pixel map examples Module0 Chip0 (B0) Module20 Chip0 (B1) Hot/Dead MapHit distribution Normal pixel Dead pixel

14. 14 Hot/dead map example (2) Module 18 Chip 1 (B0) Run 346973- 347899 Run 347900- 349680

15. 15 Schematic view of hot/dead maps in DB Pixel-by-pixel map for each chip in a long run range –Run ranges different for each chip Chip 0 Chip 1 Chip 2 Chip 3 … Chip 479 Run number Pixel map 1A Pixel map1B Pixel map 0A Rate Cut criteria Pixel map 2A Pixel map 2B Pixel map 2C Chip-by-chip map for each run Rate cuts are determined in each run range

16. 16 Status With 200 GeV data after last repair Determined rate cuts for all chips Chip maps (text) were made for all the runs Created pixel maps (text) for each chip for each run range To do Implementing offline codes for chip maps and pixel maps (to be done soon!) –offline/database/pdbcal/base –Offline/database/pdbcal/pg Interface –Offline/packages/svx/SvxPixelHotDeadMap

17. 17 Chip map for each run (plan) One entry for each run Store only bad chips –short module –short chip –short status (dead=-1,normal=0,hot=1)

18. 18 Pixel map in DB (plan) One data set for each chip for each run range bankId = module*8+ROC Start timestamp = start time of the first run End timestamp = end time of the last run Store only dead/hot pixels –unsigned char module –unsigned char ROC –unsigned char column –unsigned char row –signed char status (dead=-1,normal=0,hot=1) Note In packages/svx/SvxPixelHotDeadMap, a complete pixel map is made for a given run with a chip map and pixel maps No pixel map necessary for always dead or sick chips If there is a difference in hot/dead pixels in segments of runs (typically 10 such pixels per run) –Take OR of hot/dead pixels

19. 19 Module 10-14 Smoothly varying rates M10

20. 20 M30 M31 M32 M33 M34 Scattered distributions

21. 21

22. 22

23. 23 Hot/dead map example(3) Module 29 Chip 4 (B1) Run 346973- 347759 Run 347760- 349680