Binary addition and multiplication in cellular space

Cellular automata are highly parallel bitprocessors, so they are suitable for the bitparallel execution of distinct computational tasks. In this paper powerful bitparallel algorithms are given for fixed point binary addition and multiplication, taking into account the cellprocessor architecture developed by T. LEGENDI [1]. For this architecture there have been constructed more then 100 cellular algorithms solving different computational tasks [6]. In a large cellular space a high number of cellular adders, multipliers and other processing elements may be embedded, and more complex tasks may be computed in parallel, as matrix multiplication [4], certain data processing tasks [5], etc.