Binary Addition on Cellular Automata
Bhavin Sheth
Prantik Nag
Robert W. Hellwarth
University of Southern California,
Los Angeles, CA 90089-0484, USA
Abstract
A cellular automata approach to fast addition of binary numbers is presented. This approach utilizes the intrinsically parallel nature of the cellular automaton to add binary numbers represented as on/off pixels on the computer screen. Numbers n-bit long are added serially pairwise until the final sum is obtained. This approach can easily be generalized to numbers of any base, but is constrained by the number of planes available on the Cellular Automata Machine.
