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. A new 13N-complexity memory built-in self-test algorithm to balance static random access memory static fault coverage and test time
 
Options

A new 13N-complexity memory built-in self-test algorithm to balance static random access memory static fault coverage and test time

Journal
International Journal of Electrical and Computer Engineering (IJECE)
ISSN
2722-2578
2088-8708
Date Issued
2025-02
Author(s)
Aiman Zakwan Jidin
Universiti Teknikal Malaysia Melaka
Razaidi Hussin
Universiti Malaysia Perlis
Mohd Syafiq Mispan
Universiti Teknikal Malaysia Melaka
Lee Weng Fook
Universiti Malaysia Perlis
DOI
10.11591/ijece.v15i1.pp163-173
Handle (URI)
https://ijece.iaescore.com/index.php/IJECE/article/view/36168
https://ijece.iaescore.com/
https://hdl.handle.net/20.500.14170/15921
Abstract
As memories dominate the system-on-chip (SoC), their quality significantly impacts the chip manufacturing yield. There is a growing need to reduce the chip production time and cost, which mainly depends on the testing phase. Hence, a memory built-in self-test (MBIST) utilizing a low-complexity, high-fault-coverage test algorithm is essential for efficient and thorough memory testing. The March AZ1 algorithm, with 13N complexity, was created earlier to balance the test length and fault coverage. However, poor positioning of a write operation in its test sequence caused the reduction of the transition coupling fault (CFtr) detection. This paper presents the creation of the March AZ algorithm, modified from the March AZ1 algorithm, to increase CFtr coverage while preserving the same complexity. It was accomplished by analyzing the fault coverage offered by the March AZ1 algorithm and then reorganizing its test sequence to address the limitation in detecting CFtr. The newly produced March AZ1 algorithm was successfully implemented in an MBIST controller. The simulation tests validated its functionality and demonstrated that the CFtr coverage was enhanced from 62.5% to 75%, achieving an overall fault coverage of 83.3%. Therefore, with 13N complexity, it offers the best fault coverage among all the existing test algorithms with a complexity below 18N.
Subjects
  • March test algorithm

  • Memory built-in self-...

  • Memory fault coverage...

  • Randon access memory

  • Unlinked static fault...

File(s)
A new 13N-complexity memory built-in self-test algorithm to balance static random access memory.pdf (883.83 KB)
google-scholar
Views
Downloads
  • About Us
  • Contact Us
  • Policies