Two new cellular pipelined algorithms for computing a sum of products

Two new cellular pipelined algorithms (2D and 3D) for computing a sum of products with a very short multiplication time (six and three steps, respectively) are proposed. The initial data and results are binary signed-digit integers. The design and investigation tool is an experemental computer simulating system (Animating Language Tools), based on an original model of distributed computation (Parallel Substitution Algorithm).