The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1982 vol.31)
pp: 802-805
S. Dormido , Departamento de Informatica y Autom?tica, Universidad Complutense, Ciudad Universitaria
ABSTRACT
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].
INDEX TERMS
parallel counter networks, Digital counters, fast multipliers, multiple input adders, parallel counters
CITATION
S. Dormido, M.A. Canto, "An Upper Bound for the Synthesis of Generalized Parallel Counters", IEEE Transactions on Computers, vol.31, no. 8, pp. 802-805, August 1982, doi:10.1109/TC.1982.1676088
55 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool