Abstract

In this paper we present high sample rate array architectures, stack filter-based architectures and sorting network-based architectures for computing recursive median filters. We first develop non-pipelined architectures with lower sample periods than existing architectures, and then reduce the sample period further by pipelining. Pipelining is achieved by developing new recursive algorithms which have additional delays in the feedback paths, and using the delays as pipeline latches. We show that for 2 levels of pipelining, the sample period of the array and stack filter-based architectures reduces by a factor of 2; the sample period does not however reduce proportionately for higher levels of pipelining because of the large implementation overhead. The sample period of sorting network-based architectures, on the other hand, can be reduced to any level for MSB-first implementations.

Original languageEnglish (US)
Title of host publicationPlenary, Special, Audio, Underwater Acoustics, VLSI, Neural Networks
PublisherPubl by IEEE
PagesI-413-I-416
ISBN (Print)0780309464
StatePublished - Jan 1 1993
Event1993 IEEE International Conference on Acoustics, Speech and Signal Processing - Minneapolis, MN, USA
Duration: Apr 27 1993Apr 30 1993

Publication series

NameProceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
Volume1
ISSN (Print)0736-7791

Other

Other1993 IEEE International Conference on Acoustics, Speech and Signal Processing
CityMinneapolis, MN, USA
Period4/27/934/30/93

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Chakrabarti, C. (1993). VLSI architectures for recursive median filters. In Plenary, Special, Audio, Underwater Acoustics, VLSI, Neural Networks (pp. I-413-I-416). (Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing; Vol. 1). Publ by IEEE.