This page provides an overview of the status and inner workings of the TES Readout development and eventual implementation.
Description of TES
PseudoCode
Benchmarks
This table lists the latest benchmarks.
Currently, it evaluates the average time (over 1e6 iterations) to complete the number of products indicated as well as the sum of the resulting vector. The length of the vector varies according to the number of samples.
The code currently uses a simple decision tree which directly indicates how many filters to use. In the future this tree will determine the case to use depending on which windows have a hit.
All values are in μs.
Number of products Number of samples | 1 | 2 | 3 | 4 | 5 |
|---|---|---|---|---|---|
| 100 | 0.061 | 0.074 | |||
| 200 | 0.113 | 0.145 | |||
| 300 | 0.150 | 0.190 | |||
| 400 | 0.200 | 0.266 | |||
| 500 | 0.239 | 0.321 | |||
| 600 | 0.279 | 0.378 | |||
| 700 | 0.318 | 0.435 |
Tasks
Overview
Content Tools