loading...
Scheduling of Iterative Algorithms on FPGA with Pipelined Arithmetic Unit
Toronto, Canada May 25-May 28
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTTAS.2004.131728710th IEEE Real-Time and Embedded Tech ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Premysl Sucha, Czech Technical University in Prague
Zdenek Pohl, Institute of Information Theory and Automation
Zdenek Hanz?lek, Czech Technical University in Prague
This paper presents a scheduling technique for a library of arithmetic logarithmic modules for FPGA illustrated on a RLS filter for active noise cancellation. The problem under assumption is to find an optimal periodic cyclic schedule satisfying the timing constraints. The approach is based on a transformation to monoprocessor cyclic scheduling with precedence delays. We prove that this problem is NP-hard and we suggest a solution based on Integer Linear Programming that allows to minimize completion time. Finally experimental results of optimized RLS filter are shown.
Index Terms:
Cyclic scheduling, monoprocessor, iterative algorithms, integer linear programming, FPGA
Citation:
Premysl Sucha, Zdenek Pohl, Zdenek Hanz?lek, "Scheduling of Iterative Algorithms on FPGA with Pipelined Arithmetic Unit," rtas, pp.404, 10th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.