Design and Implementation of Hardware Accelerators for Neural Processing Applications

TL;DR

This paper presents the design and implementation of hardware accelerators for the Auto Resonance Network (ARN), a novel neural network architecture, demonstrating an image recognition application with high accuracy and efficient hardware realization.

Contribution

The work introduces a hardware accelerator for ARN, a new explainable neural network, and demonstrates its application in image recognition with optimized hardware design and theoretical analysis of multi-operand addition.

Findings

Achieved 94% accuracy on MNIST with 2-layer ARN

Developed a modular, pipelined multi-operand adder for neural hardware

Presented a theorem for exact carry bit calculation in multi-operand addition

Abstract

Primary motivation for this work was the need to implement hardware accelerators for a newly proposed ANN structure called Auto Resonance Network (ARN) for robotic motion planning. ARN is an approximating feed-forward hierarchical and explainable network. It can be used in various AI applications but the application base was small. Therefore, the objective of the research was twofold: to develop a new application using ARN and to implement a hardware accelerator for ARN. As per the suggestions given by the Doctoral Committee, an image recognition system using ARN has been implemented. An accuracy of around 94% was achieved with only 2 layers of ARN. The network also required a small training data set of about 500 images. Publicly available MNIST dataset was used for this experiment. All the coding was done in Python. Massive parallelism seen in ANNs presents several challenges to CPU design. For a given functionality, e.g., multiplication, several copies of serial modules can be realized within the same area as a parallel module. Advantage of using serial modules compared to parallel modules under area constraints has been discussed. One of the module often useful in ANNs is a multi-operand addition. One problem in its implementation is that the estimation of carry bits when the number of operands changes. A theorem to calculate exact number of carry bits required for a multi-operand addition has been presented in the thesis which alleviates this problem. The main advantage of the modular approach to multi-operand addition is the possibility of pipelined addition with low reconfiguration overhead. This results in overall increase in throughput for large number of additions, typically seen in several DNN configurations.