Loh Wan Ying

dblp:352/6560 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-8062-7860ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 83% Memory systems · 17%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware test
embedded memory testing
0.712023
Generation of New Low-Complexity March Algorithms for Optimum Faults Detection in SRAM · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023
Electronic design automation › hardware verification and test
fault detection
0.712023
Generation of New Low-Complexity March Algorithms for Optimum Faults Detection in SRAM · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023
Electronic design automation
hardware verification and test
0.712023
Generation of New Low-Complexity March Algorithms for Optimum Faults Detection in SRAM · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023
Electronic design automation › hardware verification and test › memory testing
march test algorithm
0.712023
Generation of New Low-Complexity March Algorithms for Optimum Faults Detection in SRAM · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023
Electronic design automation › hardware verification and test › design for testability › built-in self-test
memory BIST
0.712023
Generation of New Low-Complexity March Algorithms for Optimum Faults Detection in SRAM · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023
Memory systems › random-access memory
SRAM
0.712023
Generation of New Low-Complexity March Algorithms for Optimum Faults Detection in SRAM · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023

Methods — techniques the papers use, named apart from their topics

fault simulation · 0.7automated test generation · 0.7
YearPublicationVenuePosition
2023 Generation of New Low-Complexity March Algorithms for Optimum Faults Detection in SRAM
abstract
Memory BIST implements March test techniques extensively for testing embedded memories on a chip. A high-complexity test algorithm like the March MSS (18N) can guarantee the detection of all unlinked static faults in SRAM. In contrast, March algorithms with lower complexity can be used to reduce test costs and chip area overhead. Still, they have poor coverage of faults identified in the nanometer process technologies. Subsequently, a balance between the fault coverage (FC) and the test cost is necessary. This article presents a method to generate new March algorithms that provide optimum coverage on faults introduced by the nanometer process technologies. It was achieved by developing automated software to generate the new Data Background sequence and rearrange the existing March algorithms’ test operations to remove redundancies and enable the sensitization and detection of the intended faults while preserving their complexities. Comprehensive fault detection analyses were conducted to assess their FCs and to find any removable redundant test operations. The proposed method produced new March AZ1 and March AZ2 algorithms, with 13N and 14N complexity, respectively, that provide optimum coverage of the targeted faults. They were successfully implemented in the Memory BIST controllers, and their functionalities were validated via simulations.
Aiman Zakwan Jidin, Razaidi Hussin, Lee Weng Fook, Mohd Syafiq Mispan, Nor Azura Zakaria, Loh Wan Ying, Norshuhani Zamin
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.6