On the maximum value of aliasing probabilities for single input signature registers

The aliasing error performance of a signature register is measured by the maximum values of the aliasing error probabilities for certain ranges of the bit-error rate (and those of the test length). Based on these measures, we evaluate the performances of all the single input signature registers whos...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. 44; no. 11; pp. 1265 - 1274
Main Authors Shou-Ping Feng, Fujiwara, T., Kasami, T., Iwasaki, K.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.11.1995
Institute of Electrical and Electronics Engineers
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Bit error rate
Built-in self-test
Circuit testing
Compaction
Computer science; control theory; systems
Design. Technologies. Operation analysis. Testing
Electronics
Error probability
Exact sciences and technology
Feedback circuits
Integrated circuits
Length measurement
Linear feedback shift registers
Polynomials
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Test pattern generators
Theoretical computing
Hamming code
Feedback
VLSI circuits
Aliasing
Bit error rate
Theoretical study
Test method
Shift registers
Error correcting code
Signature analysis
Built-in self test
Online AccessGet full text

Cover

More Information
Summary:The aliasing error performance of a signature register is measured by the maximum values of the aliasing error probabilities for certain ranges of the bit-error rate (and those of the test length). Based on these measures, we evaluate the performances of all the single input signature registers whose feedback polynomials are primitive polynomials of degree 16 and generator polynomials of the double-error-correcting BCH codes of the same degree. When the degree of the feedback polynomial is large, say 32, it is computationally hard to obtain the exact aliasing probability. But we observe that the numbers of codewords with large weights in the corresponding code dominate the maximum value of the aliasing probabilities. By computing the numbers of codewords of large weights, we find primitive polynomials of degree 32 whose maximum value of the aliasing probabilities is very large for some test lengths. The error performance of an LFSR with any BCH polynomial of degree m for the test length 2/sup m/2/-2 is shown to be very good by deriving the formula for the weight distribution of the corresponding code.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/12.475122