The search functionality is under construction.

Author Search Result

[Author] Michiaki MURAOKA(7hit)

1-7hit
  • Partial Scan Design Methods Based on n-Fold Line-Up Structures and the State Justification of Pure Load/Hold Flip-Flops

    Toshinori HOSOKAWA  Toshihiro HIRAOKA  Mitsuyasu OHTA  Michiaki MURAOKA  Shigeo KUNINOBU  

     
    PAPER-Design for Testability

      Vol:
    E81-D No:7
      Page(s):
    660-667

    We will present a partial scan design method based on n-fold line-up structures in order to achieve high fault efficiency and reduce test pattern generation time for practical LSIs. We will also present a partial scan design method based on the state justification of pure load/hold FFs in order to achieve high fault efficiency and reduce the number of scan FFs for practical LSIs with lots of load/hold FFs. Experimental results for practical LSIs show that our presented methods can achieve high fault efficiency (more than 99%) and reduce the number of scan FFs for the LSI with lots of load/hold FFs.

  • A Partial Scan Design Approach based on Register-Transfer Level Testability Analysis

    Akira MOTOHARA  Sadami TAKEOKA  Mitsuyasu OHTA  Michiaki MURAOKA  

     
    PAPER-Design for Testability

      Vol:
    E79-D No:10
      Page(s):
    1436-1442

    An approach to design for testability using register-transfer level (RTL) partial scan selection is described. We define an RTL circuit model which enables efficient description in an electronic system design automation (ESDA) tool and testability analysis which leads to effective partial scan selection for RTL design including data path circuits and control circuits such as state machines. We also introduced a method of partial scan selection at RTL which selects critical registers and state machines based on RTL testability analysis. DFT techniques using gate level testability measures have been studied and concluded that they are not successful in achieving high fault coverage [15]. However, we started this work for the following reasons, 1) In sequential ATPG procedure, more than two memory elements belonging to a functional units such as registers and state machines are often required to be justified at a time. At RTL, state machines and registers are explicitly described and recognized as functional units while gate level memory elements are scattered over the circuit. 2) As discussed in [6], if the circuit is modified so that the test sequence which causes state transition between initial and final states of sequential ATPG can be easily obtained, ATPG results can be also improved. Complex state machines can be identified at RTL. According to the experimental results, our gate level DFT achieves high fault coverage comparable with the previously published most successful DFT methods, and DFT at RTL resulted in higher fault coverage than gate level DFT at much shorter CPU time.

  • Two Test Generation Methods Using a Compacted Test Table and a Compacted Test Plan Table for RTL Data Path Circuits

    Toshinori HOSOKAWA  Hiroshi DATE  Michiaki MURAOKA  

     
    PAPER-Test Generation and Modification

      Vol:
    E85-D No:10
      Page(s):
    1474-1482

    This paper proposes a test generation method using a compacted test table and a test generation method using a compacted test plan table for RTL data path circuits with DFT where hierarchical test generations are applicable. Moreover, a heuristic algorithm for a compacted test plan table generation is proposed. The proposed methods could shorten test lengths for some RTL data path circuits compared with the conventional hierarchical test generation method.

  • SoC Architecture Synthesis Methodology Based on High-Level IPs

    Michiaki MURAOKA  Hiroaki NISHI  Rafael K. MORIZAWA  Hideaki YOKOTA  Yoichi ONISHI  

     
    PAPER-System Level Design

      Vol:
    E87-A No:12
      Page(s):
    3057-3067

    We propose a sophisticated synthesis methodology for SoC (System-on-Chip) architectures from the system level specification based on reusable high-level IPs named as Virtual Cores (VCores), in this paper. This synthesis methodology generates an initial architecture that consists of a CPU, buses, IPs, peripherals, I/Os and an RTOS (Real Time Operating System), as well as making tradeoffs to the architecture, between hardware and software on assigned software VCores and hardware VCores. The results of an architecture level design experiment, using the proposed methodology, shows that the partial automation of the architecture synthesis process, allied with design reuse, accelerates the architecture design, therefore, reducing the time required to design an architecture of SoC.

  • FOREWORD

    Michiaki MURAOKA  

     
    FOREWORD

      Vol:
    E87-A No:12
      Page(s):
    3029-3029
  • A DFT Selection Method for Reducing Test Application Time of System-on-Chips

    Masahide MIYAZAKI  Toshinori HOSOKAWA  Hiroshi DATE  Michiaki MURAOKA  Hideo FUJIWARA  

     
    PAPER-SoC Testing

      Vol:
    E87-D No:3
      Page(s):
    609-619

    This paper proposes an SoC test architecture generation framework. It contains a database, which stores the test cost information of several DFTs for every core, and a DFT selection part which performs DFT selection for minimizing the test application time using this database in the early phase of the design flow. Moreover, the DFT selection problem is formulated and the algorithm that solves this problem is proposed. Experimental results show that bottlenecks in test application time when using a single DFT method for all cores in an SoC is reduced by performing DFT selection from two types of DFTs. As a result, the whole test application time is drastically shortened.

  • A Test Plan Grouping Method to Shorten Test Length for RTL Data Paths under a Test Controller Area Constraint

    Toshinori HOSOKAWA  Hiroshi DATE  Masahide MIYAZAKI  Michiaki MURAOKA  Hideo FUJIWARA  

     
    PAPER-Test

      Vol:
    E86-D No:12
      Page(s):
    2674-2683

    This paper proposes a test generation method using several partly compacted test plan tables for RTL data paths. Combinational modules in data paths are tested using several partly compacted test plan tables. Each partly compacted test plan table is generated from each grouped test plan set and is used to test combinational modules corresponding to the grouped test plans. The values of control signals in a partly compacted test plan table are supplied by a test controller. This paper also proposes the architecture of a test controller which can be synthesized in a reasonable amount of time, and proposes a test plan grouping method to shorten test length for data paths under a test controller area constraint. Experimental results for benchmarks show that the test lengths are shortened by 4 to 36% with -9 to 8% additional test controller area compared with the test generation method using test plans.