Comparison of Implementations between Haar Wavelet Transform and FFT on FPGA
Mousa K. Wali1, Zahra Qasim2

1Dr. Mousa K.Wali, Assistant Professor, Dean of Electrical Engineering Technical College, Middle Technical University, Baghdad, Iraq.
2Zahra Qasim, MSc Student, Department of Computer Engineering, Electrical Engineering Technical College, Middle Technical University, Baghdad, Iraq.
Manuscript received on June 04, 2018. | Revised Manuscript received on June 12, 2018. | Manuscript published on June 30, 2018. | PP: 1-10 | Volume-5 Issue-6, June 2018. | Retrieval Number: F1246065618
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: This research presents a design for both Fast Fourier Transform (FFT) and Fast Discrete wavelet transform (FDWT) by using the simplest algorithms in their respective design. Both the Haar wavelet and Decimation in Frequency implementations were performed. The performance of these two transformations was verified through their implementation using both VHDL and Xilinx System Generator (XSG) applied by MATLAB version R2012a and ISE design suite version 14.6.Finally, the difference between them is shown by comparing the speed of performance and signal processing in addition to the size of the design.
Keywords: FFT, FDWT, Simulink, VHDL.