Michael Lunglmayr
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Michael Lunglmayr has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Bernhard Alois Moser
Software Competence Center Hagenberg, Hagenberg, Austria
8 shared publications Bernhard A. Moser
Institute of Signal Processing Institute of Signal Processing Institute of Signal Processing Software Competence Center Hagenberg (SCCH) Johannes Kepler University of Linz Johannes Kepler University of Linz (JKU) Johannes Kepler University of Linz (JKU) 4232 Hagenberg Austria
6 shared publications- Mario Huemer
Institute of Signal Processing, Johannes Kepler University, Linz, Austria
6 shared publications - Daniel Windhager
Intelligent Wireless Systems Silicon Austria Labs Linz Austria
4 shared publications - Gustavo Castro Do Amaral
Delft University of Technology
4 shared publications - Werner Haselmayr
Institute for Communications Engineering and RF-Systems, Johannes Kepler University Linz, Linz, Austria
4 shared publications
Latest Publications
- 27 August 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Neural Systems
- Vol. 35 (13) , 2550053
Deep Unfolded Variable Projection Networks
In this paper, we present a hybrid learning framework that integrates two model-driven AI paradigms: Deep unfolding and Variable Projections (VPs). The core idea is to unfold the iterations of VP solvers for separable nonlinear least squares (SNLLS) problems into trainable neural network layers. As a consequence, the network is capable of learning optimal nonlinear VP parameters during inference, which is a form of model-based meta-learning. Furthermore, the architecture incorporates prior knowledge of the underlying SNLLS problem, such as basis function expansions and signal structure, which enhance interpretability, reduce model size, and lower data requirements. As a case study, we adapt the proposed deep unfolded VPNet to learn ECG representations for the classification of five arrhythmias. Experimental results on the MIT-BIH Arrhythmia Database show that VPNet achieves performance comparable to state-of-the-art ECG classifiers, attaining 95% accuracy while maintaining a compact architecture. Its low computational complexity enables efficient training and inference, making it highly suitable for real-time, power-efficient edge computing applications. This is further validated through embedded implementation on STM32 microcontrollers.
- 27 August 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Neural Systems
- Vol. 35 (13) , 2550053
Deep Unfolded Variable Projection Networks
In this paper, we present a hybrid learning framework that integrates two model-driven AI paradigms: Deep unfolding and Variable Projections (VPs). The core idea is to unfold the iterations of VP solvers for separable nonlinear least squares (SNLLS) problems into trainable neural network layers. As a consequence, the network is capable of learning optimal nonlinear VP parameters during inference, which is a form of model-based meta-learning. Furthermore, the architecture incorporates prior knowledge of the underlying SNLLS problem, such as basis function expansions and signal structure, which enhance interpretability, reduce model size, and lower data requirements. As a case study, we adapt the proposed deep unfolded VPNet to learn ECG representations for the classification of five arrhythmias. Experimental results on the MIT-BIH Arrhythmia Database show that VPNet achieves performance comparable to state-of-the-art ECG classifiers, attaining 95% accuracy while maintaining a compact architecture. Its low computational complexity enables efficient training and inference, making it highly suitable for real-time, power-efficient edge computing applications. This is further validated through embedded implementation on STM32 microcontrollers.
- Open Access
Lightweight LIF-only SNN accelerator using differential time encoding
Spiking Neural Networks (SNNs) offer a promising solution to the problem of increasing computational and energy requirements for modern Machine Learning (ML) applications. Due to their unique data representation choice of using spikes and spike trains, they mostly rely on additions and thresholding operations to achieve results approaching state-of-the-art (SOTA) Artificial Neural Networks (ANNs). This advantage is hindered by the fact that their temporal characteristic does not map well to already existing accelerator hardware like GPUs. Therefore, this work will introduce a hardware accelerator architecture capable of computing feedforward LIF-only SNNs, as well as an accompanying encoding method to efficiently encode already existing data into spike trains. Together, this leads to a design capable of >99% accuracy on the MNIST dataset, with ~0.29ms inference times on a Xilinx Ultrascale+ FPGA, as well as ~0.17ms on a custom ASIC using the open-source predictive 7nm ASAP7 PDK. Furthermore, this work will showcase the advantages of the previously presented differential time encoding for spikes, as well as provide proof that merging spikes from different synapses given in differential time encoding can be done efficiently in hardware.
Open AccessLightweight LIF-only SNN accelerator using differential time encoding
Spiking Neural Networks (SNNs) offer a promising solution to the problem of increasing computational and energy requirements for modern Machine Learning (ML) applications. Due to their unique data representation choice of using spikes and spike trains, they mostly rely on additions and thresholding operations to achieve results approaching state-of-the-art (SOTA) Artificial Neural Networks (ANNs). This advantage is hindered by the fact that their temporal characteristic does not map well to already existing accelerator hardware like GPUs. Therefore, this work will introduce a hardware accelerator architecture capable of computing feedforward LIF-only SNNs, as well as an accompanying encoding method to efficiently encode already existing data into spike trains. Together, this leads to a design capable of >99% accuracy on the MNIST dataset, with ~0.29ms inference times on a Xilinx Ultrascale+ FPGA, as well as ~0.17ms on a custom ASIC using the open-source predictive 7nm ASAP7 PDK. Furthermore, this work will showcase the advantages of the previously presented differential time encoding for spikes, as well as provide proof that merging spikes from different synapses given in differential time encoding can be done efficiently in hardware.
- 24 April 2025
- Published by Springer Nature
- p. 3-11
Efficient Hardware Architecture for Random Forest Training
- 24 April 2025
- Published by Springer Nature
- p. 3-11
Efficient Hardware Architecture for Random Forest Training
- 24 April 2025
- Published by Springer Nature
- p. 12-18
Influence of Spike Encoding, Neuron Models and Quantization on SNN Performance
- 24 April 2025
- Published by Springer Nature
- p. 12-18
Influence of Spike Encoding, Neuron Models and Quantization on SNN Performance
- Open Access
Integrate-and-Fire from a Mathematical and Signal Processing Perspective
Integrate-and-Fire (IF) is an idealized model of the spike-triggering mechanism of a biological neuron. It is used to realize the bio-inspired event-based principle of information processing in neuromorphic computing. We show that IF is closely related to the concept of Send-on-Delta (SOD) as used in threshold-based sampling. It turns out that the IF model can be adjusted in a way that SOD can be understood as differential version of IF. As a result, we gain insight into the underlying metric structure based on the Alexiewicz norm with consequences for clarifying the underlying signal space including bounded integrable signals with superpositions of finitely many Dirac impulses, the identification of a maximum sparsity property, error bounds for signal reconstruction and a characterization in terms of sparse regularization.
Open AccessIntegrate-and-Fire from a Mathematical and Signal Processing Perspective
Integrate-and-Fire (IF) is an idealized model of the spike-triggering mechanism of a biological neuron. It is used to realize the bio-inspired event-based principle of information processing in neuromorphic computing. We show that IF is closely related to the concept of Send-on-Delta (SOD) as used in threshold-based sampling. It turns out that the IF model can be adjusted in a way that SOD can be understood as differential version of IF. As a result, we gain insight into the underlying metric structure based on the Alexiewicz norm with consequences for clarifying the underlying signal space including bounded integrable signals with superpositions of finitely many Dirac impulses, the identification of a maximum sparsity property, error bounds for signal reconstruction and a characterization in terms of sparse regularization.
- Open Access
Spiking Neural Network Accelerator Architecture for Differential-Time Representation using Learned Encoding
Spiking Neural Networks (SNNs) have garnered attention over recent years due to their increased energy efficiency and advantages in terms of operational complexity compared to traditional Artificial Neural Networks (ANNs). Two important questions when implementing SNNs are how to best encode existing data into spike trains and how to efficiently process these spike trains in hardware. This paper addresses both of these problems by incorporating the encoding into the learning process, thus allowing the network to learn the spike encoding alongside the weights. Furthermore, this paper proposes a hardware architecture based on a recently introduced differential-time representation for spike trains allowing decoupling of spike time and processing time. Together these contributions lead to a feedforward SNN using only Leaky-Integrate and Fire (LIF) neurons that surpasses 99% accuracy on the MNIST dataset while still being implementable on medium-sized FPGAs with inference times of less than 295us.
Open AccessSpiking Neural Network Accelerator Architecture for Differential-Time Representation using Learned Encoding
Spiking Neural Networks (SNNs) have garnered attention over recent years due to their increased energy efficiency and advantages in terms of operational complexity compared to traditional Artificial Neural Networks (ANNs). Two important questions when implementing SNNs are how to best encode existing data into spike trains and how to efficiently process these spike trains in hardware. This paper addresses both of these problems by incorporating the encoding into the learning process, thus allowing the network to learn the spike encoding alongside the weights. Furthermore, this paper proposes a hardware architecture based on a recently introduced differential-time representation for spike trains allowing decoupling of spike time and processing time. Together these contributions lead to a feedforward SNN using only Leaky-Integrate and Fire (LIF) neurons that surpasses 99% accuracy on the MNIST dataset while still being implementable on medium-sized FPGAs with inference times of less than 295us.
- Open Access
On the Sampling Sparsity of Neuromorphic Analog-to-Spike Conversion based on Leaky Integrate-and-Fire
In contrast to the traditional principle of periodic sensing neuromorphic engineering pursues a paradigm shift towards bio-inspired event-based sensing, where events are primarily triggered by a change in the perceived stimulus. We show in a rigorous mathematical way that information encoding by means of Threshold-Based Representation based on either Leaky Integrate-and-Fire (LIF) or Send-on-Delta (SOD) is linked to an analog-to-spike conversion that guarantees maximum sparsity while satisfying an approximation condition based on the Alexiewicz norm.
Open AccessOn the Sampling Sparsity of Neuromorphic Analog-to-Spike Conversion based on Leaky Integrate-and-Fire
In contrast to the traditional principle of periodic sensing neuromorphic engineering pursues a paradigm shift towards bio-inspired event-based sensing, where events are primarily triggered by a change in the perceived stimulus. We show in a rigorous mathematical way that information encoding by means of Threshold-Based Representation based on either Leaky Integrate-and-Fire (LIF) or Send-on-Delta (SOD) is linked to an analog-to-spike conversion that guarantees maximum sparsity while satisfying an approximation condition based on the Alexiewicz norm.
- 28 August 2024
- Published by Springer Nature
- p. 57-66
On the Solvability of the XOR Problem by Spiking Neural Networks
- 28 August 2024
- Published by Springer Nature
- p. 57-66
On the Solvability of the XOR Problem by Spiking Neural Networks
- Open Access
On the Solvability of the {XOR} Problem by Spiking Neural Networks
The linearly inseparable XOR problem and the related problem of representing binary logical gates is revisited from the point of view of temporal encoding and its solvability by spiking neural networks with minimal configurations of leaky integrate-and-fire (LIF) neurons. We use this problem as an example to study the effect of different hyper parameters such as information encoding, the number of hidden units in a fully connected reservoir, the choice of the leaky parameter and the reset mechanism in terms of reset-to-zero and reset-by-subtraction based on different refractory times. The distributions of the weight matrices give insight into the difficulty, respectively the probability, to find a solution. This leads to the observation that zero refractory time together with graded spikes and an adapted reset mechanism, reset-to-mod, makes it possible to realize sparse solutions of a minimal configuration with only two neurons in the hidden layer to resolve all binary logic gate constellations with XOR as a special case.
Open AccessOn the Solvability of the {XOR} Problem by Spiking Neural Networks
The linearly inseparable XOR problem and the related problem of representing binary logical gates is revisited from the point of view of temporal encoding and its solvability by spiking neural networks with minimal configurations of leaky integrate-and-fire (LIF) neurons. We use this problem as an example to study the effect of different hyper parameters such as information encoding, the number of hidden units in a fully connected reservoir, the choice of the leaky parameter and the reset mechanism in terms of reset-to-zero and reset-by-subtraction based on different refractory times. The distributions of the weight matrices give insight into the difficulty, respectively the probability, to find a solution. This leads to the observation that zero refractory time together with graded spikes and an adapted reset mechanism, reset-to-mod, makes it possible to realize sparse solutions of a minimal configuration with only two neurons in the hidden layer to resolve all binary logic gate constellations with XOR as a special case.
- Open Access
- 17 July 2024
- Published by Elsevier in Neurocomputing
- Vol. 601
Spiking neural networks in the Alexiewicz topology: A new perspective on analysis and error bounds
- 17 July 2024
- Published by Elsevier in Neurocomputing
- Vol. 601
Open AccessSpiking neural networks in the Alexiewicz topology: A new perspective on analysis and error bounds