Median filter architecture based on sorting networks

Chaitali Chakrabarti, Suhel Dhanani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

This paper presents a sorting network based architecture for computing 2-dimensional median filters in real-time. The median computing network is a modified version of Batcher's sorting network with compare-swap units which sort 2 elements (sort-S) as well as 3 elements (sort-3) in 1 time unit. Introduction of sort-3 units reduces the latency of the network without loss of regularity. A (3 x 3) median filter has been implemented in 2 micron CMOS using this approach. The architecture is completely pipelined and operates in the bit-serial mode with 8 bit precision. The operating speed is 40 MHz.

Original languageEnglish (US)
Title of host publication1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1069-1072
Number of pages4
ISBN (Electronic)0780305930
DOIs
StatePublished - 1992
Event1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992 - San Diego, United States
Duration: May 10 1992May 13 1992

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
Volume3
ISSN (Print)0271-4310

Conference

Conference1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992
Country/TerritoryUnited States
CitySan Diego
Period5/10/925/13/92

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Median filter architecture based on sorting networks'. Together they form a unique fingerprint.

Cite this