Abstract
Analysis of different combinatorial search algorithms has shown that they have a set of distinctive features in common. The paper suggests a number of reusable blocks that support these features and provide high-level design of combinatorial accelerators.
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
Zakrevski, A.D.: Logical Synthesis of Cascade Networks. Science, Moscow (1981)
Sklyarov, V., Skliarova, I.: Architecture of Reconfigurable Processor for Implementing Search Algorithms over Discrete Matrices. In: Proceedings of ERSA 2003 (Engineering of Reconfigurable Systems and Algorithms), Las Vegas, USA (2003)
Sklyarov, V.: Reconfigurable models of finite state machines and their implementation in FPGAs. Journal of Systems Architecture 47, 1043–1064 (2002)
Sklyarov, V.: Hierarchical Finite-State Machines and Their Use for Digital Control. IEEE Transactions on VLSI Systems 7(2), 222–228 (1999)
http://webct.ua.pt , 2 semester, the discipline Computação Reconfigurável, public domain is indicated by the letter “i” enclosed in a circle. Login and password for access to the protected section can also be provided (via e-mails: skl@ieeta.pt, iouliia@det.ua.pt)
HandelC, DK1, RC100. [Online], available: http://www.celoxica.com
Alpha Data. [Online], available: http://www.alpha-data.com
Spartan-IIE Development Platform. [Online], available: http://www.trenz-electronic.de
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sklyarov, V., Skliarova, I., Almeida, P., Almeida, M. (2003). High-Level Design Tools for FPGA-Based Combinatorial Accelerators. In: Y. K. Cheung, P., Constantinides, G.A. (eds) Field Programmable Logic and Application. FPL 2003. Lecture Notes in Computer Science, vol 2778. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45234-8_99
Download citation
DOI: https://doi.org/10.1007/978-3-540-45234-8_99
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40822-2
Online ISBN: 978-3-540-45234-8
eBook Packages: Springer Book Archive