LFSR Reseeding with Irreducible Polynomials

LFSR Reseeding with Irreducible Polynomials
复制标题

使用不可约多项式进行 LFSR 重新播种

DOI:
--
复制
发表时间:
2007
期刊:
IEEE International Symposium on On-Line Testing and Robust System Design
影响因子:
--
通讯作者:
D. Kagaris
D. Kagaris
中科院分区:
--
文献类型:
--
作者:
Snehal Udar;D. Kagaris

文献摘要

被引文献

相似文献

我们提出了一个创新的方案LFSR重新播种的基础上,任何非原始的不可约多项式的种子的有效生成。该方案具有很小的硬件开销,无论种子的数量,并保证从每个种子的模式子序列的生成是不相交的。实验结果表明,在并行链测试每扫描环境中的伪随机测试模式生成机制的潜力。
We propose an innovative scheme for LFSR re- seeding based on the efficient generation of the seeds of any non-primitive irreducible polynomial. The scheme has very small hardware overhead irrespective of the number of seeds and guarantees that the generation of the pattern subsequence from each seed is disjoint. Experimental results demonstrate the potential of the mechanism for pseudorandom test pattern generation in a parallel chain test-per-scan environment.