Referenced Items are not available for this document.
A class of selection algorithms using binary partition that are very efficient for median and rank order filtering is considered. A unified discussion of these algorithms is presented. The algorithms have better time-area complexity than sorting methods. Counting, firing, and updating are the three basic steps. A generic structure is proposed to realize these algorithms. They can be implemented by simple and regular modules in VLSI
Published in:
Signal Processing, IEEE Transactions on
(Volume:41
,
Issue:
9
)
Date of Publication: Sep 1993
- Page(s):
- 2937 - 2942
- ISSN :
- 1053-587X
- INSPEC Accession Number:
- 4563674
- Digital Object Identifier :
- 10.1109/78.236516
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Sep 1993
- Sponsored by :
- IEEE Signal Processing Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
