Мақаланы E-mail арқылы жіберу Cellular Automata Algorithms for String Sorting and Integer Multiplication According to the Atrubin Scheme
- Авторлар: Matyushkin I.1,2,3, Zhemerikin A.2, Zapletina M.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
