High-level synthesis of data paths with concurrent error detection

被引:19
作者
Antola, A [1 ]
Piuri, V [1 ]
Sami, M [1 ]
机构
[1] Politecn Milan, Dipartimento Elettron & Informaz, I-20133 Milan, Italy
来源
1998 IEEE INTERNATIONAL SYMPOSIUM ON DEFECT AND FAULT TOLERANCE IN VLSI SYSTEMS, PROCEEDINGS | 1998年
关键词
D O I
10.1109/DFTVS.1998.732178
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
High-level synthesis of data paths with concurrent self-checking abilities is discussed to balance redundancy latency, and checking effectiveness. The nominal and the checking computations are scheduled and allocated contemporaneously by using a force-directed approach to limit the number of redundant units required to achieve detection within the latency of the nominal computation only. Resource sharing between the nominal and the checking computation is used to minimise the redundancy, while keeping error aliasing as reduced as possible.
引用
收藏
页码:292 / 300
页数:9
相关论文
共 11 条
  • [1] Semi-concurrent error detection in data paths
    Antola, A
    Piuri, V
    Sami, M
    [J]. 1997 IEEE INTERNATIONAL SYMPOSIUM ON DEFECT AND FAULT TOLERANCE IN VLSI SYSTEMS, PROCEEDINGS, 1997, : 298 - 306
  • [2] Antola A, 1996, EURO-DAC '96 - EUROPEAN DESIGN AUTOMATION CONFERENCE WITH EURO-VHDL '96 AND EXHIBITION, PROCEEDINGS, P382, DOI 10.1109/EURDAC.1996.558233
  • [3] ANTOLA A, 1998, P DATE 98
  • [4] ANTOLA A, 1996, P IEEE DFT 96
  • [5] BOLCHINI C, 1995, IEEE P DFT 95
  • [6] BUONANNO G, 1997, P 1997 IEEE VLSI TES
  • [7] Concurrent error recovery with near-zero latency in synthesized ASICs
    Hamilton, SN
    Orailoglu, A
    [J]. DESIGN, AUTOMATION AND TEST IN EUROPE, PROCEEDINGS, 1998, : 604 - 609
  • [8] IYER B, 1996, P DES AUT C ACM NEW, P137
  • [9] Automatic synthesis of self-recovering VLSI systems
    Orailoglu, A
    Karri, R
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (02) : 131 - 142
  • [10] On-line fault resilience through gracefully degradable ASICs
    Orailoglu, A
    [J]. JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS, 1998, 12 (1-2): : 145 - 151