z-logo
open-access-imgOpen Access
Joint interpolation for LTE downlink channel estimation in very high‐mobility environments with support vector machine regression
Author(s) -
Charrada Anis,
Samet Abdelaziz
Publication year - 2016
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2016.0132
Subject(s) - joint (building) , telecommunications link , computer science , support vector machine , interpolation (computer graphics) , channel (broadcasting) , algorithm , artificial intelligence , computer network , engineering , architectural engineering , motion (physics)
In this study, the estimation of fast‐fading long term evolution (LTE) downlink channels in high‐speed applications of LTE advanced is investigated by the authors. A robust channel estimation and interpolation algorithm is essential in order to adequately track the fast time‐varying channel response. In this contribution, the multipath fast‐fading channel is modelled as a discrete, tapped‐delay and finite impulse response filter. Using support vector machine regression (SVR), they develop an extended algorithm to jointly estimate the complex‐valued channel frequency response in time and frequency domains, in the presence of fading and non‐linear noise from the transmission of known pilot symbols. Furthermore, the channel estimates at the known pilot symbols are interpolated to the unknown data symbols by using the non‐linear SVR approach exploiting kernel features. This study integrates both channel estimation at pilot symbols and interpolation at data symbol into the complex SVR interpolation method. The bit error rate and mean square error performances of the authors’ fast‐fading channel estimation scheme is demonstrated via simulation for LTE downlink with 64‐QAM modulation and 500 km/h velocity under non‐linearities.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here