Method and system for prioritizing data values for robust data representation

• US 7,242,329 B2
• Filed: 08/11/2005
• Issued: 07/10/2007
• Est. Priority Date: 02/02/2005
• Status: Expired due to Fees

• Current Assignee: GM Global Technology Operations LLC (General Motors Company)
• Original Assignee: GM Global Technology Operations Incorporated (General Motors Company)
• Inventors: Katrak, Kerfegar K.
• Primary Examiner(s): NGUYEN, LINH V
• Application Number:
  US11/201,863
• Publication Number:
  US 20060173942A1
• Time in Patent Office: 698 Days
• Field of Search: 341/97, 341/98, 341/99, 341/106
• US Class Current: 341/97
• CPC Class Codes: H03M 7/16 Conversion to or from unit-distance codes, e.g. Gray code, reflected binary code

Abstract

Methods, systems and data structures select prioritized robust data values from a plurality of available data values formed by a plurality of data bits, each capable of exhibiting a bit value. Available data values are arranged into a gray code format, and alternate values of gray code format are selected to form a value map. An optional complementary value map may also be formed from the remaining data values. The value map is then prioritized according to bit adjacencies, wherein bit adjacencies are defined by contiguous bits within one of the data values that exhibit a common bit value. Priority may be given to data values having shortest and/or fewest bit adjacencies.

Claims

1. A method for selecting prioritized data values from a plurality of available data values formed by a plurality of data bits, wherein each of the data bits exhibits a bit value, the method comprising the steps of:

arranging the plurality of available data values in a gray code format;

selecting alternate data values of the gray code format for a value map; and

prioritizing the value map according to bit adjacencies, wherein bit adjacencies are defined by contiguous bits within one of the data values that each exhibit a common bit value.

2. The method of claim 1 wherein the prioritizing step comprises determining a size of bit adjacencies in each of the data values in the value map.

3. The method of claim 2 wherein the prioritizing step further comprises determining a frequency of bit adjacencies in each of the data values in the value map.

4. The method of claim 3 wherein the prioritizing step further comprises sorting the value map primarily according to the size of bit adjacencies, and secondarily according to the frequency of bit adjacencies.

5. The method of claim 1 wherein each of the data values in the value map are arranged such that any transition from one data value to another data value in the value map requires a change in the bit values of at least two of the plurality of data bits.

6. The method of claim 1 wherein the data values of the gray code format not selected for the value map are selected for a complementary value map.

7. The method of claim 6 wherein the data values in the complementary value map comprise invalid states of the value map.

8. The method of claim 1 wherein the plurality of bits comprises at least two bits.

9. The method of claim 1 further comprising the step of dividing the plurality of available data values into a first section and a second section, each of the sections corresponding to a separate value map.

10. The method of claim 1 further comprising the step of selecting at least a portion of the data values in the value map having the highest priority to represent state information.

11. The method of claim 1 wherein the plurality of bits comprise an even number of bits.

12. The method of claim 11 wherein the value map comprises a first data value wherein each of the plurality of bits comprise a first bit value and a second data value wherein each of the plurality of bits comprise a second bit value different from the first bit value.

13. The method of claim 1 wherein the plurality of data bits comprises n data bits, and wherein the prioritization step comprises identifying bit adjacencies of lengths ranging from two bits to n−

1 bits.

14. The method of claim 13 wherein the prioritization step further comprises sorting the data values according to the length of the longest bit adjacencies found within each data value.

15. The method of claim 14 wherein the prioritization step comprises further sorting data values having longest bit adjacencies of equal lengths according to frequency of bit adjacencies.

16. A system for selecting prioritized data values from a plurality of available data values formed by a plurality of data bits, wherein each of the data bits exhibits a bit value, the system comprising:

means for arranging the plurality of available data values in a gray code format;

means for selecting alternate data values of the gray code format for a value map; and

means for prioritizing the value map according to bit adjacencies, wherein bit adjacencies are defined by contiguous bits within one of the data values that each exhibit a common bit value.

17. The system of claim 16 wherein each of the data values in the value map are arranged such that any transition from one data value to another data value in the value map results from a change in the bit values of at least two of the plurality of data bits.

18. A value map for representing state information with a plurality of data bits, wherein each of the data bits exhibits a bit value, the value map comprising a plurality of data values formed from the plurality of data bits, wherein each of the data values in the data map are arranged such that any transition from one data value to another data value in the value map results from a change in the bit values of at least two of the plurality of data bits.

19. The value map of claim 18 wherein the value map is further prioritized according to bit adjacencies, wherein bit adjacencies are defined by contiguous bits within one of the data values exhibiting a common bit value.

20. A digital storage medium having computer-readable instructions stored thereon, wherein the instructions comprise the data map of claim 18.