Cellular Automata Algorithms for String Sorting and Integer Multiplication According to the Atrubin Scheme
I. V. Matyushkin, A. V. Zhemerikin, Mariya A. Zapletina · Russian Microelectronics · 2017
Being unavailable in the literature for the past few recent decades, the cellular automata formulations of some algorithms for sorting character and string arrays are considered here. A cellular automaton multiplying two integers written in a numeral system with an arbitrary basis is proposed for the first time. The algorithm is based on the Atrubin parallel multiplication scheme for a systolic array of processors and requires four components (registers) instead of five.