An algorithm for order statistic determination and L-filtering

Abstract

An algorithm is presented for order-statistic determination which operates in a number of steps fewer than or equal to the number of bits in the binary representation of the input. The algorithm uses a bit-level thresholding operation on input data in binary representation with both adaptive thresholds and adaptive binary weights, and it does not require any auxiliary data structure. A bit-level pipelined implementation for this scheme is also presented whose hardware complexity is bounded by N(log/sub 2/N) where N is the window size; this leads to a pipelined structure for L-filtering.<>