Sorting network based architectures for median filters

Research output: Contribution to journalArticle

32 Citations (Scopus)

Abstract

Sorting network based architectures for computing nonrecursive and recursive median filters are presented. The proposed architectures are highly pipelined and consist of fewer compare-swap units than existing architectures. The reduction in the number of compare-swap units is achieved by minimizing computational overlap between successive outputs and also by using Batcher's odd-even merge sort (instead of bubble-sort). The latency of these networks is reduced by building them with sorting units that sort 2 elements (sort-2) as well as 3 elements (sort-3) in 1 time unit.

Original languageEnglish (US)
Pages (from-to)723-727
Number of pages5
JournalIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Volume40
Issue number11
DOIs
StatePublished - Nov 1993

Fingerprint

Median filters
Sorting

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

@article{ee086c6813914117bfe93252bb7da440,
title = "Sorting network based architectures for median filters",
abstract = "Sorting network based architectures for computing nonrecursive and recursive median filters are presented. The proposed architectures are highly pipelined and consist of fewer compare-swap units than existing architectures. The reduction in the number of compare-swap units is achieved by minimizing computational overlap between successive outputs and also by using Batcher's odd-even merge sort (instead of bubble-sort). The latency of these networks is reduced by building them with sorting units that sort 2 elements (sort-2) as well as 3 elements (sort-3) in 1 time unit.",
author = "Chaitali Chakrabarti",
year = "1993",
month = "11",
doi = "10.1109/82.251840",
language = "English (US)",
volume = "40",
pages = "723--727",
journal = "IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing",
issn = "1549-7747",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - Sorting network based architectures for median filters

AU - Chakrabarti, Chaitali

PY - 1993/11

Y1 - 1993/11

N2 - Sorting network based architectures for computing nonrecursive and recursive median filters are presented. The proposed architectures are highly pipelined and consist of fewer compare-swap units than existing architectures. The reduction in the number of compare-swap units is achieved by minimizing computational overlap between successive outputs and also by using Batcher's odd-even merge sort (instead of bubble-sort). The latency of these networks is reduced by building them with sorting units that sort 2 elements (sort-2) as well as 3 elements (sort-3) in 1 time unit.

AB - Sorting network based architectures for computing nonrecursive and recursive median filters are presented. The proposed architectures are highly pipelined and consist of fewer compare-swap units than existing architectures. The reduction in the number of compare-swap units is achieved by minimizing computational overlap between successive outputs and also by using Batcher's odd-even merge sort (instead of bubble-sort). The latency of these networks is reduced by building them with sorting units that sort 2 elements (sort-2) as well as 3 elements (sort-3) in 1 time unit.

UR - http://www.scopus.com/inward/record.url?scp=0027703194&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027703194&partnerID=8YFLogxK

U2 - 10.1109/82.251840

DO - 10.1109/82.251840

M3 - Article

AN - SCOPUS:0027703194

VL - 40

SP - 723

EP - 727

JO - IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

JF - IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

SN - 1549-7747

IS - 11

ER -