Index coded PSK modulation over an AWGN broadcast channel, for a given index coding problem (ICP) is studied. For a chosen index code and an arbitrary mapping (of broadcast vectors to PSK signal points), a decision rule for the maximum likelihood (ML) decoder is derived. The message error performance of a receiver at high SNR is characterized by a parameter called PSK-index coding gain (PSK-ICG). The PSK-ICG of a receiver is determined by a metric called minimum inter-set distance. For a given ICP with an order of priority among the receivers, and a chosen $2^N$-PSK constellation an algorithm to find (index code, mapping) pairs, each of which gives the best performance in terms of PSK-ICG of the receivers, is proposed. No other pair of index code (of length 𝒩 with $2^N$ broadcast vectors) and mapping can give a better PSK-ICG for the highest priority receiver. Also, given that the highest priority receiver achieves its best performance, the next highest priority receiver achieves its maximum gain possible and so on in the specified order of priority.
Maximum Likelihood Decoder for Index Coded PSK Modulation for Priority Ordered Receivers
2017-09-01
216453 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Maximum-likelihood data decoder
NTRS | 1979
|Maximum-Likelihood Decoder on a Hypercube Multiprocessor
NTRS | 1987
|