Multiple-seed TPG structures

doi:10.1109/TC.2003.1252858

Multiple-seed TPG structures

2003-12-01

4

PRE

AI

D

Dimitri Kagaris

DOI：10.1109/TC.2003.1252858

Original

Original request for help

Save

Abstract

En 中文

Linear Feedback Shift Registers (LFSRs) are popular mechanisms for built-in test pattern generation (TPG). They are normally used with a primitive characteristic polynomial because, in that case, only one initialization state (seed) is required. In this paper, we show that if the characteristic polynomial is nonprimitive irreducible, the required seeds can still be efficiently generated. We establish a formula that shows how the seeds of any nonprimitive irreducible polynomial relate to each other. This leads to an efficient hardware implementation with small hardware overhead, irrespective of the number of seeds, and enhances the choices available for the design of appropriate TPG structures in the case of pseudoexhaustive TPG that were previously limited to primitive characteristic polynomials only.

Keywords:

test pattern generation (TPG)

built-in self-test (BIST)

linear feedback shift registers (LFSRs)

Multiple-seed TPG structures

Abstract

Journal

Organization