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

被引:0
作者
Hu, J [1 ]
Ma, GS [1 ]
Feng, G [1 ]
Lin, T [1 ]
机构
[1] Harbin Engn Univ, Dept Comp Sci & Technol, Harbin 150001, Heilongjiang, Peoples R China
来源
EUROCON 2005: THE INTERNATIONAL CONFERENCE ON COMPUTER AS A TOOL, VOL 1 AND 2 , PROCEEDINGS | 2005年
关键词
shifted Popov form; polynomial matrix; data flow synthesis; verification; reconfigurable architectures;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:503 / 506
页数:4
相关论文
共 9 条