Data-Rate-Aware High-Speed CNN Inference on FPGAs

• URL: http://arxiv.org/abs/2603.08726v1
• Date: Wed, 18 Feb 2026 08:46:38 GMT
• Title: Data-Rate-Aware High-Speed CNN Inference on FPGAs
• Abstract summary: CNN accelerators on FPGAs achieve low latency and high throughput by mapping computations of each layer directly to corresponding hardware units.<n> layers such as pooling and strided convolutions reduce the data at their output with respect to their input, strongly effecting the data rate of the following layers.<n>This paper presents a data-rate-aware CNN accelerator architecture for multi-pixel processing.
• Score: 0.8594140167290097
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Dataflow-based CNN accelerators on FPGAs achieve low latency and high throughput by mapping computations of each layer directly to corresponding hardware units. However, layers such as pooling and strided convolutions reduce the data at their output with respect to their input, strongly effecting the data rate of the following layers. This leads to underutilization in fully unrolled designs. While prior work introduced data-rate-aware layer-wise adaptation, determining the most efficient implementation remains challenging. This paper presents a data-rate-aware CNN accelerator architecture for multi-pixel processing. Building on existing analytical models, the proposed method performs design-space exploration to identify configurations that improve hardware utilization and resource efficiency while preserving continuous flow of data, keeping all hardware units busy. Experimental results show substantial reductions in arithmetic resources compared to previous designs, enabling efficient implementation of complex CNNs on a single FPGA across a wide range of data rates.

Related papers

• Data-Driven Deep MIMO Detection:Network Architectures and Generalization Analysis [50.20709408241935]
  This paper proposes inspecting the fully data-driven DeepSIC detection within a Network-of-MLPs architecture.<n>Within such an architecture, DeepSIC can be upgraded as a graph-based message-passing process using Graph Neural Networks (GNNs)<n>GNNSIC achieves excellent expressivity comparable to DeepSIC with substantially fewer trainable parameters.
  arXiv  Detail & Related papers  (2026-02-13T04:38:51Z)
• Continuous-Flow Data-Rate-Aware CNN Inference on FPGA [6.473184145566098]
  This work presents a novel approach to designing data-rate-aware, continuous-flow CNN architectures.<n>The proposed approach ensures a high hardware utilization close to 100% by interleaving low data rate signals and sharing hardware units.<n>The results show that a significant amount of arithmetic logic can be saved, which allows implementing complex CNNs like MobileNet on a single FPGA with high throughput.
  arXiv  Detail & Related papers  (2026-01-16T17:27:19Z)
• I2E: Real-Time Image-to-Event Conversion for High-Performance Spiking Neural Networks [5.758857776572054]
  Spiking neural networks (SNNs) promise highly energy-efficient computing, but their adoption is hindered by a critical scarcity of event-stream data.<n>This work introduces I2E, an algorithmic framework that resolves this bottleneck by converting static images into high-fidelity event streams.<n>I2E achieves a conversion speed over 300x faster than prior methods, enabling on-the-fly data augmentation for SNN training.<n>An SNN trained on the generated I2E-ImageNet dataset achieves a state-of-the-art accuracy of 60.50%.
  arXiv  Detail & Related papers  (2025-11-11T10:05:17Z)
• Prior-Fitted Networks Scale to Larger Datasets When Treated as Weak Learners [82.72552644267724]
  BoostPFN can outperform standard PFNs with the same size of training samples in large datasets.<n>High performance is maintained for up to 50x of the pre-training size of PFNs.
  arXiv  Detail & Related papers  (2025-03-03T07:31:40Z)
• A Data-Driven Approach to Dataflow-Aware Online Scheduling for Graph Neural Network Inference [3.734578883171713]
  We propose a data-driven framework for dataflow-aware latency prediction in GNN inference. Our regressors can predict the optimal dataflow for a given graph with up to 91.28% accuracy and a Mean Absolute Percentage Error (MAPE) of 3.78%. We introduce an online scheduling algorithm that uses these regressors to enhance scheduling decisions.
  arXiv  Detail & Related papers  (2024-11-25T12:38:59Z)
• DCP: Learning Accelerator Dataflow for Neural Network via Propagation [52.06154296196845]
  This work proposes an efficient data-centric approach, named Dataflow Code Propagation (DCP), to automatically find the optimal dataflow for DNN layers in seconds without human effort. DCP learns a neural predictor to efficiently update the dataflow codes towards the desired gradient directions to minimize various optimization objectives. For example, without using additional training data, DCP surpasses the GAMMA method that performs a full search using thousands of samples.
  arXiv  Detail & Related papers  (2024-10-09T05:16:44Z)
• HASS: Hardware-Aware Sparsity Search for Dataflow DNN Accelerator [47.66463010685586]
  We propose a novel approach to exploit unstructured weights and activations sparsity for dataflow accelerators, using software and hardware co-optimization. We achieve an efficiency improvement ranging from 1.3$times$ to 4.2$times$ compared to existing sparse designs.
  arXiv  Detail & Related papers  (2024-06-05T09:25:18Z)
• Analysis and Optimization of Wireless Federated Learning with Data Heterogeneity [72.85248553787538]
  This paper focuses on performance analysis and optimization for wireless FL, considering data heterogeneity, combined with wireless resource allocation. We formulate the loss function minimization problem, under constraints on long-term energy consumption and latency, and jointly optimize client scheduling, resource allocation, and the number of local training epochs (CRE) Experiments on real-world datasets demonstrate that the proposed algorithm outperforms other benchmarks in terms of the learning accuracy and energy consumption.
  arXiv  Detail & Related papers  (2023-08-04T04:18:01Z)
• KAPLA: Pragmatic Representation and Fast Solving of Scalable NN Accelerator Dataflow [0.0]
  We build a generic, optimized, and fast dataflow solver, KAPLA, to explore the design space with effective validity check and efficiency estimation. KAPLA achieves within only 2.2% and 7.7% energy overheads on the result dataflow for training and inference. It also outperforms random and machine-learning-based approaches, with more optimized results and orders of magnitude faster search speedup.
  arXiv  Detail & Related papers  (2023-06-09T03:12:42Z)
• Deep Cellular Recurrent Network for Efficient Analysis of Time-Series Data with Spatial Information [52.635997570873194]
  This work proposes a novel deep cellular recurrent neural network (DCRNN) architecture to process complex multi-dimensional time series data with spatial information. The proposed architecture achieves state-of-the-art performance while utilizing substantially less trainable parameters when compared to comparable methods in the literature.
  arXiv  Detail & Related papers  (2021-01-12T20:08:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.