DOI QR코드

DOI QR Code

Multi-operation-based Constrained Random Verification for On-Chip Memory

  • Son, Hyeonuk (Department of Electrical and Electronic Engineering, Yonsei University) ;
  • Jang, Jaewon (Department of Electrical and Electronic Engineering, Yonsei University) ;
  • Kim, Heetae (Department of Electrical and Electronic Engineering, Yonsei University) ;
  • Kang, Sungho (Department of Electrical and Electronic Engineering, Yonsei University)
  • 투고 : 2015.03.21
  • 심사 : 2015.05.31
  • 발행 : 2015.06.30

초록

Current verification methods for on-chip memory have been implemented using coverpoints that are generated based on a single operation. These coverpoints cannot consider the influence of other memory banks in a busy state. In this paper, we propose a method in which the coverpoints account for all operations executed on different memory banks. In addition, a new constrained random vector generation method is proposed to reduce the required random vectors for the multi-operation-based coverpoints. The simulation results on NAND flash memory show 100% coverage with 496,541 constrained random vectors indicating a reduction of 96.4% compared with conventional random vectors.

키워드

참고문헌

  1. N. Kichen and A. Kuehlmann, "Stimulus Generation for Constrained Random Simulation," International Conference on Computer Aided Design (ICCAD), pp. 258-265, Nov. 2007.
  2. M. D, Moffitt and G. E. Gunther, "Scalable Scheduling for Hardware Accelerated Functional Verification," International Conference on Automated Planning and Scheduling (ICAPS), pp. 162-169, Jun. 2011.
  3. M. A. Iyer, "RACE: A Word-Level ATPG-Based constraints Solver System for Smart Random Simulation," International Test Conference (ITC), pp. 299-308, Sep. 2003.
  4. M. Kudlugi, C. Sevidge and R. Tessier, "Static Scheduling of Multi-Domain Memories For Functional Verification," International Conference on Computer Aided Design (ICCAD), pp. 2-9, Nov. 2001.