Email this article Cellular Automata Algorithms for String Sorting and Integer Multiplication According to the Atrubin Scheme
- Authors: Matyushkin I.V.1,2,3, Zhemerikin A.V.2, Zapletina M.A.2
-
Affiliations:
- Institute for Design Problems in Microelectronics
- National Research University of Electronic Technology
- OAO Micron
- Issue: Vol 46, No 7 (2017)
- Pages: 500-505
- Section: Article
- URL: https://journals.rcsi.science/1063-7397/article/view/186677
- DOI: https://doi.org/10.1134/S1063739717070071
- ID: 186677
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
I. V. Matyushkin
Institute for Design Problems in Microelectronics; National Research University of Electronic Technology; OAO Micron
Author for correspondence.
Email: imatyushkin@ippm.ru
Russian Federation, Moscow; Zelenograd, Moscow oblast; Zelenograd, Moscow oblast
A. V. Zhemerikin
National Research University of Electronic Technology
Email: imatyushkin@ippm.ru
Russian Federation, Zelenograd, Moscow oblast
M. A. Zapletina
National Research University of Electronic Technology
Email: imatyushkin@ippm.ru
Russian Federation, Zelenograd, Moscow oblast
