Design methodology for a tightly coupled VLIW/reconfigurable matrix architecture: a case study

B. Mei, S. Vernalde, D. Verkest, R. Lauwereins

Proceedings Design, Automation and Test in Europe Conference and Exhibition · 2004 · 70 citations · 7 references

Concepts

TL;DR

Coarse‑grained reconfigurable architectures are increasingly important, and effective design tools and methodology are essential for their success. The authors present a C‑based design flow for a tightly coupled VLIW/reconfigurable matrix architecture, illustrated with an MPEG‑2 decoder. The methodology builds on modulo scheduling algorithms and a novel tightly coupled VLIW/reconfigurable matrix architecture, implemented in C and applied to an MPEG‑2 decoder. Mapping the MPEG‑2 decoder to the architecture required less than one person‑week from a software baseline, achieving kernel and overall speedups of 4.84× and 3.05× over a reference VLIW, demonstrating competitive design effort and performance versus other programmable architectures.

Abstract

Coarse-grained reconfigurable architectures have seen growing importance recently. Design tools and methodology are essential to their success. Based on our previous work on modulo scheduling algorithms and a novel architecture with tightly coupled VLIW/reconfigurable matrix, we present a C-based design flow using an MPEG-2 decoder as a design example. The application is mapped to the architecture in less than one person-week starting from a software implementation. The kernel and overall speedup over the reference VLIW are 4.84 and 3.05 respectively. The case study shows that our methodology and architecture can deliver a competitive package in terms of design efforts and performance over other programmable architectures.

References

7