Universal decoding over Gaussian fading channels - Metric calculation and performance evaluation

Nir Weinberger*, Meir Feder

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In a previous work, a universal decoder in a competitive minimax sense was developed for unknown block fading linear white Gaussian channels. For a given codebook (with finite blocklength), a high SNR optimal metric for the decoder was found, whose direct calculation requires solving a non-convex optimization problem and may be formidable. In this paper, the metric calculation problem is facilitated by semidefinite programming, which leads to a low-complexity approximation for the metric. The competitive minimax performance of the optimal decoder (i.e., its worst case power loss compared to the maximum likelihood decoder, which has full knowledge of the channel) is evaluated, and upper lower bounds are derived for the performance evaluation of non-optimal decoders - the training sequence and the generalized likelihood test decoders.

Original languageEnglish
Title of host publication2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages1668-1672
Number of pages5
DOIs
StatePublished - 2011
Event2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation
Duration: 31 Jul 20115 Aug 2011

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8104

Conference

Conference2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Country/TerritoryRussian Federation
CitySt. Petersburg
Period31/07/115/08/11

Fingerprint

Dive into the research topics of 'Universal decoding over Gaussian fading channels - Metric calculation and performance evaluation'. Together they form a unique fingerprint.

Cite this