Title :
Counting sequences
Author :
Robinson, John P. ; Cohn, Martin
Author_Institution :
Dept. of Information Engng., Univ. of Iowa, Iowa City, IA, USA
Abstract :
A Gray sequence is a counter sequence where the Hamming distance between successive states is one. A construction for any fixed odd distance between successive states is given based on error-correcting codes. Such sequences could be used in testing and fault diagnosis when sequencing through all possible input combinations. Sequences with the maximum possible difference between successive states, alternately n and n-1, are given. A characterization of such maximal change sequences is given. The most nearly uniform even difference sequences are described. The distribution of bit changes or transition counts for individual variables for a counting sequence is considered.
Keywords :
error correction codes; logic testing; Gray sequence; Hamming distance; bit changes; circuit testing; counter sequence; error-correcting codes; fault diagnosis; testing; Generators; Large scale integration; Linear code; Radiation detectors; Reflective binary codes; Testing; Vectors; Circuit testing; Gray codes; Hamming distance; counters; transition counts; uniform distance;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1981.6312153
