A New Realization of Sum of Products and Transposed Sum of products implementation by Partitioned Arithmetic

A new approach to the implementation of sum of products (SP) and transposed sum of products (TSP) using partitioned arithmetic is proposed. This approach is able to realize SP and TSP with recent advanced semiconductor memory technology´ without multipliers. It is also shown to offer significant reductions in memory capacity requirement and computational complexity. Particularly, in the case of large size SP and TSP this approach becomes more effective and useful. A comparison between the proposed approach and the conventional methods is discussed. Dynamic range constraints and output roundoff noise analysis are also discussed.