Optimizing high speed arithmetic circuits using three-term extraction

Carry Save Adder (CSA) trees are commonly used for high speed implementation of multi-operand additions. We present a method to reduce the number of the adders in CSA trees by extracting common three-term subexpressions. Our method can optimize multiple CSA trees involving any number of variables. This optimization has a significant impact on the total area of the synthesized circuits, as we show in our experiments. To the best of our knowledge, this is the only known method for eliminating common subexpressions in CSA structures. Since extracting common subexpressions can potentially increase delay, we also present a delay aware extraction algorithm that takes into account the different arrival times of the signals.

• Type: Conference
• Year: 2006
• Where: DATE
• Authors: Anup Hosangadi, Farzan Fallah, Ryan Kastner
• Keywords: Carry Save Adder, CSA Trees, DATE 2006, Hardware, Multiple Csa Trees