Universal Decoding for Gaussian Intersymbol Interference Channels
From MaRDI portal
Publication:2978664
DOI10.1109/TIT.2015.2405534zbMATH Open1359.94853arXiv1403.3786MaRDI QIDQ2978664
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: A universal decoding procedure is proposed for the intersymbol interference (ISI) Gaussian channels. The universality of the proposed decoder is in the sense of being independent of the various channel parameters, and at the same time, attaining the same random coding error exponent as the optimal maximum-likelihood (ML) decoder, which utilizes full knowledge of these unknown parameters. The proposed decoding rule can be regarded as a frequency domain version of the universal maximum mutual information (MMI) decoder. Contrary to previously suggested universal decoders for ISI channels, our proposed decoding metric can easily be evaluated.
Full work available at URL: https://arxiv.org/abs/1403.3786
Related Items (2)
Recommendations
- Universal decoding for source-channel coding with side information 👍 👎
- Universal Algorithms for Channel Decoding of Uncompressed Sources 👍 👎
- Universal decoding for finite-state channels 👍 👎
- On the Gaussian interference channel 👍 👎
- Universal decoding for memoryless Gaussian channels with a deterministic interference 👍 👎
- Rate Splitting and Successive Decoding for Gaussian Interference Channels 👍 👎
- Gaussian Intersymbol Interference Channels With Mismatch 👍 👎
- Interference Decoding for Deterministic Channels 👍 👎
- Linear Universal Decoding for Compound Channels 👍 👎
- Universal Decoding for Arbitrary Channels Relative to a Given Class of Decoding Metrics 👍 👎
This page was built for publication: Universal Decoding for Gaussian Intersymbol Interference Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978664)
