Sciweavers

4 search results - page 1 / 1
» Accelerating Boolean Implications with FPGAs
Sort
View
FPL
1999
Springer
88views Hardware» more  FPL 1999»
13 years 9 months ago
Accelerating Boolean Implications with FPGAs
Kolja Sulimma, Dominik Stoffel, Wolfgang Kunz
FPGA
2007
ACM
163views FPGA» more  FPGA 2007»
13 years 11 months ago
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
Jason Cong, Kirill Minkovich
ICCD
2007
IEEE
205views Hardware» more  ICCD 2007»
14 years 1 months ago
Hardware libraries: An architecture for economic acceleration in soft multi-core environments
In single processor architectures, computationallyintensive functions are typically accelerated using hardware accelerators, which exploit the concurrency in the function code to ...
David Meisner, Sherief Reda
ICCAD
1996
IEEE
93views Hardware» more  ICCAD 1996»
13 years 9 months ago
VERILAT: verification using logic augmentation and transformations
This paper presents a new framework for formal logic verification. What is depicted here is fundamentally different from previous approaches. In earlier approaches, the circuit is ...
Dhiraj K. Pradhan, Debjyoti Paul, Mitrajit Chatter...