The paper presents a parallel ATPG algorithm - PTGBP, which aims at decreasing the complexity of the ATPG by partitioning circuit under test (CUT) to big function blocks (BFB) and processing them parallelly. PTGBP ado...The paper presents a parallel ATPG algorithm - PTGBP, which aims at decreasing the complexity of the ATPG by partitioning circuit under test (CUT) to big function blocks (BFB) and processing them parallelly. PTGBP adopts hybrid circuit mode and hybrid fault model, and organizes the parallel course in term of master/slave mode. Master processor loads the whole netlist of CUT based on BFB, every slave processor loads logic level (gate/function block/basic logic units) netlist of a BFB. Test generation (TG) uses BFB input/output s-a-0/s-a-1 fault model; fault simulation uses logic level single stuck fault model. Master controls the PTGBP’s running course and ensures the correctness of its running result; slaves provide the results of fault sensitization compatible computation and fault simulation to master parallelly. PTGBP algorithm is under implementation.展开更多
基金Supported by National Natural Science Founding of China.
文摘The paper presents a parallel ATPG algorithm - PTGBP, which aims at decreasing the complexity of the ATPG by partitioning circuit under test (CUT) to big function blocks (BFB) and processing them parallelly. PTGBP adopts hybrid circuit mode and hybrid fault model, and organizes the parallel course in term of master/slave mode. Master processor loads the whole netlist of CUT based on BFB, every slave processor loads logic level (gate/function block/basic logic units) netlist of a BFB. Test generation (TG) uses BFB input/output s-a-0/s-a-1 fault model; fault simulation uses logic level single stuck fault model. Master controls the PTGBP’s running course and ensures the correctness of its running result; slaves provide the results of fault sensitization compatible computation and fault simulation to master parallelly. PTGBP algorithm is under implementation.
