Computation of the exact bit-error rate of coherent M-ary PSK with Gray code bit mapping
The problem of calculating the average bit-error probability (BEP) of coherent M-ary phase-
shift keying (PSK) over a Gaussian channel has been studied previously in the literature. A
solution to the problem for systems using a binary reflected Gray code (BRGC) to map bits to
symbols was first presented by PJ Lee (see ibid., vol. COM-34, p. 488-91, 1986). We show
that the results obtained by Lee are incorrect for M/spl ges/16. We show that the reason for
this is an invalid assumption that the bit-error rate (BER) is independent of the transmitted …
shift keying (PSK) over a Gaussian channel has been studied previously in the literature. A
solution to the problem for systems using a binary reflected Gray code (BRGC) to map bits to
symbols was first presented by PJ Lee (see ibid., vol. COM-34, p. 488-91, 1986). We show
that the results obtained by Lee are incorrect for M/spl ges/16. We show that the reason for
this is an invalid assumption that the bit-error rate (BER) is independent of the transmitted …
Computation of the bit error rate of coherent M-ary PSK with Gray code bit mapping
P Lee - IEEE Transactions on Communications, 1986 - ieeexplore.ieee.org
Efficient computation of the bit error rate (BER) for the coherent M-ary PSK signals with Gray
code bit mapping is considered. A closed-form expression for the exact BER of 8-ary PSK is
presented. Tight upper and lower bounds on BER are also obtained for M-ary PSK with
larger M.
code bit mapping is considered. A closed-form expression for the exact BER of 8-ary PSK is
presented. Tight upper and lower bounds on BER are also obtained for M-ary PSK with
larger M.
以上显示的是最相近的搜索结果。 查看全部搜索结果