access icon free Appendix B: Minimum cost maximum length cellular automata for n = 100

Author(s): Stanley L. Hurst
Source: VLSI Testing: digital and mixed analogue/digital techniques, p. 519-522
Publication date January 1998

The following gives the positions in n-stage autonomous cellular automata of the type 150 cells necessary to produce a maximum-length sequence of 2n - 1 states. All remaining cells in the n-stage string of cells are the simpler type 90 cells.

Inspec keywords: mixed analogue-digital integrated circuits; cellular automata; VLSI

Other keywords: maximum-length sequence; n-stage autonomous cellular automata; mixed analogue/digital techniques; maximum length cellular automata; VLSI testing

Subjects: Semiconductor integrated circuits

Preview this chapter:
Zoom in
Zoomout

Appendix B: Minimum cost maximum length cellular automata for n = 100, Page 1 of 2

| /docserver/preview/fulltext/books/cs/pbcs009e/PBCS009E_appendixb-1.gif /docserver/preview/fulltext/books/cs/pbcs009e/PBCS009E_appendixb-2.gif

Related content

content/books/10.1049/pbcs009e_appendixb
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading