Abstract
An adaptive optimization algorithm for the design of a new class of stack filters is presented. Unlike stack smoothers, this new class of stack filters, based on mirrored threshold decomposition, has been empowered not only with lowpass filtering characteristics but with bandpass and highpass filtering characteristics as well. Therefore, these filters can be effectively used in applications where frequency selection is critical. An adaptive optimization approach is introduced, where the positive Boolean function (PBF) that characterizes the stack filter in the binary domain of mirrored threshold decomposition is represented by a soft truth table where each possible binary input sequence is mapped to a real number in the interval [-1, 1]. At each iteration of the adaptive algorithm, the probability that the PBF makes the correct decision when a given input sequence is presented is incremented by suitably changing the entries of the soft truth table. The proposed adaptive algorithm is simple to implement since it requires only increment, decrement, and local comparison operations. The performance of optimal stack filters is illustrated by several simulations.
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.
