Hierarchical Pipelining of Nested Loops in High-Level Synthesis
Abstract
Pipelining of the nested loops is very important in increasing the throughput of a system developed by a high-level synthesis tool. The most pipelining methods can handle only single loops. Therefore, nested loops are converted into a single loop, called loop flattened loop. In consequence, i.e. the sequential loops cannot be implemented in separate pipeline stages. This constraint limits the throughput. In this paper, a novel method are presented for nested loops by implementing to avoid this limitation. The method has the advantage that the desired restart time of the whole system can be given as an input parameter. The necessity of the pipeline scheduling on each loop hierarchy level can also be determined by this method. A novel multirate dataflow graph is also introduced for modeling the nested loops in an easy and abstract way.
Keywords:
HLS, SDF, multi-rate, nested loops, pipeline schedulingPublished Online
How to Cite
Issue
Section
License
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (see The Effect of Open Access). As soon as the paper is accepted, finally submitted and edited, the paper will appear in the "OnlineFirst" page of the journal, thus from this point no other internet-based publication is necessary.
