The Challenge of Multi-Operand Adders in CNNs on FPGAs: How not to solve it!

Kamel Abdelouahab, François Berry, Maxime Pelcat
6/30/2018
cs.DCcs.AR

No confident code implementation found for this paper.

Abstract

Convolutional Neural Networks (CNNs) are computationally intensive algorithms that currently require dedicated hardware to be executed. In the case of FPGA-Based accelerators, we point-out in this work the challenge of Multi-Operand Adders (MOAs) and their high resource utilization in an FPGA implementation of a CNN. To address this challenge, two optimization strategies, that rely on time-multiplexing and approximate computing, are investigated. At first glance, the two strategies looked promising to reduce the footprint of a given architectural mapping, but when synthesized on the device, none of them gave the expected results. Experimental sections analyze the reasons of these unexpected results.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{abdelouahab2018challenge,
  title  = {The Challenge of Multi-Operand Adders in CNNs on FPGAs: How not to solve it!},
  author = {Kamel Abdelouahab and François Berry and Maxime Pelcat},
  year   = {2018},
  eprint = {1807.00217},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1807.00217}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1807.00217.svg)](https://codeofpaper.com/paper/1807.00217)

Discussion