TY - GEN
T1 - Universal decoding for linear Gaussian fading channels in the competitive minimax sense
AU - Weinberger, Nir
AU - Feder, Meir
PY - 2008
Y1 - 2008
N2 - We address the problem of communicating over an unknown linear fading channel with additive white Gaussian noise, in the high SNR regime. A block fading model is adopted where the channel fading vector is unknown, yet assumed constant during the block. For a given codebook, a competitive minimax criterion is used to find a decoder ignorant of the specific channel fading prevailing, yet its performance, relative to the Maximum Likelihood decoder, has the best worst case. For a codebook with two codewords, the decoder is found explicitly, and a numerical method is described to find its performance.
AB - We address the problem of communicating over an unknown linear fading channel with additive white Gaussian noise, in the high SNR regime. A block fading model is adopted where the channel fading vector is unknown, yet assumed constant during the block. For a given codebook, a competitive minimax criterion is used to find a decoder ignorant of the specific channel fading prevailing, yet its performance, relative to the Maximum Likelihood decoder, has the best worst case. For a codebook with two codewords, the decoder is found explicitly, and a numerical method is described to find its performance.
UR - http://www.scopus.com/inward/record.url?scp=52649107538&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2008.4595093
DO - 10.1109/ISIT.2008.4595093
M3 - פרסום בספר כנס
AN - SCOPUS:52649107538
SN - 9781424422579
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 782
EP - 786
BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Y2 - 6 July 2008 through 11 July 2008
ER -