Efficient High Speed Compression Trees on Xilinx FPGAs

  title={Efficient High Speed Compression Trees on Xilinx FPGAs},
  author={Martin Kumm and Peter Zipf},
Compressor trees are efficient circuits to realize multi-operand addition with fast carry-save arithmetic. They can be found in various arithmetic applications like multiplication, squaring and the evaluation of polynomials with application to function approximation. Finding good elementary compressing elements on FPGAs is a non-trivial task as an efficient mapping to look-up tables and carry-chain logic has to be found. It was shown recently that common ternary adders on modern FPGAs… CONTINUE READING