DocumentCode :
2987142
Title :
A comparison of 2-D discrete wavelet transform computation schedules on FPGAs
Author :
Angelopoulou, Maria ; Masselos, Konstantinos ; Cheung, Peter ; Andreopoulos, Yiannis
Author_Institution :
Dept. of Electr. & Electron. Eng., Imperial Coll. London
fYear :
2006
fDate :
Dec. 2006
Firstpage :
181
Lastpage :
188
Abstract :
When it comes to the computation of the 2D discrete wavelet transform (DWT), three major computation schedules have been proposed, namely the row-column, the line-based and the block-based. In this work, the lifting-based designs of these schedules are implemented on FPGA-based platforms to execute the forward 2D DWT, and their comparison is presented. Our implementations are optimized in terms of throughput and memory requirements, in accordance with the specifications of each one of the three computation schedules and the lifting decomposition. All implementations are parameterized with respect to the image size and the number of decomposition levels. Experimental results prove that the suitability of each implementation for a particular application depends on the given specifications, concerning the throughput and the hardware cost
Keywords :
discrete wavelet transforms; field programmable gate arrays; 2D discrete wavelet transform; FPGA; Buildings; Costs; Discrete wavelet transforms; Educational institutions; Field programmable gate arrays; Filtering; Hardware; Hydrogen; Processor scheduling; Throughput;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Field Programmable Technology, 2006. FPT 2006. IEEE International Conference on
Conference_Location :
Bangkok
Print_ISBN :
0-7803-9729-0
Electronic_ISBN :
0-7803-9729-0
Type :
conf
DOI :
10.1109/FPT.2006.270310
Filename :
4042432
Link To Document :
بازگشت