LGCVSPMLOct 24, 2019

LUTNet: Learning FPGA Configurations for Highly Efficient Neural Network Inference

arXiv:1910.12625v257 citations
Originality Incremental advance
AI Analysis

This work addresses efficiency challenges for deploying neural networks on resource-constrained FPGAs, offering incremental improvements over existing binarization methods.

The authors tackled the problem of inefficient neural network inference on FPGAs by proposing LUTNet, a framework that uses FPGA LUTs as operators to enable heavy pruning, resulting in up to twice the area efficiency compared to prior binarized networks while maintaining comparable accuracy.

Research has shown that deep neural networks contain significant redundancy, and thus that high classification accuracy can be achieved even when weights and activations are quantized down to binary values. Network binarization on FPGAs greatly increases area efficiency by replacing resource-hungry multipliers with lightweight XNOR gates. However, an FPGA's fundamental building block, the K-LUT, is capable of implementing far more than an XNOR: it can perform any K-input Boolean operation. Inspired by this observation, we propose LUTNet, an end-to-end hardware-software framework for the construction of area-efficient FPGA-based neural network accelerators using the native LUTs as inference operators. We describe the realization of both unrolled and tiled LUTNet architectures, with the latter facilitating smaller, less power-hungry deployment over the former while sacrificing area and energy efficiency along with throughput. For both varieties, we demonstrate that the exploitation of LUT flexibility allows for far heavier pruning than possible in prior works, resulting in significant area savings while achieving comparable accuracy. Against the state-of-the-art binarized neural network implementation, we achieve up to twice the area efficiency for several standard network models when inferencing popular datasets. We also demonstrate that even greater energy efficiency improvements are obtainable.

Code Implementations2 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes