PolyLUT-Add: FPGA-based LUT Inference with Wide Inputs

Binglei Lou, Richard Rademacher, David Boland, Philip H. W. Leong
6/7/2024
cs.LGcs.AIcs.AR

No official code found. Best implementation: bingleilou/PolyLUT-Add (11 stars, Apache-2.0, last commit 2026-04-22).

Abstract

FPGAs have distinct advantages as a technology for deploying deep neural networks (DNNs) at the edge. Lookup Table (LUT) based networks, where neurons are directly modeled using LUTs, help maximize this promise of offering ultra-low latency and high area efficiency on FPGAs. Unfortunately, LUT resource usage scales exponentially with the number of inputs to the LUT, restricting PolyLUT to small LUT sizes. This work introduces PolyLUT-Add, a technique that enhances neuron connectivity by combining $A$ PolyLUT sub-neurons via addition to improve accuracy. Moreover, we describe a novel architecture to improve its scalability. We evaluated our implementation over the MNIST, Jet Substructure classification, and Network Intrusion Detection benchmark and found that for similar accuracy, PolyLUT-Add achieves a LUT reduction of $2.0-13.9\times$ with a $1.2-1.6\times$ decrease in latency.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

PolyLUT-Add: FPGA-based LUT Inference with Wide Inputs

112Python, VerilogMar 20, 20246 months agoApache-2.0

Cite this paper

@article{lou2024polylutadd,
  title  = {PolyLUT-Add: FPGA-based LUT Inference with Wide Inputs},
  author = {Binglei Lou and Richard Rademacher and David Boland and Philip H. W. Leong},
  year   = {2024},
  eprint = {2406.04910},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.04910v2}
}

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/2406.04910.svg)](https://codeofpaper.com/paper/2406.04910)

Discussion