DocumentCode :
3217002
Title :
Fast bit-pipeline rank filter
Author :
Prokin, Dragana ; Prokin, Milan
Author_Institution :
Sch. of Electr. & Comput. Eng. of Prof. Studies, Univ. of Belgrade, Belgrade, Serbia
fYear :
2011
fDate :
22-24 Nov. 2011
Firstpage :
882
Lastpage :
887
Abstract :
The major benefit of disclosed low hardware complexity bit-pipeline rank filter is the reduction in hardware complexity and the increase in processing speed, due to identical pipelined stages and the absence of mask bits. FPGA realization of this filter significantly reduces the number of used logic elements and registers in comparison with best prior art methods, while at the same time increases maximum operating frequency. One rank sample result is available at the output per each clock cycle, thus enabling real-time nonlinear image processing.
Keywords :
field programmable gate arrays; filtering theory; image processing; logic devices; nonlinear filters; shift registers; FPGA realization; fast bit-pipeline rank filter; field programmable gate array; hardware complexity; logic elements; maximum operating frequency; processing speed; realtime nonlinear image processing; registers; Complexity theory; Field programmable gate arrays; Hardware; Maximum likelihood detection; Nonlinear filters; Registers; Rank filters; median filters; nonlinear filters; pipeline processing; very-large-scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Telecommunications Forum (TELFOR), 2011 19th
Conference_Location :
Belgrade
Print_ISBN :
978-1-4577-1499-3
Type :
conf
DOI :
10.1109/TELFOR.2011.6143686
Filename :
6143686
Link To Document :
بازگشت