Parallel Counters

Multiple-input circuits that count the number of their inputs that are in a given state (normally logic ONE) are called parallel counters. In this paper three separate types of counters are described, analyzed, and compared. The first counter consists of a network of full adders. The second counter uses a combination of full adders and fast adders (that may be realized with READ-ONLY memories), while the third type of counter uses quasi-digital (i.e., analog current summing) techniques to generate an analog signal proportional to the count which is then digitized.

[1]  R. H. S. Riordan,et al.  The Use of Analog Techniques in Binary Arithmetic Units , 1965, IEEE Trans. Electron. Comput..

[2]  Paul A. Wintz,et al.  Fast Multipliers , 1970, IEEE Transactions on Computers.

[3]  Caxton C. Foster,et al.  Counting Responders in an Associative Memory , 1971, IEEE Transactions on Computers.

[4]  T. C. Chen,et al.  Multiple Addition by Residue Threshold Functions and Their Representation by Array Logic , 1973, IEEE Transactions on Computers.

[5]  Earl E. Swartzlander The Quasi-Serial Multiplier , 1973, IEEE Transactions on Computers.

[6]  ANTONIN SVOBODA Adder With Distributed Control , 1970, IEEE Transactions on Computers.