Gray Coding Mechanism for assigning bits to symbols so that the number of bit errors is minimized Most likely symbol errors are between adjacent levels Want to maP bits to symbols so that the number of bits that differ between adjacent levels is mimimized Gray coding achieves 1 bit difference between adjacent levels Example M=8 (can be generalized) 000 001 011 010 110 101 A8100Gray Coding • Mechanism for assigning bits to symbols so that the number of bit errors is minimized – Most likely symbol errors are between adjacent levels – Want to MAP bits to symbols so that the number of bits that differ between adjacent levels is mimimized • Gray coding achieves 1 bit difference between adjacent levels • Example M= 8 (can be generalized) A1 000 A2 001 A3 011 A4 010 A5 110 A6 111 A7 101 Eytan Modiano A8 100 Slide 7