Abstract

This paper presents efficient stack filter implementations of rank order filters for bit-parallel, bit-serial, and nibble-serial data. The implementations support variations in word size, window size and rank order. All the implementations are sampled at a high rate by efficient incorporation of pipelining. While the bit-parallel realizations are pipelined by adding latches in the feed-forward paths, the recursive bit-serial and nibble-serial realizations are pipelined to p levels by increasing the number of PBF units by a factor of 2p-1. The computational complexity of the bit-parallel realizations is reduced by processing a block of outputs, thereby exploiting the computational overlap between consecutive windows.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages958-961
Number of pages4
Volume1
ISBN (Print)0780312813
StatePublished - 1993
Event1993 IEEE International Symposium on Circuits and Systems - Chicago, IL, USA
Duration: May 3 1993May 6 1993

Other

Other1993 IEEE International Symposium on Circuits and Systems
CityChicago, IL, USA
Period5/3/935/6/93

Fingerprint

Computational complexity
Processing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Cite this

Chakrabarti, C. (1993). Efficient stack filter implementations of rank order filters. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 1, pp. 958-961). Piscataway, NJ, United States: Publ by IEEE.

Efficient stack filter implementations of rank order filters. / Chakrabarti, Chaitali.

Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 1 Piscataway, NJ, United States : Publ by IEEE, 1993. p. 958-961.

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

Chakrabarti, C 1993, Efficient stack filter implementations of rank order filters. in Proceedings - IEEE International Symposium on Circuits and Systems. vol. 1, Publ by IEEE, Piscataway, NJ, United States, pp. 958-961, 1993 IEEE International Symposium on Circuits and Systems, Chicago, IL, USA, 5/3/93.
Chakrabarti C. Efficient stack filter implementations of rank order filters. In Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 1. Piscataway, NJ, United States: Publ by IEEE. 1993. p. 958-961
Chakrabarti, Chaitali. / Efficient stack filter implementations of rank order filters. Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 1 Piscataway, NJ, United States : Publ by IEEE, 1993. pp. 958-961
@inproceedings{6155c099a6c248bf9a35dfd63e47c12d,
title = "Efficient stack filter implementations of rank order filters",
abstract = "This paper presents efficient stack filter implementations of rank order filters for bit-parallel, bit-serial, and nibble-serial data. The implementations support variations in word size, window size and rank order. All the implementations are sampled at a high rate by efficient incorporation of pipelining. While the bit-parallel realizations are pipelined by adding latches in the feed-forward paths, the recursive bit-serial and nibble-serial realizations are pipelined to p levels by increasing the number of PBF units by a factor of 2p-1. The computational complexity of the bit-parallel realizations is reduced by processing a block of outputs, thereby exploiting the computational overlap between consecutive windows.",
author = "Chaitali Chakrabarti",
year = "1993",
language = "English (US)",
isbn = "0780312813",
volume = "1",
pages = "958--961",
booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Efficient stack filter implementations of rank order filters

AU - Chakrabarti, Chaitali

PY - 1993

Y1 - 1993

N2 - This paper presents efficient stack filter implementations of rank order filters for bit-parallel, bit-serial, and nibble-serial data. The implementations support variations in word size, window size and rank order. All the implementations are sampled at a high rate by efficient incorporation of pipelining. While the bit-parallel realizations are pipelined by adding latches in the feed-forward paths, the recursive bit-serial and nibble-serial realizations are pipelined to p levels by increasing the number of PBF units by a factor of 2p-1. The computational complexity of the bit-parallel realizations is reduced by processing a block of outputs, thereby exploiting the computational overlap between consecutive windows.

AB - This paper presents efficient stack filter implementations of rank order filters for bit-parallel, bit-serial, and nibble-serial data. The implementations support variations in word size, window size and rank order. All the implementations are sampled at a high rate by efficient incorporation of pipelining. While the bit-parallel realizations are pipelined by adding latches in the feed-forward paths, the recursive bit-serial and nibble-serial realizations are pipelined to p levels by increasing the number of PBF units by a factor of 2p-1. The computational complexity of the bit-parallel realizations is reduced by processing a block of outputs, thereby exploiting the computational overlap between consecutive windows.

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

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

M3 - Conference contribution

AN - SCOPUS:0027229825

SN - 0780312813

VL - 1

SP - 958

EP - 961

BT - Proceedings - IEEE International Symposium on Circuits and Systems

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -