High-Level Algorithmic Complexity Analysis for the Implementation of a Motion-JPEG2000 Encoder

Abstract

Abstract. The increasing complexity of processing algorithms has lead to the need of more and more intensive specification and validation by means of software implementations. As the complexity grows, the intuitive understanding of the specific processing needs becomes harder. Hence, the architectural implementation choices or the choices between different possible software/hardware partitioning become extremely difficult tasks. Automatic tools for complexity analysis at high abstraction level are nowadays a fundamental need. This paper describes a new automatic tool for high-level algorithmic complexity analysis, the Software Instrumentation Tool (SIT), and presents the results concerning the complexity analysis and design space exploration for the implementation of a JPEG2000 encoder using a hardware/software co-design methodology on a Xilinx Virtex-II™ platform FPGA. The analysis and design process for the implementation of a video surveillance application example is described.

High level extraction of SoC architectural information from generic C algorithmic descriptions

“…Another interesting feature of the tool is the possibility of weighting all computational and memory based operators according to some specific target platforms. Accurate evaluations of the performance on the target platform are possible without the need of the actual porting of all or of some parts of the code [9].…”

“…The new approach of SIT [9] is possible by means of a breakthrough in the instrumentation/overloading technology enabling a complete detection of all C operators without any limitation in the way pointers and data structures are used Error! Reference source not found..…”

Evaluation of the parallelization potential for efficient multimedia implementations: dynamic evaluation of algorithm critical path

“…This section provides an example of how such mapping can be implemented. More details of one possible implementation of such non trivial mapping can be also found in [15], [17], [18]. During the mapping of the source C/C++-code into an instrumented C++-code version, the following parts of the C/C++-code have to be instrumented to evaluate the parallelization potential of the algorithm:…”

High-abstraction level complexity analysis and memory architecture simulations of multimedia algorithms

“…Accurate evaluations of the performance on the target platform are possible without the need of the actual porting of all or of some parts of the code [40].…”