A complete memory address generator for scan based march algorithms

Wei Lun Wang, Kuen-Jong Lee

Research output: Contribution to journalConference article

10 Citations (Scopus)

Abstract

The march algorithm based built-in self-test (BIST) schemes have been widely used to test memory chips (cores). Conventional methods which use binary counters to generate the addresses may require large routing area when the addresses are to be broadcast to multiple memory cores. In this paper we propose to use linear feedback shift registers (LFSRs) to generate the memory addresses which can be serially applied to the memory cores under test and thus the routing area overhead can be greatly reduced. We have designed a complete up/down LFSR which can generate complete march addresses, including all 2 n up and 2n down sequences. Also theoretic analysis has been done which guarantees the transitions from up to down and down to up sequences can all be smoothly carried out such that the memory under test can receive a different address per clock cycle even during the transitions.

Original languageEnglish
Pages (from-to)83-88
Number of pages6
JournalRecords of the IEEE International Workshop on Memory Technology, Design and Testing
Publication statusPublished - 2005 Dec 9
EventProceedings - 2005 IEEE International Workshop on Memory Technology, Design, and Testing, MTDT 2005 - Taipei, Taiwan
Duration: 2005 Aug 32005 Aug 5

Fingerprint

Data storage equipment
Shift registers
Feedback
Built-in self test
Clocks

All Science Journal Classification (ASJC) codes

  • Media Technology

Cite this

@article{7e27ef3b272f41e9aaec2f2e3a4c4199,
title = "A complete memory address generator for scan based march algorithms",
abstract = "The march algorithm based built-in self-test (BIST) schemes have been widely used to test memory chips (cores). Conventional methods which use binary counters to generate the addresses may require large routing area when the addresses are to be broadcast to multiple memory cores. In this paper we propose to use linear feedback shift registers (LFSRs) to generate the memory addresses which can be serially applied to the memory cores under test and thus the routing area overhead can be greatly reduced. We have designed a complete up/down LFSR which can generate complete march addresses, including all 2 n up and 2n down sequences. Also theoretic analysis has been done which guarantees the transitions from up to down and down to up sequences can all be smoothly carried out such that the memory under test can receive a different address per clock cycle even during the transitions.",
author = "Wang, {Wei Lun} and Kuen-Jong Lee",
year = "2005",
month = "12",
day = "9",
language = "English",
pages = "83--88",
journal = "Records of the IEEE International Workshop on Memory Technology, Design and Testing",
issn = "1087-4852",
publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - A complete memory address generator for scan based march algorithms

AU - Wang, Wei Lun

AU - Lee, Kuen-Jong

PY - 2005/12/9

Y1 - 2005/12/9

N2 - The march algorithm based built-in self-test (BIST) schemes have been widely used to test memory chips (cores). Conventional methods which use binary counters to generate the addresses may require large routing area when the addresses are to be broadcast to multiple memory cores. In this paper we propose to use linear feedback shift registers (LFSRs) to generate the memory addresses which can be serially applied to the memory cores under test and thus the routing area overhead can be greatly reduced. We have designed a complete up/down LFSR which can generate complete march addresses, including all 2 n up and 2n down sequences. Also theoretic analysis has been done which guarantees the transitions from up to down and down to up sequences can all be smoothly carried out such that the memory under test can receive a different address per clock cycle even during the transitions.

AB - The march algorithm based built-in self-test (BIST) schemes have been widely used to test memory chips (cores). Conventional methods which use binary counters to generate the addresses may require large routing area when the addresses are to be broadcast to multiple memory cores. In this paper we propose to use linear feedback shift registers (LFSRs) to generate the memory addresses which can be serially applied to the memory cores under test and thus the routing area overhead can be greatly reduced. We have designed a complete up/down LFSR which can generate complete march addresses, including all 2 n up and 2n down sequences. Also theoretic analysis has been done which guarantees the transitions from up to down and down to up sequences can all be smoothly carried out such that the memory under test can receive a different address per clock cycle even during the transitions.

UR - http://www.scopus.com/inward/record.url?scp=28344445243&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=28344445243&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:28344445243

SP - 83

EP - 88

JO - Records of the IEEE International Workshop on Memory Technology, Design and Testing

JF - Records of the IEEE International Workshop on Memory Technology, Design and Testing

SN - 1087-4852

ER -