Let us consider an example of a system which gets one of its data from a sensor. Most of the timestime, the sensor may be measuring some noise. and forFor this example, let us consider that the values being measured are (0) and (-1) alternatively. For a 32-bit data bus, value 0 translates to 0x00000000 (0000 0000 0000 0000 0000 0000 0000 0000) while (-1) translates to 0xFFFFFFFF (1111 1111 1111 1111 1111 1111 1111 1111) in a [[two's complement|2’s complement]] representation. WeThe see that the hammingHamming distance in this case is 32 (since all 32-bits are changing their state). UsingThe theHamming signeddistance bitis representation,much smaller using the hamming[[signed distancenumber isrepresentation|sign significantlybit minimizedrepresentation]]. However, even using 2’s complement, weinversion canencoding achievereduces the same activity reductionnecessary. usingIn inversionthis encoding. So,case 0 willwould be represented as 0x00000000 with INV=0 and -1 willwould be represented as 0x00000000 with INV=1. Since INV=1, the receiver willwould invert the data before consuming it, thereby converting it to 0xFFFFFFFF internally. In this case, only 1 bit (INV bit) is changed overin the bus, leading to an activity of factor 1, which is even better than signedsign bit representation.
[[File:Overviewbusencoding.png|thumb|Overview for Performance Analysis: inversion encoding]]
