An Easily Testable Routing Architecture and Prototype Chip

被引:11
|
作者
Inoue, Kazuki [1 ]
Koga, Masahiro [1 ]
Amagasaki, Motoki [1 ]
Iida, Masahiro [1 ]
Ichida, Yoshinobu [2 ]
Saji, Mitsuro [2 ]
Iida, Jun [2 ]
Sueyoshi, Toshinori [1 ]
机构
[1] Kumamoto Univ, Grad Sch Sci & Technol, Kumamoto 8608555, Japan
[2] ROHM Co Ltd, Kyoto 6158585, Japan
来源
关键词
design for testability; homogeneous architecture; test method; prototype chip;
D O I
10.1587/transinf.E95.D.303
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Generally, a programmable LSI such as an FPGA is difficult to test compared to an ASIC. There are two major reasons for this. The first is that an automatic test pattern generator (ATPG) cannot be used because of the programmability of the FPGA. The other reason is that the FPGA architecture is very complex. In this paper, we propose a new FPGA architecture that will simplify the testing of the device. The base of our architecture is general island-style FPGA architecture, but it consists of a few types of circuit blocks and orderly wire connections. This paper also presents efficient test configurations for our proposed architecture. We evaluated our architecture and test configurations using a prototype chip. As a result, the chip was fully tested using our configurations in a short test time. Moreover, our architecture can provide comparable performance to a conventional FPGA architecture.
引用
收藏
页码:303 / 313
页数:11
相关论文
共 50 条
  • [1] REAL-TIME MAXIMUM VALUE DETERMINATION ON AN EASILY TESTABLE VLSI ARCHITECTURE
    VAI, M
    MOY, MM
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS, 1993, 40 (04): : 283 - 285
  • [2] Testable clock routing architecture for field programmable gate arrays
    Kumar, LK
    Mupid, AJ
    Ramani, AS
    Kamakoti, V
    FIELD-PROGRAMMABLE LOGIC AND APPLICATIONS, PROCEEDINGS, 2003, 2778 : 1044 - 1047
  • [3] DESIGN OF EASILY TESTABLE LOGIC
    ROMANKEVICH, AM
    STUKACH, ND
    AUTOMATION AND REMOTE CONTROL, 1991, 52 (03) : 428 - 434
  • [4] Easily Testable Graph Properties
    Alon, Noga
    Fox, Jacob
    COMBINATORICS PROBABILITY & COMPUTING, 2015, 24 (04): : 646 - 657
  • [5] EASILY TESTABLE ITERATIVE SYSTEMS
    FRIEDMAN, AD
    IEEE TRANSACTIONS ON COMPUTERS, 1973, C 22 (12) : 1061 - 1064
  • [6] A characterization of easily testable induced subgraphs
    Alon, Noga
    Shapira, Asaf
    COMBINATORICS PROBABILITY & COMPUTING, 2006, 15 (06): : 791 - 805
  • [7] DESIGN AND TESTING OF EASILY TESTABLE PLA
    MOTTALIB, MA
    DASGUPTA, P
    IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1991, 138 (05): : 357 - 360
  • [8] EASILY TESTABLE REALIZATIONS FOR LOGIC FUNCTIONS
    REDDY, SM
    IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (11) : 1183 - +
  • [9] EASILY TESTABLE REALIZATIONS FOR LOGIC FUNCTIONS
    KODANDAPANI, KL
    IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (03) : 332 - 333
  • [10] Design of a fast, easily testable ALU
    Blanton, RD
    Hayes, JP
    14TH IEEE VLSI TEST SYMPOSIUM, PROCEEDINGS, 1996, : 9 - 16