loading...
Recursive versus Iterative Algorithms for Solving Combinatorial Search Problems in Hardware
Hyderabad, India January 04-January 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/VLSI.2008.5121st International Conference on VLSI ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The paper analyses and compares alternative iterative and recursive implementations of combinatorial search algorithms in hardware (in field-programmable gate arrays ? FPGA, in particular). The results of experiments and comparisons for three widely used problems from this scope are presented, namely for the Boolean satisfiability, binary matrix covering, and graph coloring. The relevant comparative data have been obtained as a result of synthesis and implementation in FPGAs of the respective circuits from VHDL specifications.
Citation:
Iouliia Skliarova, Valery Sklyarov, "Recursive versus Iterative Algorithms for Solving Combinatorial Search Problems in Hardware," vlsid, pp.255-260, 21st International Conference on VLSI Design (VLSI Design 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.