<会議発表論文>
Area recovery under depth constraint by cut substitution for technology mapping for LUT-based FPGAs

作成者
本文言語
発行日
収録物名
収録物名
開始ページ
終了ページ
出版タイプ
アクセス権
概要 In this paper we present the post-processing algorithm, Cut Substitution, for technology mapping for LUT-based FPGAs to minimize the area under depth minimum constraint. The problem to generate a LUT’...s network whose area is minimum under depth minimum costraint seems to be as difficult as NP-Hard class problem. Cut Substitution is the process to generate a local optimum solution by eliminating redundant LUTs while the depth of network is maintained. The experiments shows that the proposed method derives the solutions whose area are 9% smaller than the solutions of a previous state-of-the-art, DAOmap on average.続きを見る

本文情報を非表示

taiga07_2 pdf 130 KB 67  

詳細

レコードID
査読有無
関連情報
ISBN
注記
タイプ
登録日 2009.04.22
更新日 2020.10.13

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