Logic design principles with emphasis on testable semicustom circuits
Logic design principles with emphasis on testable semicustom circuits
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
The synchronization problem in protocol testing and its complexity
Information Processing Letters
Formal methods for test sequence generation
Computer Communications
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Shift Register Sequences
Checking experiments to test latches
VTS '95 Proceedings of the 13th IEEE VLSI Test Symposium
| Hi-index | 14.98 |
This paper develops a closed-form formula, f(k), to count the number of transition-tour sequences of length k for bistable machines. It is shown that the function f(k) is related to Fibonacci numbers. Some applications of the results in this paper are in the areas of testable sequential machine designs, random testing of register data paths, and qualification tests for random pattern generators.