Nearest neighbor decoding for additive non-Gaussian noise channels
- 1 September 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 42 (5) , 1520-1529
- https://doi.org/10.1109/18.532892
Abstract
We study the performance of a transmission scheme employing random Gaussian codebooks and nearest neighbor decoding over a power limited additive non-Gaussian noise channel. We show that the achievable rates depend on the noise distribution only via its power and thus coincide with the capacity region of a white Gaussian noise channel with signal and noise power equal to those of the original channel. The results are presented for single-user channels as well as multiple-access channels, and are extended to fading channels with side information at the receiver.Keywords
This publication has 15 references indexed in Scilit:
- Coding theorem for discrete memoryless channels with given decision rulePublished by Springer Nature ,2005
- On the role of mismatch in rate distortion theoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Mismatched decoding and the multiple-access channelIEEE Transactions on Information Theory, 1996
- Generalized cutoff rates and Renyi's information measuresIEEE Transactions on Information Theory, 1995
- A converse coding theorem for mismatched decoding at the output of binary-input memoryless channelsIEEE Transactions on Information Theory, 1995
- Capacity of the Gaussian arbitrarily varying channelIEEE Transactions on Information Theory, 1991
- Gaussian arbitrarily varying channelsIEEE Transactions on Information Theory, 1987
- Universal decoding for finite-state channelsIEEE Transactions on Information Theory, 1985
- Channels with block interferenceIEEE Transactions on Information Theory, 1984
- Coded Error Probability Evaluation for Antijam Communication SystemsIEEE Transactions on Communications, 1982