Title :
An efficient VLSI architecture parallel prefix counting with domino logic
Author :
Lin, Rong ; Nakano, Koji ; Olariu, Stephan ; Zomaya, Albert Y.
Author_Institution :
Dept. of Comput. Sci., State Univ. of New York, Geneseo, NY, USA
Abstract :
We propose an efficient reconfigurable parallel prefix counting network based on the recently-proposed technique of shift switching with domino logic, where the charge/discharge signals propagate along the switch chain producing semaphores results in a network that is fast and highly hardware-compact. The proposed architecture for prefix counting N-1 bits features a total delay of (4 log N+√N-2)*Td, where Td is the delay for charging or discharging a row of two prefix sum units of eight shift switches. Simulation results reveal that Td does not exceed Ins under 0.8-micron CMOS technology. Our design is faster than any design known to us for N⩽210 Yet another important and novel feature of the proposed architecture is that it requires very simple controls, partially driven by semaphores, reducing significantly the hardware complexity and fully utilizing the inherent speed of the process
Keywords :
digital arithmetic; parallel architectures; reconfigurable architectures; VLSI architecture; VLSI design; computer arithmetic; digital signal processing; domino logic; hardware complexity; parallel architectures; parallel prefix counting; reconfigurable; shift switching; special-purpose parallel architectures; CMOS technology; Computer architecture; Concurrent computing; Delay; Digital arithmetic; Logic design; Signal design; Signal processing; Switches; Very large scale integration;
Conference_Titel :
Parallel Processing, 1999. 13th International and 10th Symposium on Parallel and Distributed Processing, 1999. 1999 IPPS/SPDP. Proceedings
Conference_Location :
San Juan
Print_ISBN :
0-7695-0143-5
DOI :
10.1109/IPPS.1999.760476