SPCCLGJun 24, 2022

Computational Complexity Evaluation of Neural Network Applications in Signal Processing

arXiv:2206.12191v21 citationsh-index: 25
Originality Synthesis-oriented
AI Analysis

This work addresses the need for unified computational complexity estimation in neural network-based digital signal processing, particularly for real-time applications, though it is incremental as it builds on existing complexity analysis methods.

The paper tackles the problem of systematically assessing computational complexity for neural networks in signal processing by introducing four linked software-to-hardware complexity metrics, including a new metric called NABS for heterogeneous quantization, and provides guidelines for their application in real-time scenarios.

In this paper, we provide a systematic approach for assessing and comparing the computational complexity of neural network layers in digital signal processing. We provide and link four software-to-hardware complexity measures, defining how the different complexity metrics relate to the layers' hyper-parameters. This paper explains how to compute these four metrics for feed-forward and recurrent layers, and defines in which case we ought to use a particular metric depending on whether we characterize a more soft- or hardware-oriented application. One of the four metrics, called `the number of additions and bit shifts (NABS)', is newly introduced for heterogeneous quantization. NABS characterizes the impact of not only the bitwidth used in the operation but also the type of quantization used in the arithmetical operations. We intend this work to serve as a baseline for the different levels (purposes) of complexity estimation related to the neural networks' application in real-time digital signal processing, aiming at unifying the computational complexity estimation.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes