The binary reflected Gray code is optimal for M-PSK
Paper i proceeding, 2004

This paper is concerned with the problem of selecting a binary labeling for the signal constellation in an M-PSK communication system. A good starting point is labelings having the Gray property, but this is not altogether enough, since 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 (not only Gray), that will give the lowest possible average probability of bit errors. Under certain assumptions on the channel, the answer is that the labeling originally proposed by Gray, the binary reflected Gray code, is the optimal labeling for M-PSK systems, which has, surprisingly, never been proved before.

linear-mod

error-control

Författare

Erik Agrell

Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Johan Lassing

Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Erik Ström

Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Tony Ottosson Gadd

Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Proc. IEEE International Symposium on Information Theory, Chicago, Illinois, USA

164-

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1109/ISIT.2004.1365203

ISBN

0-7803-8280-3