Algorithms and Hardware for Efficient Processing of Logic-based Neural Networks
Authors:
Preprint
Abstract
Recent efforts to improve the performance of neural network (NN) accelerators that meet today's application requirements have given rise to a new trend of logic-based NN inference relying on fixed-function combinational logic (FFCL). This paper presents an innovative optimization methodology for compiling and mapping NNs utilizing FFCL into a logic processor. The presented method maps FFCL blocks to a set of Boolean functions where Boolean operations in each function are mapped to high-performance, low-latency, parallelized processing elements. Graph partitioning and scheduling algorithms are presented to handle FFCL blocks that cannot straightforwardly fit the logic processor. Our experimental evaluations across several datasets and NNs demonstrate the superior performance of our framework in terms of the inference throughput compared to prior art NN accelerators. We achieve 25x higher throughput compared with the XNOR-based accelerator for VGG16 model that can be amplified 5x deploying the graph partitioning and merging algorithms.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- On the RTL Implementation of FINN Matrix Vector UnitACM Transactions on Embedded Computing Systems, 2023
- Efficient Compilation and Mapping of Fixed Function Combinational Logic onto Digital Signal Processors Targeting Neural Network Inference and Utilizing High-level SynthesisACM Transactions on Reconfigurable Technology and Systems, 2023
- Massively parallel binary neural network inference for detecting ships in FPGA systems on the edge2021
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding2019
- Fast inference of deep neural networks in FPGAs for particle physicsJournal of Instrumentation, 2018
- ABC: An Academic Industrial-Strength Verification Tool2010
- Nonblocking broadcast switching networksIEEE Transactions on Computers, 1991