Recursion and hierarchy in digital design and prototyping: a case study

Authors:
Dmitri Mihhailov;Margus Kruus;Valery Sklyarov;Iouliia Skliarova;Alexander Sudnitson
Affiliations:
Tallinn University of Technology, Estonia;Tallinn University of Technology;University of Aveiro, Portugal;University of Aveiro, Portugal;Tallinn University of Technology, Estonia
Venue:
Proceedings of the 12th International Conference on Computer Systems and Technologies
Year:
2011

Citing 3
Cited 0

Hierarchical finite-state machines and their use for digital control

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Introduction to Algorithms and Java CD-ROM

Introduction to Algorithms and Java CD-ROM
Parallel FPGA-Based Implementation of Recursive Sorting Algorithms

RECONFIG '10 Proceedings of the 2010 International Conference on Reconfigurable Computing and FPGAs

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the constant growth of integration level, today's circuits contain way over millions of gates. This puts forward a fundamental question -- how to efficiently use enormous and continuously rising hardware resources in the design process? This paper describes a reuse technique that can be applied to the design of FPGA-based application-specific digital systems. Reusability is achieved at the level of specifications. The proposed specification and implementation method is based on the model of hierarchical finite state machine (HFSM). This allows to describe fragments (modules) in such a way that the developed algorithm can be composed of either new or previously designed modules providing reuse on project scale.