Back to Results
First PageMeta Content
Mathematical logic / Implicant / Lookup table / Canonical form / Boolean satisfiability problem / Conjunctive normal form / Binary decision diagram / Truth table / Boolean function / Boolean algebra / Theoretical computer science / Mathematics


Improved SAT-Based Boolean Matching Using Implicants for LUT-Based FPGAs Jason Cong and Kirill Minkovich Computer Science Department University of California, Los Angeles Los Angeles, CA 90095, USA
Add to Reading List

Document Date: 2007-02-13 15:10:27

Open Document

File Size: 424,40 KB

Share Result on Facebook

City

Monterey / /

Company

Verification Group / MultiValued Multi-Level Networks / ABC / Boolean Satisfiability Research Group / /

Continent

Asia / Europe / /

Country

United States / /

Currency

USD / /

/

Facility

Library Binding / Kirill Minkovich Computer Science Department University of California / /

IndustryTerm

technology mapping problem / technology mapping / area-minimal technology / technology mapping step / resynthesis tool / exhaustive search / resynthesis algorithm / /

OperatingSystem

L3 / /

Organization

Kirill Minkovich Computer Science Department University / National Science Foundation / US Federal Reserve / University of California / Los Angeles / /

Person

Jason Cong / Kirill Minkovich / /

Position

Optimization General / Major / Representative / ” Proc / General / /

ProgrammingLanguage

Perl / Python / /

ProvinceOrState

California / /

PublishedMedium

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems / /

Region

South Pacific / /

Technology

FPGA / area-minimal technology / artificial intelligence / SAT-BM-M algorithm / Perl / SRAM / integrated circuits / FPGA technology / resynthesis algorithm / CAD / /

URL

http /

SocialTag