<会議発表論文>
Multi-Operand Adder Synthesis on FPGAs using Generalized Parallel Counters

作成者
本文言語
発行日
収録物名
収録物名
出版タイプ
アクセス権
概要 Multi-operand adders, which are also found in parallel multipliers, usually consist of the compression trees which reduce the number of operands per a bit to two, and the carrypropagate adder for the ...two operands in ASIC implementation. The former part is usually realized using full adders or (3;2) counters like Wallace-trees in ASIC, though adder trees or dedicated hardware are used in FPGA. In this paper, an approach to realize compression trees on FPGAs is proposed. In case of FPGA with m-input LUT, any larger or generalized parallel counters with up to m inputs can be realized with one LUT per an output. Our approach utilizes generalized parallel counters with up to m inputs and synthesizes the compression trees to implement high-performance multi-operand adders by setting some intermediate height limits in the compression process like Dadda multipliers. Several experiments on Altera’s Stratix III show its effectiveness against existing approaches.続きを見る

本文情報を非表示

taeko09_1 pdf 116 KB 167  

詳細

レコードID
査読有無
関連情報
タイプ
登録日 2009.08.18
更新日 2020.11.27

この資料を見た人はこんな資料も見ています