Abstract
The paper describes two methods for the design of matrix-oriented SAT solvers based on data compression. The first one provides matrix compression in a host computer and decompression in an FPGA. It is shown that although some improvements have been achieved in this case, there exists a better solution. The second method makes possible to execute operations required for solving the SAT problem over compressed matrices.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
de Sousa, J., Marques-Silva, J.P., Abramovici, M.: A configware/software approach to SAT solving. In: Proc. 9th IEEE Int. Symp. on Field-Programmable Custom Computing Machines (2001)
Zhong, P.: Using Configurable Computing to Accelerate Boolean Satisfiability., Ph.D. dissertation, Department of Electrical Engineering, Princeton University (1999)
Skliarova, I., Ferrari, A.B.: Reconfigurable Hardware SAT Solvers: A Survey of Systems. In: Y. K. Cheung, P., Constantinides, G.A. (eds.) FPL 2003. LNCS, vol. 2778, pp. 468–477. Springer, Heidelberg (2003)
Skliarova, A.B.: Ferrari, The Design and Implementation of a Reconfigurable Processor for Problems of Combinatorial Computation. Journal of Systems Architecture, Special Issue on Reconfigurable Systems 49, 211–226 (2003)
Skliarova, I., Ferrari, A.B.: A Software/Reconfigurable Hardware SAT Solver. IEEE Transactions on VLSI Systems 12(4), 408–419 (2004)
Sklyarov, V.: FPGA-based implementation of recursive algorithms. Microprocessors and Microsystems, Special Issue on FPGAs: Applications and Designs 28/5-6, 197–211 (2004)
Available, http://www.celoxica.com/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sklyarov, V., Skliarova, I., Pimentel, B., Arrais, J. (2004). Hardware/Software Implementation of FPGA-Targeted Matrix-Oriented SAT Solvers. In: Becker, J., Platzner, M., Vernalde, S. (eds) Field Programmable Logic and Application. FPL 2004. Lecture Notes in Computer Science, vol 3203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30117-2_100
Download citation
DOI: https://doi.org/10.1007/978-3-540-30117-2_100
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22989-6
Online ISBN: 978-3-540-30117-2
eBook Packages: Springer Book Archive