Peeling algorithm for custom instruction identification

To speedup the custom instruction identification for the application specific instruction-set processor (ASIP), this paper proposes a peeling algorithm. It starts with the maximal valid pattern, and then gets a set of valid sub-patterns through deleting the source and sink respectively. Furthermore, a local priority is proposed for the exhaustive pruning. The final experiment indicates a distinct speedup compared to the fastest deterministic algorithm.