Tree-Structured Linear Cellular Automata and Their Applications in BIST

Authors:
Jin Li;Xiaoling Sun
Affiliations:
Department of Electrical and Computer Engineering, University of Alberta,Edmonton, Canada T6G 2G7;Department of Electrical and Computer Engineering, University of Alberta,Edmonton, Canada T6G 2G7. xsun@ee.uAlberta.ca
Venue:
Journal of Electronic Testing: Theory and Applications
Year:
1999

Citing 6
Cited 0

Group Properties of Cellular Automata and VLSI Applications

IEEE Transactions on Computers
Built-in test for VLSI: pseudorandom techniques

Built-in test for VLSI: pseudorandom techniques
Primitive polynomials of degree 301 through 500

Journal of Electronic Testing: Theory and Applications
A class of two-dimensional cellular automata and their applications in random pattern testing

Journal of Electronic Testing: Theory and Applications
Quantitative analysis for linear hybrid cellular automata and LFSR as built-in self-test generators for sequential faults

Journal of Electronic Testing: Theory and Applications
Tree-Structured Linear Cellular Automata and Their Applications as PRPGs

Proceedings of the IEEE International Test Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel implementation structure of linear finite statemachines, named tree-structured linear cellular automata (TLCA), isintroduced. The structures and operations of TLCA are defined. Theminimal cost maximum length machines and their implementationprocedure are given. Our empirical study on the ISCAS‘85 benchmarkcircuits shows the effectiveness of TLCA for testing stuck-open anddelay faults.