Table of Contents
Fetching ...

Computational Complexity Evaluation of Neural Network Applications in Signal Processing

Pedro Freire, Sasipim Srivallapanondh, Antonio Napoli, Jaroslaw E. Prilepsky, Sergei K. Turitsyn

TL;DR

This work intends 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.

Abstract

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.

Computational Complexity Evaluation of Neural Network Applications in Signal Processing

TL;DR

This work intends 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.

Abstract

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.
Paper Structure (30 sections, 66 equations, 13 figures, 4 tables)

This paper contains 30 sections, 66 equations, 13 figures, 4 tables.

Figures (13)

  • Figure 1: Main strategies to design low complex NN-equalizers in training, inference, and hardware synthesis phases.
  • Figure 2: Main metrics to evaluate complexity in the training phase for NN-equalizers.
  • Figure 3: Main metrics to evaluate complexity in the inference phase for NN-equalizers.
  • Figure 4: Data path of a neuron in a quantized dense layer where $x$ is the input vector with size $n_i$, $w$ is the weight matrix, $b_w$ is the weight bitwidth and $b_i$ is the input bitwidth, $b_a$ is the activation bitwidth and $b_b$ is the bias bitwidth.
  • Figure 5: Architecture of a ResNet block.
  • ...and 8 more figures