Uğurdağ, Hasan FatihKeskin, O.Tunç, CihanTemizkan, FatihFici, G.Dedeoğlu, S.2016-02-152016-02-152011978-1-4577-1957-8http://hdl.handle.net/10679/2350https://doi.org/10.1109/EWDTS.2011.6116419Due to copyright restrictions, the access to the full text of this article is only available via subscription.Multiplication is, in no doubt, one of the top few frequently used operations in hardware and software. In high-performance hardware design, after high-level optimizations are exhausted, component level optimizations are employed such as building fast multipliers. Most fast multiplier architectures use some form of a Carry Save Adder (CSA) Tree, which is also called Column Compression (CC). We propose a new CC method called RoCoCo (Row and Column Compression), which also compresses the tree along rows so that the final adder is small and fast. Although CC results in faster multipliers in ASIC implementations, it is an assumption by designers that they are not the wisest choice on FPGAs. On the contrary, we were able to show through Xilinx synthesis results that RoCoCo (and sometimes Dadda CC) frequently offer faster multipliers than the built-in implementation of the multiply operation in Xilinx ISE synthesis tool.enginfo:eu-repo/semantics/restrictedAccessConference paper9810110.1109/EWDTS.2011.6116419AddersApplication specific integrated circuitsField programmable gate arraysIntegrated circuit design2-s2.0-84856094597