Concepts of Primitive Polynomial and Galois Field in Designing More Randomize PN Sequence Generators for Maximum Fault Coverage in Modern VLSI Testing
Priyanka Shrivastava1, Prashant Purohit2, Pushpraj Singh Tanwar3, Harishanker Shrivastava4
1Miss Priyanka Shrivastava, Department of EC (Digital Communication), RGPV, Radharaman Institute of Technology & Science, Bhopal, India.
2Prof. Prashant Purohit, Department of EC, RGPV, Radharaman Institute of Technology & Science, Bhopal, India.
3Prof. Pushpraj singh Tanwer, Department of EC, RGPV, Radharaman Institute of Technology & Science, Bhopal, India.
4Prof. Harishankar Shrivastava, Department of EC, RGPV, Radharaman Institute of Technology & Science, Bhopal, India.
Manuscript received on September 05, 2014. | Revised Manuscript received on September 11, 2014. | Manuscript published on September 15, 2014. | PP: 14-17 | Volume-2 Issue-10, September 2014. | Retrieval Number: J07130921014/2014©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley
©The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: This paper deals with the vital role of primitive polynomials for designing PN sequence generators. The standard LFSR (linear feedback shift register) used for pattern generation may give repetitive patterns. Which are in certain cases is not efficient for complete test coverage. The LFSR based on primitive polynomial generates maximum-length PRPG.
Keywords: LFSR (linear feedback shift register). 2. PRPG (Pseudo feedback shift register).3 Primitive polynomial 4. Galois field.