An Upper Bound for the Synthesis of Generalized Parallel Counters

Recently, an algorithm has been developed for synthesizing generalized parallel counters (GPC´s) with a network of smaller ones [11]. In this correspondence we obtain an upper bound q, for the number of levels q in the synthesis of GPC´s. This upper bound generalizes and improves the values deduced by other authors in [13] and [14].