Test pattern generation and signature analysis for burst errors
R. Katti
Abstract
R. Katti
Abstract
In testing certain systems, checking for burst errors is important. This is due to the fact that errors are confined to a certain number of bits. If signature analysis is used to test a circuit then the testing capabilities depend on the polynomial that defines the linear feedback shift register (LFSR) used in the test. In this paper we show that the LFSR that is suitable for checking for burst errors is not suitable for test pattern generation. We propose a method to modify the LFSR that performs signature analysis efficiently into a nonlinear feedback shift register (NLFSR) that is suitable for test pattern generation.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In testing certain systems, checking for burst errors is important. This is due to the fact that errors are confined to a certain number of bits. If signature analysis is used to test a circuit then the testing capabilities depend on the polynomial that defines the linear feedback shift register (LFSR) used in the test. In this paper we show that the LFSR that is suitable for checking for burst errors is not suitable for test pattern generation. We propose a method to modify the LFSR that performs signature analysis efficiently into a nonlinear feedback shift register (NLFSR) that is suitable for test pattern generation.
Key concepts: Signature (topology), Linear feedback shift register, Shift register, Computer science, Built-in self-test, Algorithm, Polynomial, Mathematics