Cargando…

Sparse Sliding-Window Kernel Recursive Least-Squares Channel Prediction for Fast Time-Varying MIMO Systems

Accurate channel state information (CSI) is important for MIMO systems, especially in a high-speed scenario, fast time-varying CSI tends to be out of date, and a change in CSI shows complex nonlinearities. The kernel recursive least-squares (KRLS) algorithm, which offers an attractive framework to d...

Descripción completa

Detalles Bibliográficos
Autores principales: Ai, Xingxing, Zhao, Jiayi, Zhang, Hongtao, Sun, Yong
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9412379/
https://www.ncbi.nlm.nih.gov/pubmed/36016009
http://dx.doi.org/10.3390/s22166248
_version_ 1784775479657496576
author Ai, Xingxing
Zhao, Jiayi
Zhang, Hongtao
Sun, Yong
author_facet Ai, Xingxing
Zhao, Jiayi
Zhang, Hongtao
Sun, Yong
author_sort Ai, Xingxing
collection PubMed
description Accurate channel state information (CSI) is important for MIMO systems, especially in a high-speed scenario, fast time-varying CSI tends to be out of date, and a change in CSI shows complex nonlinearities. The kernel recursive least-squares (KRLS) algorithm, which offers an attractive framework to deal with nonlinear problems, can be used in predicting nonlinear time-varying CSI. However, the network structure of the traditional KRLS algorithm grows as the training sample size increases, resulting in insufficient storage space and increasing computation when dealing with incoming data, which limits the online prediction of the KRLS algorithm. This paper proposed a new sparse sliding-window KRLS (SSW-KRLS) algorithm where a candidate discard set is selected through correlation analysis between the mapping vectors in the kernel Hilbert spaces of the new input sample and the existing samples in the kernel dictionary; then, the discarded sample is determined in combination with its corresponding output to achieve dynamic sample updates. Specifically, the proposed SSW-KRLS algorithm maintains the size of the kernel dictionary within the sample budget requires a fixed amount of memory and computation per time step, incorporates regularization, and achieves online prediction. Moreover, in order to sufficiently track the strongly changeable dynamic characteristics, a forgetting factor is considered in the proposed algorithm. Numerical simulations demonstrate that, under a realistic channel model of 3GPP in a rich scattering environment, our proposed algorithm achieved superior performance in terms of both predictive accuracy and kernel dictionary size than that of the ALD-KRLS algorithm. Our proposed SSW-KRLS algorithm with [Formula: see text] achieved 2 dB NMSE less than that of the ALD-KRLS algorithm with [Formula: see text] , while the kernel dictionary was about 17% smaller when the speed of the mobile user was 120 km/h.
format Online
Article
Text
id pubmed-9412379
institution National Center for Biotechnology Information
language English
publishDate 2022
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-94123792022-08-27 Sparse Sliding-Window Kernel Recursive Least-Squares Channel Prediction for Fast Time-Varying MIMO Systems Ai, Xingxing Zhao, Jiayi Zhang, Hongtao Sun, Yong Sensors (Basel) Article Accurate channel state information (CSI) is important for MIMO systems, especially in a high-speed scenario, fast time-varying CSI tends to be out of date, and a change in CSI shows complex nonlinearities. The kernel recursive least-squares (KRLS) algorithm, which offers an attractive framework to deal with nonlinear problems, can be used in predicting nonlinear time-varying CSI. However, the network structure of the traditional KRLS algorithm grows as the training sample size increases, resulting in insufficient storage space and increasing computation when dealing with incoming data, which limits the online prediction of the KRLS algorithm. This paper proposed a new sparse sliding-window KRLS (SSW-KRLS) algorithm where a candidate discard set is selected through correlation analysis between the mapping vectors in the kernel Hilbert spaces of the new input sample and the existing samples in the kernel dictionary; then, the discarded sample is determined in combination with its corresponding output to achieve dynamic sample updates. Specifically, the proposed SSW-KRLS algorithm maintains the size of the kernel dictionary within the sample budget requires a fixed amount of memory and computation per time step, incorporates regularization, and achieves online prediction. Moreover, in order to sufficiently track the strongly changeable dynamic characteristics, a forgetting factor is considered in the proposed algorithm. Numerical simulations demonstrate that, under a realistic channel model of 3GPP in a rich scattering environment, our proposed algorithm achieved superior performance in terms of both predictive accuracy and kernel dictionary size than that of the ALD-KRLS algorithm. Our proposed SSW-KRLS algorithm with [Formula: see text] achieved 2 dB NMSE less than that of the ALD-KRLS algorithm with [Formula: see text] , while the kernel dictionary was about 17% smaller when the speed of the mobile user was 120 km/h. MDPI 2022-08-19 /pmc/articles/PMC9412379/ /pubmed/36016009 http://dx.doi.org/10.3390/s22166248 Text en © 2022 by the authors. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Ai, Xingxing
Zhao, Jiayi
Zhang, Hongtao
Sun, Yong
Sparse Sliding-Window Kernel Recursive Least-Squares Channel Prediction for Fast Time-Varying MIMO Systems
title Sparse Sliding-Window Kernel Recursive Least-Squares Channel Prediction for Fast Time-Varying MIMO Systems
title_full Sparse Sliding-Window Kernel Recursive Least-Squares Channel Prediction for Fast Time-Varying MIMO Systems
title_fullStr Sparse Sliding-Window Kernel Recursive Least-Squares Channel Prediction for Fast Time-Varying MIMO Systems
title_full_unstemmed Sparse Sliding-Window Kernel Recursive Least-Squares Channel Prediction for Fast Time-Varying MIMO Systems
title_short Sparse Sliding-Window Kernel Recursive Least-Squares Channel Prediction for Fast Time-Varying MIMO Systems
title_sort sparse sliding-window kernel recursive least-squares channel prediction for fast time-varying mimo systems
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9412379/
https://www.ncbi.nlm.nih.gov/pubmed/36016009
http://dx.doi.org/10.3390/s22166248
work_keys_str_mv AT aixingxing sparseslidingwindowkernelrecursiveleastsquareschannelpredictionforfasttimevaryingmimosystems
AT zhaojiayi sparseslidingwindowkernelrecursiveleastsquareschannelpredictionforfasttimevaryingmimosystems
AT zhanghongtao sparseslidingwindowkernelrecursiveleastsquareschannelpredictionforfasttimevaryingmimosystems
AT sunyong sparseslidingwindowkernelrecursiveleastsquareschannelpredictionforfasttimevaryingmimosystems