Application of shifted Popov form in high-level synthesis and verification for reconfigurable architectures

The development of next-generation computer-aided design tools and field reconfigurable architectures require efficient high-level data-flow synthesis. In this paper, we present the transform rules from polynomial presentation to polynomial matrix presentation and show how symbolic algebra can be used to construct arithmetic-level decomposition algorithm with extensibility that leads to efficient high-level synthesis of system. And the simple verification approach for reconfigurable architectures is given. On second thoughts, the parallelism of the mapping methodology for matrix multiplication is utilized to speed up the process of optimization. The key contribution of the work is to obtain a minimal state-space realization of the system.