PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Codenotti B., Lotti G. A note on the VLSI counter. In: Information Processing Letters, vol. 22 pp. 193 - 195. North-Holland, 1986.
 
 
Abstract
(English)
In this note, the area-time complexity of a VLSI counter is studied. Both a lower and an upper bound are derived which meet to within the exponent of the logarithmic factor. The proposed VLSI design derives from the parallel counter presented by Muller and Preparata, which requires O(log n) delay time and O(n) number of elements. An area of order n (log)^2 n will be shown to suffice for the VLSI network and a lower bound to (AT)^2 of order n log n will also be proved.
Subject VLSI ModeI
Area-time complexity
Counter
Lower bound
C.5.4 VLSI Systems


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional