Abstract
We present a novel algorithm for calculating the running maximum or minimum value of a 1-D sequence over a sliding data window. The new algorithm stores a pruned ordered list of data elements that have the potential to become maxima or minima across the data window at some future time instant. This algorithm has a number of advantages over competing algorithms, including balanced computational requirements for a variety of signals and the potential for reduced processing and storage requirements for long data windows. We show through both analysis and simulation that for an L-element running window, the new algorithm uses approximately three comparisons and 2logL+1 memory locations per output sample on average for i.i.d. signals, independent of the signal distribution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
