FIR implementation on FPGA: investigate the FIR order on SDA and PDA algorithms
Migdadi, Hassan S.O. Obeidat, Huthaifa A.N. Noras, James M. Qaralleh, E.A.A. Ngala, Mohammad J.
Migdadi, Hassan S.O.
Obeidat, Huthaifa A.N.
Noras, James M.
Qaralleh, E.A.A.
Ngala, Mohammad J.
Publication Date
2015
End of Embargo
Supervisor
Rights
Peer-Reviewed
Yes
Open Access status
closedAccess
Accepted for publication
Institution
Department
Awarded
Embargo end date
Additional title
Abstract
Finite impulse response (FIR) digital filters are extensively used due to their key role in various digital signal processing (DSP) applications. Several attempts have been made to develop hardware realization of FIR filters characterized by implementation complexity, precision and high speed. Field Programmable Gate Array is a reconfigurable realization of FIR filters. Field-programmable gate arrays (FPGAs) are on the verge of revolutionizing digital signal processing. Many front-end digital signal processing (DSP) algorithms, such as FFTs, FIR or IIR filters, are now most often realized by FPGAs. Modern FPGA families provide DSP arithmetic support with fast-carry chains that are used to implement multiply-accumulates (MACs) at high speed, with low overhead and low costs. In this paper, distributed arithmetic (DA) realization of FIR filter as serial and parallel are discussed in terms of hardware cost and resource utilization.
Version
No full-text in the repository
Citation
Migdadi HSO, Abd-Alhameed R, Obeidat HAN et al (2015) FIR implementation on FPGA: investigate the FIR order on SDA and PDA algorithms. In: Proceedings of the Internet Technologies and Applications (ITA) conference, 8-11 Sep 2015. Wrexham, UK: 417-421.
Link to publisher’s version
Link to published version
Link to Version of Record
Type
Conference paper