Skip to main content
SpringerLink
Log in

A New Built-in TPG Based on Berlekamp–Massey Algorithm

  • Published:
Journal of Electronic Testing Aims and scope Submit manuscript

Abstract

In this work, a new method to design a mixed-mode Test Pattern Generator (TPG) based only on a simple and single Linear Feedback Shift Register (LFSR) is described. Such an LFSR is synthesized by Berlekamp–Massey algorithm (BMA) and is capable of generating pre-computed deterministic test patterns which detect the hard-to-detect faults of the circuit. Moreover, the LFSR generates residual patterns which are sufficient to detect the remaining easy-to-detect faults. In this way, the BMA-designed LFSR is a mixed-mode TPG which achieves total fault coverage with short testing length and low hardware overhead compared with previous schemes according to the experimental results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Notes

  1. The linear complexity of a given sequence is defined as the length of the shortest linear feedback shift register (LFSR) which can produce this sequence. The sequence linear complexity is one measure of its predictability. In a cryptographic context, if the linear complexity of a sequence s is L, then the cryptanalyst can recover the entire sequence by observing 2L consecutive elements of s [11]. Thus, stream cipher designers should ensure that sequences produced by their ciphers have large linear complexity.

  2. It was used a kind of Monte Carlo Method to determine the circuit hard-to-detect faults. A large set of pseudo-random sequences using LFSR (almost) uniformly distributed was generated and the faults that were not detected by each sequence were checked. These faults were ranked according to the number of times that appeared as not detected. The best-ranked faults were considered hard-to-detect ones.

References

  1. Ali L, Sidek R, Aris I, Suparjo BS, Ali AM (2004) Challenges and directions for testing IC. Integration, the VLSI Journal 37:17–28

    Article  Google Scholar 

  2. Blahut RE (2006) Algebraic codes for data transmission. Cambridge University Press, Cambridge, UK

    Google Scholar 

  3. Chiusano S, Prinetto P, Wunderlich HJ (2000) Non-intrusive BIST for systems-on-a-chip. In: Proceedings of the international test conference, pp 644–651

  4. Hellebrand S, Rajski J, Tarnick S, Venkataraman S, Courtois B (1995) Built-in test for circuits with scan based on reseeding of multiple-polynomial linear feedback shift registers. IEEE Trans Comput 44(2):223–233

    Article  MATH  Google Scholar 

  5. Karkala M, Touba MA, Wunderlich HJ (1998) Special ATPG to correlate test patterns for low-overhead mixed-mode BIST. In: 7th Asian test symposium, pp 492–499

  6. Kavousianos X, Bakalis D, Nikolos D, Tragoudas S (2002) A new built-in TPG method for circuits with random pattern resistant faults. IEEE Trans Comput-Aided Des Integr Circuits Syst 21(7):859–866

    Article  Google Scholar 

  7. Lee HK, Ha DS (1993) Atalanta: an efficient ATPG for combinational circuits. Technical Report, 93-12, Dep’t of Electrical Eng., Virginia Polytechnic Institute and State University, Blacksburg, Virginia

  8. Massey JL (1969) Shift-register synthesis and BCH decoding. IEEE Trans Inf Theory 15(1):122–127

    Article  MATH  MathSciNet  Google Scholar 

  9. Son Y, Chong J, Russell G (2002) E-BIST: enhanced test-per-clock BIST architecture. IEE Proc, Comput Digit Tech 149(1):9–15

    Article  Google Scholar 

  10. Vardy A (ed) (1998) Codes, curves, and signals, common threads in communications. Kluwer Academic Publishers, Erewhon, NC

    MATH  Google Scholar 

  11. Youssef AM, Gong G (2006) On linear complexity of sequences over gf(2n). Theor Comput Sci 352(1–3):288–292

    Article  MATH  MathSciNet  Google Scholar 

  12. Zhang S, Choi M, Park N, Lombardi F (2007) Cost-driven optimization of coverage of combined built-in self-test/automated test equipment testing. EEE Trans Instrum Meas 56(3):1094–1100

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Federal University of Paraíba, João Pessoa, Paraíba, Brazil

    Cleonilson Protásio de Souza

  2. Department of Electrical Engineering, Federal University of Campina Grande, Campina Grande, Paraíba, Brazil

    Francisco Marcos de Assis & Raimundo Carlos Silvério Freire

Authors
  1. Cleonilson Protásio de Souza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francisco Marcos de Assis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Raimundo Carlos Silvério Freire
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cleonilson Protásio de Souza.

Additional information

Responsible Editor: C. E. Stroud

Rights and permissions

Reprints and permissions

About this article

Cite this article

de Souza, C.P., Marcos de Assis, F. & Silvério Freire, R.C. A New Built-in TPG Based on Berlekamp–Massey Algorithm. J Electron Test 26, 443–451 (2010). https://doi.org/10.1007/s10836-010-5155-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10836-010-5155-x

Keywords

Search

Navigation