By Topic

FPGA Implementation of a 3/spl times/3 window median filter based on a new efficient bit-serial sorting algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tae-Wook Lee ; Sch. of Electr. Eng., Ulsan Univ., South Korea ; Jong-Hwa Lee ; Sang-Bock Cho

In this paper, we proposed a new efficient bit-serial sorting algorithm for an implementation of 3/spl times/3 window median filter. The proposed algorithm is based on a majority concept in determining the bits of the median value. The majority function is implemented by an optimized nine-bit sorting network, which is more efficient than the existing ones. The algorithm was implemented by VHDL and graphical environment in MAX+PlusII of ALTERA. The simulation results indicate that the circuit is capable of running at 37.59 MHz and is composed of 462 logic cells.

Published in:

Science and Technology, 2003. Proceedings KORUS 2003. The 7th Korea-Russia International Symposium on  (Volume:2 )

Date of Conference:

6-6 July 2003