For efficiently implementation of a signal processing algorithm on a given processor architecture, we often need to choose an appropriate algorithm among existing ones, or design an algorithm effective for the target architecture, where elapsed time and usage of computational resources are taken into account. In this article, a given program is analysed by use of the 3-D representation scheme, and then it is automatically translated into one of the most efficient algorithms for a target hardware. The 3-D representation scheme is extended, so that it can easily handle multiple data stream with nested conditional branches. Heuristic transformation techniques over the 3-D representation are proposed. The proposed techniques are iteratively applied to an example sorting algorithm, and, by the derived algorithm, its effectiveness is shown.
展开▼
