Systolic Pattern Recognition Based on Neural Network Algorithm
The paper presents a solution for pattern classification, which uses distribute processing both for computing the matching score and selecting the class with the maximum score. The proposed architecture belongs to systolic arrays, being a generalization of the classical priority queue. A detailed description of the elementary processors (EPs) reveals that the algorithm implemented by each EP (which is based on computing the Hamming distance) is common also for neural networks. The overall result is a O(M) execution time for M classes (i.e. linear), and O(1) execution time with respect to n (the size of the patterns).
For testing the ideas, a simulator has been developed. It has been built starting from a set of C functions for simulating parallel processes. A short description of these functions supports our claim about the improvement of efficiency when developing a simulator starting from these functions. Several results are shortly discussed. Conclusions and further directions of research end the paper.
KeywordsInput Pattern Traditional Classifier Priority Queue Systolic Array Unknown Input
Unable to display preview. Download preview PDF.
- C.E. Leiserson, “Area Efficient VLSI Computations”, The MIT Press, 1982.Google Scholar
- C.A. Mead, L. Conway, “Introduction to VLSI Systems”, Addison-Wesley, 1980.Google Scholar
- J.J. Hopfield, “Neural Networks and Physical Systems with Emergent Collective Computational Abilities”, Proc. Natl. Acad. USA, 79, April 1982.Google Scholar
- V. Beiu, “From Systolic Arrays to Neural Networks”, The Scientific Annals of “Al.I. Cuza” Univ., Iasi (Iassy), Section: Informatics, 35, 4, 1989.Google Scholar
- D.O. Creteanu, “Set of C Functions for Parallel Processes Simulation”, M.Sc. thesis, Buch. Polytech. Inst., 1991.Google Scholar
- V. Aho, E.J. Hopcroft and D.J. Ullman, “The Design and Analysis of Computer Algorithms”, Addison-Wesley, 1975.Google Scholar