Incremental learning approach and SAT model for boolean matching with don't cares

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2007, Pages 234-239

  Wang, Kuo Hua ^a   Chan, Chung Ming ^a  

^a FU JEN CATHOLIC UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; DESIGN; EDUCATION; LEARNING ALGORITHMS; LEARNING SYSTEMS;

BOOLEAN MATCHING; BOOLEAN MATCHING ALGORITHMS; COMPUTER-AIDED DESIGN; INCOMPLETELY SPECIFIED FUNCTIONS; INCREMENTAL LEARNING; INTERNATIONAL CONFERENCES; PARTIAL MAPPINGS; SAT MODEL; SEARCHING SPACES; SINGLE VARIABLE;

BOOLEAN FUNCTIONS;

EID: 50249158672     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2007.4397271     Document Type: Conference Paper

References (14)

1. J. Cong and Y. Hwang, "Boolean Matching for LUT-Based Logic Blocks with Application to Architecture Evaluation and Technology Mapping," IEEE Transactions on Computer-Aided Design, Vol. 20, No. 9, pp. 1077-1090, Sep. 2001.
2. A. Mishchenko, S. Chatterjee, and R. Brayton, "Improvements to Technology Mapping for LUT-Based FPGAs." IEEE Transactions on Computer-Aided Design, Vol. 26, No. 2, pp. 240-253, Feb. 2007.
3. F. Mailhot and G. D. Micheli, "Technology mapping using Boolean Matching and Don't Care Sets," in Proc. of the Conference on European Design Automation, pp. 212-216, 1990.
4. L. Benini and G. D. Micheli. "A Survey of Boolean Matching Techniques for Library Binding." ACM Trans. Design Automation of Electronic Systems, Vol. 2, No. 3, pp. 193-226, July 1997.
5. A. Abdollahi and M. Pedram, "A New Canonical Form for Fast Boolean Matching in Logic Synthesis and Verification," in Proc. of Design Automation Conference, pp. 379-384. June 2005.
6. K. H. Wang and T. Hwang. "Boolean Matching for Incompletely Specified Functions." IEEE Transaction on Compuler-Aided-Design of Integrated Circuits and Systems, Vol. 16. , No. 2., pp. 160-168. Febraruary. 1997.
7. J. P. Marques-Silva and K. A. Sakallah, "GRASP: A Search Algorithm for Propositional Satisfiability," IEEE Transactions on Computer-Aided Design, Vol. 48, No. 5, pp. 506-521, May 1999.
8. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an Efficient SAT Solver," in Proc. of Design Automation Conference, pp. 530-535, June 2001.
9. J. P. Marques-Silva and K. A. Sakallah,"Boolean Satisfiability in Electronic Design Automation," in Proc. of Design Automation Conference, pp. 675-680, June 2000.
10. A. Ling, D. Singh, and S. Brown, "FPGA Technology Mapping: A Study of Optimality," in Proc. of Design Automation Conference, pp. 427-432, 2005.
11. S. Safarpour, A. Veneris, G. Baeckler, R. Yuan, "Efficient SAT-based Boolean Matching for FPGA Technology Mapping." in Proc. of Design Automation Conference, pp.466-471, July 2006.
12. J. Cong and K. Minkovich."Improved SAT-Based Boolean Matching using Implicants for LUT-based FPGAs," in Proc. of Int. Symp. on FPGAs, pp.139-147, Feb., 2007.
13. J. Denzinger, M. Fuchs, C. Goller, and S. Schulz, "Learning from Previous Proof Experience: A Survey," AR-Report AR-99-4, TU München, 1999.
14. K. H. Wang and J. H. Chen. "Symmetry Detection for Incompletely Specified Functions," in Proc. of Design Automation Conference, pp.434-437, June 2004.