Adding numbers with spiking neural circuits on neuromorphic hardware: a building block for future hybrid systems

Abstract Progress in neuromorphic computing requires efficient implementation of standard computational problems, like adding numbers. Here we implement a variety of sequential and parallel binary adders in the Lava software framework, and deploy them to the neuromorphic chip Loihi 2. To the best of our knowledge, up to now, a neuromorphic implementation of such parallel adders has not been reported. We describe the time complexity, neuron and synaptic resources, as well as constraints on the bit width of the numbers that can be added with the current implementations. Further, we measure the time required for the addition operation on-chip. Importantly, we encounter trade-offs in terms of time complexity and required chip resources for the three considered adders. While sequential adders have linear time complexity <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mrow> <mml:mrow> <mml:mi class="MJX-tex-calligraphic">O</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>n</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> and require a linearly increasing number of neurons and synapses with number of bits n , the parallel adders have constant time complexity <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mrow> <mml:mrow> <mml:mi class="MJX-tex-calligraphic">O</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> and also require a linearly increasing number of neurons, but nonlinearly increasing synaptic resources (scaling with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mrow> <mml:msup> <mml:mi>n</mml:mi> <mml:mn>2</mml:mn> </mml:msup> </mml:mrow> </mml:math> or <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mrow> <mml:mi>n</mml:mi> <mml:msqrt> <mml:mi>n</mml:mi> </mml:msqrt> </mml:mrow> </mml:math> ). This trade-off between compute time and chip resources may inform decisions in application development, and the implementations we provide may serve as a building block for further progress towards efficient neuromorphic algorithms.

Authors

Institutions

Publication Details

Journal
Neuromorphic Computing and Engineering
Published
2025-10-14
DOI
https://doi.org/10.1088/2634-4386/ae0c91
Primary Topic
Advanced Memory and Neural Computing
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adding numbers with spiking neural circuits on neuromorphic hardware: a building block for future hybrid systems

Andrew B. Lehr, Jannik Luboeinski, Christian Tetzlaff, Elena C Offenberg et al.
Neuromorphic Computing and Engineering
Advanced Memory and Neural Computing
article

Adding numbers with spiking neural circuits on neuromorphic hardware: a building block for future hybrid systems

Andrew B. Lehr, Jannik Luboeinski, Christian Tetzlaff, Elena C Offenberg, Carlo Michaelis, Oskar von Seeler
article en

Abstract

Abstract Progress in neuromorphic computing requires efficient implementation of standard computational problems, like adding numbers. Here we implement a variety of sequential and parallel binary adders in the Lava software framework, and deploy them to the neuromorphic chip Loihi 2. To the best of our knowledge, up to now, a neuromorphic implementation of such parallel adders has not been reported. We describe the time complexity, neuron and synaptic resources, as well as constraints on the bit width of the numbers that can be added with the current implementations. Further, we measure the time required for the addition operation on-chip. Importantly, we encounter trade-offs in terms of time complexity and required chip resources for the three considered adders. While sequential adders have linear time complexity <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mrow> <mml:mrow> <mml:mi class="MJX-tex-calligraphic">O</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>n</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> and require a linearly increasing number of neurons and synapses with number of bits n , the parallel adders have constant time complexity <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mrow> <mml:mrow> <mml:mi class="MJX-tex-calligraphic">O</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> and also require a linearly increasing number of neurons, but nonlinearly increasing synaptic resources (scaling with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mrow> <mml:msup> <mml:mi>n</mml:mi> <mml:mn>2</mml:mn> </mml:msup> </mml:mrow> </mml:math> or <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mrow> <mml:mi>n</mml:mi> <mml:msqrt> <mml:mi>n</mml:mi> </mml:msqrt> </mml:mrow> </mml:math> ). This trade-off between compute time and chip resources may inform decisions in application development, and the implementations we provide may serve as a building block for further progress towards efficient neuromorphic algorithms.

Neuromorphic Computing and EngineeringVol. 5(4)
Universitätsmedizin Göttingen (DE), University of Göttingen (DE)
Intel Corporation, Bundesministerium für Bildung und Forschung, Göteborgs Universitet
Openalex Percentile: Top 71%
Advanced Memory and Neural Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.