Equivalence verification of FPGA and structured ASIC implementations

被引:6
作者
Pistorius, Joachim [1 ]
Hutton, Mike [1 ]
Schleicher, Jay [1 ]
Lotov, Mihail [1 ]
Julias, Enoch [1 ]
Tharmalingam, Kumara [1 ]
机构
[1] Altera Corp, San Jose, CA 95134 USA
来源
2007 INTERNATIONAL CONFERENCE ON FIELD PROGRAMMABLE LOGIC AND APPLICATIONS, PROCEEDINGS, VOLS 1 AND 2 | 2007年
关键词
D O I
10.1109/FPL.2007.4380683
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Structured ASICs have recently emerged as a mid-way between cell-based ASICs with high NRE costs and FPGAs with high unit costs. Though the structured ASIC fabric attacks mask and other fixed cost it does not solve verification, particularly physical verification issues with ASICs or logic errors missed by simulation which would require re-spins. These can be avoided by testing in-system with an FPGA and migrating the FPGA design to a closely coupled structured ASIC fabric. Here we describe a practical methodology for a fast, push-button, and thorough verification approach tying an FPGA prototype to a matching structured-ASIC implementation for cost-reduction. Our focus is the equivalence verification between the respective revisions of a design, including netlist, compiler settings, macro-block parameters, timing constraints, pin layout and resource count.
引用
收藏
页码:423 / 428
页数:6
相关论文
共 14 条
[1]  
[Anonymous], 2004, P 2004 INT S PHYS DE
[2]  
[Anonymous], 2004, P INT S PHYS DESIGN
[3]  
BRYANT RE, 1986, IEEE T COMPUT, V35, P677, DOI 10.1109/TC.1986.1676819
[4]  
Hu B., 2003, PROC INT S PHYS DESI, P197
[5]  
HUTTON M, P DATE 2006 DES FOR, P64
[6]   Routing architecture exploration for regular fabrics [J].
Kheterpal, V ;
Strojwas, AJ ;
Pileggi, L .
41ST DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2004, 2004, :204-207
[7]  
Lewis David, 2005, INT S FIELD PROGR GA, P14
[8]  
OKAMOTO T, 2004, P ISPD, P90
[9]  
PATEL C, 2003, P INT S PHYS DES, P184
[10]  
Pileggi L, 2003, DES AUT CON, P782