Cevrero, AlessandroAthanasopoulos, PanagiotisParandeh-Afshar, HadiVerma, Ajay K.Brisk, PhilipGurkaynak, Frank K.Leblebici, YusufIenne, Paolo2008-04-232008-04-232008-04-23200810.1145/1344671.1344699https://infoscience.epfl.ch/handle/20.500.14299/23423WOS:000267587700018The Field Programmable Counter Array (FPCA) was introduced to improve FPGA performance for arithmetic circuits. An FPCA is a reconfigurable IP core that can be integrated into an FPGA. To exploit the FPCA, a circuit is transformed by merging disparate addition and multiplication operations into large multi-input addition operations, which are synthesized as compressor trees on the FPCA; the remaining portion of the circuit is synthesized on the FPGA. This paper presents a series of architectural improvements to the FPCA that reduce routing delay, increase flexibility and component utilization, and simplify the integration process. Using an FPGA containing six FPCAs, we observed average and maximum speedups of 1.60x and 2.40x on a set of arithmetic benchmarksFPGAfield programmable counter array (FPCA)text::conference output::conference proceedings::conference paper