On the optimality of the binary reflected Gray code

Agrell, Erik,1965Chalmers tekniska högskola,Chalmers University of Technology (författare)

This paper concerns the problem of selecting a binary labeling for the signal constellation in M-PSK, M-PAM, and M-QAM communication systems. Gray labelings are discussed and the original work by Frank Gray is analyzed. As is noted, the number of distinct Gray labelings that result in different bit-error probability grows rapidly with increasing constellation size. By introducing a recursive Gray labeling construction method called expansion, the paper answers the natural question of what labeling, among all possible constellation labelings, will give the lowest possible average probability of bit errors for the considered constellations. Under certain assumptions on the channel, the answer is that the labeling proposed by Gray, the binary reflected Gray code, is the optimal labeling for all three constellations, which has, surprisingly, never been proved before.

Lassing, Johan,1973Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)lassing (författare)
Ström, Erik,1965Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)estrom (författare)
Ottosson Gadd, Tony,1969Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)tonyo (författare)
Chalmers tekniska högskola (creator_code:org_t)

Ingår i:IEEE Transactions on Information Theory50:12, s. 3170-31820018-94481557-9654

Av författaren/redakt...: Agrell, Erik, 19 ...; Lassing, Johan, ...; Ström, Erik, 196 ...; Ottosson Gadd, T ...

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.