DocumentCode
2894654
Title
How fast is an FPGA in image processing?
Author
Saegusa, Takashi ; Maruyama, Tsutomu ; Yamaguchi, Yoshiki
Author_Institution
Tsukuba Univ., Tsukuba
fYear
2008
fDate
8-10 Sept. 2008
Firstpage
77
Lastpage
82
Abstract
In image processing, FPGAs have shown very high performance in spite of their low operational frequency. This high performance comes from (1) high parallelism in applications in image processing, (2) high ratio of 8 bit operations, and (3) a large number of internal memory banks on FPGAs which can be accessed in parallel. In the recent micro processors, it becomes possible to execute SIMD instructions on 128 bit data in one clock cycle. Furthermore, these processors support multi-cores and large cache memory which can hold all image data for each core. In this paper, we compare the performance of FPGAs with those processors using three applications in image processing; two-dimensional filters, stereo-vision and k-means clustering, and make it clear how fast is an FPGA in image processing, and how many hardware resources are required to achieve the performance.
Keywords
field programmable gate arrays; image processing; pattern clustering; stereo image processing; 2D filters; FPGA; image processing; k-means clustering; stereo vision; Cache memory; Circuits; Clocks; Field programmable gate arrays; Filters; Frequency; Hardware; Image processing; Parallel processing; Systems engineering and theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Field Programmable Logic and Applications, 2008. FPL 2008. International Conference on
Conference_Location
Heidelberg
Print_ISBN
978-1-4244-1960-9
Electronic_ISBN
978-1-4244-1961-6
Type
conf
DOI
10.1109/FPL.2008.4629911
Filename
4629911
Link To Document