MSSV: Tree-Based Mapping of Algorithms to Prede ned Structures (Extended Version)

Due to the need for fast design cycles and low production cost, programmable circuits like FPGAs and DSP processors (henceforth called target structures) are becoming increasingly popular. Design planning, detailed design as well as updating such designs requires mapping existing algorithms onto these circuits. Instead of writing target-speci c mappers, we propose using retargetable mappers. The technique reported is this paper is based on pattern matching. Binary code is generated as a result of this matching process. This paper describes the essential techniques of our mapper MSSV and identi es areas for improvements. As a result, it shows that e cient handling of alternative mappings is crucial for an acceptable performance. This report is also intended as a reference for new developments.