Nearest Neighbor Decoding and Pilot-Aided Channel Estimation for Fading Channels

A. Taufiq Asyhari; Tobias Koch; Albert Guillén i Fàbregas

Nearest Neighbor Decoding and Pilot-Aided Channel Estimation for Fading Channels

A. Taufiq Asyhari, Tobias Koch, Albert Guillén i Fàbregas

School of Computing, Electronics and Maths

Research output: Contribution to conference › Paper

Abstract

We study the information rates of non-coherent, stationary, Gaussian, multiple-input multiple-output (MIMO) flat-fading channels that are achievable with nearest neighbor decoding and pilot-aided channel estimation. In particular, we investigate the behavior of these achievable rates in the limit as the signal- to-noise ratio (SNR) tends to infinity by analyzing the capacity pre-log, which is defined as the limiting ratio of the capacity to the logarithm of the SNR as the SNR tends to infinity. We demonstrate that a scheme estimating the channel using pilot symbols and detecting the message using nearest neighbor decoding (while assuming that the channel estimation is perfect) essentially achieves the capacity pre-log of non-coherent multiple-input single-output flat-fading channels, and it essentially achieves the best so far known lower bound on the capacity pre-log of non-coherent MIMO flat-fading channels. We then extend our analysis to the multiple-access channel.

Original language	English
Publication status	Published - 2014
Event	2011 IEEE International Symposium on Information Theory Proceedings - St. Petersburg, Russian Federation Duration: 31 Jul 2011 → 5 Aug 2011

Conference

Conference	2011 IEEE International Symposium on Information Theory Proceedings
Abbreviated title	ISIT 2011
Country	Russian Federation
City	St. Petersburg
Period	31/07/11 → 5/08/11

Fingerprint

Channel estimation

Fading channels

Decoding

Signal to noise ratio

Cite this

Asyhari, A. T., Koch, T., & Fàbregas, A. G. I. (2014). Nearest Neighbor Decoding and Pilot-Aided Channel Estimation for Fading Channels. Paper presented at 2011 IEEE International Symposium on Information Theory Proceedings, St. Petersburg, Russian Federation.

Nearest Neighbor Decoding and Pilot-Aided Channel Estimation for Fading Channels. / Asyhari, A. Taufiq; Koch, Tobias; Fàbregas, Albert Guillén i.

2014. Paper presented at 2011 IEEE International Symposium on Information Theory Proceedings, St. Petersburg, Russian Federation.

Research output: Contribution to conference › Paper

Asyhari, AT, Koch, T & Fàbregas, AGI 2014, 'Nearest Neighbor Decoding and Pilot-Aided Channel Estimation for Fading Channels' Paper presented at 2011 IEEE International Symposium on Information Theory Proceedings, St. Petersburg, Russian Federation, 31/07/11 - 5/08/11, .

Asyhari AT, Koch T, Fàbregas AGI. Nearest Neighbor Decoding and Pilot-Aided Channel Estimation for Fading Channels. 2014. Paper presented at 2011 IEEE International Symposium on Information Theory Proceedings, St. Petersburg, Russian Federation.

Asyhari, A. Taufiq ; Koch, Tobias ; Fàbregas, Albert Guillén i. / Nearest Neighbor Decoding and Pilot-Aided Channel Estimation for Fading Channels. Paper presented at 2011 IEEE International Symposium on Information Theory Proceedings, St. Petersburg, Russian Federation.

@conference{67c91bb42e4241ceb2fd131d247867ad,

title = "Nearest Neighbor Decoding and Pilot-Aided Channel Estimation for Fading Channels",

abstract = "We study the information rates of non-coherent, stationary, Gaussian, multiple-input multiple-output (MIMO) flat-fading channels that are achievable with nearest neighbor decoding and pilot-aided channel estimation. In particular, we investigate the behavior of these achievable rates in the limit as the signal- to-noise ratio (SNR) tends to infinity by analyzing the capacity pre-log, which is defined as the limiting ratio of the capacity to the logarithm of the SNR as the SNR tends to infinity. We demonstrate that a scheme estimating the channel using pilot symbols and detecting the message using nearest neighbor decoding (while assuming that the channel estimation is perfect) essentially achieves the capacity pre-log of non-coherent multiple-input single-output flat-fading channels, and it essentially achieves the best so far known lower bound on the capacity pre-log of non-coherent MIMO flat-fading channels. We then extend our analysis to the multiple-access channel.",

author = "Asyhari, {A. Taufiq} and Tobias Koch and F{\`a}bregas, {Albert Guill{\'e}n i}",

year = "2014",

language = "English",

note = "2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 ; Conference date: 31-07-2011 Through 05-08-2011",

}

TY - CONF

T1 - Nearest Neighbor Decoding and Pilot-Aided Channel Estimation for Fading Channels

AU - Asyhari, A. Taufiq

AU - Koch, Tobias

AU - Fàbregas, Albert Guillén i

PY - 2014

Y1 - 2014

N2 - We study the information rates of non-coherent, stationary, Gaussian, multiple-input multiple-output (MIMO) flat-fading channels that are achievable with nearest neighbor decoding and pilot-aided channel estimation. In particular, we investigate the behavior of these achievable rates in the limit as the signal- to-noise ratio (SNR) tends to infinity by analyzing the capacity pre-log, which is defined as the limiting ratio of the capacity to the logarithm of the SNR as the SNR tends to infinity. We demonstrate that a scheme estimating the channel using pilot symbols and detecting the message using nearest neighbor decoding (while assuming that the channel estimation is perfect) essentially achieves the capacity pre-log of non-coherent multiple-input single-output flat-fading channels, and it essentially achieves the best so far known lower bound on the capacity pre-log of non-coherent MIMO flat-fading channels. We then extend our analysis to the multiple-access channel.

AB - We study the information rates of non-coherent, stationary, Gaussian, multiple-input multiple-output (MIMO) flat-fading channels that are achievable with nearest neighbor decoding and pilot-aided channel estimation. In particular, we investigate the behavior of these achievable rates in the limit as the signal- to-noise ratio (SNR) tends to infinity by analyzing the capacity pre-log, which is defined as the limiting ratio of the capacity to the logarithm of the SNR as the SNR tends to infinity. We demonstrate that a scheme estimating the channel using pilot symbols and detecting the message using nearest neighbor decoding (while assuming that the channel estimation is perfect) essentially achieves the capacity pre-log of non-coherent multiple-input single-output flat-fading channels, and it essentially achieves the best so far known lower bound on the capacity pre-log of non-coherent MIMO flat-fading channels. We then extend our analysis to the multiple-access channel.

UR - http://arxiv.org/abs/1301.1223

M3 - Paper

ER -

Access to Document

http://arxiv.org/abs/1301.1223