TY - GEN
T1 - Link adaptation for BICM-OFDM through adaptive kernel regression
AU - Wahls, Sander
AU - Poor, H. Vincent
PY - 2013/10/18
Y1 - 2013/10/18
N2 - The packet error rate (PER) of wireless BICM-OFDM systems is notoriously difficult to predict analytically. This remains true even if all subcarriers use a common modulation and coding scheme (MCS). Link adaptation, which here shall be understood as the process of adapting the MCS in order to maximize goodput, therefore remains a major challenge. Non-parametric learning is an elegant way to evade the lack of robust analytical models. Learning from multidimensional features is particularly interesting because one-dimensional features can characterize frequency-selective channels only roughly. However, most of the literature discusses methods that are not truly online. Either the computational costs become unbearable over time or the method saturates and effectively stops learning. The modified k nearest neighbors algorithm (k-NN) seems to be the only exception currently. However, k-NN has well-known weaknesses in learning from small sample sets. Two adaptive kernel regression (AKR) methods are therefore proposed instead. Simulation results are reported for a setup in which several practically relevant conditions that have been mostly ignored in previous studies using multidimensional features (imperfect channel knowledge, Doppler shift, feedback delay, collisions) are modeled.
AB - The packet error rate (PER) of wireless BICM-OFDM systems is notoriously difficult to predict analytically. This remains true even if all subcarriers use a common modulation and coding scheme (MCS). Link adaptation, which here shall be understood as the process of adapting the MCS in order to maximize goodput, therefore remains a major challenge. Non-parametric learning is an elegant way to evade the lack of robust analytical models. Learning from multidimensional features is particularly interesting because one-dimensional features can characterize frequency-selective channels only roughly. However, most of the literature discusses methods that are not truly online. Either the computational costs become unbearable over time or the method saturates and effectively stops learning. The modified k nearest neighbors algorithm (k-NN) seems to be the only exception currently. However, k-NN has well-known weaknesses in learning from small sample sets. Two adaptive kernel regression (AKR) methods are therefore proposed instead. Simulation results are reported for a setup in which several practically relevant conditions that have been mostly ignored in previous studies using multidimensional features (imperfect channel knowledge, Doppler shift, feedback delay, collisions) are modeled.
KW - Link adaptation
KW - Machine learning algorithms
KW - OFDM
KW - Unsupervised learning
KW - Wireless communication
UR - http://www.scopus.com/inward/record.url?scp=84890478385&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84890478385&partnerID=8YFLogxK
U2 - 10.1109/ICASSP.2013.6638641
DO - 10.1109/ICASSP.2013.6638641
M3 - Conference contribution
AN - SCOPUS:84890478385
SN - 9781479903566
T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
SP - 5136
EP - 5140
BT - 2013 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2013 - Proceedings
T2 - 2013 38th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2013
Y2 - 26 May 2013 through 31 May 2013
ER -