By Topic

Fast VLSI architecture for rank order based filtering using a bit-serial window partitioning technique

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
C. E. Savin ; Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada ; M. O. Ahmad ; M. N. S. Swamy

Based on a recently proposed algorithm for stack filtering, the bit-serial window partitioning (BSWP) algorithm, a new architecture suitable for the VLSI implementation of very fast rank order based filters for signal and image processing, is developed. The proposed architecture provides important improvements in terms of the running time (i.e., of the order of 30%-40%) compared to the conventional bit-serial binary tree search configuration for stack filtering, at the expense of only slightly increased chip area. The improved computational efficiency is obtained by evaluating the Boolean function at thresholds corresponding to the sample-values within the filter-window, and by taking advantage of the ordering information associated with the threshold sequences

Published in:

Circuits and Systems, 1997. Proceedings of the 40th Midwest Symposium on  (Volume:2 )

Date of Conference:

3-6 Aug 1997