Method for generation of even numbered reduced gray codes
US6970113B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 30, 2004 |
| Grant date | Nov 29, 2005 |
| Priority date | — |
| Expiry date | Oct 6, 2024 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M7/16
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
A cyclic reduced Gray code in n-many bits having 2k-many entries, for any natural number k, where 2(n−1)<2k<2n and n is a positive integer, is found by first constructing a 2n-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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.