The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
부울 매칭은 FPGA 합성의 근본적인 문제이지만 기존 부울 매칭기는 복잡한 PLB(프로그래머블 로직 블록) 및 대형 회로로 확장 가능하지 않습니다. 본 논문에서는 미리 계산된 매칭 결과를 저장하는 Bloom 필터로 구현된 룩업 테이블을 이용하여 불리언 매칭을 가속화하는 필터 기반 불리언 매칭 방법인 F-BM을 제안한다. 제안한 F-BM의 유효성을 보여주기 위해 부울 매칭을 커널로 사용하는 사후 매핑 재합성 최소화 영역을 구현하였다. 광범위한 벤치마크에서 테스트된 F-BM을 사용한 재합성기는 SAT 기반 부울 일치기를 사용하는 것에 비해 80% 더 많은 영역으로 0.5배 더 빠릅니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Chun ZHANG, Yu HU, Lingli WANG, Lei HE, Jiarong TONG, "Accelerating Boolean Matching Using Bloom Filter" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 10, pp. 1775-1781, October 2010, doi: 10.1587/transfun.E93.A.1775.
Abstract: Boolean matching is a fundamental problem in FPGA synthesis, but existing Boolean matchers are not scalable to complex PLBs (programmable logic blocks) and large circuits. This paper proposes a filter-based Boolean matching method, F-BM, which accelerates Boolean matching using lookup tables implemented by Bloom filters storing pre-calculated matching results. To show the effectiveness of the proposed F-BM, a post-mapping re-synthesis minimizing area which employs Boolean matching as the kernel has been implemented. Tested on a broad selection of benchmarks, the re-synthesizer using F-BM is 80X faster with 0.5% more area, compared with the one using a SAT-based Boolean matcher.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1775/_p
부
@ARTICLE{e93-a_10_1775,
author={Chun ZHANG, Yu HU, Lingli WANG, Lei HE, Jiarong TONG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Accelerating Boolean Matching Using Bloom Filter},
year={2010},
volume={E93-A},
number={10},
pages={1775-1781},
abstract={Boolean matching is a fundamental problem in FPGA synthesis, but existing Boolean matchers are not scalable to complex PLBs (programmable logic blocks) and large circuits. This paper proposes a filter-based Boolean matching method, F-BM, which accelerates Boolean matching using lookup tables implemented by Bloom filters storing pre-calculated matching results. To show the effectiveness of the proposed F-BM, a post-mapping re-synthesis minimizing area which employs Boolean matching as the kernel has been implemented. Tested on a broad selection of benchmarks, the re-synthesizer using F-BM is 80X faster with 0.5% more area, compared with the one using a SAT-based Boolean matcher.},
keywords={},
doi={10.1587/transfun.E93.A.1775},
ISSN={1745-1337},
month={October},}
부
TY - JOUR
TI - Accelerating Boolean Matching Using Bloom Filter
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1775
EP - 1781
AU - Chun ZHANG
AU - Yu HU
AU - Lingli WANG
AU - Lei HE
AU - Jiarong TONG
PY - 2010
DO - 10.1587/transfun.E93.A.1775
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2010
AB - Boolean matching is a fundamental problem in FPGA synthesis, but existing Boolean matchers are not scalable to complex PLBs (programmable logic blocks) and large circuits. This paper proposes a filter-based Boolean matching method, F-BM, which accelerates Boolean matching using lookup tables implemented by Bloom filters storing pre-calculated matching results. To show the effectiveness of the proposed F-BM, a post-mapping re-synthesis minimizing area which employs Boolean matching as the kernel has been implemented. Tested on a broad selection of benchmarks, the re-synthesizer using F-BM is 80X faster with 0.5% more area, compared with the one using a SAT-based Boolean matcher.
ER -