期刊文献+

A Novel Register Allocation Algorithm for Testability 被引量:1

A Novel Register Allocation Algorithm for Testability
原文传递
导出
摘要 In the course of high-level synthesis of integrate circuit, the hard-to-test structure caused by irrational schedule and allocation reduces the testability of circuit. In order to improve the circuit testability, this paper proposes a weighted compatibility graph (WCG), which provides a weighted formula of compatibility graph based on register allocation for testability and uses improved weighted compatibility clique partition algorithm to deal with this WCG. As a result, four rules for testability are considered simultaneously in the course of register allocation so that the objective of improving the design of testability is acquired. Tested by many experimental results of benchmarks and compared with many other models, the register allocation algorithm proposed in this paper has greatly improved the circuit testability with little overhead on the final circuit area. In the course of high-level synthesis of integrate circuit, the hard-to-test structure caused by irrational schedule and allocation reduces the testability of circuit. In order to improve the circuit testability, this paper proposes a weighted compatibility graph (WCG), which provides a weighted formula of compatibility graph based on register allocation for testability and uses improved weighted compatibility clique partition algorithm to deal with this WCG. As a result, four rules for testability are considered simultaneously in the course of register allocation so that the objective of improving the design of testability is acquired. Tested by many experimental results of benchmarks and compared with many other models, the register allocation algorithm proposed in this paper has greatly improved the circuit testability with little overhead on the final circuit area.
出处 《Tsinghua Science and Technology》 SCIE EI CAS 2007年第S1期57-60,共4页 清华大学学报(自然科学版(英文版)
基金 the National Natural Science Foundation of China (No.60273081)
关键词 high-level synthesis register allocation TESTABILITY compatibility graph clique partition algorithm high-level synthesis register allocation testability compatibility graph clique partition algorithm
  • 相关文献

参考文献6

  • 1Cheng K T,Agrawal V D.A partial scan method for se- quential circuit with feedback[].IEEE Transactions on Communications.1990
  • 2Tseng C J,Siewiorek D P.Automated synthesis of data paths in digital systems[].IEEE Trans on Computer Aided Design.1986
  • 3Lee M T C.High-Level Test Synthesis of Digital VLSI Circuit[]..1997
  • 4Hermanani H,Saliba R.An evolutionary algorithm for the testable allocation problem in high-level synthesis.J. Cir- cuits Syst[].Computer.2005
  • 5Ravi S,Lakshminarayana G,Jha N K.TAO: Regular ex- pression-based register-transfer level testability analysis and optimization[].IEEE Transactions on Very Large Scale Integration Systems.2001
  • 6Potkonjak M,Dey S,Kroy R.Behavioral synthesis of area-efficient testable designs using interaction between hardware sharing and partial scan[].IEEE On Computer- Aided Design of Integrated Circuits Systems.1995

同被引文献1

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部