Overview
Takes an array of std_logic_vector's and finds the earilest and latest vector in the array, under the assumption that the input vectors are all grouped closer than 1/2 the vector's range, and that such a group may span over the vector's boundary, e.g. 510, 511, 0, 1, ...
Currently using 9-bit window counter as input. Would like to switch to window & 8ns-resolution timestamp, i.e. 11-bit input, then provide starting window & sample to DigitizeAndShiftOutData. We still have to digitize whole windows, but we can shift out only the samples we care about. As shifting is the most time-expensive part of the process, this idea is appealing, but needs to be worked out in detail.
Definition at line 22 of file CalculateROI.vhd.