Method for generation of even numbered reduced gray codes
View Patent ↗A cyclic reduced Gray code in n-many bits having 2k-many entries, for any natural number k, where 2 (n−1) <2k<2 n and n is a positive integer, is found by first constructing a 2 n -many entry code in n-many bits with a reflected binary technique, and then selecting the last k-many ordered entries in the first half of the full reflected binary code, followed by the first k-many ordered entries in the second half of the full reflected binary code. These ordered 2k-many entries are a shortened cyclic reduced Gray code in n-many bits. Alternatively, the first k-many ordered entries in the first half of the full reflected binary code can be selected, followed by the last k-many ordered entries in the second half of the full reflected binary code. If either the original or reduced Gray code is expressed as a table whose columns are bit positions and whose rows are the code entries, then entire columns can optionally be interchanged at will, either before or after the 2k-many selection, to produce additional different cyclic reduced Gray codes that do not outwardly appear to be ‘reflected’ ones.
1. A method of producing a reduced Gray code in n-many bits of 2k-many entries for a natural number k, the method comprising the steps of:
(a) reflecting a Gray code in (n−1)-many bits and whose r-many ordered entries are (a, b, c, . . . , i, j) to produce an intermediate cyclic code of 2r-many ordered entries that are (a, b, c, . . . , i, j, j, i, . . . c, b, a), r being greater than k and wherein ( . . . , b, a, a, b, . . . ) and ( . . . , i, j, j, i, . . . ) are entries representing symmetrically reversed sequences in the ordering of the entries;
(b) appending a first bit value to a selected location in each of the ordered entries (a, b, c, . . . , j) in the first half of the intermediate code to produce entries that are of n-many bits, and appending the complement of the first bit value to the selected location in each of the ordered entries (j, . . . c, b, a) in the second half of the intermediate code to produce entries that are of n-many bits, the combined appended versions of the first and second halves of the intermediate code forming a cyclic reflected binary Gray code of 2r-many entries; and
(c) symmetrically discarding from the cyclic reflected binary Gray code of 2r-many entries of step (b) 2(r-k)-many consecutive entries corresponding to a symmetrically reversed sequence, leaving a cyclic reduced Gray code of 2k-many entries in n-many bits.
2. A method as in claim 1 wherein the Gray code in (n−1)-many bits of step (a) is itself a reflected binary Gray code.
3. A method as in claim 1 wherein the Gray code in (n−1)-many bits of step (a) is itself a reduced Gray code where 2k is less than 2 (2−1) .
4. A method as in claim 1 wherein 2k is less than 2 (n) and greater than 2 (n−1) .
5. Apparatus incorporating a Gray code produced in accordance with claim 1 .