N3H-Core: Neuron-designed Neural Network Accelerator via FPGA-based Heterogeneous Computing Cores
Not on the map. Why?
Abstract (arXiv)
Accelerating the neural network inference by FPGA has emerged as a popular option, since the reconfigurability and high performance computing capability of FPGA intrinsically satisfies the computation demand of the fast-evolving neural algorithms. However, the popular neural accelerators on FPGA (e.g., Xilinx DPU) mainly utilize the DSP resources for constructing their processing units, while the rich LUT resources are not well exploited. Via the software-hardware co-design approach, in this work, we develop an FPGA-based heterogeneous computing system for neural network acceleration. From the hardware perspective, the proposed accelerator consists of DSP- and LUT-based GEneral Matrix-Multiplication (GEMM) computing cores, which forms the entire computing system in a heterogeneous fashion. The DSP- and LUT-based GEMM cores are computed w.r.t a unified Instruction Set Architecture (ISA) and unified buffers. Along the data flow of the neural network inference path, the computation of the convolution/fully-connected layer is split into two portions, handled by the DSP- and LUT-based GEMM cores asynchronously. From the software perspective, we mathematically and systematically model the latency and resource utilization of the proposed heterogeneous accelerator, regarding varying system design configurations. Through leveraging the reinforcement learning technique, we construct a framework to achieve end-to-end selection and optimization of the design specification of target heterogeneous accelerator, including workload split strategy, mixed-precision quantization scheme, and resource allocation of DSP- and LUT-core. In virtue of the proposed design framework and heterogeneous computing system, our design outperforms the state-of-the-art Mix&Match design with latency reduced by 1.12-1.32x with higher inference accuracy. The N3H-core is open-sourced at: https://github.com/elliothe/N3H_Core.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 20 of its 40 references that are in the map. First posted on arXiv 15 Dec 2021.
Builds on
20 of 40 references.
References · 20
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
- 2019Learned Step Size Quantizationcited by 604
- 2016DoReFa-Net: Training Low Bitwidth Convolutional Neural Networks with Low Bitwidth Gradientscited by 557
- 2018PACT: Parameterized Clipping Activation for Quantized Neural Networkscited by 456
- 2018HAQ: Hardware-Aware Automated Quantization with Mixed Precisioncited by 426
- 2019HAWQ: Hessian AWare Quantization of Neural Networks with Mixed-Precisioncited by 387
- 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
- 2020ZeroQ: A Novel Zero Shot Quantization Frameworkcited by 265
8 more
- 2019Differentiable Soft Quantization: Bridging Full-Precision and Low-Bit Neural Networkscited by 234
- 2019Low-bit Quantization of Neural Networks for Efficient Inferencecited by 185
- 2018Mixed Precision Quantization of ConvNets via Differentiable Neural Architecture Searchcited by 122
- 2016Convolutional Neural Networks using Logarithmic Data Representationcited by 97
- 2020Mix and Match: A Novel FPGA-Centric Deep Neural Network Quantization Frameworkcited by 27
- 2018BISMO: A Scalable Bit-Serial Matrix Multiplication Overlay for Reconfigurable Computingcited by 21
- 2018Simultaneously Optimizing Weight and Quantizer of Ternary Neural Network using Truncated Gaussian Approximationcited by 20
- 2018Optimize Deep Convolutional Neural Network with Ternarized Weights and High Accuracycited by 4
Built on by
Citing papers per year: 2023: 1; 2024: 1.
2 papers.