Built-in Generation of m -Sequences with Irreducible Characteristic Polynomials

I
IOLTW
2002
Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02)
Abstract - Built-in Generation of m -Sequences with Irreducible Characteristic Polynomials

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Dimitri Kagaris

Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02)

Isle of Bendor, France

July 08-July 10

ISBN: 0-7695-1641-6

	ASCII Text	x
	Dimitri Kagaris, "Built-in Generation of m -Sequences with Irreducible Characteristic Polynomials," On-Line Testing Workshop, IEEE International, pp. 158, Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02), 2002.

	BibTex	x
	@article{ 10.1109/OLT.2002.1030200, author = {Dimitri Kagaris}, title = {Built-in Generation of m -Sequences with Irreducible Characteristic Polynomials}, journal ={On-Line Testing Workshop, IEEE International}, volume = {0}, year = {2002}, isbn = {0-7695-1641-6}, pages = {158}, doi = {http://doi.ieeecomputersociety.org/10.1109/OLT.2002.1030200}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - On-Line Testing Workshop, IEEE International TI - Built-in Generation of m -Sequences with Irreducible Characteristic Polynomials SN - 0-7695-1641-6 SP EP A1 - Dimitri Kagaris, PY - 2002 KW - null VL - 0 JA - On-Line Testing Workshop, IEEE International ER -

Dimitri Kagaris, Southern Illinois University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/OLT.2002.1030200

In this paper, we show that m-sequences for built-in Test Pattern Generation (TPG) can be efficiently generated by LFSR structures that have non-primitive irreducible characteristic polynomials. We present two mechanisms that can generate the required number of seeds with very low hardware overhead that is independent of the number of seeds. This enhances the choices available for the design of appropriate TPG structures for pseudo-exhaustive or pseudo-random TPG that were previously limited to primitive characteristic polynomials only.

Citation:

Dimitri Kagaris, "Built-in Generation of m -Sequences with Irreducible Characteristic Polynomials," ioltw, pp.158, Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02), 2002

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.