Отправить статью по E-mail Cellular Automata Algorithms for String Sorting and Integer Multiplication According to the Atrubin Scheme
- Авторы: Matyushkin I.V.1,2,3, Zhemerikin A.V.2, Zapletina M.A.2
-
Учреждения:
- Institute for Design Problems in Microelectronics
- National Research University of Electronic Technology
- OAO Micron
- Выпуск: Том 46, № 7 (2017)
- Страницы: 500-505
- Раздел: Article
- URL: https://journals.rcsi.science/1063-7397/article/view/186677
- DOI: https://doi.org/10.1134/S1063739717070071
- ID: 186677
Цитировать
Открытый доступ
Доступ предоставлен
Только для подписчиков
Аннотация
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.
Ключевые слова
Об авторах
I. Matyushkin
Institute for Design Problems in Microelectronics; National Research University of Electronic Technology; OAO Micron
Автор, ответственный за переписку.
Email: imatyushkin@ippm.ru
Россия, Moscow; Zelenograd, Moscow oblast; Zelenograd, Moscow oblast
A. Zhemerikin
National Research University of Electronic Technology
Email: imatyushkin@ippm.ru
Россия, Zelenograd, Moscow oblast
M. Zapletina
National Research University of Electronic Technology
Email: imatyushkin@ippm.ru
Россия, Zelenograd, Moscow oblast
Дополнительные файлы
