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

June 30, 2018 Β· Declared Dead Β· πŸ› International Conference / Workshop on Embedded Computer Systems: Architectures, Modeling and Simulation

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Kamel Abdelouahab, FranΓ§ois Berry, Maxime Pelcat arXiv ID 1807.00217 Category cs.DC: Distributed Computing Cross-listed cs.AR Citations 14 Venue International Conference / Workshop on Embedded Computer Systems: Architectures, Modeling and Simulation Last Checked 4 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Distributed Computing

Died the same way β€” πŸ‘» Ghosted