Register-Like Storage Block Used as Cluster Buffers, Histograms, and Hough Transform Accumulators for HEP Trigger Systems

TL;DR

This paper introduces a register-like storage block design for high energy physics trigger systems that enables fast read/write operations, boundary coverage, and efficient memory refresh within a single clock cycle, improving performance for binned searching algorithms.

Contribution

A novel register-like storage architecture tailored for HEP trigger systems that supports rapid updates, boundary-aware reads, and efficient resets, addressing cost and performance issues of traditional register arrays.

Findings

Supports single-cycle read/write operations

Enables boundary coverage during reading

Efficiently refreshes entire memory in one cycle

Abstract

In high energy physics experiment trigger systems, block memories are utilized for various purposes, especially in binned searching algorithms. In these algorithms, the storages are demanded to perform like a large set of registers. The writing and reading operation must be performed in single clock cycle and once an event is processed, the memory must be globally reset. These demands can be fulfilled with registers but the cost of using registers for large memory is unaffordable. Another common requirement is the boundary coverage feature during reading process. When a memory bin is addressed, the stored contents in the addressed bin and its neighboring bin must be output simultaneously. In this paper, a register-like block storage design scheme is described, which allows updating memory locations in single clock cycle, reading two adjacent bins, and effectively refreshing entire memory within a single clock. The implementation and test results are presented.