Double Krylov subspace approximation for low-complexity iterative multi-user decoding and time-variant channel estimation (2005)
| Venue: | In Proc. IEEE Workshop on Signal Processing Advances in Wireless Com. (SPAWC |
| Citations: | 3 - 0 self |
BibTeX
@INPROCEEDINGS{Dumard05doublekrylov,
author = {Charlotte Dumard and Thomas Zemen and Ftw Forschungszentrum Telekommunikation Wien},
title = {Double Krylov subspace approximation for low-complexity iterative multi-user decoding and time-variant channel estimation},
booktitle = {In Proc. IEEE Workshop on Signal Processing Advances in Wireless Com. (SPAWC},
year = {2005}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Iterative multi-user detection and time-variant channel estimation in a multi-carrier (MC) code division multiple access (CDMA) uplink requires high computational complexity. This is mainly due to the linear minimum mean square error (MMSE) filters for data detection and time-variant channel estimation. We develop an algorithm based on the Krylov subspace method to solve a linear system with low complexity, trading accuracy for efficiency. This approach enables drastic reduction of computational complexity for time-variant channel estimation as well as storage reduction and parallelization of the computations for multi-user detection. The performance of the low-complexity iterative Krylov subspace receiver is validated by simulations. 1.
Keyphrases
time-variant channel estimation double krylov subspace approximation low-complexity iterative multi-user decoding computational complexity high computational complexity iterative multi-user detection multi-user detection trading accuracy data detection drastic reduction low-complexity iterative krylov subspace receiver code division multiple access linear system low complexity linear minimum mean square error krylov subspace method storage reduction
