Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.38118

FPGAFly: A 166.7k-Neuron Fruit-Fly Connectome on One FPGA via Deferred Spike Expansion and Shared-Codeword States

YE Ziyang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Synapse-resolution fruit-fly (Drosophila) connectomes enable neuron-by-neuron simulation of entire insect nervous systems, yet whole-brain models still require computationally demanding software or multiple neuromorphic chips, and single FPGAs support only small or statistical networks. Scaling to the full connectome, per-synapse spike expansion scales queue traffic with fan-out up to 11.2k, while 41-bit neuron states require 6.83 Mbit, exceeding the 6.27 Mbit on-chip block static RAM (BSRAM) of the target device. FPGAFly runs the 166.7k-neuron, 25.6M-connection leaky integrate-and-fire male central nervous system (CNS) connectome on one FPGA. Order-preserving deferred expansion queues one 64-bit descriptor per spike in source-ID order, cutting external memory traffic by 54.5%-57.9% and peak queue data by 95.6%-96.5% with bit-identical results. A 24-bit encoding shares codewords across normal, refractory, and quantized out-of-range states, reducing BSRAM usage from 438 to 270 with 1245 extra LUTs and zero changes across 10,000 MNIST predictions. At 80 MHz on a Gowin GW5AST-LV138, each 100 ms window finishes in 86.83 ms on average and within 93.05 ms across 2000 tests, realizing the first complete Drosophila CNS connectome simulation on one FPGA.

Explore related subjects

cs.NEcs.AR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

YE Ziyang. 2026-10-28. FPGAFly: A 166.7k-Neuron Fruit-Fly Connectome on One FPGA via Deferred Spike Expansion and Shared-Codeword States. https://arxiv.org/abs/2610.38118

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Exploiting heterogeneous delays for efficient computation in low-bit neural networks

Neural networks rely on learning synaptic weights. However, this overlooks other learnable neural parameters. One such parameter is delay: neurons communicate asynchronously with heterogeneous transmission delays. We propose that, rather than a cost to minimize, this heterogeneity supports computation when task-relevant information unfolds over time. We test this hypothesis by jointly learning weights and delays at different precisions in feedforward spiking neural networks. Delay heterogeneity supports competitive performance on neuromorphic benchmarks while compressing weights over an order of magnitude more aggressively than typically studied weight-only networks. Performance depends on task-matched delay distributions, with temporally complex tasks selectively relying on longer delays. These benefits persist under explicit delay constraints, while neural time constants only partially substitute for long delays. Our results connect the temporal structure of data with efficient model design, highlighting temporal heterogeneity as a computational resource with implications for embodied intelligence and neuromorphic hardware.

cs.NE↗
arXiv2026

Provable Speedups From Dynamic Population Sizes in Evolutionary Algorithms for Multiobjective Optimization

This paper investigates the role of dynamic population sizes in evolutionary multi-objective optimization. Although such approaches are widely used in practice, their benefits remain poorly understood, and rigorous runtime analyses explaining when and why they help are still scarce. To address this, we introduce the bi-objective problem class $\text{CLIMB}$, where the parameter $\ell$ determines the size of the Pareto front. On this problem class, we analyze the runtime of GSEMO and the widely used NSGA-II. Our results show that allowing a dynamic population size for NSGA-II can lead to a moderate improvement, yielding a super-constant speedup for $\ell \in ω(\log(n)) \cap o(\sqrt{n \log(n)})$ in terms of fitness evaluations. In particular, we prove that GSEMO and NSGA-II-DYN, a version of NSGA-II with dynamic population sizes that we propose in this paper, can cover the Pareto front of $\text{CLIMB}$ in expected $O(n \log(n) + \ell^2 \log(en/(n-2\ell+3)))$ evaluations, and that this bound is tight for $\ell = O(\sqrt{n \log(n)})$. In contrast, NSGA-II with a fixed population size of at least $4\ell$ requires expected $O(n\ell + n\log(n) + \ell^2 \log(en/(n-2\ell+3)))$ evaluations to cover the entire Pareto front of $\text{CLIMB}$, while still requiring expected $Ω(\ell n)$ evaluations to even find a Pareto-optimal search point. To the best of our knowledge, this is the first rigorous runtime analysis in bi-objective optimization that demonstrates a super-constant speedup of GSEMO over NSGA-II. Our analysis builds on concepts from single-objective optimization, such as the evolution of population diversity over time, and employs the well-known family-tree method to prove the lower bound.

cs.NE↗
arXiv2026

GNBG-C: A Unified and Configurable Benchmark Generator for Constrained Continuous Optimization

Many real-world optimization tasks are governed not only by what should be optimized, but also by what is allowed: a solution must first satisfy physical, operational, safety, budgetary, or structural requirements before its objective value becomes meaningful. Yet benchmark design for constrained continuous optimization often treats these restrictions as fixed properties of predefined test instances. Existing generators and benchmark suites provide essential foundations for reproducible comparison, but they either focus primarily on configurable objective landscapes or expose constraint properties within limited, predefined regimes, making it difficult to ask targeted questions about constraint-induced difficulty: whether an optimizer struggles because feasible regions are small, boundaries are restrictive, variables are tightly coupled, or constraint information is poorly scaled. We introduce GNBG-C, a Generalized Numerical Benchmark Generator for Constrained Continuous Optimization. The central idea is to treat the feasible region itself as a configurable object rather than as an inseparable attachment to a fixed test function. By generating controlled constraint regimes around the known GNBG global minimizer, the generator enables systematic studies in which feasibility pressure can be varied while preserving that point as a global minimizer of the constrained problem. This allows researchers to examine how optimizers discover feasibility, handle constraint pressure, and improve objective quality under diverse and controllable feasibility conditions. GNBG-C therefore provides a flexible and auditable framework for probing the strengths and weaknesses of constrained continuous optimizers under targeted forms of feasibility-side difficulty.

cs.NE↗