Home
  • English
  • ÄŒeÅ¡tina
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • LatvieÅ¡u
  • Magyar
  • Nederlands
  • Português
  • Português do Brasil
  • Suomi
  • Log In
    New user? Click here to register. Have you forgotten your password?
Home
  • Browse Our Collections
  • Publications
  • Researchers
  • Research Data
  • Institutions
  • Statistics
    • English
    • ÄŒeÅ¡tina
    • Deutsch
    • Español
    • Français
    • Gàidhlig
    • LatvieÅ¡u
    • Magyar
    • Nederlands
    • Português
    • Português do Brasil
    • Suomi
    • Log In
      New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Research Output and Publications
  3. Faculty of Electronic Engineering & Technology (FKTEN)
  4. Journal Articles
  5. MBIST implementation and evaluation in FPGA based on low-complexity march algorithms
 
Options

MBIST implementation and evaluation in FPGA based on low-complexity march algorithms

Journal
Journal of Circuits, Systems and Computers
ISSN
0218-1266
1793-6454
Date Issued
2023
Author(s)
Aiman Zakwan Jidin
Universiti Teknikal Malaysia Melaka
Razaidi Hussin
Universiti Malaysia Perlis
Weng Fook Lee
Emerald System Design Center, Penang
Mohd Syafiq Mispan
Universiti Teknikal Malaysia Melaka
DOI
10.1142/S0218126624501524
Handle (URI)
https://www.worldscientific.com/doi/10.1142/S0218126624501524?srsltid=AfmBOoqPWP5dM1OqIKXUuBffVj1YI4tuFe9ODR3ywcrq44v_gRq5xixB
https://www.worldscientific.com/
https://hdl.handle.net/20.500.14170/16367
Abstract
March algorithms are widely used in Memory Built-In Self-Test (MBIST) on-chip memory testing, providing linear test complexities that reduce the test time and cost. However, studies show that March algorithms with complexities lower than 18N have poor coverages of faults that have emerged with the advent of the nanometer process technologies and are more relevant to nowadays memories. New March AZ1 and March AZ2 algorithms, with 13N and 14N complexities, respectively, were introduced to provide optimum coverage of those faults and to produce a shorter test than an 18N-complexity test algorithm with a lesser area overhead, thus reducing chip manufacturing costs. This paper presents the implementation and validation of MBIST controllers that applied the March AZ1 and March AZ2 algorithms in a Field-Programmable Gate Array (FPGA) device. They were implemented in the Intel Max 10 DE10-Lite FPGA Development Board. A test generator was built in FPGA, as an alternative to the external tester, to provide test vectors required in initiating the test on the memory model using the implemented MBIST. The FPGA experimental tests demonstrated that they function correctly as the expected test sequences were observed. In addition, their fault detection abilities were also validated through tests on a fault-injected memory model, which shows that the implemented March AZ1 and March AZ2 provide 80.6% and 83.3% coverage of the intended faults, respectively, which outperform any other existing 14N-complexity March algorithms.
Subjects
  • Design for testabilit...

  • FPGA

  • March AZ1

  • March AZ2

  • Memory BIST

File(s)
MBIST Implementation and Evaluation in FPGA Based on Low-Complexity March Algorithms.pdf (148.8 KB)
google-scholar
Views
Downloads
  • About Us
  • Contact Us
  • Policies