Low FPGA area multiplier blocks for full parallel FIR filters

Kenneth N. Macpherson, Robert Stewart

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

4 Citations (Scopus)

Abstract

A new algorithm is presented that synthesises multiplier blocks with the goal of minimising FPGA hardware cost. Comparisons with existing algorithms are made via implementing synthesised blocks as the multiplication hardware of fully-pipelined, full-parallel transposed form FIR filters. Results establish that the classic optimisation goal of minimising adders does not minimise FPGA hardware. Instead, minimising multiplier block logic depth is shown to be the primary factor for low area FPGA implementation. Filters generated using the new algorithm are also shown to consume less FPGA area than equivalents implemented using the distributed arithmetic technique.
LanguageEnglish
Title of host publicationProceedings of the 2004 IEEE International Conference on Field-Programmable Technology
PublisherIEEE
Pages247 - 254
Number of pages8
ISBN (Print)0-7803-8651-5
DOIs
Publication statusPublished - Dec 2004
Event2004 IEEE International Conference on Field-Programmable Technology - Brisbane, Australia
Duration: 6 Dec 20048 Dec 2004

Conference

Conference2004 IEEE International Conference on Field-Programmable Technology
CountryAustralia
CityBrisbane
Period6/12/048/12/04

Fingerprint

FIR filters
Field programmable gate arrays (FPGA)
Hardware
Adders
Costs

Keywords

  • arithmetic
  • field programmable gate arrays
  • finite impulse response filter
  • FIR filters
  • distributed arithmetic technique

Cite this

Macpherson, K. N., & Stewart, R. (2004). Low FPGA area multiplier blocks for full parallel FIR filters. In Proceedings of the 2004 IEEE International Conference on Field-Programmable Technology (pp. 247 - 254). IEEE. https://doi.org/10.1109/FPT.2004.1393275
Macpherson, Kenneth N. ; Stewart, Robert. / Low FPGA area multiplier blocks for full parallel FIR filters. Proceedings of the 2004 IEEE International Conference on Field-Programmable Technology. IEEE, 2004. pp. 247 - 254
@inproceedings{2eee2ddf109d4c049e7b24daf593e066,
title = "Low FPGA area multiplier blocks for full parallel FIR filters",
abstract = "A new algorithm is presented that synthesises multiplier blocks with the goal of minimising FPGA hardware cost. Comparisons with existing algorithms are made via implementing synthesised blocks as the multiplication hardware of fully-pipelined, full-parallel transposed form FIR filters. Results establish that the classic optimisation goal of minimising adders does not minimise FPGA hardware. Instead, minimising multiplier block logic depth is shown to be the primary factor for low area FPGA implementation. Filters generated using the new algorithm are also shown to consume less FPGA area than equivalents implemented using the distributed arithmetic technique.",
keywords = "arithmetic, field programmable gate arrays, finite impulse response filter , FIR filters, distributed arithmetic technique",
author = "Macpherson, {Kenneth N.} and Robert Stewart",
year = "2004",
month = "12",
doi = "10.1109/FPT.2004.1393275",
language = "English",
isbn = "0-7803-8651-5",
pages = "247 -- 254",
booktitle = "Proceedings of the 2004 IEEE International Conference on Field-Programmable Technology",
publisher = "IEEE",

}

Macpherson, KN & Stewart, R 2004, Low FPGA area multiplier blocks for full parallel FIR filters. in Proceedings of the 2004 IEEE International Conference on Field-Programmable Technology. IEEE, pp. 247 - 254, 2004 IEEE International Conference on Field-Programmable Technology, Brisbane, Australia, 6/12/04. https://doi.org/10.1109/FPT.2004.1393275

Low FPGA area multiplier blocks for full parallel FIR filters. / Macpherson, Kenneth N.; Stewart, Robert.

Proceedings of the 2004 IEEE International Conference on Field-Programmable Technology. IEEE, 2004. p. 247 - 254.

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

TY - GEN

T1 - Low FPGA area multiplier blocks for full parallel FIR filters

AU - Macpherson, Kenneth N.

AU - Stewart, Robert

PY - 2004/12

Y1 - 2004/12

N2 - A new algorithm is presented that synthesises multiplier blocks with the goal of minimising FPGA hardware cost. Comparisons with existing algorithms are made via implementing synthesised blocks as the multiplication hardware of fully-pipelined, full-parallel transposed form FIR filters. Results establish that the classic optimisation goal of minimising adders does not minimise FPGA hardware. Instead, minimising multiplier block logic depth is shown to be the primary factor for low area FPGA implementation. Filters generated using the new algorithm are also shown to consume less FPGA area than equivalents implemented using the distributed arithmetic technique.

AB - A new algorithm is presented that synthesises multiplier blocks with the goal of minimising FPGA hardware cost. Comparisons with existing algorithms are made via implementing synthesised blocks as the multiplication hardware of fully-pipelined, full-parallel transposed form FIR filters. Results establish that the classic optimisation goal of minimising adders does not minimise FPGA hardware. Instead, minimising multiplier block logic depth is shown to be the primary factor for low area FPGA implementation. Filters generated using the new algorithm are also shown to consume less FPGA area than equivalents implemented using the distributed arithmetic technique.

KW - arithmetic

KW - field programmable gate arrays

KW - finite impulse response filter

KW - FIR filters

KW - distributed arithmetic technique

U2 - 10.1109/FPT.2004.1393275

DO - 10.1109/FPT.2004.1393275

M3 - Conference contribution book

SN - 0-7803-8651-5

SP - 247

EP - 254

BT - Proceedings of the 2004 IEEE International Conference on Field-Programmable Technology

PB - IEEE

ER -

Macpherson KN, Stewart R. Low FPGA area multiplier blocks for full parallel FIR filters. In Proceedings of the 2004 IEEE International Conference on Field-Programmable Technology. IEEE. 2004. p. 247 - 254 https://doi.org/10.1109/FPT.2004.1393275