Reducing FPGA algorithm area by avoiding redundant computation

Brian Axelrod; Michel Laverne

ICRA 2015poster3 citations

Reducing FPGA algorithm area by avoiding redundant computation

Abstract

We develop a new paradigm for designing fully streaming, area-efficient FPGA implementations of common building blocks for vision algorithm. By focusing on avoiding redundant computation we achieve a reduction of one to two orders of magnitude reduction in design area utilization as compared to previous implementations. We demonstrate that our design works in practice by building five 325 frames per second, high resolution Harris corner detection cores onto a single FPGA.

BibTeX

@inproceedings{icra2015_reducingfpgaalgo,
  title = {Reducing FPGA algorithm area by avoiding redundant computation},
  author = {Brian Axelrod and Michel Laverne},
  booktitle = {ICRA 2015},
  year = {2015}
}