By Topic

A Synthesizing Method for Large Parallel Counters with a Network of Smaller Ones

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kobayashi, H. ; Department of Electronics and Communication, School of Science and Engineering, Waseda University ; Ohara, H.

This correspondence introduces an extended method of parallel counting which enables small parallel counters to generate larger ones. It is an extension of the Method of Carry Showers by Foster and Stockton to a (u,v)-counter network. A (u,v) counter is a small parallel counter with u inputs and v outputs, u = 2v− 1. It is shown that the counter delay is proportional to the log of the number N of inputs and the total number of elements is approximated by N/(u-v).

Published in:

Computers, IEEE Transactions on  (Volume:C-27 ,  Issue: 8 )