| Popis: |
In this paper an optimized architecture for implementation of ROF is presented. The architecture is based on sorting network architecture algorithm optimized for each rank and consists of significantly fewer comparators than the existing architectures that are based on bubble-sort and quick-sort (Cardells-Tormo and Molinet, 2006). The reduction in comparators is obtained by sorting the columns of the window only once, and then merging the elements based on the range of the ranks the column sorted elements would occupy. The design of architecture is further optimized using the concepts of parallelism and pipelining to store the sorted columns of one window for processing the next successive overlapping windows (Gonzalez and Woods, 2000 and Archana et al., 2005).The architecture is pipelined which processes one pixel per clock cycle, thus to process an image of size 256 × 256 it requires 0.65ms when a clock of 100MHz is used and hence is suitable for real time applications. |
