Lfsr Based Test Generator Synthesis Essay

  • 1.

    C. Fagot, O. Gascuel, P. Girard, and C. Landrault, “A Ring Architecture Strategy for BIST Test Pattern Generation,” IEEE Asian Test Symposium, pp. 418-423, 1998.Google Scholar

  • 2.

    Y. Zorian, “Testing the Monster Chip,” IEEE Spectrum, pp. 54-60, July 1999.Google Scholar

  • 3.

    Semiconductor Industry Association (SIA), International Technology Roadmap for Semiconductors (ITRS), 1999 edition.Google Scholar

  • 4.

    E.B. Eichelberger and E. Lindbloom, “Random-Pattern Coverage Enhancement and Diagnosis for LSSD Logic Self-Test,” IBM Journal of Research and Development, vol. 27, no. 3, pp. 265-272, 1983.Google Scholar

  • 5.

    J.P. Hayes and A.D. Friedman, “Test Point Placement to Simplify Fault Detection,” IEEE Trans. on Computers, vol. C-33, pp. 727-735, July 1974.Google Scholar

  • 6.

    N. Tamarapalli and J. Rajski, “Constructive Multi-Phase Test Point Insertion for Scan-Based BIST,” in IEEE International Test Conference, 1996, pp. 649-658.Google Scholar

  • 7.

    G. Hetherington, T. Fryars, N. Tamarapalli, M. Kassab, A. Hassan, and J. Rajski, “Logic BIST for Large Industrial Designs: Real Issues and Case Studies,” in IEEE International Test Conference, 1999, pp. 358-367.Google Scholar

  • 8.

    R.W. Bassett et al., “Low Cost Testing of High Density Logic Components,” in IEEE International Test Conference, 1989, pp. 550-557.Google Scholar

  • 9.

    H.J. Wunderlich, “Self Test Using Unequiprobable Random Patterns,” in IEEE International Symposium on Fault-Tolerant Computing, 1987, pp. 258-263.Google Scholar

  • 10.

    F. Brglez et al., “Hardware-Based Weighted Random Pattern Generation for Boundary-Scan,” in IEEE International Test Conference, 1989, pp. 264-274.Google Scholar

  • 11.

    S. Hellebrand, H.J. Wunderlich, and O.F. Haberl, “Generating Pseudo-Exhaustive Vectors for External Testing,” in IEEE International Test Conference, 1990, pp. 670-679.Google Scholar

  • 12.

    B. Koenemann, “LFSR-Coded Test Patterns for Scan Designs,” IEEE European Test Conference, 1991, pp. 237-242.Google Scholar

  • 13.

    S. Hellebrand, S. Tarnick, J. Rajski, and B. Courtois, “Generation of Vector Patterns Through Reseeding of Multiple-Polynomial Linear Feedback Shift Registers,” in IEEE International Test Conference, 1992, pp. 120-129.Google Scholar

  • 14.

    G. Edirisooriya and J.P. Robinson, “Design of Low Cost ROM Based Test Generators,” in IEEE VLSI Test Symposium, 1992, pp. 61-66.Google Scholar

  • 15.

    C. Dufaza, H. Viallon, and C. Chevalier, “BIST Hardware Generator for Mixed Testing Scheme,” in IEEE European Design & Test Conference, 1995, pp. 424-430.Google Scholar

  • 16.

    D. Kangaris and S. Tragoudas, “Generating Deterministic Unordered Test Patterns with Counter,” in IEEE VLSI Test Symposium, 1996, pp. 374-379.Google Scholar

  • 17.

    M. Chatterjee and D.K. Pradhan, “A Novel Pattern Generator for Near-Perfect Fault Coverage,” in IEEE VLSI Test Symposium, 1995, pp. 417-425.Google Scholar

  • 18.

    N.A. Touba and E.J. McCluskey, “Synthesis of Mapping Logic for Generating Transformed Pseudo-Random Patterns for BIST,” in IEEE International Test Conference, 1995, pp. 674-682.Google Scholar

  • 19.

    S. Hellebrand, B. Reeb, S. Tarnick, and H.J. Wunderlich, “Pattern Generation for a Deterministic BIST Scheme,” in IEEE International Conference on Computer-Aided Design, 1995, pp. 88-94.Google Scholar

  • 20.

    N.A. Touba and E.J. McCluskey, “Altering a Pseudo-Random Bit Sequence for Scan-Based BIST,” in IEEE International Test Conference, 1996, pp. 167-175.Google Scholar

  • 21.

    H.J. Wunderlich and G. Kiefer, “Bit-Flipping BIST,” in IEEE International Conference on Computer-Aided Design, 1996, pp. 337-343.Google Scholar

  • 22.

    C. Fagot, P. Girard, and C. Landrault, “On Using Machine Learning for Logic BIST,” in IEEE International Test Conference, 1997, pp. 338-346.Google Scholar

  • 23.

    G. Kiefer and H.J. Wunderlich, “Deterministic BIST with Multiple Scan Chains,” in IEEE International Test Conference, 1998, pp. 1057-1064.Google Scholar

  • 24.

    G. Kiefer and H.J. Wunderlich, “Deterministic BIST with Partial Scan,” IEEE European Test Workshop, pp. 110-116, 1999.Google Scholar

  • 25.

    G. Kiefer, H. Vranken, E.J. Marinissen, and H.J. Wunderlich, “Application of Deterministic Logic BIST on Industrials Circuits,” in IEEE International Test Conference, 2000, pp. 105-114.Google Scholar

  • 26.

    C. Fagot, O. Gascuel, P. Girard, and C. Landrault, “On Calculating Efficient LFSR Seeds for Built-In Self Test,” IEEE European Test Workshop, pp. 7-14, 1999.Google Scholar

  • 27.

    F. Brglez and H. Fujiwara, “A Neutral Netlist of 10 Combinational Benchmark Circuits and a Target Translator in Fortran,” in IEEE International Symposium on Circuits and Systems, 1985, pp. 663-698.Google Scholar

  • 28.

    F. Brglez, D. Bryant, and K. Kozminski, “Combinational Profiles of Sequential Benchmark Circuits,” in IEEE International Symposium on Circuits and Systems, 1989, pp. 1929-1934.Google Scholar

  • 29.

    M. Abramovici, P.R. Menon, and D.T. Miller, “Critical Path Tracing: An Alternative to Fault Simulation,” in IEEE Design & Test of Computers, vol. 1, no. 1, Feb. 1984.Google Scholar

  • 30.

    TestGen, version Tg4.1, User Guide, Synopsys Inc., 1999.Google Scholar

  • 31.

    S. Wang, “Low Hardware Overhead Scan Based 3-Weight Weighted Random BIST,” in IEEE International Test Conference, 2001, pp. 868-877.Google Scholar

  • 1.

    Bardell P.H.: Discrete logarithms in a parallel pseudorandom pattern generator analysis method. J. Elect. Testing: Theory and Appl., Vol. 3. (1992) 17–31CrossRefGoogle Scholar

  • 2.

    Bhavsar D.K., Edmondson J.H.: Alpha 21164 Testability Strategy. IEEE Design and Test of Computers, vol. 14, No 1 (January-March 1997) 25–33.CrossRefGoogle Scholar

  • 3.

    David R.: Random Testing of Digital Circuits. Theory and Applications, Marcel Dekker, Inc., New York (1998)Google Scholar

  • 4.

    Garbolino T., Hlawiczka A.: Test Pattern Generator for Delay Faults Based on LFSR with D, T Flip-Flops and Internal Inverters. Proc. of Design and Diagnostics of Electronic Circuits and Systems Workshop, Szczyrk, Poland (2-4 September 1998) 153–160Google Scholar

  • 5.

    Garbolino T., Hlawiczka A.: Synthesis and Analysis of New LFSRs with D-and T-Flip-Flops, Inverters, XOR-and IOR-Gates. Proc. of 11th Workshop on Test Technology and Reliability of Circuits and Systems (TWS’99), Potsdam, Germany, (28th February-2nd March 1999) 34–37Google Scholar

  • 6.

    Hlawiczka A.: Built-in Self-test Using Time Linear Compression. Journal on New Generation of Computer Systems. Akademie-Verlag, Berlin, (1990) 337–352Google Scholar

  • 7.

    Hlawiczka A.: D or T Flip-Flop Based Linear Registers. Archives of Control Sciences, vol. 1, (XXXVII), No 3-4 (1992) 249–268Google Scholar

  • 8.

    Hlawiczka A., Binda J.: The Optimized Synthesis of Self-Testable Finite State Machines Using BIST-PST Structures in ALTERA Structures. Proc. of 4th International Workshop on Field Programmable Logic and Applications, September 7-9, 1994, Prague. Lecture Notes in Computer Science No 849. Springer Verlag Press (1994) 120–122Google Scholar

  • 9.

    Hortensius P.D., McLeod R.D., Pries W., Miller D.M., Card H.C.: Cellular Automata-Based Pseudorandom Number Generators for Built-In Self-Test. IEEE Transactions on Computer-Aided Design, Vol. 8, No. 8 (August 1989) 842–858CrossRefGoogle Scholar

  • 10.

    Muszyñski J., Hlawiczka A.: Design of Fast LFSR and MISR Linear Registers Using Resources of OTP Type FPGA Circuits Produced by ACTEL and XILINX. Proc. of Design and Diagnostics of Electronic Circuits and Systems Workshop, Szczyrk, Poland (September 2-4 1998) 193–199Google Scholar

  • 11.

    Odlyzko A.M., Discrete Logarithms in Finite Fields and Their Cryptographic Significance. Lecture Notes in Computer Science, Vol. 209 (1984) 224Google Scholar

  • 12.

    [YarmM95] Yarmolik V.N., Murashko I.A.: A new test pattern generator design approach for VLSI built-in self-testing. Automatic Control & Computer Sciences, No 6 (1995) 25–35Google Scholar

  • Comments

    Leave a Reply

    Your email address will not be published. Required fields are marked *