Proceedings of the IEEE 1998 Custom Integrated Circuits Conference (Cat. No.98CH36143)
DOI: 10.1109/cicc.1998.694960
|View full text |Cite
|
Sign up to set email alerts
|

Architecture and implementation of a bitserial sorter for weighted median filtering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…This is due to the fact, that the physically optimized median implementation has been optimized for silicon area and energy per sample and not for maximum throughput rate [33]. This is due to the fact, that the physically optimized median implementation has been optimized for silicon area and energy per sample and not for maximum throughput rate [33].…”
Section: Comparison Of Implementations On Different Architecture Blocksmentioning
confidence: 99%
“…This is due to the fact, that the physically optimized median implementation has been optimized for silicon area and energy per sample and not for maximum throughput rate [33]. This is due to the fact, that the physically optimized median implementation has been optimized for silicon area and energy per sample and not for maximum throughput rate [33].…”
Section: Comparison Of Implementations On Different Architecture Blocksmentioning
confidence: 99%
“…Many of them are based on sorting algorithm [11,22,23,[25][26][27][28]. They considered the operation of rank-order filtering as two steps: sorting and choosing.…”
Section: Introductionmentioning
confidence: 99%