Modeling and FPGA Implementation of Applications Using Parameterized Process Networks with Non-Static Parameters

Authors:
Hristo Nikolov;Todor Stefanov;Ed Deprettere
Affiliations:
Leiden University;Leiden University;Leiden University
Venue:
FCCM '05 Proceedings of the 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Year:
2005

Citing 0
Cited 3

SoC Memory Hierarchy Derivation from Dataflow Graphs

Journal of Signal Processing Systems
FPGA implementation of a prototype hierarchical control network for large-scale signal processing applications

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Parameterized Scheduling of Topological Patterns in Signal Processing Dataflow Graphs

Journal of Signal Processing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Todayýs applications in the domains of multimedia, signal processing, etc. consist of a number of interacting components. If the way of interaction is determined at run time, we say that an application is non-static. In general, complex real-world applications are non-static. In this paper, we summarize a method for modeling and FPGA implementation of applications that have a specific type of non-static behavior. This method is based on program decomposition resulting in the generation of truly Parameterized Kahn Process Networks and their mapping onto FPGAs. We automated the method by integrating it in our tools Compaan/Laura. The efficiency of our method is demonstrated by an implementation of a real-world application taken from the automotive domain.