FSM Based Implementation of March C- and Checkerboard Algorithm

Embedded memory systems are integral to modern VLSI designs, constituting a significant portion of chip area and directly impacting system reliability and performance. As semiconductor memories become denser and operate at higher frequencies, they are increasingly prone to various faults such as stuck-at, transition, coupling faults etc. Undetected memory failures can lead to critical system malfunctions, making efficient memory testing a fundamental requirement in hardware verification and validation. To ensure robustness, various memory testing algorithms have been developed, often serving as the foundation for Memory Built-in Self-Test (MBIST) methodologies. In this paper, we analyse the FSM (finite state machine) based FPGA implementation of two widely used memory test algorithms, March C- and Checkerboard, and assessing their efficiency in terms of area, power consumption, and delay. These algorithms are implemented in Verilog, synthesized on Xilinx Vivado – 2016.2, and deployed on the Nexys 4 DDR Artix-7 FPGA. Our results provide a comparative evaluation of these algorithms, demonstrating their effectiveness in detecting memory faults and highlighting their suitability for FPGA-based memory testing and verification.

Authors

Publication Details

Published
2025-05-23
DOI
https://doi.org/10.1109/incet64471.2025.11140858
Primary Topic
Network Packet Processing and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

FSM Based Implementation of March C- and Checkerboard Algorithm

A.A. Khurshid, Advika Metre
Network Packet Processing and Optimization
article

FSM Based Implementation of March C- and Checkerboard Algorithm

A.A. Khurshid, Advika Metre
article en

Abstract

Embedded memory systems are integral to modern VLSI designs, constituting a significant portion of chip area and directly impacting system reliability and performance. As semiconductor memories become denser and operate at higher frequencies, they are increasingly prone to various faults such as stuck-at, transition, coupling faults etc. Undetected memory failures can lead to critical system malfunctions, making efficient memory testing a fundamental requirement in hardware verification and validation. To ensure robustness, various memory testing algorithms have been developed, often serving as the foundation for Memory Built-in Self-Test (MBIST) methodologies. In this paper, we analyse the FSM (finite state machine) based FPGA implementation of two widely used memory test algorithms, March C- and Checkerboard, and assessing their efficiency in terms of area, power consumption, and delay. These algorithms are implemented in Verilog, synthesized on Xilinx Vivado – 2016.2, and deployed on the Nexys 4 DDR Artix-7 FPGA. Our results provide a comparative evaluation of these algorithms, demonstrating their effectiveness in detecting memory faults and highlighting their suitability for FPGA-based memory testing and verification.

Openalex Percentile: Top 75%
Network Packet Processing and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

FSM Based Implementation of March C- and Checkerboard Algorithm — A.A. Khurshid, Advika Metre · (2025) | TGRS Research Map | TGRS